{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VAFFURGXGY7R6TRJXM6VS6EYOL","short_pith_number":"pith:VAFFURGX","schema_version":"1.0","canonical_sha256":"a80a5a44d7363f1f4e29bb3d59789872e89f40b92bcf8a6288e72a73dd7a88b1","source":{"kind":"arxiv","id":"1805.03351","version":1},"attestation_state":"computed","paper":{"title":"Symmetric Rendezvous With Advice: How to Rendezvous in a Disk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jay Griffiths, Konstantinos Georgiou, Yuval Yakubov","submitted_at":"2018-05-09T02:13:35Z","abstract_excerpt":"In the classic Symmetric Rendezvous problem on a Line (SRL), two robots at known distance 2 but unknown direction execute the same randomized algorithm trying to minimize the expected rendezvous time. A long standing conjecture is that the best possible rendezvous time is 4.25 with known upper and lower bounds being very close to that value. We introduce and study a geometric variation of SRL that we call Symmetric Rendezvous in a Disk (SRD) where two robots at distance 2 have a common reference point at distance $\\rho$. We show that even when $\\rho$ is not too small, the two robots can meet i"},"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":"1805.03351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T02:13:35Z","cross_cats_sorted":[],"title_canon_sha256":"290f974c98ce132483dd7483858e588ca5ac32ca09fdd826b6d4c8ed39ca6c47","abstract_canon_sha256":"97704778d8166d199861782f771a92eb4ee686d3b16aae65ab61da1e970a2902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.416937Z","signature_b64":"yCbGWsvvIkihxrUj7JQadvDyFNB3gPcc5j7FhiRE00b5n0o+4kNOO8T0b4mm38FeDQW7Uwau/uL7GSJby+AqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a80a5a44d7363f1f4e29bb3d59789872e89f40b92bcf8a6288e72a73dd7a88b1","last_reissued_at":"2026-05-18T00:16:20.416500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.416500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Rendezvous With Advice: How to Rendezvous in a Disk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jay Griffiths, Konstantinos Georgiou, Yuval Yakubov","submitted_at":"2018-05-09T02:13:35Z","abstract_excerpt":"In the classic Symmetric Rendezvous problem on a Line (SRL), two robots at known distance 2 but unknown direction execute the same randomized algorithm trying to minimize the expected rendezvous time. A long standing conjecture is that the best possible rendezvous time is 4.25 with known upper and lower bounds being very close to that value. We introduce and study a geometric variation of SRL that we call Symmetric Rendezvous in a Disk (SRD) where two robots at distance 2 have a common reference point at distance $\\rho$. We show that even when $\\rho$ is not too small, the two robots can meet i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03351","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":"1805.03351","created_at":"2026-05-18T00:16:20.416561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03351v1","created_at":"2026-05-18T00:16:20.416561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03351","created_at":"2026-05-18T00:16:20.416561+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAFFURGXGY7R","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAFFURGXGY7R6TRJ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAFFURGX","created_at":"2026-05-18T12:32:59.047623+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/VAFFURGXGY7R6TRJXM6VS6EYOL","json":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL.json","graph_json":"https://pith.science/api/pith-number/VAFFURGXGY7R6TRJXM6VS6EYOL/graph.json","events_json":"https://pith.science/api/pith-number/VAFFURGXGY7R6TRJXM6VS6EYOL/events.json","paper":"https://pith.science/paper/VAFFURGX"},"agent_actions":{"view_html":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL","download_json":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL.json","view_paper":"https://pith.science/paper/VAFFURGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03351&json=true","fetch_graph":"https://pith.science/api/pith-number/VAFFURGXGY7R6TRJXM6VS6EYOL/graph.json","fetch_events":"https://pith.science/api/pith-number/VAFFURGXGY7R6TRJXM6VS6EYOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL/action/storage_attestation","attest_author":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL/action/author_attestation","sign_citation":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL/action/citation_signature","submit_replication":"https://pith.science/pith/VAFFURGXGY7R6TRJXM6VS6EYOL/action/replication_record"}},"created_at":"2026-05-18T00:16:20.416561+00:00","updated_at":"2026-05-18T00:16:20.416561+00:00"}