{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2YD7PNZENQCNSOBL5Y5XEQWGZR","short_pith_number":"pith:2YD7PNZE","schema_version":"1.0","canonical_sha256":"d607f7b7246c04d9382bee3b7242c6cc49346d0d0703ad8efde76525529bcedd","source":{"kind":"arxiv","id":"2311.01582","version":1},"attestation_state":"computed","paper":{"title":"The $k$-visibility Localization Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, JD Nir, John Marcoux, Trent G. Marbach","submitted_at":"2023-11-02T20:27:16Z","abstract_excerpt":"We study a variant of the Localization game in which the cops have limited visibility, along with the corresponding optimization parameter, the $k$-visibility localization number $\\zeta_k$, where $k$ is a non-negative integer. We give bounds on $k$-visibility localization numbers related to domination, maximum degree, and isoperimetric inequalities. For all $k$, we give a family of trees with unbounded $\\zeta_k$ values. Extending results known for the localization number, we show that for $k\\geq 2$, every tree contains a subdivision with $\\zeta_k = 1$. For many $n$, we give the exact value of "},"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":"2311.01582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-02T20:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"ccd7e438c3d695c86f514ac841aef64ce850f6943b135128c6ce4f08f65d8c68","abstract_canon_sha256":"679d7ab85aeccf3391a8288ee01a64c4f50bf6a195a6e44d2c64c00df18008aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:31.538832Z","signature_b64":"ssTO5ccTgnWb9g2yXQd8FnnPF1k/N/FKDLJcQT53SqLObWLe+q+M4jXYIHi7r+AzwY6pyT3bwIImLX0mLCXNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d607f7b7246c04d9382bee3b7242c6cc49346d0d0703ad8efde76525529bcedd","last_reissued_at":"2026-07-05T07:08:31.538410Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:31.538410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-visibility Localization Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, JD Nir, John Marcoux, Trent G. Marbach","submitted_at":"2023-11-02T20:27:16Z","abstract_excerpt":"We study a variant of the Localization game in which the cops have limited visibility, along with the corresponding optimization parameter, the $k$-visibility localization number $\\zeta_k$, where $k$ is a non-negative integer. We give bounds on $k$-visibility localization numbers related to domination, maximum degree, and isoperimetric inequalities. For all $k$, we give a family of trees with unbounded $\\zeta_k$ values. Extending results known for the localization number, we show that for $k\\geq 2$, every tree contains a subdivision with $\\zeta_k = 1$. For many $n$, we give the exact value of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01582","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.01582/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.01582","created_at":"2026-07-05T07:08:31.538470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01582v1","created_at":"2026-07-05T07:08:31.538470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01582","created_at":"2026-07-05T07:08:31.538470+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YD7PNZENQCN","created_at":"2026-07-05T07:08:31.538470+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YD7PNZENQCNSOBL","created_at":"2026-07-05T07:08:31.538470+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YD7PNZE","created_at":"2026-07-05T07:08:31.538470+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/2YD7PNZENQCNSOBL5Y5XEQWGZR","json":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR.json","graph_json":"https://pith.science/api/pith-number/2YD7PNZENQCNSOBL5Y5XEQWGZR/graph.json","events_json":"https://pith.science/api/pith-number/2YD7PNZENQCNSOBL5Y5XEQWGZR/events.json","paper":"https://pith.science/paper/2YD7PNZE"},"agent_actions":{"view_html":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR","download_json":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR.json","view_paper":"https://pith.science/paper/2YD7PNZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01582&json=true","fetch_graph":"https://pith.science/api/pith-number/2YD7PNZENQCNSOBL5Y5XEQWGZR/graph.json","fetch_events":"https://pith.science/api/pith-number/2YD7PNZENQCNSOBL5Y5XEQWGZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR/action/storage_attestation","attest_author":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR/action/author_attestation","sign_citation":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR/action/citation_signature","submit_replication":"https://pith.science/pith/2YD7PNZENQCNSOBL5Y5XEQWGZR/action/replication_record"}},"created_at":"2026-07-05T07:08:31.538470+00:00","updated_at":"2026-07-05T07:08:31.538470+00:00"}