{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FTWSVVUAZIIAT6P4GGKNCJ5UEI","short_pith_number":"pith:FTWSVVUA","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"},"canonical_sha256":"2ced2ad680ca1009f9fc3194d127b422042154a75ec0674c7c6b7f4f5e31b9ab","source":{"kind":"arxiv","id":"1402.2969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2969","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2969v1","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2969","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"pith_short_12","alias_value":"FTWSVVUAZIIA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTWSVVUAZIIAT6P4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTWSVVUA","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FTWSVVUAZIIAT6P4GGKNCJ5UEI","target":"record","payload":{"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"},"canonical_sha256":"2ced2ad680ca1009f9fc3194d127b422042154a75ec0674c7c6b7f4f5e31b9ab","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"},"source_kind":"arxiv","source_id":"1402.2969","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:59:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvjO6f4eiZFBxYIY/JnB7NeMH5BJ73Zvq/MCo6EH+ANvCUGO6/5NXJU1gZAWTGoqoCRvX72mRVRdrs5fyTahDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:30:31.713265Z"},"content_sha256":"d232253a4983a9e8e5efe883ff02418acbe3356928213eb2936cca2ad91372eb","schema_version":"1.0","event_id":"sha256:d232253a4983a9e8e5efe883ff02418acbe3356928213eb2936cca2ad91372eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FTWSVVUAZIIAT6P4GGKNCJ5UEI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:59:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeRQCTW4jGDjPlsLOS9QqnUjpS875C8mrCnk8eZmyFASoTHCPZgGDfGbRWu+mbEu2/45EXq7miSJLl8Y7IJDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:30:31.713629Z"},"content_sha256":"10910cb1414c8125c56b073f48f9d823f344d39d08ebc83c848c7ddf18e4dbea","schema_version":"1.0","event_id":"sha256:10910cb1414c8125c56b073f48f9d823f344d39d08ebc83c848c7ddf18e4dbea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/bundle.json","state_url":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T21:30:31Z","links":{"resolver":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI","bundle":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/bundle.json","state":"https://pith.science/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTWSVVUAZIIAT6P4GGKNCJ5UEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FTWSVVUAZIIAT6P4GGKNCJ5UEI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e3134dd4f5b370742f8c40bc5b49a9d098f4a72d8f297e04e67e17a1ea29f737","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T20:51:47Z","title_canon_sha256":"2af459926d1117c907a07ec93e032ec114081c1637089f0e18a775c5b1fca960"},"schema_version":"1.0","source":{"id":"1402.2969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2969","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2969v1","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2969","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"pith_short_12","alias_value":"FTWSVVUAZIIA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTWSVVUAZIIAT6P4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTWSVVUA","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:10910cb1414c8125c56b073f48f9d823f344d39d08ebc83c848c7ddf18e4dbea","target":"graph","created_at":"2026-05-18T02:59:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Richard A. B. Johnson, Sebastian Koch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T20:51:47Z","title":"Subgraphs and Colourability of Locatable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2969","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d232253a4983a9e8e5efe883ff02418acbe3356928213eb2936cca2ad91372eb","target":"record","created_at":"2026-05-18T02:59:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e3134dd4f5b370742f8c40bc5b49a9d098f4a72d8f297e04e67e17a1ea29f737","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T20:51:47Z","title_canon_sha256":"2af459926d1117c907a07ec93e032ec114081c1637089f0e18a775c5b1fca960"},"schema_version":"1.0","source":{"id":"1402.2969","kind":"arxiv","version":1}},"canonical_sha256":"2ced2ad680ca1009f9fc3194d127b422042154a75ec0674c7c6b7f4f5e31b9ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ced2ad680ca1009f9fc3194d127b422042154a75ec0674c7c6b7f4f5e31b9ab","first_computed_at":"2026-05-18T02:59:16.764292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:16.764292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JLBvJk+uDeZHQ3oHWElSm5Al2Fi0qGKwa88F3748mzprK6Dk2++BvCtGlDlBDoWEHM1EGNn4kxWR53PYZNTVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:16.764996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d232253a4983a9e8e5efe883ff02418acbe3356928213eb2936cca2ad91372eb","sha256:10910cb1414c8125c56b073f48f9d823f344d39d08ebc83c848c7ddf18e4dbea"],"state_sha256":"b4d17e185e1a134937e8a65a194d4ea65ff2b66ba447084742f25d09ace93ce4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2SRynm4r7FpzqHLOcchuIuBrL1W7r0aQN068MUbh0Tvb92y9z1m6wnEV5z1XVwvD/xqsYM1ckKJxXCOFoEhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:30:31.715708Z","bundle_sha256":"3db451573b05f6e161786931380d5f74048ba9b200a23655095739ed9c3904c4"}}