{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z7GEZCFKQ42FEWA6TUNFNCLE4L","short_pith_number":"pith:Z7GEZCFK","schema_version":"1.0","canonical_sha256":"cfcc4c88aa873452581e9d1a568964e2c9605362bd6998b4715ad6c9ed6f9646","source":{"kind":"arxiv","id":"1102.0467","version":1},"attestation_state":"computed","paper":{"title":"Delays Induce an Exponential Memory Gap for Rendezvous in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Pierre Fraigniaud","submitted_at":"2011-02-02T15:39:17Z","abstract_excerpt":"The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. In this paper, we focus on rendezvous in trees, and, analogously to the efforts that have been made for solving the exploration problem with compact automata, we study the size of memory of mobile agents that permits to solve the rendezvous problem deterministically. We assume that the agents are identical, and move in synchronous rounds.\n  We first show that if the delay between the starting times of the agents is arbitrary, then the lower bound on memory required for rendezv"},"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":"1102.0467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-02-02T15:39:17Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"4f3ef5ca67627caf7cce4c640b2489eccba9d479372eff4ca47df26aaed75c6b","abstract_canon_sha256":"7702e8623d9a6f13abd1dfb89a8bc6a28d8ddef0e648fba81eab9922ced1532c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.127883Z","signature_b64":"xDXEv6w6ob6TcDYyoG/yQn2s/fWm63GPF6WZWAqqwBbHiHyESVAb40Nn0z+tbK+kEa71EAW7zAf9eb3xAcMyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcc4c88aa873452581e9d1a568964e2c9605362bd6998b4715ad6c9ed6f9646","last_reissued_at":"2026-05-18T02:22:41.126303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.126303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delays Induce an Exponential Memory Gap for Rendezvous in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Pierre Fraigniaud","submitted_at":"2011-02-02T15:39:17Z","abstract_excerpt":"The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. In this paper, we focus on rendezvous in trees, and, analogously to the efforts that have been made for solving the exploration problem with compact automata, we study the size of memory of mobile agents that permits to solve the rendezvous problem deterministically. We assume that the agents are identical, and move in synchronous rounds.\n  We first show that if the delay between the starting times of the agents is arbitrary, then the lower bound on memory required for rendezv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0467","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":"1102.0467","created_at":"2026-05-18T02:22:41.126497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0467v1","created_at":"2026-05-18T02:22:41.126497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0467","created_at":"2026-05-18T02:22:41.126497+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7GEZCFKQ42F","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7GEZCFKQ42FEWA6","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7GEZCFK","created_at":"2026-05-18T12:26:47.523578+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/Z7GEZCFKQ42FEWA6TUNFNCLE4L","json":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L.json","graph_json":"https://pith.science/api/pith-number/Z7GEZCFKQ42FEWA6TUNFNCLE4L/graph.json","events_json":"https://pith.science/api/pith-number/Z7GEZCFKQ42FEWA6TUNFNCLE4L/events.json","paper":"https://pith.science/paper/Z7GEZCFK"},"agent_actions":{"view_html":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L","download_json":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L.json","view_paper":"https://pith.science/paper/Z7GEZCFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0467&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7GEZCFKQ42FEWA6TUNFNCLE4L/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7GEZCFKQ42FEWA6TUNFNCLE4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L/action/storage_attestation","attest_author":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L/action/author_attestation","sign_citation":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L/action/citation_signature","submit_replication":"https://pith.science/pith/Z7GEZCFKQ42FEWA6TUNFNCLE4L/action/replication_record"}},"created_at":"2026-05-18T02:22:41.126497+00:00","updated_at":"2026-05-18T02:22:41.126497+00:00"}