{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WXFP3M4J3Y43YJF7T6TXVLWHAL","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":"0241a11adaddf9509c25a20e5d21dc8c557b2c42427c545492ba20688a431110","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T02:01:04Z","title_canon_sha256":"615bfcdac712d95f3c6ebd235d4fc1eaae3981c5229dd7cc0cabbb48fca7f734"},"schema_version":"1.0","source":{"id":"2001.00477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.00477","created_at":"2026-07-05T00:29:24Z"},{"alias_kind":"arxiv_version","alias_value":"2001.00477v1","created_at":"2026-07-05T00:29:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00477","created_at":"2026-07-05T00:29:24Z"},{"alias_kind":"pith_short_12","alias_value":"WXFP3M4J3Y43","created_at":"2026-07-05T00:29:24Z"},{"alias_kind":"pith_short_16","alias_value":"WXFP3M4J3Y43YJF7","created_at":"2026-07-05T00:29:24Z"},{"alias_kind":"pith_short_8","alias_value":"WXFP3M4J","created_at":"2026-07-05T00:29:24Z"}],"graph_snapshots":[{"event_id":"sha256:832deebab71d4b4e1aa72ad8874682c6cd599687495073e97b130de21d1b3179","target":"graph","created_at":"2026-07-05T00:29:24Z","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/2001.00477/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A hole in a graph is an induced cycle of length at least 4. We give a simple winning strategy for t-3 cops to capture a robber in the game of cops and robbers played in a graph that does not contain a hole of length at least t. This strengthens a theorem of Joret-Kaminski-Theis, who proved that t-2 cops have a winning strategy in such graphs. As a consequence of our bound, we also give an inequality relating the cop number and the Dilworth number of a graph.","authors_text":"Vaidy Sivaraman","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T02:01:04Z","title":"Cop number of graphs without long holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00477","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:7fbb30ca7cdc5434032f9fcf489d9cd91d082791d9cfb16ca0e99ac2903a941f","target":"record","created_at":"2026-07-05T00:29:24Z","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":"0241a11adaddf9509c25a20e5d21dc8c557b2c42427c545492ba20688a431110","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T02:01:04Z","title_canon_sha256":"615bfcdac712d95f3c6ebd235d4fc1eaae3981c5229dd7cc0cabbb48fca7f734"},"schema_version":"1.0","source":{"id":"2001.00477","kind":"arxiv","version":1}},"canonical_sha256":"b5cafdb389de39bc24bf9fa77aaec702d1308fd86436107d421525d9a7eb1c64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5cafdb389de39bc24bf9fa77aaec702d1308fd86436107d421525d9a7eb1c64","first_computed_at":"2026-07-05T00:29:24.690531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:24.690531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WqXhYVPFp2og2adzFRWhl8xORFEm2U63jOLx+Ho4MPGBbIR0IMy0fCj93y8ZB73Iu+oEmrpiY0qSmRyFHN8aAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:24.690871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.00477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fbb30ca7cdc5434032f9fcf489d9cd91d082791d9cfb16ca0e99ac2903a941f","sha256:832deebab71d4b4e1aa72ad8874682c6cd599687495073e97b130de21d1b3179"],"state_sha256":"4f00fb68263350f384cb7b57e60fce8b756c70bed93242ea13217bb4a0da87ab"}