{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:P2PEQNAH4WSBVIGB4C2WZJGUUI","short_pith_number":"pith:P2PEQNAH","schema_version":"1.0","canonical_sha256":"7e9e483407e5a41aa0c1e0b56ca4d4a22f3a86768e6929e05e6ffb32f2e39332","source":{"kind":"arxiv","id":"1307.2700","version":4},"attestation_state":"computed","paper":{"title":"Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mohammad Ali Abam, Sue Whitesides, Valerie King, Zahed Rahmati","submitted_at":"2013-07-10T07:13:38Z","abstract_excerpt":"This paper presents a simple kinetic data structure for maintaining all the nearest neighbors of a set of $n$ moving points in $\\mathbb{R}^d$, where the trajectory of each point is an algebraic function of at most constant degree $s$. The approach is based on maintaining the edges of the Semi-Yao graph, a sparse graph whose edge set includes the pairs of nearest neighbors as a subset.\n  Our kinetic data structure (KDS) for maintaining all the nearest neighbors is deterministic. It processes $O(n^2\\beta_{2s+2}^2(n)\\log n)$ events with a total cost of $O(n^2\\beta_{2s+2}(n)\\log^{d+1} n)$. Here, $"},"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":"1307.2700","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-07-10T07:13:38Z","cross_cats_sorted":[],"title_canon_sha256":"50bfd086808d230299cc168433bd3f344d47e644ddbd66ded6a5112c1bcc96c7","abstract_canon_sha256":"9fe8237c5662e88a2dc225f465240171605ddf21bb0bbe1884f0d392306e126a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:03.669441Z","signature_b64":"OP43SIsf9933spHUKsI9G9J5CjFIKD1uB6O5uDSnMBptEms7+atJLL6hfPVvSXDVoj6pRX+ZMmDEzAU7ZvxACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e9e483407e5a41aa0c1e0b56ca4d4a22f3a86768e6929e05e6ffb32f2e39332","last_reissued_at":"2026-05-18T03:07:03.669005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:03.669005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mohammad Ali Abam, Sue Whitesides, Valerie King, Zahed Rahmati","submitted_at":"2013-07-10T07:13:38Z","abstract_excerpt":"This paper presents a simple kinetic data structure for maintaining all the nearest neighbors of a set of $n$ moving points in $\\mathbb{R}^d$, where the trajectory of each point is an algebraic function of at most constant degree $s$. The approach is based on maintaining the edges of the Semi-Yao graph, a sparse graph whose edge set includes the pairs of nearest neighbors as a subset.\n  Our kinetic data structure (KDS) for maintaining all the nearest neighbors is deterministic. It processes $O(n^2\\beta_{2s+2}^2(n)\\log n)$ events with a total cost of $O(n^2\\beta_{2s+2}(n)\\log^{d+1} n)$. Here, $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2700","kind":"arxiv","version":4},"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":"1307.2700","created_at":"2026-05-18T03:07:03.669071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2700v4","created_at":"2026-05-18T03:07:03.669071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2700","created_at":"2026-05-18T03:07:03.669071+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2PEQNAH4WSB","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2PEQNAH4WSBVIGB","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2PEQNAH","created_at":"2026-05-18T12:27:54.935989+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/P2PEQNAH4WSBVIGB4C2WZJGUUI","json":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI.json","graph_json":"https://pith.science/api/pith-number/P2PEQNAH4WSBVIGB4C2WZJGUUI/graph.json","events_json":"https://pith.science/api/pith-number/P2PEQNAH4WSBVIGB4C2WZJGUUI/events.json","paper":"https://pith.science/paper/P2PEQNAH"},"agent_actions":{"view_html":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI","download_json":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI.json","view_paper":"https://pith.science/paper/P2PEQNAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2700&json=true","fetch_graph":"https://pith.science/api/pith-number/P2PEQNAH4WSBVIGB4C2WZJGUUI/graph.json","fetch_events":"https://pith.science/api/pith-number/P2PEQNAH4WSBVIGB4C2WZJGUUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI/action/storage_attestation","attest_author":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI/action/author_attestation","sign_citation":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI/action/citation_signature","submit_replication":"https://pith.science/pith/P2PEQNAH4WSBVIGB4C2WZJGUUI/action/replication_record"}},"created_at":"2026-05-18T03:07:03.669071+00:00","updated_at":"2026-05-18T03:07:03.669071+00:00"}