{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JENASIN6HL57SYKR7QJLLB2TSD","short_pith_number":"pith:JENASIN6","schema_version":"1.0","canonical_sha256":"491a0921be3afbf96151fc12b5875390fb7f4d12062abebfd7da1e60e0770ecb","source":{"kind":"arxiv","id":"1001.4457","version":1},"attestation_state":"computed","paper":{"title":"Cop and robber games when the robber can hide and ride","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"J\\'er\\'emie Chalopin, Nicolas Nisse, Victor Chepoi, Yann Vax\\`es","submitted_at":"2010-01-25T15:23:59Z","abstract_excerpt":"In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G. The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the cop-win graphs as graphs admitting a dismantling scheme. In this paper, we characterize in a similar way the class CW(s,s') of cop-win graphs in the game in which the cop and the robber move at different speeds "},"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":"1001.4457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-01-25T15:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"9d8806a059ca70bf797892c3e45cb893a9f5c5d2f6039f4aca70cefb71876907","abstract_canon_sha256":"d633f8b1e96d0752b10594648f78ffa6264d541703f4e2380ca5ac29c44ec24e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:48.316591Z","signature_b64":"RxtkFRoB6bz43SossD8MfPV1OVIETmaLLeRjWFdsorayvUcXk8prJhtZSrX4kUdfJAi+bU7J91OP1grodtrCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"491a0921be3afbf96151fc12b5875390fb7f4d12062abebfd7da1e60e0770ecb","last_reissued_at":"2026-05-18T02:23:48.315914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:48.315914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cop and robber games when the robber can hide and ride","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"J\\'er\\'emie Chalopin, Nicolas Nisse, Victor Chepoi, Yann Vax\\`es","submitted_at":"2010-01-25T15:23:59Z","abstract_excerpt":"In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G. The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the cop-win graphs as graphs admitting a dismantling scheme. In this paper, we characterize in a similar way the class CW(s,s') of cop-win graphs in the game in which the cop and the robber move at different speeds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4457","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":"1001.4457","created_at":"2026-05-18T02:23:48.316009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.4457v1","created_at":"2026-05-18T02:23:48.316009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4457","created_at":"2026-05-18T02:23:48.316009+00:00"},{"alias_kind":"pith_short_12","alias_value":"JENASIN6HL57","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JENASIN6HL57SYKR","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JENASIN6","created_at":"2026-05-18T12:26:09.077623+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/JENASIN6HL57SYKR7QJLLB2TSD","json":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD.json","graph_json":"https://pith.science/api/pith-number/JENASIN6HL57SYKR7QJLLB2TSD/graph.json","events_json":"https://pith.science/api/pith-number/JENASIN6HL57SYKR7QJLLB2TSD/events.json","paper":"https://pith.science/paper/JENASIN6"},"agent_actions":{"view_html":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD","download_json":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD.json","view_paper":"https://pith.science/paper/JENASIN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.4457&json=true","fetch_graph":"https://pith.science/api/pith-number/JENASIN6HL57SYKR7QJLLB2TSD/graph.json","fetch_events":"https://pith.science/api/pith-number/JENASIN6HL57SYKR7QJLLB2TSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD/action/storage_attestation","attest_author":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD/action/author_attestation","sign_citation":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD/action/citation_signature","submit_replication":"https://pith.science/pith/JENASIN6HL57SYKR7QJLLB2TSD/action/replication_record"}},"created_at":"2026-05-18T02:23:48.316009+00:00","updated_at":"2026-05-18T02:23:48.316009+00:00"}