{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NM2Q7EN5SCYHWXITQACDSSAZ6W","short_pith_number":"pith:NM2Q7EN5","schema_version":"1.0","canonical_sha256":"6b350f91bd90b07b5d138004394819f5985ee996bf619d5db1d593fd7e53f8e4","source":{"kind":"arxiv","id":"1506.07952","version":1},"attestation_state":"computed","paper":{"title":"Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller","submitted_at":"2015-06-26T04:12:25Z","abstract_excerpt":"In rendezvous, two agents traverse network edges in synchronous rounds and have to meet at some node. In treasure hunt, a single agent has to find a stationary target situated at an unknown node of the network. We study tradeoffs between the amount of information ($\\mathit{advice}$) available $\\mathit{a\\ priori}$ to the agents and the cost (number of edge traversals) of rendezvous and treasure hunt. Our goal is to find the smallest size of advice which enables the agents to solve these tasks at some cost $C$ in a network with $e$ edges. This size turns out to depend on the initial distance $D$"},"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":"1506.07952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-26T04:12:25Z","cross_cats_sorted":[],"title_canon_sha256":"14a6d9ee9a4ee8580edd19219fd26d7477be1ee82d848c480a1cc565edf37840","abstract_canon_sha256":"1caa346047af579626e217987f109df00a0af182c8074e0d0184f31b5a93fced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:48.512331Z","signature_b64":"V1F2LyVkI3tj5Nxq/0gkEwq+c+kb3uEMFqwZARWhYn8j/2wxVpgZVjdIKzHHD2dBt/r2AB7JE4cYG2aChLuPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b350f91bd90b07b5d138004394819f5985ee996bf619d5db1d593fd7e53f8e4","last_reissued_at":"2026-05-18T01:37:48.511837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:48.511837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller","submitted_at":"2015-06-26T04:12:25Z","abstract_excerpt":"In rendezvous, two agents traverse network edges in synchronous rounds and have to meet at some node. In treasure hunt, a single agent has to find a stationary target situated at an unknown node of the network. We study tradeoffs between the amount of information ($\\mathit{advice}$) available $\\mathit{a\\ priori}$ to the agents and the cost (number of edge traversals) of rendezvous and treasure hunt. Our goal is to find the smallest size of advice which enables the agents to solve these tasks at some cost $C$ in a network with $e$ edges. This size turns out to depend on the initial distance $D$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07952","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":"1506.07952","created_at":"2026-05-18T01:37:48.511920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07952v1","created_at":"2026-05-18T01:37:48.511920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07952","created_at":"2026-05-18T01:37:48.511920+00:00"},{"alias_kind":"pith_short_12","alias_value":"NM2Q7EN5SCYH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NM2Q7EN5SCYHWXIT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NM2Q7EN5","created_at":"2026-05-18T12:29:32.376354+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/NM2Q7EN5SCYHWXITQACDSSAZ6W","json":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W.json","graph_json":"https://pith.science/api/pith-number/NM2Q7EN5SCYHWXITQACDSSAZ6W/graph.json","events_json":"https://pith.science/api/pith-number/NM2Q7EN5SCYHWXITQACDSSAZ6W/events.json","paper":"https://pith.science/paper/NM2Q7EN5"},"agent_actions":{"view_html":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W","download_json":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W.json","view_paper":"https://pith.science/paper/NM2Q7EN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07952&json=true","fetch_graph":"https://pith.science/api/pith-number/NM2Q7EN5SCYHWXITQACDSSAZ6W/graph.json","fetch_events":"https://pith.science/api/pith-number/NM2Q7EN5SCYHWXITQACDSSAZ6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W/action/storage_attestation","attest_author":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W/action/author_attestation","sign_citation":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W/action/citation_signature","submit_replication":"https://pith.science/pith/NM2Q7EN5SCYHWXITQACDSSAZ6W/action/replication_record"}},"created_at":"2026-05-18T01:37:48.511920+00:00","updated_at":"2026-05-18T01:37:48.511920+00:00"}