{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HG4VKPSTNUIPH46DENBG2G7KO7","short_pith_number":"pith:HG4VKPST","schema_version":"1.0","canonical_sha256":"39b9553e536d10f3f3c323426d1bea77ef033beda3df5a41f3b2c6e9b42b1c96","source":{"kind":"arxiv","id":"1405.7508","version":2},"attestation_state":"computed","paper":{"title":"Identifying codes and searching with balls in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Balazs Patkos, Mate Vizer, Mohit Kumbhat, Younjin Kim, Zoltan Lorant Nagy","submitted_at":"2014-05-29T09:40:04Z","abstract_excerpt":"Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form \"does an unknown vertex $v \\in V(G)$ belong to the ball of radius $r$ around $u$?\" with $u \\in V(G)$ and $r\\le R$ that is needed to determine $v$. We consider both the adaptive case when the $j$th query might depend on the answers to the previous queries and the non-adaptive case when all queries must be made at once. We obtain bounds on the minimum number of queries for hypercubes, the Erd\\H os-R\\'enyi random graphs and graphs of bound"},"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":"1405.7508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"25fc8dbfd568ccd6c17929cd90e499ba0dbf2822e3c612ba941b2e62109651ca","abstract_canon_sha256":"123f4e3f62f6a65355215882d35a5d0220fbe379e6632e9adc3e0aee994713f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:42.126298Z","signature_b64":"Tq206D9GChOokU8X7kYF7hLz5RPMAStdn7vxTiBb6IU3WkxS1vs7EeGiAS5Suv4gjZUcFNMbXKbXChM/aAXBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39b9553e536d10f3f3c323426d1bea77ef033beda3df5a41f3b2c6e9b42b1c96","last_reissued_at":"2026-05-18T02:50:42.125828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:42.125828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying codes and searching with balls in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy, Balazs Patkos, Mate Vizer, Mohit Kumbhat, Younjin Kim, Zoltan Lorant Nagy","submitted_at":"2014-05-29T09:40:04Z","abstract_excerpt":"Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form \"does an unknown vertex $v \\in V(G)$ belong to the ball of radius $r$ around $u$?\" with $u \\in V(G)$ and $r\\le R$ that is needed to determine $v$. We consider both the adaptive case when the $j$th query might depend on the answers to the previous queries and the non-adaptive case when all queries must be made at once. We obtain bounds on the minimum number of queries for hypercubes, the Erd\\H os-R\\'enyi random graphs and graphs of bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7508","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":"1405.7508","created_at":"2026-05-18T02:50:42.125906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7508v2","created_at":"2026-05-18T02:50:42.125906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7508","created_at":"2026-05-18T02:50:42.125906+00:00"},{"alias_kind":"pith_short_12","alias_value":"HG4VKPSTNUIP","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HG4VKPSTNUIPH46D","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HG4VKPST","created_at":"2026-05-18T12:28:30.664211+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/HG4VKPSTNUIPH46DENBG2G7KO7","json":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7.json","graph_json":"https://pith.science/api/pith-number/HG4VKPSTNUIPH46DENBG2G7KO7/graph.json","events_json":"https://pith.science/api/pith-number/HG4VKPSTNUIPH46DENBG2G7KO7/events.json","paper":"https://pith.science/paper/HG4VKPST"},"agent_actions":{"view_html":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7","download_json":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7.json","view_paper":"https://pith.science/paper/HG4VKPST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7508&json=true","fetch_graph":"https://pith.science/api/pith-number/HG4VKPSTNUIPH46DENBG2G7KO7/graph.json","fetch_events":"https://pith.science/api/pith-number/HG4VKPSTNUIPH46DENBG2G7KO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/action/storage_attestation","attest_author":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/action/author_attestation","sign_citation":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/action/citation_signature","submit_replication":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/action/replication_record"}},"created_at":"2026-05-18T02:50:42.125906+00:00","updated_at":"2026-05-18T02:50:42.125906+00:00"}