{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YIDYAZJLE7E6UNZAVVRNJWUA2M","short_pith_number":"pith:YIDYAZJL","canonical_record":{"source":{"id":"1311.2032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-08T18:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"a5ad982e375cdb2d588153153fb2e4bf39ad1682ed36ab55ff49086c0035eeb1","abstract_canon_sha256":"4a4e762a75516fe6d93b489354f73c23e2bb4bf334c72f6d4b8a776ba725073d"},"schema_version":"1.0"},"canonical_sha256":"c20780652b27c9ea3720ad62d4da80d3088576fc2102b2ad300319ade539e159","source":{"kind":"arxiv","id":"1311.2032","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2032","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2032v2","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2032","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"YIDYAZJLE7E6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YIDYAZJLE7E6UNZA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YIDYAZJL","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YIDYAZJLE7E6UNZAVVRNJWUA2M","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-08T18:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"a5ad982e375cdb2d588153153fb2e4bf39ad1682ed36ab55ff49086c0035eeb1","abstract_canon_sha256":"4a4e762a75516fe6d93b489354f73c23e2bb4bf334c72f6d4b8a776ba725073d"},"schema_version":"1.0"},"canonical_sha256":"c20780652b27c9ea3720ad62d4da80d3088576fc2102b2ad300319ade539e159","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:20.393876Z","signature_b64":"KvXXDIJy//PHNNnKXx0Se1HqTYlrgyZQrJ/9S8SMFLY3rMMD6i4Jzow3+NEQkcRNH0aLFPVTbyLCYs2cSFh3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c20780652b27c9ea3720ad62d4da80d3088576fc2102b2ad300319ade539e159","last_reissued_at":"2026-05-18T03:03:20.393350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:20.393350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2032","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-18T03:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+fA90ophIjnHxmRvk5gT1age/osz2GgU0vEwbE5dwhlIZW69hMNvssXA+hdRFXmZSAsE3TI5YEo67//qMMrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:01:45.876281Z"},"content_sha256":"b312964e25474436d779509664b52bb46bf067358c0b4b01e790d2c8b78fe24a","schema_version":"1.0","event_id":"sha256:b312964e25474436d779509664b52bb46bf067358c0b4b01e790d2c8b78fe24a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YIDYAZJLE7E6UNZAVVRNJWUA2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple, Faster Method for Kinetic Proximity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Zarei, Mohammad Ali Abam, Sue Whitesides, Valerie King, Zahed Rahmati","submitted_at":"2013-11-08T18:00:40Z","abstract_excerpt":"For a set of $n$ points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS's for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Yao graph.\n  We use sparse graph representations, the Pie Delaunay graph and the Equilateral Delaunay graph, to provide new solutions for the proximity problems. Then we design KDS's that efficiently mai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2032","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-18T03:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrNqohq3jt9HCBiDurhmqjQPyUplGKQAmYAii7Oja//Sc5dibGS1Z7Wq7pIwQY+juooZsv7Uv0y117SbXxxkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:01:45.876904Z"},"content_sha256":"49f38404009874a0e7eac2128213b3db41457a3405f8b11c5afd9e4695370306","schema_version":"1.0","event_id":"sha256:49f38404009874a0e7eac2128213b3db41457a3405f8b11c5afd9e4695370306"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M/bundle.json","state_url":"https://pith.science/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M/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-06-07T11:01:45Z","links":{"resolver":"https://pith.science/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M","bundle":"https://pith.science/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M/bundle.json","state":"https://pith.science/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIDYAZJLE7E6UNZAVVRNJWUA2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YIDYAZJLE7E6UNZAVVRNJWUA2M","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":"4a4e762a75516fe6d93b489354f73c23e2bb4bf334c72f6d4b8a776ba725073d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-08T18:00:40Z","title_canon_sha256":"a5ad982e375cdb2d588153153fb2e4bf39ad1682ed36ab55ff49086c0035eeb1"},"schema_version":"1.0","source":{"id":"1311.2032","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2032","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2032v2","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2032","created_at":"2026-05-18T03:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"YIDYAZJLE7E6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YIDYAZJLE7E6UNZA","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YIDYAZJL","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:49f38404009874a0e7eac2128213b3db41457a3405f8b11c5afd9e4695370306","target":"graph","created_at":"2026-05-18T03:03:20Z","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":"For a set of $n$ points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS's for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Yao graph.\n  We use sparse graph representations, the Pie Delaunay graph and the Equilateral Delaunay graph, to provide new solutions for the proximity problems. Then we design KDS's that efficiently mai","authors_text":"Alireza Zarei, Mohammad Ali Abam, Sue Whitesides, Valerie King, Zahed Rahmati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-08T18:00:40Z","title":"A Simple, Faster Method for Kinetic Proximity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2032","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:b312964e25474436d779509664b52bb46bf067358c0b4b01e790d2c8b78fe24a","target":"record","created_at":"2026-05-18T03:03:20Z","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":"4a4e762a75516fe6d93b489354f73c23e2bb4bf334c72f6d4b8a776ba725073d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-08T18:00:40Z","title_canon_sha256":"a5ad982e375cdb2d588153153fb2e4bf39ad1682ed36ab55ff49086c0035eeb1"},"schema_version":"1.0","source":{"id":"1311.2032","kind":"arxiv","version":2}},"canonical_sha256":"c20780652b27c9ea3720ad62d4da80d3088576fc2102b2ad300319ade539e159","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c20780652b27c9ea3720ad62d4da80d3088576fc2102b2ad300319ade539e159","first_computed_at":"2026-05-18T03:03:20.393350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:20.393350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvXXDIJy//PHNNnKXx0Se1HqTYlrgyZQrJ/9S8SMFLY3rMMD6i4Jzow3+NEQkcRNH0aLFPVTbyLCYs2cSFh3AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:20.393876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2032","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b312964e25474436d779509664b52bb46bf067358c0b4b01e790d2c8b78fe24a","sha256:49f38404009874a0e7eac2128213b3db41457a3405f8b11c5afd9e4695370306"],"state_sha256":"f4aabc03dc80c982cef7c9d914cd7d74c75cbf4894161aea6ad9a55acada143b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsSmSEd344NFApHUr30Ao8TKdASzuDTKMoidXdXDi92PR+ZJJ4ZSnUgVP+tBTNsIHLwIGgdPe6ktcr8SDcdrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:01:45.879695Z","bundle_sha256":"c3b23ab37f04ab98f32933eb5bb9ed668e83db561f1ecb526bb8e4b8cb0d3a22"}}