{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:267PFPYQPBLDDNUDK4PTKET6PT","short_pith_number":"pith:267PFPYQ","canonical_record":{"source":{"id":"0912.0670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-12-03T15:03:32Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b64217bee8e9fb72f2efa055adcbe238cb924a71db5f968e8213b9cf9b8b8fd9","abstract_canon_sha256":"5867551faa2b3a4f8255eb28885fcee9dc6ccb23d82135d32ef43322d3db98b3"},"schema_version":"1.0"},"canonical_sha256":"d7bef2bf10785631b683571f35127e7cf98f21e6bd477416f69b0b3988698b76","source":{"kind":"arxiv","id":"0912.0670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0670","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0670v1","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0670","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"267PFPYQPBLD","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"267PFPYQPBLDDNUD","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"267PFPYQ","created_at":"2026-07-04T17:17:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:267PFPYQPBLDDNUDK4PTKET6PT","target":"record","payload":{"canonical_record":{"source":{"id":"0912.0670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-12-03T15:03:32Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b64217bee8e9fb72f2efa055adcbe238cb924a71db5f968e8213b9cf9b8b8fd9","abstract_canon_sha256":"5867551faa2b3a4f8255eb28885fcee9dc6ccb23d82135d32ef43322d3db98b3"},"schema_version":"1.0"},"canonical_sha256":"d7bef2bf10785631b683571f35127e7cf98f21e6bd477416f69b0b3988698b76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:17:03.084013Z","signature_b64":"0i2GOqsVsCM/xBUtYM7FXg0K1A1Ujh/rxuFLwU6gsxwh4xgeUYHnFv1wHLDwQjqC3TV0qG/02+v/WDZvDs/ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7bef2bf10785631b683571f35127e7cf98f21e6bd477416f69b0b3988698b76","last_reissued_at":"2026-07-04T17:17:03.083600Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:17:03.083600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.0670","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-07-04T17:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohmchsU2K7YM2j/RgReG0txZ7lU2WyZ5amqKXIJb+t2yAlV+lATpt+WRwmR8/Q8QbvsAB5AWMBZc+Xy9IehjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:02:02.936555Z"},"content_sha256":"1907e113050f13c24cd027ed9b5b834747b7f117e1685a69f43d8c3ac860571e","schema_version":"1.0","event_id":"sha256:1907e113050f13c24cd027ed9b5b834747b7f117e1685a69f43d8c3ac860571e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:267PFPYQPBLDDNUDK4PTKET6PT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Anderson-Weber strategy is not optimal for symmetric rendezvous search on K4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Richard Weber","submitted_at":"2009-12-03T15:03:32Z","abstract_excerpt":"We consider the symmetric rendezvous search game on a complete graph of n locations. In 1990, Anderson and Weber proposed a strategy in which, over successive blocks of n-1 steps, the players independently choose either to stay at their initial location or to tour the other n-1 locations, with probabilities p and 1-p, respectively. Their strategy has been proved optimal for n=2 with p=1/2, and for n=3 with p=1/3. The proof for n=3 is very complicated and it has been difficult to guess what might be true for n>3. Anderson and Weber suspected that their strategy might not be optimal for n>3, but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0670","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0912.0670/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrz257trJu3zV/los+w+RGhEPMRLuJD4doDJAV3wkt8BKRgpENeLwu3tL79I4CLQQ/NGgp20mHfkREIOiH/zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:02:02.936923Z"},"content_sha256":"9f6ad7f7a80b597b3dfdd63ca77371a5a81dfe84c7b0b3865899a34570e6429e","schema_version":"1.0","event_id":"sha256:9f6ad7f7a80b597b3dfdd63ca77371a5a81dfe84c7b0b3865899a34570e6429e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/267PFPYQPBLDDNUDK4PTKET6PT/bundle.json","state_url":"https://pith.science/pith/267PFPYQPBLDDNUDK4PTKET6PT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/267PFPYQPBLDDNUDK4PTKET6PT/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-07-05T02:02:02Z","links":{"resolver":"https://pith.science/pith/267PFPYQPBLDDNUDK4PTKET6PT","bundle":"https://pith.science/pith/267PFPYQPBLDDNUDK4PTKET6PT/bundle.json","state":"https://pith.science/pith/267PFPYQPBLDDNUDK4PTKET6PT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/267PFPYQPBLDDNUDK4PTKET6PT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:267PFPYQPBLDDNUDK4PTKET6PT","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":"5867551faa2b3a4f8255eb28885fcee9dc6ccb23d82135d32ef43322d3db98b3","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-12-03T15:03:32Z","title_canon_sha256":"b64217bee8e9fb72f2efa055adcbe238cb924a71db5f968e8213b9cf9b8b8fd9"},"schema_version":"1.0","source":{"id":"0912.0670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0670","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0670v1","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0670","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"267PFPYQPBLD","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"267PFPYQPBLDDNUD","created_at":"2026-07-04T17:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"267PFPYQ","created_at":"2026-07-04T17:17:03Z"}],"graph_snapshots":[{"event_id":"sha256:9f6ad7f7a80b597b3dfdd63ca77371a5a81dfe84c7b0b3865899a34570e6429e","target":"graph","created_at":"2026-07-04T17:17:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0912.0670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the symmetric rendezvous search game on a complete graph of n locations. In 1990, Anderson and Weber proposed a strategy in which, over successive blocks of n-1 steps, the players independently choose either to stay at their initial location or to tour the other n-1 locations, with probabilities p and 1-p, respectively. Their strategy has been proved optimal for n=2 with p=1/2, and for n=3 with p=1/3. The proof for n=3 is very complicated and it has been difficult to guess what might be true for n>3. Anderson and Weber suspected that their strategy might not be optimal for n>3, but","authors_text":"Richard Weber","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-12-03T15:03:32Z","title":"The Anderson-Weber strategy is not optimal for symmetric rendezvous search on K4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0670","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:1907e113050f13c24cd027ed9b5b834747b7f117e1685a69f43d8c3ac860571e","target":"record","created_at":"2026-07-04T17:17:03Z","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":"5867551faa2b3a4f8255eb28885fcee9dc6ccb23d82135d32ef43322d3db98b3","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-12-03T15:03:32Z","title_canon_sha256":"b64217bee8e9fb72f2efa055adcbe238cb924a71db5f968e8213b9cf9b8b8fd9"},"schema_version":"1.0","source":{"id":"0912.0670","kind":"arxiv","version":1}},"canonical_sha256":"d7bef2bf10785631b683571f35127e7cf98f21e6bd477416f69b0b3988698b76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7bef2bf10785631b683571f35127e7cf98f21e6bd477416f69b0b3988698b76","first_computed_at":"2026-07-04T17:17:03.083600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:17:03.083600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0i2GOqsVsCM/xBUtYM7FXg0K1A1Ujh/rxuFLwU6gsxwh4xgeUYHnFv1wHLDwQjqC3TV0qG/02+v/WDZvDs/ADQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:17:03.084013Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.0670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1907e113050f13c24cd027ed9b5b834747b7f117e1685a69f43d8c3ac860571e","sha256:9f6ad7f7a80b597b3dfdd63ca77371a5a81dfe84c7b0b3865899a34570e6429e"],"state_sha256":"a367ce01cdd2236bc2ec4ff39376a502625547631ab818e1f69578b60c2895e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnQQLIAoElnp1woxB4divZGLX9QLP6o3JPlkz6pLE/BjkhMy+un1A/wPw/1rUUYXQX2UL+m0qNAE8bamOu8GDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T02:02:02.938920Z","bundle_sha256":"328cd38cc01dab34d9b531205e41523ee88875c356629c423e1b34ba059f1909"}}