{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UCXXH5AWQPTCUVPNPHTGZSTTUQ","short_pith_number":"pith:UCXXH5AW","canonical_record":{"source":{"id":"1207.6389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-26T19:55:25Z","cross_cats_sorted":["math.CA","math.CO"],"title_canon_sha256":"d68c6285c76599f4449e4797b953feb76e4f98500bd3352f632cb49d5641f409","abstract_canon_sha256":"27ded314ab610e98fc3c390a6b3039e120ca7d84c7025539cb3b66fbadbe3c62"},"schema_version":"1.0"},"canonical_sha256":"a0af73f41683e62a55ed79e66cca73a40ebf27c0330a9a0a57dac034420a9465","source":{"kind":"arxiv","id":"1207.6389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6389","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6389v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6389","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"UCXXH5AWQPTC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UCXXH5AWQPTCUVPN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UCXXH5AW","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UCXXH5AWQPTCUVPNPHTGZSTTUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-26T19:55:25Z","cross_cats_sorted":["math.CA","math.CO"],"title_canon_sha256":"d68c6285c76599f4449e4797b953feb76e4f98500bd3352f632cb49d5641f409","abstract_canon_sha256":"27ded314ab610e98fc3c390a6b3039e120ca7d84c7025539cb3b66fbadbe3c62"},"schema_version":"1.0"},"canonical_sha256":"a0af73f41683e62a55ed79e66cca73a40ebf27c0330a9a0a57dac034420a9465","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:00.382186Z","signature_b64":"C3UmmdeKwVzlxAv1W0jbguc3JkjNcCP+BcalqB0YH740ac1Hc6cR3BPNwfQwSuwGll6+yAuU8Xj0c6Wo2qQICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0af73f41683e62a55ed79e66cca73a40ebf27c0330a9a0a57dac034420a9465","last_reissued_at":"2026-05-18T03:50:00.381741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:00.381741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6389","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-18T03:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KtO+aJVxg5H8LA/y89/EnW2nUSVChFTdEsho9DTQYGAktZEvYzgZSKUr/ciLwY+d2+jGsLbfp7Tw9DM1fZMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:38:59.931501Z"},"content_sha256":"2d44ea650176873bd69acdee542d2b73870fe6caf6e7f59ccaedc00e0a9cfbce","schema_version":"1.0","event_id":"sha256:2d44ea650176873bd69acdee542d2b73870fe6caf6e7f59ccaedc00e0a9cfbce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UCXXH5AWQPTCUVPNPHTGZSTTUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hunter, Cauchy Rabbit, and Optimal Kakeya Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.CO"],"primary_cat":"math.PR","authors_text":"Perla Sousi, Peter Winkler, Ron Peretz, Yakov Babichenko, Yuval Peres","submitted_at":"2012-07-26T19:55:25Z","abstract_excerpt":"A planar set that contains a unit segment in every direction is called a Kakeya set. We relate these sets to a game of pursuit on a cycle $\\Z_n$. A hunter and a rabbit move on the nodes of $\\Z_n$ without seeing each other. At each step, the hunter moves to a neighbouring vertex or stays in place, while the rabbit is free to jump to any node. Adler et al (2003) provide strategies for hunter and rabbit that are optimal up to constant factors and achieve probability of capture in the first $n$ steps of order $1/\\log n$. We show these strategies yield a Kakeya set consisting of $4n$ triangles with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6389","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-18T03:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1YGdGVBO0W6DtvDIMQ1nDTpb/5wM+geYLEkq+gv4gM6AwDnX4b+5FlZjEzGocPrLn8M8yM5ctBmo6cS0bS5QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:38:59.931859Z"},"content_sha256":"1bf6e70b04c5c02d4996452f4a546c0c5d64f989625bf2df2eb4b10f38fa7b5d","schema_version":"1.0","event_id":"sha256:1bf6e70b04c5c02d4996452f4a546c0c5d64f989625bf2df2eb4b10f38fa7b5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ/bundle.json","state_url":"https://pith.science/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ/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-28T17:38:59Z","links":{"resolver":"https://pith.science/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ","bundle":"https://pith.science/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ/bundle.json","state":"https://pith.science/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCXXH5AWQPTCUVPNPHTGZSTTUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UCXXH5AWQPTCUVPNPHTGZSTTUQ","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":"27ded314ab610e98fc3c390a6b3039e120ca7d84c7025539cb3b66fbadbe3c62","cross_cats_sorted":["math.CA","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-26T19:55:25Z","title_canon_sha256":"d68c6285c76599f4449e4797b953feb76e4f98500bd3352f632cb49d5641f409"},"schema_version":"1.0","source":{"id":"1207.6389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6389","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6389v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6389","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"UCXXH5AWQPTC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UCXXH5AWQPTCUVPN","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UCXXH5AW","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:1bf6e70b04c5c02d4996452f4a546c0c5d64f989625bf2df2eb4b10f38fa7b5d","target":"graph","created_at":"2026-05-18T03:50:00Z","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":"A planar set that contains a unit segment in every direction is called a Kakeya set. We relate these sets to a game of pursuit on a cycle $\\Z_n$. A hunter and a rabbit move on the nodes of $\\Z_n$ without seeing each other. At each step, the hunter moves to a neighbouring vertex or stays in place, while the rabbit is free to jump to any node. Adler et al (2003) provide strategies for hunter and rabbit that are optimal up to constant factors and achieve probability of capture in the first $n$ steps of order $1/\\log n$. We show these strategies yield a Kakeya set consisting of $4n$ triangles with","authors_text":"Perla Sousi, Peter Winkler, Ron Peretz, Yakov Babichenko, Yuval Peres","cross_cats":["math.CA","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-26T19:55:25Z","title":"Hunter, Cauchy Rabbit, and Optimal Kakeya Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6389","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:2d44ea650176873bd69acdee542d2b73870fe6caf6e7f59ccaedc00e0a9cfbce","target":"record","created_at":"2026-05-18T03:50:00Z","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":"27ded314ab610e98fc3c390a6b3039e120ca7d84c7025539cb3b66fbadbe3c62","cross_cats_sorted":["math.CA","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-26T19:55:25Z","title_canon_sha256":"d68c6285c76599f4449e4797b953feb76e4f98500bd3352f632cb49d5641f409"},"schema_version":"1.0","source":{"id":"1207.6389","kind":"arxiv","version":1}},"canonical_sha256":"a0af73f41683e62a55ed79e66cca73a40ebf27c0330a9a0a57dac034420a9465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0af73f41683e62a55ed79e66cca73a40ebf27c0330a9a0a57dac034420a9465","first_computed_at":"2026-05-18T03:50:00.381741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:00.381741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C3UmmdeKwVzlxAv1W0jbguc3JkjNcCP+BcalqB0YH740ac1Hc6cR3BPNwfQwSuwGll6+yAuU8Xj0c6Wo2qQICg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:00.382186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d44ea650176873bd69acdee542d2b73870fe6caf6e7f59ccaedc00e0a9cfbce","sha256:1bf6e70b04c5c02d4996452f4a546c0c5d64f989625bf2df2eb4b10f38fa7b5d"],"state_sha256":"da4e12ab4e65b61eebb6da04faa7925b404570832b193ebd6b7f9086d1dd765c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+k0NVniQq5JuAZR9U8qJlkgmo10S1C9hH0TTzSc8I/z25lFkL406ZVYvHcRsOnoQyZIagarJFc+xyp3A+/JLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:38:59.933932Z","bundle_sha256":"c899df4278d6115dcd1497dfbf968f211891ca33c24d9d33a5ce6f7bc0c13857"}}