{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:532F5QNNED4FJIUFUZTMMQBUO2","short_pith_number":"pith:532F5QNN","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"},"canonical_sha256":"eef45ec1ad20f854a285a666c64034768fad3e250a39ad8129665bb5a180e905","source":{"kind":"arxiv","id":"1709.05904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05904","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05904v2","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05904","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"532F5QNNED4F","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"532F5QNNED4FJIUF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"532F5QNN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:532F5QNNED4FJIUFUZTMMQBUO2","target":"record","payload":{"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"},"canonical_sha256":"eef45ec1ad20f854a285a666c64034768fad3e250a39ad8129665bb5a180e905","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"},"source_kind":"arxiv","source_id":"1709.05904","source_version":2,"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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxotU8hIaNwei0yKHZhxmz1RNDbgGL8Nnc+jP1Vl6t+jrMhHcz5X68RKGWMKZGmuSBej4pRLWdUycwXE/Kr0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:21:30.215905Z"},"content_sha256":"230622f14971c2631c621a8b9bc94f6f2cc8cdc1d76109f6c7d80441a1d005fc","schema_version":"1.0","event_id":"sha256:230622f14971c2631c621a8b9bc94f6f2cc8cdc1d76109f6c7d80441a1d005fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:532F5QNNED4FJIUFUZTMMQBUO2","target":"graph","payload":{"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"},"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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gARTeAIx+0rR5KdWPnjy/k2rsj3w4h75vqq7XRwkPmk6hYaUV+a5X/bAvfgUhYjTaZkAmNOeNblBSKbkznQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:21:30.216509Z"},"content_sha256":"c01ae2cbbb5bad25d992bb357dcf46eb432dcef021a28592213469452460d5bd","schema_version":"1.0","event_id":"sha256:c01ae2cbbb5bad25d992bb357dcf46eb432dcef021a28592213469452460d5bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/bundle.json","state_url":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/532F5QNNED4FJIUFUZTMMQBUO2/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-05-26T10:21:30Z","links":{"resolver":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2","bundle":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/bundle.json","state":"https://pith.science/pith/532F5QNNED4FJIUFUZTMMQBUO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/532F5QNNED4FJIUFUZTMMQBUO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:532F5QNNED4FJIUFUZTMMQBUO2","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":"650aa06ad1a0929f170560bd66d285d731f95389b40ddbeb9e5776e4802621ef","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T13:03:29Z","title_canon_sha256":"31c87f77b34867c5e07d56d5a3b8ab7ea9b6da9e3a28766dbf9e3d0c8c32ce13"},"schema_version":"1.0","source":{"id":"1709.05904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05904","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05904v2","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05904","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"532F5QNNED4F","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"532F5QNNED4FJIUF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"532F5QNN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:c01ae2cbbb5bad25d992bb357dcf46eb432dcef021a28592213469452460d5bd","target":"graph","created_at":"2026-05-17T23:46:11Z","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":"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","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","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T13:03:29Z","title":"Localization game on geometric and planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05904","kind":"arxiv","version":2},"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:230622f14971c2631c621a8b9bc94f6f2cc8cdc1d76109f6c7d80441a1d005fc","target":"record","created_at":"2026-05-17T23:46:11Z","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":"650aa06ad1a0929f170560bd66d285d731f95389b40ddbeb9e5776e4802621ef","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T13:03:29Z","title_canon_sha256":"31c87f77b34867c5e07d56d5a3b8ab7ea9b6da9e3a28766dbf9e3d0c8c32ce13"},"schema_version":"1.0","source":{"id":"1709.05904","kind":"arxiv","version":2}},"canonical_sha256":"eef45ec1ad20f854a285a666c64034768fad3e250a39ad8129665bb5a180e905","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eef45ec1ad20f854a285a666c64034768fad3e250a39ad8129665bb5a180e905","first_computed_at":"2026-05-17T23:46:11.312278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:11.312278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EeaHeePG+8gJTUEx5NgMqEXATF7vzOOze3bDbvsfNHcOzNZRJG6HbD0GT1erk2XVS2tAEurChrmsfrCXRw3tDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:11.312930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:230622f14971c2631c621a8b9bc94f6f2cc8cdc1d76109f6c7d80441a1d005fc","sha256:c01ae2cbbb5bad25d992bb357dcf46eb432dcef021a28592213469452460d5bd"],"state_sha256":"824ffdb2ea2df12f59d2c71cd5491978ac8888ecdc3e35b921dc4b7f77190416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mS9EnIePk2tZlMsHlzKYbFk0uIdm0Le+20pjjoe5zgBEP7b8GrOhDypzxM1lcmUnOwBGA1hOgHxzXAaA+ctHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:21:30.220172Z","bundle_sha256":"b7c7a49c7c4e23588bcf8d2dc3e46c45844a1e668701e5985a1b726fbed360f8"}}