{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PYR5GKANRHX2VKCHMWGIZBKEUL","short_pith_number":"pith:PYR5GKAN","canonical_record":{"source":{"id":"1310.3388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-12T15:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"a59153256a6c8b978da0f23ce3cdb98902d7138dfc1e6dba1e23c09c9a87013a","abstract_canon_sha256":"801227ab13b0629bc176057e4accd44a08046ef11250d6ffdc7419dec98dee10"},"schema_version":"1.0"},"canonical_sha256":"7e23d3280d89efaaa847658c8c8544a2e0df5eed1c67c2e7761a35215f1ab053","source":{"kind":"arxiv","id":"1310.3388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3388","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3388v1","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3388","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"PYR5GKANRHX2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PYR5GKANRHX2VKCH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PYR5GKAN","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PYR5GKANRHX2VKCHMWGIZBKEUL","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-12T15:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"a59153256a6c8b978da0f23ce3cdb98902d7138dfc1e6dba1e23c09c9a87013a","abstract_canon_sha256":"801227ab13b0629bc176057e4accd44a08046ef11250d6ffdc7419dec98dee10"},"schema_version":"1.0"},"canonical_sha256":"7e23d3280d89efaaa847658c8c8544a2e0df5eed1c67c2e7761a35215f1ab053","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.886450Z","signature_b64":"8YrddXBMEVF77ajNHfkH/pjZES601nEIijxplSZK03KEriujf429uaJN3SZXH34xUn/4qKUwZ3TgqDTNQ0UJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e23d3280d89efaaa847658c8c8544a2e0df5eed1c67c2e7761a35215f1ab053","last_reissued_at":"2026-05-18T03:10:35.885783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.885783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3388","source_version":1,"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-18T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdQcILAS0g/XDtmU4GlkDc/o/c6UzfZ1PdtvTlmHFfAaOPj/hjM0MWitUzqYapIMmrk5A+nlHgZ7xc7LXyFtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:52:17.432943Z"},"content_sha256":"4af299ab37c2bfb747923fbcb40c1e77481e92b0120601cf49f33b0444de8518","schema_version":"1.0","event_id":"sha256:4af299ab37c2bfb747923fbcb40c1e77481e92b0120601cf49f33b0444de8518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PYR5GKANRHX2VKCHMWGIZBKEUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Micha Sharir, Tal Kaminker","submitted_at":"2013-10-12T15:15:07Z","abstract_excerpt":"Let D be a set of n disks in the plane. We present a data structure of size O(n) that can compute, for any query point q, the largest disk in D that contains q, in O(log n) time. The structure can be constructed in O(n log^3 n) time. The optimal storage and query time of the structure improve several recent solutions by Augustine et al. and by Kaplan and Sharir."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3388","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":""},"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-18T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5YP4xEQUZF3pvnujfB5md3odilmmIYiioSSlp3MN5ck5hh0cJlOsdtvsp8Mwm7Ri1r/41ggb0xyVR4FAQNZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:52:17.433605Z"},"content_sha256":"eca9a957b7f81adaf2e0e56408e5df3d0b9987d9c9e7430867e7c4b8713b66c0","schema_version":"1.0","event_id":"sha256:eca9a957b7f81adaf2e0e56408e5df3d0b9987d9c9e7430867e7c4b8713b66c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYR5GKANRHX2VKCHMWGIZBKEUL/bundle.json","state_url":"https://pith.science/pith/PYR5GKANRHX2VKCHMWGIZBKEUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYR5GKANRHX2VKCHMWGIZBKEUL/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:52:17Z","links":{"resolver":"https://pith.science/pith/PYR5GKANRHX2VKCHMWGIZBKEUL","bundle":"https://pith.science/pith/PYR5GKANRHX2VKCHMWGIZBKEUL/bundle.json","state":"https://pith.science/pith/PYR5GKANRHX2VKCHMWGIZBKEUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYR5GKANRHX2VKCHMWGIZBKEUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PYR5GKANRHX2VKCHMWGIZBKEUL","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":"801227ab13b0629bc176057e4accd44a08046ef11250d6ffdc7419dec98dee10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-12T15:15:07Z","title_canon_sha256":"a59153256a6c8b978da0f23ce3cdb98902d7138dfc1e6dba1e23c09c9a87013a"},"schema_version":"1.0","source":{"id":"1310.3388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3388","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3388v1","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3388","created_at":"2026-05-18T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"PYR5GKANRHX2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PYR5GKANRHX2VKCH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PYR5GKAN","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:eca9a957b7f81adaf2e0e56408e5df3d0b9987d9c9e7430867e7c4b8713b66c0","target":"graph","created_at":"2026-05-18T03:10:35Z","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":"Let D be a set of n disks in the plane. We present a data structure of size O(n) that can compute, for any query point q, the largest disk in D that contains q, in O(log n) time. The structure can be constructed in O(n log^3 n) time. The optimal storage and query time of the structure improve several recent solutions by Augustine et al. and by Kaplan and Sharir.","authors_text":"Micha Sharir, Tal Kaminker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-12T15:15:07Z","title":"Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3388","kind":"arxiv","version":1},"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:4af299ab37c2bfb747923fbcb40c1e77481e92b0120601cf49f33b0444de8518","target":"record","created_at":"2026-05-18T03:10:35Z","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":"801227ab13b0629bc176057e4accd44a08046ef11250d6ffdc7419dec98dee10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-12T15:15:07Z","title_canon_sha256":"a59153256a6c8b978da0f23ce3cdb98902d7138dfc1e6dba1e23c09c9a87013a"},"schema_version":"1.0","source":{"id":"1310.3388","kind":"arxiv","version":1}},"canonical_sha256":"7e23d3280d89efaaa847658c8c8544a2e0df5eed1c67c2e7761a35215f1ab053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e23d3280d89efaaa847658c8c8544a2e0df5eed1c67c2e7761a35215f1ab053","first_computed_at":"2026-05-18T03:10:35.885783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:35.885783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8YrddXBMEVF77ajNHfkH/pjZES601nEIijxplSZK03KEriujf429uaJN3SZXH34xUn/4qKUwZ3TgqDTNQ0UJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:35.886450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af299ab37c2bfb747923fbcb40c1e77481e92b0120601cf49f33b0444de8518","sha256:eca9a957b7f81adaf2e0e56408e5df3d0b9987d9c9e7430867e7c4b8713b66c0"],"state_sha256":"07d1091ad2d9c36b514b6489b34c3a3e62e793806952230c92b050b2071be358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMD6sZa6e1HBR7Mh8u1cFmq03NOFAl+wBhuWvd2D9PHCpZkAotZdsnij5YzwzI0DvUq2pgpNj3TOLgQLoa6/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:52:17.436908Z","bundle_sha256":"2057d60939c672682c89dfd98d77b06e78db5117e5d4289972da4c65492b7fbe"}}