{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SNQAK5DVBTNLP45P2C4ZHL42N5","short_pith_number":"pith:SNQAK5DV","schema_version":"1.0","canonical_sha256":"93600574750cdab7f3afd0b993af9a6f73ff4098c492ac3bbcd283595cd3d88c","source":{"kind":"arxiv","id":"1306.1956","version":1},"attestation_state":"computed","paper":{"title":"Rendezvous of Two Robots with Constant Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.MA","authors_text":"Giovanni Viglietta, Masafumi Yamashita, Nicola Santoro, Paola Flocchini","submitted_at":"2013-06-08T20:34:43Z","abstract_excerpt":"We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible even if the system is asynchronous (ASynch) if each robot is endowed with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and can remember (i.e., can persistently store) the last r"},"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":"1306.1956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2013-06-08T20:34:43Z","cross_cats_sorted":["cs.CG","cs.RO"],"title_canon_sha256":"77cec27f37474b5d79114342b0e4e316cb2183750f07629ee08742b36604ad56","abstract_canon_sha256":"7efcea27fba48e331755b3a29b63fc776758554380a40d3fd12c86b1c2f53b96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.752219Z","signature_b64":"KPkqebpftZZGDrNaRlT9NzBzrCMAncUqmfJYL+TbyzHzidMTyKGCb7kXz1dTVi+OvhOTjxjrVQX/vHdsBm5EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93600574750cdab7f3afd0b993af9a6f73ff4098c492ac3bbcd283595cd3d88c","last_reissued_at":"2026-05-18T03:21:22.751662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.751662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rendezvous of Two Robots with Constant Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.RO"],"primary_cat":"cs.MA","authors_text":"Giovanni Viglietta, Masafumi Yamashita, Nicola Santoro, Paola Flocchini","submitted_at":"2013-06-08T20:34:43Z","abstract_excerpt":"We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible even if the system is asynchronous (ASynch) if each robot is endowed with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and can remember (i.e., can persistently store) the last r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1956","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":"1306.1956","created_at":"2026-05-18T03:21:22.751744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1956v1","created_at":"2026-05-18T03:21:22.751744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1956","created_at":"2026-05-18T03:21:22.751744+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNQAK5DVBTNL","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNQAK5DVBTNLP45P","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNQAK5DV","created_at":"2026-05-18T12:27:59.945178+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/SNQAK5DVBTNLP45P2C4ZHL42N5","json":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5.json","graph_json":"https://pith.science/api/pith-number/SNQAK5DVBTNLP45P2C4ZHL42N5/graph.json","events_json":"https://pith.science/api/pith-number/SNQAK5DVBTNLP45P2C4ZHL42N5/events.json","paper":"https://pith.science/paper/SNQAK5DV"},"agent_actions":{"view_html":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5","download_json":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5.json","view_paper":"https://pith.science/paper/SNQAK5DV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1956&json=true","fetch_graph":"https://pith.science/api/pith-number/SNQAK5DVBTNLP45P2C4ZHL42N5/graph.json","fetch_events":"https://pith.science/api/pith-number/SNQAK5DVBTNLP45P2C4ZHL42N5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5/action/storage_attestation","attest_author":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5/action/author_attestation","sign_citation":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5/action/citation_signature","submit_replication":"https://pith.science/pith/SNQAK5DVBTNLP45P2C4ZHL42N5/action/replication_record"}},"created_at":"2026-05-18T03:21:22.751744+00:00","updated_at":"2026-05-18T03:21:22.751744+00:00"}