{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PH267H2LBY5MKPQ2B6QPZSWW5Q","short_pith_number":"pith:PH267H2L","schema_version":"1.0","canonical_sha256":"79f5ef9f4b0e3ac53e1a0fa0fccad6ec3a1a9df072a2c43d7c45b10329948091","source":{"kind":"arxiv","id":"1406.2795","version":1},"attestation_state":"computed","paper":{"title":"Rendezvous of Distance-aware Mobile Agents in Unknown Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (INRIA Rocquencourt, Dariusz Dereniowski, LIAFA), Przemyslaw Uznanski (LIF), Shantanu Das (LIF)","submitted_at":"2014-06-11T07:01:42Z","abstract_excerpt":"We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size and to depend only on the initial distance between the agents and some local parameters such as the degree of the vertices, and the size of the agent's label. It is "},"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":"1406.2795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-11T07:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"53ad7f8550ad9852f146183f3b0a62100bdaaf7b5346d87fd663098629eee093","abstract_canon_sha256":"1a4e180baf30cb3f141a6d851fa3828aa3799708a498a12c3a004e217490161f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:55.086721Z","signature_b64":"CcRYHEb7xvK7qJsQgxO+GCMuQ8ZcxuTJ/gxe7cywQQhkHFznum4TA+4rfvBi/52b5ABZ6Np+NcnQVB6F4kRSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f5ef9f4b0e3ac53e1a0fa0fccad6ec3a1a9df072a2c43d7c45b10329948091","last_reissued_at":"2026-05-18T02:49:55.086023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:55.086023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rendezvous of Distance-aware Mobile Agents in Unknown Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Kosowski (INRIA Rocquencourt, Dariusz Dereniowski, LIAFA), Przemyslaw Uznanski (LIF), Shantanu Das (LIF)","submitted_at":"2014-06-11T07:01:42Z","abstract_excerpt":"We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size and to depend only on the initial distance between the agents and some local parameters such as the degree of the vertices, and the size of the agent's label. It is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2795","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":"1406.2795","created_at":"2026-05-18T02:49:55.086128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2795v1","created_at":"2026-05-18T02:49:55.086128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2795","created_at":"2026-05-18T02:49:55.086128+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH267H2LBY5M","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH267H2LBY5MKPQ2","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH267H2L","created_at":"2026-05-18T12:28:43.426989+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/PH267H2LBY5MKPQ2B6QPZSWW5Q","json":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q.json","graph_json":"https://pith.science/api/pith-number/PH267H2LBY5MKPQ2B6QPZSWW5Q/graph.json","events_json":"https://pith.science/api/pith-number/PH267H2LBY5MKPQ2B6QPZSWW5Q/events.json","paper":"https://pith.science/paper/PH267H2L"},"agent_actions":{"view_html":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q","download_json":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q.json","view_paper":"https://pith.science/paper/PH267H2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2795&json=true","fetch_graph":"https://pith.science/api/pith-number/PH267H2LBY5MKPQ2B6QPZSWW5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/PH267H2LBY5MKPQ2B6QPZSWW5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q/action/storage_attestation","attest_author":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q/action/author_attestation","sign_citation":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q/action/citation_signature","submit_replication":"https://pith.science/pith/PH267H2LBY5MKPQ2B6QPZSWW5Q/action/replication_record"}},"created_at":"2026-05-18T02:49:55.086128+00:00","updated_at":"2026-05-18T02:49:55.086128+00:00"}