Status: IN
Social systems pair symmetric graph structures (bidirectional contacts and friendships with no one-way follow) with reference-based fan-out (IDs pushed at write time, data hydrated at read time), achieving simplified visibility rules at the graph layer and minimal write amplification at the delivery layer.
Symmetric graphs eliminate one-way edge complexity; reference-based fan-out avoids data duplication — together they simplify both the model and the delivery
Depends on (SL): symmetric-social-graphs-simplify-visibility, fan-out-write-pushes-references-not-data