{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7RVSAVBX34JAQAXNYE73BRLTGX","short_pith_number":"pith:7RVSAVBX","schema_version":"1.0","canonical_sha256":"fc6b205437df120802edc13fb0c57335c29f33dd49146612d24cf79525b26dc1","source":{"kind":"arxiv","id":"1810.03120","version":1},"attestation_state":"computed","paper":{"title":"Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Ram Narayan Yadav","submitted_at":"2018-10-07T11:16:59Z","abstract_excerpt":"Two anonymous mobile agents navigate synchronously in an anonymous graph and have to meet at a node, using a deterministic algorithm. This is a symmetry breaking task called rendezvous, equivalent to the fundamental task of leader election between the agents. When is this feasible in a completely anonymous environment? It is known that agents can always meet if their initial positions are nonsymmetric, and that if they are symmetric and agents start simultaneously then rendezvous is impossible. What happens for symmetric initial positions with non-simultaneous start? Can symmetry between the a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.03120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-07T11:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"9615f763aa196de2b71abe777df78a276eef51ba4a8be909213e8fec0c8cc44e","abstract_canon_sha256":"701eaccb5891734d4de3faeb7874f945fd24c17d8f890b7ed15b4e23e7661216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:54.464760Z","signature_b64":"6bf2Ke1tincPvfa+JLp3pTm2/c3/URc/wt8RhfzjLHAp/Hx3TjZ2WNSK9i8YrU4n2WDQgU2W/lH5UB3/9B8tCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc6b205437df120802edc13fb0c57335c29f33dd49146612d24cf79525b26dc1","last_reissued_at":"2026-05-18T00:03:54.464080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:54.464080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Ram Narayan Yadav","submitted_at":"2018-10-07T11:16:59Z","abstract_excerpt":"Two anonymous mobile agents navigate synchronously in an anonymous graph and have to meet at a node, using a deterministic algorithm. This is a symmetry breaking task called rendezvous, equivalent to the fundamental task of leader election between the agents. When is this feasible in a completely anonymous environment? It is known that agents can always meet if their initial positions are nonsymmetric, and that if they are symmetric and agents start simultaneously then rendezvous is impossible. What happens for symmetric initial positions with non-simultaneous start? Can symmetry between the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03120","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.03120","created_at":"2026-05-18T00:03:54.464191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03120v1","created_at":"2026-05-18T00:03:54.464191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03120","created_at":"2026-05-18T00:03:54.464191+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RVSAVBX34JA","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RVSAVBX34JAQAXN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RVSAVBX","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX","json":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX.json","graph_json":"https://pith.science/api/pith-number/7RVSAVBX34JAQAXNYE73BRLTGX/graph.json","events_json":"https://pith.science/api/pith-number/7RVSAVBX34JAQAXNYE73BRLTGX/events.json","paper":"https://pith.science/paper/7RVSAVBX"},"agent_actions":{"view_html":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX","download_json":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX.json","view_paper":"https://pith.science/paper/7RVSAVBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03120&json=true","fetch_graph":"https://pith.science/api/pith-number/7RVSAVBX34JAQAXNYE73BRLTGX/graph.json","fetch_events":"https://pith.science/api/pith-number/7RVSAVBX34JAQAXNYE73BRLTGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX/action/storage_attestation","attest_author":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX/action/author_attestation","sign_citation":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX/action/citation_signature","submit_replication":"https://pith.science/pith/7RVSAVBX34JAQAXNYE73BRLTGX/action/replication_record"}},"created_at":"2026-05-18T00:03:54.464191+00:00","updated_at":"2026-05-18T00:03:54.464191+00:00"}