{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HG4VKPSTNUIPH46DENBG2G7KO7","short_pith_number":"pith:HG4VKPST","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"},"canonical_sha256":"39b9553e536d10f3f3c323426d1bea77ef033beda3df5a41f3b2c6e9b42b1c96","source":{"kind":"arxiv","id":"1405.7508","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7508","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7508v2","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7508","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"HG4VKPSTNUIP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HG4VKPSTNUIPH46D","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HG4VKPST","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HG4VKPSTNUIPH46DENBG2G7KO7","target":"record","payload":{"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"},"canonical_sha256":"39b9553e536d10f3f3c323426d1bea77ef033beda3df5a41f3b2c6e9b42b1c96","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"},"source_kind":"arxiv","source_id":"1405.7508","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-18T02:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buVANeHY+4302Z8+cf7wqmDn8myadYoY7ScRxdenjiAXX8HPRE999QnCKMXP4EAh9s045fz+6EyF/Ym8ppSbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:14:18.715104Z"},"content_sha256":"a914deb4096b4499722a3cb1ee245e269c34c7d79d79a8c8268345d3ad1c5102","schema_version":"1.0","event_id":"sha256:a914deb4096b4499722a3cb1ee245e269c34c7d79d79a8c8268345d3ad1c5102"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HG4VKPSTNUIPH46DENBG2G7KO7","target":"graph","payload":{"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"},"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-18T02:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZhlVK2BdI4fLhB1q3JpLsYMxVI2sg81qf77atjwYQqo5RxqtSAp0/Jakzlm3Qh+OuxdtgJYt/99jr6xnD5LDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:14:18.715493Z"},"content_sha256":"9f8a3a59afe102a71c9ad11c94a2fa1e8e06d63287cfa2acacea9065f3449ab6","schema_version":"1.0","event_id":"sha256:9f8a3a59afe102a71c9ad11c94a2fa1e8e06d63287cfa2acacea9065f3449ab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/bundle.json","state_url":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HG4VKPSTNUIPH46DENBG2G7KO7/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-27T22:14:18Z","links":{"resolver":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7","bundle":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/bundle.json","state":"https://pith.science/pith/HG4VKPSTNUIPH46DENBG2G7KO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HG4VKPSTNUIPH46DENBG2G7KO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HG4VKPSTNUIPH46DENBG2G7KO7","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":"123f4e3f62f6a65355215882d35a5d0220fbe379e6632e9adc3e0aee994713f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:40:04Z","title_canon_sha256":"25fc8dbfd568ccd6c17929cd90e499ba0dbf2822e3c612ba941b2e62109651ca"},"schema_version":"1.0","source":{"id":"1405.7508","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7508","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7508v2","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7508","created_at":"2026-05-18T02:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"HG4VKPSTNUIP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HG4VKPSTNUIPH46D","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HG4VKPST","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:9f8a3a59afe102a71c9ad11c94a2fa1e8e06d63287cfa2acacea9065f3449ab6","target":"graph","created_at":"2026-05-18T02:50:42Z","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":"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","authors_text":"Alexey Pokrovskiy, Balazs Patkos, Mate Vizer, Mohit Kumbhat, Younjin Kim, Zoltan Lorant Nagy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:40:04Z","title":"Identifying codes and searching with balls in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7508","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:a914deb4096b4499722a3cb1ee245e269c34c7d79d79a8c8268345d3ad1c5102","target":"record","created_at":"2026-05-18T02:50:42Z","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":"123f4e3f62f6a65355215882d35a5d0220fbe379e6632e9adc3e0aee994713f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-29T09:40:04Z","title_canon_sha256":"25fc8dbfd568ccd6c17929cd90e499ba0dbf2822e3c612ba941b2e62109651ca"},"schema_version":"1.0","source":{"id":"1405.7508","kind":"arxiv","version":2}},"canonical_sha256":"39b9553e536d10f3f3c323426d1bea77ef033beda3df5a41f3b2c6e9b42b1c96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39b9553e536d10f3f3c323426d1bea77ef033beda3df5a41f3b2c6e9b42b1c96","first_computed_at":"2026-05-18T02:50:42.125828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:42.125828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tq206D9GChOokU8X7kYF7hLz5RPMAStdn7vxTiBb6IU3WkxS1vs7EeGiAS5Suv4gjZUcFNMbXKbXChM/aAXBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:42.126298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7508","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a914deb4096b4499722a3cb1ee245e269c34c7d79d79a8c8268345d3ad1c5102","sha256:9f8a3a59afe102a71c9ad11c94a2fa1e8e06d63287cfa2acacea9065f3449ab6"],"state_sha256":"b42ef1211d7d3dfd218568c612eaeef7baa5671ae96fc373bbab45dce067ccaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTuvNLpNYxOihzP+XVa8jGP08YVxy75t4LODrnCHDmMRmMnYhxv/qos6uf20U4HszcL9v1JzZVFda7FveiX/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:14:18.718508Z","bundle_sha256":"3028175199752f23aa1f95fc2b6aec554d8131420920b3071b5a52893ea91050"}}