{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZI4SFMPTKPEJ6BGBKE2262BBE3","short_pith_number":"pith:ZI4SFMPT","schema_version":"1.0","canonical_sha256":"ca3922b1f353c89f04c15135af682126fabe6233d477c733c21aa4de8d71407c","source":{"kind":"arxiv","id":"1405.3330","version":2},"attestation_state":"computed","paper":{"title":"Containment: A Variation of Cops and Robbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Crytser, John Mackey, Natasha Komarov","submitted_at":"2014-05-13T23:57:33Z","abstract_excerpt":"We consider \"Containment\": a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop), and the cops win by \"containing\" the robber---that is, by occupying all $\\deg(v)$ of the edges incident with a vertex $v$ while the robber is at $v$. We develop bounds that relate the minimal number of cops, $\\xi(G)$, required to contain a robber to the well-known \"cop-number\" $c(G)$ in the original game: in particular, $c(G) {\\le} \\xi(G) {\\le} \\gamma(G) \\Delta(G)$. W"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.3330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-13T23:57:33Z","cross_cats_sorted":[],"title_canon_sha256":"4d06d3bf793353683e38ab1c14141b59bc2609f0df22fc29c2333fc467fc850f","abstract_canon_sha256":"3a88e2da76a4db50ec29e6b8bfba08a43f5e63fd7cc3eddcebe4bec20f620f08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:09.992739Z","signature_b64":"0vU6QH10nrTDPADrfQMvmyHVav4xfKZVMg3sLKWoZqEFlhZ9GMeGHqxnMZAv8kLe0UWxX6sYGMd445FZajqPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3922b1f353c89f04c15135af682126fabe6233d477c733c21aa4de8d71407c","last_reissued_at":"2026-05-17T23:51:09.992229Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:09.992229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Containment: A Variation of Cops and Robbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Crytser, John Mackey, Natasha Komarov","submitted_at":"2014-05-13T23:57:33Z","abstract_excerpt":"We consider \"Containment\": a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop), and the cops win by \"containing\" the robber---that is, by occupying all $\\deg(v)$ of the edges incident with a vertex $v$ while the robber is at $v$. We develop bounds that relate the minimal number of cops, $\\xi(G)$, required to contain a robber to the well-known \"cop-number\" $c(G)$ in the original game: in particular, $c(G) {\\le} \\xi(G) {\\le} \\gamma(G) \\Delta(G)$. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3330","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.3330","created_at":"2026-05-17T23:51:09.992300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3330v2","created_at":"2026-05-17T23:51:09.992300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3330","created_at":"2026-05-17T23:51:09.992300+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZI4SFMPTKPEJ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZI4SFMPTKPEJ6BGB","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZI4SFMPT","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3","json":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3.json","graph_json":"https://pith.science/api/pith-number/ZI4SFMPTKPEJ6BGBKE2262BBE3/graph.json","events_json":"https://pith.science/api/pith-number/ZI4SFMPTKPEJ6BGBKE2262BBE3/events.json","paper":"https://pith.science/paper/ZI4SFMPT"},"agent_actions":{"view_html":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3","download_json":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3.json","view_paper":"https://pith.science/paper/ZI4SFMPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3330&json=true","fetch_graph":"https://pith.science/api/pith-number/ZI4SFMPTKPEJ6BGBKE2262BBE3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZI4SFMPTKPEJ6BGBKE2262BBE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3/action/storage_attestation","attest_author":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3/action/author_attestation","sign_citation":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3/action/citation_signature","submit_replication":"https://pith.science/pith/ZI4SFMPTKPEJ6BGBKE2262BBE3/action/replication_record"}},"created_at":"2026-05-17T23:51:09.992300+00:00","updated_at":"2026-05-17T23:51:09.992300+00:00"}