{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ADX3YIDSFRZAU3VHEXQZQ6KVT4","short_pith_number":"pith:ADX3YIDS","schema_version":"1.0","canonical_sha256":"00efbc20722c720a6ea725e19879559f008a727b567aed4b112e093ba3cdcd61","source":{"kind":"arxiv","id":"1604.06984","version":3},"attestation_state":"computed","paper":{"title":"PFO: A Parallel Friendly High Performance System for Online Query and Update of Nearest Neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nan Zhu, Wenbo He, Xue Liu, Yu Hua","submitted_at":"2016-04-24T05:08:27Z","abstract_excerpt":"Nearest Neighbor(s) search is the fundamental computational primitive to tackle massive dataset. Locality Sensitive Hashing (LSH) has been a bracing tool for Nearest Neighbor(s) search in high dimensional spaces. However, traditional LSH systems cannot be applied in online big data systems to handle a large volume of query/update requests, because most of the systems optimize the query efficiency with the assumption of infrequent updates and missing the parallel-friendly design. As a result, the state-of-the-art LSH systems cannot adapt the system response to the user behavior interactively.\n "},"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":"1604.06984","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-24T05:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"334948c4e7beb9050f8dcd1c99bb13cb36fbebe906c8ac7c4487721db930e0c9","abstract_canon_sha256":"34a61a4ac2a68a9a0dce3ccaa90525197ea8041db2ec09852b01f924d45ad9b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:12.294680Z","signature_b64":"pIsELdD49rgERIAlZwH+4IpEi/BDAdBuoDE4oe0wT+BQlwl7Omg8BJB95Suva33VslOwVYaO/av8aYt5YumqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00efbc20722c720a6ea725e19879559f008a727b567aed4b112e093ba3cdcd61","last_reissued_at":"2026-05-18T01:14:12.294010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:12.294010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PFO: A Parallel Friendly High Performance System for Online Query and Update of Nearest Neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nan Zhu, Wenbo He, Xue Liu, Yu Hua","submitted_at":"2016-04-24T05:08:27Z","abstract_excerpt":"Nearest Neighbor(s) search is the fundamental computational primitive to tackle massive dataset. Locality Sensitive Hashing (LSH) has been a bracing tool for Nearest Neighbor(s) search in high dimensional spaces. However, traditional LSH systems cannot be applied in online big data systems to handle a large volume of query/update requests, because most of the systems optimize the query efficiency with the assumption of infrequent updates and missing the parallel-friendly design. As a result, the state-of-the-art LSH systems cannot adapt the system response to the user behavior interactively.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06984","kind":"arxiv","version":3},"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":"1604.06984","created_at":"2026-05-18T01:14:12.294116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06984v3","created_at":"2026-05-18T01:14:12.294116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06984","created_at":"2026-05-18T01:14:12.294116+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADX3YIDSFRZA","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADX3YIDSFRZAU3VH","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADX3YIDS","created_at":"2026-05-18T12:30:07.202191+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/ADX3YIDSFRZAU3VHEXQZQ6KVT4","json":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4.json","graph_json":"https://pith.science/api/pith-number/ADX3YIDSFRZAU3VHEXQZQ6KVT4/graph.json","events_json":"https://pith.science/api/pith-number/ADX3YIDSFRZAU3VHEXQZQ6KVT4/events.json","paper":"https://pith.science/paper/ADX3YIDS"},"agent_actions":{"view_html":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4","download_json":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4.json","view_paper":"https://pith.science/paper/ADX3YIDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06984&json=true","fetch_graph":"https://pith.science/api/pith-number/ADX3YIDSFRZAU3VHEXQZQ6KVT4/graph.json","fetch_events":"https://pith.science/api/pith-number/ADX3YIDSFRZAU3VHEXQZQ6KVT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/action/storage_attestation","attest_author":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/action/author_attestation","sign_citation":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/action/citation_signature","submit_replication":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/action/replication_record"}},"created_at":"2026-05-18T01:14:12.294116+00:00","updated_at":"2026-05-18T01:14:12.294116+00:00"}