{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EBKSBSKMW7IEBESXBMIJMQQQ5X","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":"e1c8feb4e1c5cbc1025e5a2f6ed099a059df090dd28adef89f30bdefac3f1f83","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-14T15:07:08Z","title_canon_sha256":"313c949689b0286331ac911f725704b994eca46f23aca4e67d3d429e982d5355"},"schema_version":"1.0","source":{"id":"2112.07449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07449","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07449v2","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07449","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"EBKSBSKMW7IE","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"pith_short_16","alias_value":"EBKSBSKMW7IEBESX","created_at":"2026-07-05T04:31:58Z"},{"alias_kind":"pith_short_8","alias_value":"EBKSBSKM","created_at":"2026-07-05T04:31:58Z"}],"graph_snapshots":[{"event_id":"sha256:377072c725657f79f5be88da06416834e24788f5ca222969ae6ca47f34ac5f30","target":"graph","created_at":"2026-07-05T04:31:58Z","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/2112.07449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an algorithm of time complexity $O(kn^{k+2})$ deciding whether a graph $G$ on $n$ vertices is $k$-copwin. The fastest algorithm thus far had time complexity $O(n^{2k+2})$.","authors_text":"Jan Petr, Julien Portier, Leo Versteegen","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-14T15:07:08Z","title":"A faster algorithm for Cops and Robbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07449","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:21a8000c84226e1b6342e8436d9337146412e72a56cd306fd8f2ee57afebf99d","target":"record","created_at":"2026-07-05T04:31:58Z","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":"e1c8feb4e1c5cbc1025e5a2f6ed099a059df090dd28adef89f30bdefac3f1f83","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-14T15:07:08Z","title_canon_sha256":"313c949689b0286331ac911f725704b994eca46f23aca4e67d3d429e982d5355"},"schema_version":"1.0","source":{"id":"2112.07449","kind":"arxiv","version":2}},"canonical_sha256":"205520c94cb7d04092570b10964210edebe1dbb52ec958ff01fa4399a3ee70e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"205520c94cb7d04092570b10964210edebe1dbb52ec958ff01fa4399a3ee70e0","first_computed_at":"2026-07-05T04:31:58.373147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:58.373147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xQnh96gmjZpUJlvVKpFsWuX5APjGxxl9QvNHZg8uWDN4tLzZAf88P9WsWwYiRbwuHFgrAUFjVmL/zJI/ZpQZBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:58.373706Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.07449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21a8000c84226e1b6342e8436d9337146412e72a56cd306fd8f2ee57afebf99d","sha256:377072c725657f79f5be88da06416834e24788f5ca222969ae6ca47f34ac5f30"],"state_sha256":"b44d1f16ce1543d5ceaa4e382307673595080b1a1bcc785bf2026384d02644f5"}