{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FTWSVVUAZIIAT6P4GGKNCJ5UEI","short_pith_number":"pith:FTWSVVUA","schema_version":"1.0","canonical_sha256":"2ced2ad680ca1009f9fc3194d127b422042154a75ec0674c7c6b7f4f5e31b9ab","source":{"kind":"arxiv","id":"1402.2969","version":1},"attestation_state":"computed","paper":{"title":"Subgraphs and Colourability of Locatable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard A. B. Johnson, Sebastian Koch","submitted_at":"2014-02-12T20:51:47Z","abstract_excerpt":"We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop wins is called locatable. In her original paper, Seager asked whether there exists a characterisation of the graph property of locatable graphs by either forbidden or forbidden induced subgraphs, both of which we answer in the negative. We then proceed to show that such a characterisation does exist for graphs of diameter at most 2, stating it explicitly, and note that this is not true for higher diameter. Exploring a d"},"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":"1402.2969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T20:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"2af459926d1117c907a07ec93e032ec114081c1637089f0e18a775c5b1fca960","abstract_canon_sha256":"e3134dd4f5b370742f8c40bc5b49a9d098f4a72d8f297e04e67e17a1ea29f737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:16.764996Z","signature_b64":"JLBvJk+uDeZHQ3oHWElSm5Al2Fi0qGKwa88F3748mzprK6Dk2++BvCtGlDlBDoWEHM1EGNn4kxWR53PYZNTVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ced2ad680ca1009f9fc3194d127b422042154a75ec0674c7c6b7f4f5e31b9ab","last_reissued_at":"2026-05-18T02:59:16.764292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:16.764292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraphs and Colourability of Locatable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard A. B. Johnson, Sebastian Koch","submitted_at":"2014-02-12T20:51:47Z","abstract_excerpt":"We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop wins is called locatable. In her original paper, Seager asked whether there exists a characterisation of the graph property of locatable graphs by either forbidden or forbidden induced subgraphs, both of which we answer in the negative. We then proceed to show that such a characterisation does exist for graphs of diameter at most 2, stating it explicitly, and note that this is not true for higher diameter. Exploring a d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2969","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":"1402.2969","created_at":"2026-05-18T02:59:16.764410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2969v1","created_at":"2026-05-18T02:59:16.764410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2969","created_at":"2026-05-18T02:59:16.764410+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTWSVVUAZIIA","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTWSVVUAZIIAT6P4","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTWSVVUA","created_at":"2026-05-18T12:28:28.263976+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/FTWSVVUAZIIAT6P4GGKNCJ5UEI","json":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI.json","graph_json":"https://pith.science/api/pith-number/FTWSVVUAZIIAT6P4GGKNCJ5UEI/graph.json","events_json":"https://pith.science/api/pith-number/FTWSVVUAZIIAT6P4GGKNCJ5UEI/events.json","paper":"https://pith.science/paper/FTWSVVUA"},"agent_actions":{"view_html":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI","download_json":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI.json","view_paper":"https://pith.science/paper/FTWSVVUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2969&json=true","fetch_graph":"https://pith.science/api/pith-number/FTWSVVUAZIIAT6P4GGKNCJ5UEI/graph.json","fetch_events":"https://pith.science/api/pith-number/FTWSVVUAZIIAT6P4GGKNCJ5UEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/action/storage_attestation","attest_author":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/action/author_attestation","sign_citation":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/action/citation_signature","submit_replication":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/action/replication_record"}},"created_at":"2026-05-18T02:59:16.764410+00:00","updated_at":"2026-05-18T02:59:16.764410+00:00"}