{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FY5HOKC2M6HWT7BYGKMROGLDF4","short_pith_number":"pith:FY5HOKC2","canonical_record":{"source":{"id":"1609.01582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T14:50:16Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"52104cdda55c1fb98b9ae1a03d9420fe16a7862f74e4ed906748d54166529073","abstract_canon_sha256":"731c967a53e6c919f04b104572e693769cf71a9eafc06be60e7d38d549706c4c"},"schema_version":"1.0"},"canonical_sha256":"2e3a77285a678f69fc3832991719632f3e9f1c1ef608d0027af2f43e37b1e05c","source":{"kind":"arxiv","id":"1609.01582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01582","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01582v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01582","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"FY5HOKC2M6HW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FY5HOKC2M6HWT7BY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FY5HOKC2","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FY5HOKC2M6HWT7BYGKMROGLDF4","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T14:50:16Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"52104cdda55c1fb98b9ae1a03d9420fe16a7862f74e4ed906748d54166529073","abstract_canon_sha256":"731c967a53e6c919f04b104572e693769cf71a9eafc06be60e7d38d549706c4c"},"schema_version":"1.0"},"canonical_sha256":"2e3a77285a678f69fc3832991719632f3e9f1c1ef608d0027af2f43e37b1e05c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.228571Z","signature_b64":"1Upa78GPTmVkKEwsAI9k559FrwMPmbU0sp+a1NktUE4j8NMtn4ubSryPFvPHVcbHzAyCklqJ4RBmDlY82CF4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3a77285a678f69fc3832991719632f3e9f1c1ef608d0027af2f43e37b1e05c","last_reissued_at":"2026-05-18T01:05:39.227854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.227854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01582","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vp0Vw0Um5p3Ip1LY9ti5zZ6EvVjWFu51dCNKEmoPtKcULn5AK4GCxSGqNDbsKmmFAygFEvs/pyHZbDdTiofzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:59:23.731616Z"},"content_sha256":"9faffa9064f6ef14eaa63b43f5b40b3add5bc14bf0395e3727779ddabe2e0800","schema_version":"1.0","event_id":"sha256:9faffa9064f6ef14eaa63b43f5b40b3add5bc14bf0395e3727779ddabe2e0800"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FY5HOKC2M6HWT7BYGKMROGLDF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Alexander Russell, Cristopher Moore, Thomas P. Hayes, Varsha Dani","submitted_at":"2016-09-06T14:50:16Z","abstract_excerpt":"In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the parties have predetermined roles, then the strategy where one of them waits at one vertex, while the other visits all $n$ vertices in random order is optimal, taking at most $n$ steps and averaging about $n/2$. Anderson and Weber considered the symmetric rendezvous problem, where both parties must use the same randomized strategy. They analyzed strategies where the parties repeatedly play the optimal asymmetric stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01582","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSwzPJA09fBZLeozls5CN4NquJy0C/0sX54xDXRynA/ilWvsjWgV+Y/wFT1NZH/wEZUI/eSgUrUdMqppYUI2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:59:23.731963Z"},"content_sha256":"f53d2a322a37c8ee12cf18c75a14d8a197fd5f491697c3049d21120222b75797","schema_version":"1.0","event_id":"sha256:f53d2a322a37c8ee12cf18c75a14d8a197fd5f491697c3049d21120222b75797"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FY5HOKC2M6HWT7BYGKMROGLDF4/bundle.json","state_url":"https://pith.science/pith/FY5HOKC2M6HWT7BYGKMROGLDF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FY5HOKC2M6HWT7BYGKMROGLDF4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T06:59:23Z","links":{"resolver":"https://pith.science/pith/FY5HOKC2M6HWT7BYGKMROGLDF4","bundle":"https://pith.science/pith/FY5HOKC2M6HWT7BYGKMROGLDF4/bundle.json","state":"https://pith.science/pith/FY5HOKC2M6HWT7BYGKMROGLDF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FY5HOKC2M6HWT7BYGKMROGLDF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FY5HOKC2M6HWT7BYGKMROGLDF4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"731c967a53e6c919f04b104572e693769cf71a9eafc06be60e7d38d549706c4c","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T14:50:16Z","title_canon_sha256":"52104cdda55c1fb98b9ae1a03d9420fe16a7862f74e4ed906748d54166529073"},"schema_version":"1.0","source":{"id":"1609.01582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01582","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01582v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01582","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"FY5HOKC2M6HW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FY5HOKC2M6HWT7BY","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FY5HOKC2","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:f53d2a322a37c8ee12cf18c75a14d8a197fd5f491697c3049d21120222b75797","target":"graph","created_at":"2026-05-18T01:05:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the parties have predetermined roles, then the strategy where one of them waits at one vertex, while the other visits all $n$ vertices in random order is optimal, taking at most $n$ steps and averaging about $n/2$. Anderson and Weber considered the symmetric rendezvous problem, where both parties must use the same randomized strategy. They analyzed strategies where the parties repeatedly play the optimal asymmetric stra","authors_text":"Alexander Russell, Cristopher Moore, Thomas P. Hayes, Varsha Dani","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T14:50:16Z","title":"Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01582","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9faffa9064f6ef14eaa63b43f5b40b3add5bc14bf0395e3727779ddabe2e0800","target":"record","created_at":"2026-05-18T01:05:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"731c967a53e6c919f04b104572e693769cf71a9eafc06be60e7d38d549706c4c","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T14:50:16Z","title_canon_sha256":"52104cdda55c1fb98b9ae1a03d9420fe16a7862f74e4ed906748d54166529073"},"schema_version":"1.0","source":{"id":"1609.01582","kind":"arxiv","version":1}},"canonical_sha256":"2e3a77285a678f69fc3832991719632f3e9f1c1ef608d0027af2f43e37b1e05c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e3a77285a678f69fc3832991719632f3e9f1c1ef608d0027af2f43e37b1e05c","first_computed_at":"2026-05-18T01:05:39.227854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:39.227854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Upa78GPTmVkKEwsAI9k559FrwMPmbU0sp+a1NktUE4j8NMtn4ubSryPFvPHVcbHzAyCklqJ4RBmDlY82CF4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:39.228571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9faffa9064f6ef14eaa63b43f5b40b3add5bc14bf0395e3727779ddabe2e0800","sha256:f53d2a322a37c8ee12cf18c75a14d8a197fd5f491697c3049d21120222b75797"],"state_sha256":"6a1d02331df46e63cd7fea9de8569363b598badb66c7430e7a403c89c4bf91c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6iaD9OCs2eJ9+Cszwa5DZ2TRHn+NCQD2fKgaPYKUUw7/1kVnXAL03KXkUaJ+qJ0q2SK2JxJ/YFMWhW/ICYgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:59:23.734007Z","bundle_sha256":"24414a60ed9985e17481f02c288743c84b0b1b64acec777305e570953730d90c"}}