{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BVMUND6ZSIUDA7Z7EC3CSP2MZP","short_pith_number":"pith:BVMUND6Z","canonical_record":{"source":{"id":"1312.1750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T01:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"e662b432eaafdf0b4574bbc462b11c4a97ab8f398b2e32ea1a51412627dc73f4","abstract_canon_sha256":"2bcaf5b3ccb84a7e1da2064e8942769fa67bbb6a7dd966d308bb776f44696edb"},"schema_version":"1.0"},"canonical_sha256":"0d59468fd99228307f3f20b6293f4ccbf4714acb6d4c8bc85b54ada926ad5c3f","source":{"kind":"arxiv","id":"1312.1750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1750","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1750v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1750","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"BVMUND6ZSIUD","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BVMUND6ZSIUDA7Z7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BVMUND6Z","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BVMUND6ZSIUDA7Z7EC3CSP2MZP","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T01:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"e662b432eaafdf0b4574bbc462b11c4a97ab8f398b2e32ea1a51412627dc73f4","abstract_canon_sha256":"2bcaf5b3ccb84a7e1da2064e8942769fa67bbb6a7dd966d308bb776f44696edb"},"schema_version":"1.0"},"canonical_sha256":"0d59468fd99228307f3f20b6293f4ccbf4714acb6d4c8bc85b54ada926ad5c3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:19.841830Z","signature_b64":"UQ1TI1b3ygP/lWIhDtfWRYGPaS86UtZsb9x1jeBXWmqjfayd/L+YFciVuvdegXJto1A9Qv4TMQFgh+hoinXECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d59468fd99228307f3f20b6293f4ccbf4714acb6d4c8bc85b54ada926ad5c3f","last_reissued_at":"2026-05-18T03:05:19.841336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:19.841336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1750","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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Np8WXumhqbh443mNZZ8QYPyS/7YvS7B01G+AGRrmHIGl/VdgXrALe/IdUsxx+U5jbXA5fczVhNkNQD4sT9xVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:16:00.295859Z"},"content_sha256":"c437a46da5eefd6857de8f81edec3d268ce7033664ba3ac59ca0651adafa675c","schema_version":"1.0","event_id":"sha256:c437a46da5eefd6857de8f81edec3d268ce7033664ba3ac59ca0651adafa675c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BVMUND6ZSIUDA7Z7EC3CSP2MZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy Cops and Robbers played on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Deepak Bal, Pawe{\\l} Pra{\\l}at, William B. Kinnersley","submitted_at":"2013-12-06T01:33:29Z","abstract_excerpt":"We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By investigating expansion properties, we provide asymptotically almost sure bounds on the lazy cop number of binomial random graphs $\\mathcal{G}(n,p)$ for a wide range of $p=p(n)$. By coupling the probabilistic metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1750","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:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvYXw3rfToOxSFTqUsdzciUgeLEv9G2znF5RpEE5vC/gGnnRcGtcO+P1ns5jD+qKY5KuUp2vDzUAR1UEKSLbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:16:00.296528Z"},"content_sha256":"a558352a9bca2ed9bae7a9abe891a564924a1209f26ea981075f10aaa24f02a5","schema_version":"1.0","event_id":"sha256:a558352a9bca2ed9bae7a9abe891a564924a1209f26ea981075f10aaa24f02a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP/bundle.json","state_url":"https://pith.science/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP/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-02T12:16:00Z","links":{"resolver":"https://pith.science/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP","bundle":"https://pith.science/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP/bundle.json","state":"https://pith.science/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVMUND6ZSIUDA7Z7EC3CSP2MZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BVMUND6ZSIUDA7Z7EC3CSP2MZP","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":"2bcaf5b3ccb84a7e1da2064e8942769fa67bbb6a7dd966d308bb776f44696edb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T01:33:29Z","title_canon_sha256":"e662b432eaafdf0b4574bbc462b11c4a97ab8f398b2e32ea1a51412627dc73f4"},"schema_version":"1.0","source":{"id":"1312.1750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1750","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1750v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1750","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"BVMUND6ZSIUD","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BVMUND6ZSIUDA7Z7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BVMUND6Z","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:a558352a9bca2ed9bae7a9abe891a564924a1209f26ea981075f10aaa24f02a5","target":"graph","created_at":"2026-05-18T03:05:19Z","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 variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By investigating expansion properties, we provide asymptotically almost sure bounds on the lazy cop number of binomial random graphs $\\mathcal{G}(n,p)$ for a wide range of $p=p(n)$. By coupling the probabilistic metho","authors_text":"Anthony Bonato, Deepak Bal, 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":"2013-12-06T01:33:29Z","title":"Lazy Cops and Robbers played on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1750","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:c437a46da5eefd6857de8f81edec3d268ce7033664ba3ac59ca0651adafa675c","target":"record","created_at":"2026-05-18T03:05:19Z","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":"2bcaf5b3ccb84a7e1da2064e8942769fa67bbb6a7dd966d308bb776f44696edb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-06T01:33:29Z","title_canon_sha256":"e662b432eaafdf0b4574bbc462b11c4a97ab8f398b2e32ea1a51412627dc73f4"},"schema_version":"1.0","source":{"id":"1312.1750","kind":"arxiv","version":1}},"canonical_sha256":"0d59468fd99228307f3f20b6293f4ccbf4714acb6d4c8bc85b54ada926ad5c3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d59468fd99228307f3f20b6293f4ccbf4714acb6d4c8bc85b54ada926ad5c3f","first_computed_at":"2026-05-18T03:05:19.841336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:19.841336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UQ1TI1b3ygP/lWIhDtfWRYGPaS86UtZsb9x1jeBXWmqjfayd/L+YFciVuvdegXJto1A9Qv4TMQFgh+hoinXECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:19.841830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c437a46da5eefd6857de8f81edec3d268ce7033664ba3ac59ca0651adafa675c","sha256:a558352a9bca2ed9bae7a9abe891a564924a1209f26ea981075f10aaa24f02a5"],"state_sha256":"a554c574b15f546b37012e49a79cafda53f01274153ad3d0c0bdcf018066ebad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2AUYgVfc53bin9nTKm2YZoHAxgvu2e7P6zXrdp8309kQfTwP+fVFArOGOCGMW/6n+GpPy2ZsdqMNRvdcy1lBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:16:00.299847Z","bundle_sha256":"b2d712673e73b181b4c3a62442fa021a2567364c808c5b8e2842a54439f27398"}}