{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UKPQHDLKM2VP7RPFPK7TNYDHUU","short_pith_number":"pith:UKPQHDLK","canonical_record":{"source":{"id":"1502.05614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-19T16:24:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9dccbf39d47e88fdd9b96a64b42bfdfae8c6ee061c2a7aab9def52712ff2223b","abstract_canon_sha256":"6c5733e16243ad35217e4a257e93043d2026b0169f6c805b24b321b9225d1c53"},"schema_version":"1.0"},"canonical_sha256":"a29f038d6a66aaffc5e57abf36e067a5043f8a6b8df427e49a0b21a68b0153a8","source":{"kind":"arxiv","id":"1502.05614","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05614","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05614v2","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05614","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"pith_short_12","alias_value":"UKPQHDLKM2VP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKPQHDLKM2VP7RPF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKPQHDLK","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UKPQHDLKM2VP7RPFPK7TNYDHUU","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-19T16:24:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9dccbf39d47e88fdd9b96a64b42bfdfae8c6ee061c2a7aab9def52712ff2223b","abstract_canon_sha256":"6c5733e16243ad35217e4a257e93043d2026b0169f6c805b24b321b9225d1c53"},"schema_version":"1.0"},"canonical_sha256":"a29f038d6a66aaffc5e57abf36e067a5043f8a6b8df427e49a0b21a68b0153a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.986565Z","signature_b64":"GLdswJPAsLh5K8MdIq4Tht7CNhhT/dToqORBFLsXeuXse99m7WkpTRQmPNCY2OZDRcW7pu6ghBqPay9O64c6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a29f038d6a66aaffc5e57abf36e067a5043f8a6b8df427e49a0b21a68b0153a8","last_reissued_at":"2026-05-18T02:26:44.985956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.985956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05614","source_version":2,"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-18T02:26:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmbI4mk24vYpOByc45agsUdyUtpPnbqqlrWatjB+BialjxYVU8tG3+KO7xTSsAW4TKMRC3GO3toMlVIC0dyICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:04.183991Z"},"content_sha256":"546d53cc897826350b2b6e578c2d0bef350a79ace1020c3c61393bd93dbeb261","schema_version":"1.0","event_id":"sha256:546d53cc897826350b2b6e578c2d0bef350a79ace1020c3c61393bd93dbeb261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UKPQHDLKM2VP7RPFPK7TNYDHUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Hunt an Invisible Rabbit on a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk, Petr A. Golovach, Tatjana V. Abramovskaya","submitted_at":"2015-02-19T16:24:39Z","abstract_excerpt":"We investigate Hunters & Rabbit game, where a set of hunters tries to catch an invisible rabbit that slides along the edges of a graph. We show that the minimum number of hunters required to win on an (n\\times m)-grid is \\lfloor min{n,m}/2\\rfloor+1. We also show that the extremal value of this number on n-vertex trees is between \\Omega(log n/log log n) and O(log n)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05614","kind":"arxiv","version":2},"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-18T02:26:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVBnjMgy26cFj/igJa9gfLRoqJB2oWirT3kLiNyKl6MxDb7kx9ZGkimd4C15fbibpTkhYqksmusoNWY/oibqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:04.184698Z"},"content_sha256":"189fc8ef4c7adab6fc9603c3261c5a822a74904dcd81afd08591dfe0836bfb68","schema_version":"1.0","event_id":"sha256:189fc8ef4c7adab6fc9603c3261c5a822a74904dcd81afd08591dfe0836bfb68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU/bundle.json","state_url":"https://pith.science/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU/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-08-14T06:41:04Z","links":{"resolver":"https://pith.science/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU","bundle":"https://pith.science/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU/bundle.json","state":"https://pith.science/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKPQHDLKM2VP7RPFPK7TNYDHUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UKPQHDLKM2VP7RPFPK7TNYDHUU","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":"6c5733e16243ad35217e4a257e93043d2026b0169f6c805b24b321b9225d1c53","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-19T16:24:39Z","title_canon_sha256":"9dccbf39d47e88fdd9b96a64b42bfdfae8c6ee061c2a7aab9def52712ff2223b"},"schema_version":"1.0","source":{"id":"1502.05614","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05614","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05614v2","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05614","created_at":"2026-05-18T02:26:44Z"},{"alias_kind":"pith_short_12","alias_value":"UKPQHDLKM2VP","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKPQHDLKM2VP7RPF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKPQHDLK","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:189fc8ef4c7adab6fc9603c3261c5a822a74904dcd81afd08591dfe0836bfb68","target":"graph","created_at":"2026-05-18T02:26:44Z","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":"We investigate Hunters & Rabbit game, where a set of hunters tries to catch an invisible rabbit that slides along the edges of a graph. We show that the minimum number of hunters required to win on an (n\\times m)-grid is \\lfloor min{n,m}/2\\rfloor+1. We also show that the extremal value of this number on n-vertex trees is between \\Omega(log n/log log n) and O(log n).","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk, Petr A. Golovach, Tatjana V. Abramovskaya","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-19T16:24:39Z","title":"How to Hunt an Invisible Rabbit on a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05614","kind":"arxiv","version":2},"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:546d53cc897826350b2b6e578c2d0bef350a79ace1020c3c61393bd93dbeb261","target":"record","created_at":"2026-05-18T02:26:44Z","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":"6c5733e16243ad35217e4a257e93043d2026b0169f6c805b24b321b9225d1c53","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-19T16:24:39Z","title_canon_sha256":"9dccbf39d47e88fdd9b96a64b42bfdfae8c6ee061c2a7aab9def52712ff2223b"},"schema_version":"1.0","source":{"id":"1502.05614","kind":"arxiv","version":2}},"canonical_sha256":"a29f038d6a66aaffc5e57abf36e067a5043f8a6b8df427e49a0b21a68b0153a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a29f038d6a66aaffc5e57abf36e067a5043f8a6b8df427e49a0b21a68b0153a8","first_computed_at":"2026-05-18T02:26:44.985956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:44.985956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLdswJPAsLh5K8MdIq4Tht7CNhhT/dToqORBFLsXeuXse99m7WkpTRQmPNCY2OZDRcW7pu6ghBqPay9O64c6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:44.986565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05614","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:546d53cc897826350b2b6e578c2d0bef350a79ace1020c3c61393bd93dbeb261","sha256:189fc8ef4c7adab6fc9603c3261c5a822a74904dcd81afd08591dfe0836bfb68"],"state_sha256":"ad8fc03cfe173f8b815488b44e739d52b29b9c9efbefad82e566a13e78c6de91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REucLOI2o0axDre+8dhW9IWDR4+F5d/nGMY9X1YanWGJbPcp5Z0JeWP/Ju2g1zG6YbX7d7impWGHL7TQZFZaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:41:04.189751Z","bundle_sha256":"bf71de7af171e01bd2aff9862af4c0d56e2f63689c407f865b3396953feade0c"}}