{"id":"symmetry-simplifies-across-graph-domains","text":"Bidirectional symmetry is enforced across social graphs (contacts, friendships) and spatial graphs (road edges), eliminating one-way edge complexity in visibility checks, nearby-friend computations, and shortest-path routing — a cross-domain preference for simpler invariants over expressive asymmetry.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["symmetric-social-graphs-simplify-visibility","maps-bidirectional-edges-share-data"],"outlist":[],"label":"Social graphs and road networks both choose mandatory bidirectionality, trading model expressiveness for implementation simplicity"}],"dependents":["symmetry-is-both-simplifier-and-routing-enabler"],"metadata":{"last_reviewed":"2026-06-06T06:26:57","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"symmetry-simplifies-across-graph-domains","truth_value":"IN","reason":"SL justification valid","antecedents":["symmetric-social-graphs-simplify-visibility","maps-bidirectional-edges-share-data"],"label":"Social graphs and road networks both choose mandatory bidirectionality, trading model expressiveness for implementation simplicity"},{"node":"symmetric-social-graphs-simplify-visibility","truth_value":"IN","reason":"SL justification valid","antecedents":["chat-contacts-always-bidirectional","nearby-friends-friendship-always-symmetric"],"label":"Symmetric graphs eliminate directional visibility checks but prevent asymmetric social models"},{"node":"chat-contacts-always-bidirectional","truth_value":"IN","reason":"premise"},{"node":"nearby-friends-friendship-always-symmetric","truth_value":"IN","reason":"premise"},{"node":"maps-bidirectional-edges-share-data","truth_value":"IN","reason":"premise"}]}}