{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6S2VREIV7GFA2VUZCAWTTL35DJ","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":"b81e2fb3fea3c13917632d8e0c58d116b50821a3ff0704bb36d9a2f4999def32","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-10-31T01:14:46Z","title_canon_sha256":"99011f7fede873edfa51c623c0b0017df0c6c4515eab8de471e2183c678acfed"},"schema_version":"1.0","source":{"id":"1910.14200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.14200","created_at":"2026-07-05T03:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1910.14200v2","created_at":"2026-07-05T03:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.14200","created_at":"2026-07-05T03:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"6S2VREIV7GFA","created_at":"2026-07-05T03:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"6S2VREIV7GFA2VUZ","created_at":"2026-07-05T03:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"6S2VREIV","created_at":"2026-07-05T03:03:24Z"}],"graph_snapshots":[{"event_id":"sha256:900d0f134a7feeb2ff4bca2d7647c26b406a8ed7c90ceb96324a3d135c9e3f52","target":"graph","created_at":"2026-07-05T03:03: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/1910.14200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by occupying each of the robber's neighbouring vertices. We denote by $\\sigma(G)$ the {\\em surrounding cop number} of $G$, namely the least number of cops required to surround a robber in the graph $G$. We present a number of results regarding this parameter, including general bounds as well as exact values for several classes of graphs. Particular classes of inter","authors_text":"Andrea C. Burgess, Caleb W. Jones, David A. Pike, Nancy E. Clarke, Peter Danziger, Rosalind A. Cameron, Stephen Finbow","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-10-31T01:14:46Z","title":"Cops that surround a robber"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.14200","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:851dc93016da80e5c03582cc2e26db320ebdda37cb961f5f90091c91c35bf5be","target":"record","created_at":"2026-07-05T03:03: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":"b81e2fb3fea3c13917632d8e0c58d116b50821a3ff0704bb36d9a2f4999def32","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-10-31T01:14:46Z","title_canon_sha256":"99011f7fede873edfa51c623c0b0017df0c6c4515eab8de471e2183c678acfed"},"schema_version":"1.0","source":{"id":"1910.14200","kind":"arxiv","version":2}},"canonical_sha256":"f4b5589115f98a0d5699102d39af7d1a564403f31264aff9234ae99b31927c35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4b5589115f98a0d5699102d39af7d1a564403f31264aff9234ae99b31927c35","first_computed_at":"2026-07-05T03:03:24.132225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:03:24.132225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lLXpOpCU/lLoObgfh0Fw2A7b9auszQJL7TBkIIdObz6OzwTu3pnHaA+/fGHmuL7E7Hv6nGfZouGkDLpgydoPCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:03:24.132664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.14200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:851dc93016da80e5c03582cc2e26db320ebdda37cb961f5f90091c91c35bf5be","sha256:900d0f134a7feeb2ff4bca2d7647c26b406a8ed7c90ceb96324a3d135c9e3f52"],"state_sha256":"169b6cfdf71739b1d1ce755be79a22d31ab2743ba93a70b4cd8d555444747565"}