{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U4WEZEWMVGX7W47K2TLSF6CY2P","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":"140c5b1e3cc2ca0feca8b4fe5686e28130b1154d4704924930a82347c1c95e70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-26T20:32:05Z","title_canon_sha256":"7b847bd33e6112fb0cb1321bf107a3246e7ce9ad8838aee0fe2ec9e378b697e6"},"schema_version":"1.0","source":{"id":"1802.09594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09594","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09594v1","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09594","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"U4WEZEWMVGX7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U4WEZEWMVGX7W47K","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U4WEZEWM","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:7589b85e672154513b841371d8c00790dec442804d05b7b2cd21f53db43da4d2","target":"graph","created_at":"2026-05-18T00:22:30Z","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":"When we have two data sets and want to find the nearest neighbour of each point in the first dataset among points in the second one, we need the all nearest neighbour operator. This is an operator in spatial databases that has many application in different fields such as GIS and VLSI circuit design. Existing algorithms for calculating this operator assume that there is no pre computation on these data sets. These algorithms has o(n*m*d) time complexity where n and m are the number of points in two data sets and d is the dimension of data points. With assumption of some pre computation on data ","authors_text":"Ali Karami, Nasrin Mazaheri Soudani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-26T20:32:05Z","title":"All nearest neighbor calculation based on Delaunay graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09594","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:a9ff0a650c5238eed3eca36e7d20c28f63cbb0e2e6813251addc4935743341ab","target":"record","created_at":"2026-05-18T00:22:30Z","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":"140c5b1e3cc2ca0feca8b4fe5686e28130b1154d4704924930a82347c1c95e70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-02-26T20:32:05Z","title_canon_sha256":"7b847bd33e6112fb0cb1321bf107a3246e7ce9ad8838aee0fe2ec9e378b697e6"},"schema_version":"1.0","source":{"id":"1802.09594","kind":"arxiv","version":1}},"canonical_sha256":"a72c4c92cca9affb73ead4d722f858d3f3265ddbcd5b0af39da1c0d1761cf7ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a72c4c92cca9affb73ead4d722f858d3f3265ddbcd5b0af39da1c0d1761cf7ed","first_computed_at":"2026-05-18T00:22:30.669353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:30.669353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ig62KCC4wkP6L2MS6aSzW0Odpit+XOaLCCHA8WO4GrfAjIxxyEbO1VfTU02BruWCbpXBACRtJMz4Arwto3VqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:30.670002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9ff0a650c5238eed3eca36e7d20c28f63cbb0e2e6813251addc4935743341ab","sha256:7589b85e672154513b841371d8c00790dec442804d05b7b2cd21f53db43da4d2"],"state_sha256":"8990dbe594de59c57aef82c336d866b253352db85a90df8b3ef45b21af67fc28"}