{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OUWGNIBOVVZAOALMSBJMR4KFR7","short_pith_number":"pith:OUWGNIBO","schema_version":"1.0","canonical_sha256":"752c66a02ead7207016c9052c8f1458fd3942c3b8939e6daed9156093962011e","source":{"kind":"arxiv","id":"1710.10112","version":1},"attestation_state":"computed","paper":{"title":"Hyperopic Cops and Robbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"A. Bonato, D. Cox, F. Mc Inerney, M.E. Messinger, N.E. Clarke, S. Finbow","submitted_at":"2017-10-27T13:00:49Z","abstract_excerpt":"We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the "},"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":"1710.10112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T13:00:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2d87d4a9561f7240be464a7a8786eadffdd157d4e138324919b0d2cfc0b33b65","abstract_canon_sha256":"8319bda1524793bcd095ab4237810a93cd6bdc75355169d32d716c5e595215fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.739121Z","signature_b64":"s5bnJy1vhRL24B68LF/661OHdZdET14nW9aBjNScL2sNc0jaF3TG8p+owutPs6Aid0kvKiyfAOVV5Iv10y3VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"752c66a02ead7207016c9052c8f1458fd3942c3b8939e6daed9156093962011e","last_reissued_at":"2026-05-18T00:31:54.738728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.738728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperopic Cops and Robbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"A. Bonato, D. Cox, F. Mc Inerney, M.E. Messinger, N.E. Clarke, S. Finbow","submitted_at":"2017-10-27T13:00:49Z","abstract_excerpt":"We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10112","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":"1710.10112","created_at":"2026-05-18T00:31:54.738790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10112v1","created_at":"2026-05-18T00:31:54.738790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10112","created_at":"2026-05-18T00:31:54.738790+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUWGNIBOVVZA","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUWGNIBOVVZAOALM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUWGNIBO","created_at":"2026-05-18T12:31:34.259226+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/OUWGNIBOVVZAOALMSBJMR4KFR7","json":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7.json","graph_json":"https://pith.science/api/pith-number/OUWGNIBOVVZAOALMSBJMR4KFR7/graph.json","events_json":"https://pith.science/api/pith-number/OUWGNIBOVVZAOALMSBJMR4KFR7/events.json","paper":"https://pith.science/paper/OUWGNIBO"},"agent_actions":{"view_html":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7","download_json":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7.json","view_paper":"https://pith.science/paper/OUWGNIBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10112&json=true","fetch_graph":"https://pith.science/api/pith-number/OUWGNIBOVVZAOALMSBJMR4KFR7/graph.json","fetch_events":"https://pith.science/api/pith-number/OUWGNIBOVVZAOALMSBJMR4KFR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7/action/storage_attestation","attest_author":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7/action/author_attestation","sign_citation":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7/action/citation_signature","submit_replication":"https://pith.science/pith/OUWGNIBOVVZAOALMSBJMR4KFR7/action/replication_record"}},"created_at":"2026-05-18T00:31:54.738790+00:00","updated_at":"2026-05-18T00:31:54.738790+00:00"}