{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KVW5EXRNLH5M4HMHU5TNMSYVXX","short_pith_number":"pith:KVW5EXRN","schema_version":"1.0","canonical_sha256":"556dd25e2d59face1d87a766d64b15bdf6152f91f834447d0c951beca8287078","source":{"kind":"arxiv","id":"1812.09955","version":1},"attestation_state":"computed","paper":{"title":"Cops, robbers, and burning bridges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eric Peterson, William B. Kinnersley","submitted_at":"2018-12-24T16:57:59Z","abstract_excerpt":"We consider a variant of Cops and Robbers wherein each edge traversed by the robber is deleted from the graph. The focus is on determining the minimum number of cops needed to capture a robber on a graph $G$, called the {\\em bridge-burning cop number} of $G$ and denoted $c_b(G)$. We determine $c_b(G)$ exactly for several elementary classes of graphs and give a polynomial-time algorithm to compute $c_b(T)$ when $T$ is a tree. We also study two-dimensional square grids and tori, as well as hypercubes, and we give bounds on the capture time of a graph (the minimum number of rounds needed for a si"},"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":"1812.09955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-24T16:57:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"54c6288db31213b7779edb3f6a5e71c75e8a3a2698845efb81b32ff296553cee","abstract_canon_sha256":"9f53f3860b1f84322b17dcc80b0e6062cddc19c8b6fce975de9ee444f8e3eaeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.268379Z","signature_b64":"1cl8M4pr0pSV8zCgbtcVuPAB8U5Xfbbbn67VbcjPiC//j6HIGUrRJ+8F9yhlXQvSVXlwWlXVxFB58F7yNivAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556dd25e2d59face1d87a766d64b15bdf6152f91f834447d0c951beca8287078","last_reissued_at":"2026-05-17T23:57:26.267868Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.267868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cops, robbers, and burning bridges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eric Peterson, William B. Kinnersley","submitted_at":"2018-12-24T16:57:59Z","abstract_excerpt":"We consider a variant of Cops and Robbers wherein each edge traversed by the robber is deleted from the graph. The focus is on determining the minimum number of cops needed to capture a robber on a graph $G$, called the {\\em bridge-burning cop number} of $G$ and denoted $c_b(G)$. We determine $c_b(G)$ exactly for several elementary classes of graphs and give a polynomial-time algorithm to compute $c_b(T)$ when $T$ is a tree. We also study two-dimensional square grids and tori, as well as hypercubes, and we give bounds on the capture time of a graph (the minimum number of rounds needed for a si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09955","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.09955","created_at":"2026-05-17T23:57:26.267951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09955v1","created_at":"2026-05-17T23:57:26.267951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09955","created_at":"2026-05-17T23:57:26.267951+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVW5EXRNLH5M","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVW5EXRNLH5M4HMH","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVW5EXRN","created_at":"2026-05-18T12:32:33.847187+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/KVW5EXRNLH5M4HMHU5TNMSYVXX","json":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX.json","graph_json":"https://pith.science/api/pith-number/KVW5EXRNLH5M4HMHU5TNMSYVXX/graph.json","events_json":"https://pith.science/api/pith-number/KVW5EXRNLH5M4HMHU5TNMSYVXX/events.json","paper":"https://pith.science/paper/KVW5EXRN"},"agent_actions":{"view_html":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX","download_json":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX.json","view_paper":"https://pith.science/paper/KVW5EXRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09955&json=true","fetch_graph":"https://pith.science/api/pith-number/KVW5EXRNLH5M4HMHU5TNMSYVXX/graph.json","fetch_events":"https://pith.science/api/pith-number/KVW5EXRNLH5M4HMHU5TNMSYVXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX/action/storage_attestation","attest_author":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX/action/author_attestation","sign_citation":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX/action/citation_signature","submit_replication":"https://pith.science/pith/KVW5EXRNLH5M4HMHU5TNMSYVXX/action/replication_record"}},"created_at":"2026-05-17T23:57:26.267951+00:00","updated_at":"2026-05-17T23:57:26.267951+00:00"}