{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6KAPFXZMDZBJJ4XTSMRRPG726X","short_pith_number":"pith:6KAPFXZM","schema_version":"1.0","canonical_sha256":"f280f2df2c1e4294f2f39323179bfaf5c4f98001e485efd0c55310886f0136a5","source":{"kind":"arxiv","id":"2603.08052","version":2},"attestation_state":"computed","paper":{"title":"Patrolling cop vs omniscient robber","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrej Taranenko, Milo\\v{s} Stojakovi\\'c, Nina Chiarelli, Paul Dorbec","submitted_at":"2026-03-09T07:43:32Z","abstract_excerpt":"We study a variant of the classical Cops and Robbers game with one cop and one robber. The cop follows a fixed walk on the graph, called a patrol, that is chosen before the game begins. The robber is omniscient and knows the entire patrol in advance. A capture occurs when the robber comes within a given distance of the cop, and this distance is referred to as the capture distance.\n  The patrol capture radius, $\\tilde{\\rho}{(G)}$, is the minimum radius of capture required for the cop to always be able to capture the robber on a connected graph $G$, under optimal play. We initiate a systematic s"},"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":"2603.08052","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-03-09T07:43:32Z","cross_cats_sorted":[],"title_canon_sha256":"14ff6e8b4d914e062ed85cf36e41ac3c95efe2269a98bb87c00e2516f83f9fea","abstract_canon_sha256":"4875e9cc2537623179f54379b932eb991aa19e8261f40471258eda56eb85f752"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:01.625460Z","signature_b64":"ybaNRnWefmCPhGt6hq3O+sCWfllwZXxVV9GVaNAWsYdwKQzrhdu6OHTVnPErdeGUVTj32V4/QqJ1KcGEXLPPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f280f2df2c1e4294f2f39323179bfaf5c4f98001e485efd0c55310886f0136a5","last_reissued_at":"2026-06-24T01:15:01.625032Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:01.625032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patrolling cop vs omniscient robber","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrej Taranenko, Milo\\v{s} Stojakovi\\'c, Nina Chiarelli, Paul Dorbec","submitted_at":"2026-03-09T07:43:32Z","abstract_excerpt":"We study a variant of the classical Cops and Robbers game with one cop and one robber. The cop follows a fixed walk on the graph, called a patrol, that is chosen before the game begins. The robber is omniscient and knows the entire patrol in advance. A capture occurs when the robber comes within a given distance of the cop, and this distance is referred to as the capture distance.\n  The patrol capture radius, $\\tilde{\\rho}{(G)}$, is the minimum radius of capture required for the cop to always be able to capture the robber on a connected graph $G$, under optimal play. We initiate a systematic s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.08052","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.08052/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2603.08052","created_at":"2026-06-24T01:15:01.625097+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.08052v2","created_at":"2026-06-24T01:15:01.625097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.08052","created_at":"2026-06-24T01:15:01.625097+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KAPFXZMDZBJ","created_at":"2026-06-24T01:15:01.625097+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KAPFXZMDZBJJ4XT","created_at":"2026-06-24T01:15:01.625097+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KAPFXZM","created_at":"2026-06-24T01:15:01.625097+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/6KAPFXZMDZBJJ4XTSMRRPG726X","json":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X.json","graph_json":"https://pith.science/api/pith-number/6KAPFXZMDZBJJ4XTSMRRPG726X/graph.json","events_json":"https://pith.science/api/pith-number/6KAPFXZMDZBJJ4XTSMRRPG726X/events.json","paper":"https://pith.science/paper/6KAPFXZM"},"agent_actions":{"view_html":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X","download_json":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X.json","view_paper":"https://pith.science/paper/6KAPFXZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.08052&json=true","fetch_graph":"https://pith.science/api/pith-number/6KAPFXZMDZBJJ4XTSMRRPG726X/graph.json","fetch_events":"https://pith.science/api/pith-number/6KAPFXZMDZBJJ4XTSMRRPG726X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X/action/storage_attestation","attest_author":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X/action/author_attestation","sign_citation":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X/action/citation_signature","submit_replication":"https://pith.science/pith/6KAPFXZMDZBJJ4XTSMRRPG726X/action/replication_record"}},"created_at":"2026-06-24T01:15:01.625097+00:00","updated_at":"2026-06-24T01:15:01.625097+00:00"}