{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J7EGTYTGFIYKOKTZSBOIVURSC2","short_pith_number":"pith:J7EGTYTG","schema_version":"1.0","canonical_sha256":"4fc869e2662a30a72a79905c8ad23216acab194897dff2dafadfc45b9fcc2524","source":{"kind":"arxiv","id":"1703.06482","version":2},"attestation_state":"computed","paper":{"title":"Locating a robber with multiple probes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Haslegrave, Richard A. B. Johnson, Sebastian Koch","submitted_at":"2017-03-19T18:06:06Z","abstract_excerpt":"We consider a game in which a cop searches for a moving robber on a connected graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any $n$-vertex graph $G$ there is a winning strategy for the cop on the graph $G^{1/m}$ obtained by replacing each edge of $G$ by a path of length $m$, if $m\\geq n$. The present authors showed that, for all but a few small values of $n$, this bound may be improved to $m\\geq n/2$, which is best possible. In this paper we consider the natural extension in which the cop probe"},"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":"1703.06482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-19T18:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"e95220d8993f4712cd139f510afc8c0848cfe43d193cad0280bc82e9c2b31ad2","abstract_canon_sha256":"196835deb45c2e04d84358223fda163d3b9e2c0e9c543e6506dbfeec13d3fabe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.786540Z","signature_b64":"17S1tgY8OiJTwOzS+ou18gv7ZDZnLQFDOpcRwO9rK5cIQDqemEru9KAprS8T5yz9klOyr6oi8srTaW9STg30Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc869e2662a30a72a79905c8ad23216acab194897dff2dafadfc45b9fcc2524","last_reissued_at":"2026-05-18T00:29:51.785922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.785922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locating a robber with multiple probes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Haslegrave, Richard A. B. Johnson, Sebastian Koch","submitted_at":"2017-03-19T18:06:06Z","abstract_excerpt":"We consider a game in which a cop searches for a moving robber on a connected graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any $n$-vertex graph $G$ there is a winning strategy for the cop on the graph $G^{1/m}$ obtained by replacing each edge of $G$ by a path of length $m$, if $m\\geq n$. The present authors showed that, for all but a few small values of $n$, this bound may be improved to $m\\geq n/2$, which is best possible. In this paper we consider the natural extension in which the cop probe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06482","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":"1703.06482","created_at":"2026-05-18T00:29:51.786014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06482v2","created_at":"2026-05-18T00:29:51.786014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06482","created_at":"2026-05-18T00:29:51.786014+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7EGTYTGFIYK","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7EGTYTGFIYKOKTZ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7EGTYTG","created_at":"2026-05-18T12:31:21.493067+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/J7EGTYTGFIYKOKTZSBOIVURSC2","json":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2.json","graph_json":"https://pith.science/api/pith-number/J7EGTYTGFIYKOKTZSBOIVURSC2/graph.json","events_json":"https://pith.science/api/pith-number/J7EGTYTGFIYKOKTZSBOIVURSC2/events.json","paper":"https://pith.science/paper/J7EGTYTG"},"agent_actions":{"view_html":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2","download_json":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2.json","view_paper":"https://pith.science/paper/J7EGTYTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06482&json=true","fetch_graph":"https://pith.science/api/pith-number/J7EGTYTGFIYKOKTZSBOIVURSC2/graph.json","fetch_events":"https://pith.science/api/pith-number/J7EGTYTGFIYKOKTZSBOIVURSC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2/action/storage_attestation","attest_author":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2/action/author_attestation","sign_citation":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2/action/citation_signature","submit_replication":"https://pith.science/pith/J7EGTYTGFIYKOKTZSBOIVURSC2/action/replication_record"}},"created_at":"2026-05-18T00:29:51.786014+00:00","updated_at":"2026-05-18T00:29:51.786014+00:00"}