{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:532F5QNNED4FJIUFUZTMMQBUO2","short_pith_number":"pith:532F5QNN","schema_version":"1.0","canonical_sha256":"eef45ec1ad20f854a285a666c64034768fad3e250a39ad8129665bb5a180e905","source":{"kind":"arxiv","id":"1709.05904","version":2},"attestation_state":"computed","paper":{"title":"Localization game on geometric and planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bart{\\l}omiej Bosek, Jaros{\\l}aw Grytczuk, Joanna Sok\\'o{\\l}, Ma{\\l}gorzata \\'Sleszy\\'nska-Nowak, Nicolas Nisse, Przemys{\\l}aw Gordinowicz","submitted_at":"2017-09-18T13:03:29Z","abstract_excerpt":"The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph $G$ we want to localize a walking agent by checking his distance to as few vertices as possible. The model we introduce is based on a pursuit graph game that resembles the famous Cops and Robbers game. It can be considered as a game theoretic variant of the \\emph{metric dimension} of a graph. We provide upper bounds on the related graph invariant $\\zeta (G)$, defined as the least number of cops needed to localize the robber on a graph $G$, for several classes of graphs (trees, bipartite grap"},"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":"1709.05904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T13:03:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"31c87f77b34867c5e07d56d5a3b8ab7ea9b6da9e3a28766dbf9e3d0c8c32ce13","abstract_canon_sha256":"650aa06ad1a0929f170560bd66d285d731f95389b40ddbeb9e5776e4802621ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:11.312930Z","signature_b64":"EeaHeePG+8gJTUEx5NgMqEXATF7vzOOze3bDbvsfNHcOzNZRJG6HbD0GT1erk2XVS2tAEurChrmsfrCXRw3tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef45ec1ad20f854a285a666c64034768fad3e250a39ad8129665bb5a180e905","last_reissued_at":"2026-05-17T23:46:11.312278Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:11.312278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Localization game on geometric and planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bart{\\l}omiej Bosek, Jaros{\\l}aw Grytczuk, Joanna Sok\\'o{\\l}, Ma{\\l}gorzata \\'Sleszy\\'nska-Nowak, Nicolas Nisse, Przemys{\\l}aw Gordinowicz","submitted_at":"2017-09-18T13:03:29Z","abstract_excerpt":"The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph $G$ we want to localize a walking agent by checking his distance to as few vertices as possible. The model we introduce is based on a pursuit graph game that resembles the famous Cops and Robbers game. It can be considered as a game theoretic variant of the \\emph{metric dimension} of a graph. We provide upper bounds on the related graph invariant $\\zeta (G)$, defined as the least number of cops needed to localize the robber on a graph $G$, for several classes of graphs (trees, bipartite grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05904","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":"1709.05904","created_at":"2026-05-17T23:46:11.312585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05904v2","created_at":"2026-05-17T23:46:11.312585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05904","created_at":"2026-05-17T23:46:11.312585+00:00"},{"alias_kind":"pith_short_12","alias_value":"532F5QNNED4F","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"532F5QNNED4FJIUF","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"532F5QNN","created_at":"2026-05-18T12:31:00.734936+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/532F5QNNED4FJIUFUZTMMQBUO2","json":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2.json","graph_json":"https://pith.science/api/pith-number/532F5QNNED4FJIUFUZTMMQBUO2/graph.json","events_json":"https://pith.science/api/pith-number/532F5QNNED4FJIUFUZTMMQBUO2/events.json","paper":"https://pith.science/paper/532F5QNN"},"agent_actions":{"view_html":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2","download_json":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2.json","view_paper":"https://pith.science/paper/532F5QNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05904&json=true","fetch_graph":"https://pith.science/api/pith-number/532F5QNNED4FJIUFUZTMMQBUO2/graph.json","fetch_events":"https://pith.science/api/pith-number/532F5QNNED4FJIUFUZTMMQBUO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/action/storage_attestation","attest_author":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/action/author_attestation","sign_citation":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/action/citation_signature","submit_replication":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/action/replication_record"}},"created_at":"2026-05-17T23:46:11.312585+00:00","updated_at":"2026-05-17T23:46:11.312585+00:00"}