{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T4Z25YODEMPSN6CMDKVVPRM2RH","short_pith_number":"pith:T4Z25YOD","canonical_record":{"source":{"id":"1406.2228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T16:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"499cc158cc4d39ac45add1146af9f3eaa5dc487699056cb0198ac7207e8225f6","abstract_canon_sha256":"f37aaa9af1c0c8c8b38af4ecfd3e24f4f1066c46d176eed70b0367541c4008f1"},"schema_version":"1.0"},"canonical_sha256":"9f33aee1c3231f26f84c1aab57c59a89ee4a6679a482c5c75ae785669ac8befa","source":{"kind":"arxiv","id":"1406.2228","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2228","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2228v3","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2228","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"T4Z25YODEMPS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T4Z25YODEMPSN6CM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T4Z25YOD","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T4Z25YODEMPSN6CMDKVVPRM2RH","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T16:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"499cc158cc4d39ac45add1146af9f3eaa5dc487699056cb0198ac7207e8225f6","abstract_canon_sha256":"f37aaa9af1c0c8c8b38af4ecfd3e24f4f1066c46d176eed70b0367541c4008f1"},"schema_version":"1.0"},"canonical_sha256":"9f33aee1c3231f26f84c1aab57c59a89ee4a6679a482c5c75ae785669ac8befa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.311049Z","signature_b64":"QRQYIVWR96RlPVOZDFf2NApSzZOYnMF4d+zgK/Hf1sxjgvqK+90opGAER9/VMrKOpkfIULFyH4fmrtcUSZZqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f33aee1c3231f26f84c1aab57c59a89ee4a6679a482c5c75ae785669ac8befa","last_reissued_at":"2026-05-18T01:20:12.310337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.310337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2228","source_version":3,"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:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2VmsVaeo7WUGky9NO10ySu9zg7Z5xQX3DoqtgfbzS1LnkJN4VhnRnXXf3U8hO5u7neJsAiTkuiZ2ttsTOKtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:00:56.773308Z"},"content_sha256":"05c65dd6b90a3045f55ce7811f21d43611ed2b0a57c5318e693ae665dd162f71","schema_version":"1.0","event_id":"sha256:05c65dd6b90a3045f55ce7811f21d43611ed2b0a57c5318e693ae665dd162f71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T4Z25YODEMPSN6CMDKVVPRM2RH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To catch a falling robber","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas B. West, Pawe{\\l} Pra{\\l}at, William B. Kinnersley","submitted_at":"2014-06-09T16:01:47Z","abstract_excerpt":"We consider a Cops-and-Robber game played on the subsets of an $n$-set. The robber starts at the full set; the cops start at the empty set. On each turn, the robber moves down one level by discarding an element, and each cop moves up one level by gaining an element. The question is how many cops are needed to ensure catching the robber when the robber reaches the middle level. Aaron Hill posed the problem and provided a lower bound of $2^{n/2}$ for even $n$ and $\\binom{n}{\\lceil n/2 \\rceil}2^{-\\lfloor n/2 \\rfloor}$ for odd $n$. We prove an upper bound (for all $n$) that is within a factor of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2228","kind":"arxiv","version":3},"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:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJAv+KPahGJnnykSDiymppCM9ni7DscFXBmOUtANn2WxbsiI5oKvZIYKPkzQjiE4aOpJANnnFIxffG5LE9nlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:00:56.774050Z"},"content_sha256":"518545d3fd1878a03cf06fae9ec2cd63aae9fe19e8d226e7fd64cd18a121df47","schema_version":"1.0","event_id":"sha256:518545d3fd1878a03cf06fae9ec2cd63aae9fe19e8d226e7fd64cd18a121df47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4Z25YODEMPSN6CMDKVVPRM2RH/bundle.json","state_url":"https://pith.science/pith/T4Z25YODEMPSN6CMDKVVPRM2RH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4Z25YODEMPSN6CMDKVVPRM2RH/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-06-06T03:00:56Z","links":{"resolver":"https://pith.science/pith/T4Z25YODEMPSN6CMDKVVPRM2RH","bundle":"https://pith.science/pith/T4Z25YODEMPSN6CMDKVVPRM2RH/bundle.json","state":"https://pith.science/pith/T4Z25YODEMPSN6CMDKVVPRM2RH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4Z25YODEMPSN6CMDKVVPRM2RH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T4Z25YODEMPSN6CMDKVVPRM2RH","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":"f37aaa9af1c0c8c8b38af4ecfd3e24f4f1066c46d176eed70b0367541c4008f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T16:01:47Z","title_canon_sha256":"499cc158cc4d39ac45add1146af9f3eaa5dc487699056cb0198ac7207e8225f6"},"schema_version":"1.0","source":{"id":"1406.2228","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2228","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2228v3","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2228","created_at":"2026-05-18T01:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"T4Z25YODEMPS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T4Z25YODEMPSN6CM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T4Z25YOD","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:518545d3fd1878a03cf06fae9ec2cd63aae9fe19e8d226e7fd64cd18a121df47","target":"graph","created_at":"2026-05-18T01:20:12Z","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 consider a Cops-and-Robber game played on the subsets of an $n$-set. The robber starts at the full set; the cops start at the empty set. On each turn, the robber moves down one level by discarding an element, and each cop moves up one level by gaining an element. The question is how many cops are needed to ensure catching the robber when the robber reaches the middle level. Aaron Hill posed the problem and provided a lower bound of $2^{n/2}$ for even $n$ and $\\binom{n}{\\lceil n/2 \\rceil}2^{-\\lfloor n/2 \\rfloor}$ for odd $n$. We prove an upper bound (for all $n$) that is within a factor of $","authors_text":"Douglas B. West, Pawe{\\l} Pra{\\l}at, William B. Kinnersley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T16:01:47Z","title":"To catch a falling robber"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2228","kind":"arxiv","version":3},"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:05c65dd6b90a3045f55ce7811f21d43611ed2b0a57c5318e693ae665dd162f71","target":"record","created_at":"2026-05-18T01:20:12Z","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":"f37aaa9af1c0c8c8b38af4ecfd3e24f4f1066c46d176eed70b0367541c4008f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-09T16:01:47Z","title_canon_sha256":"499cc158cc4d39ac45add1146af9f3eaa5dc487699056cb0198ac7207e8225f6"},"schema_version":"1.0","source":{"id":"1406.2228","kind":"arxiv","version":3}},"canonical_sha256":"9f33aee1c3231f26f84c1aab57c59a89ee4a6679a482c5c75ae785669ac8befa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f33aee1c3231f26f84c1aab57c59a89ee4a6679a482c5c75ae785669ac8befa","first_computed_at":"2026-05-18T01:20:12.310337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:12.310337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QRQYIVWR96RlPVOZDFf2NApSzZOYnMF4d+zgK/Hf1sxjgvqK+90opGAER9/VMrKOpkfIULFyH4fmrtcUSZZqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:12.311049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2228","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05c65dd6b90a3045f55ce7811f21d43611ed2b0a57c5318e693ae665dd162f71","sha256:518545d3fd1878a03cf06fae9ec2cd63aae9fe19e8d226e7fd64cd18a121df47"],"state_sha256":"ba420ae12de7334a787f44b367acbabe863ef96ddbc0c6f5ec9f2c82b2747511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dk0uCL5fDjKxQYQuMkId2eQ36bYHU6/YYr3nv3OWz8NvZjl75m1kN76bRRz+U718g6w8p7suZCZ6m6Ufbd2fBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:00:56.778419Z","bundle_sha256":"07fba3d8b0af96bb03f839d466e91c0784624fadd7e973304362bcdd44107242"}}