{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ADX3YIDSFRZAU3VHEXQZQ6KVT4","short_pith_number":"pith:ADX3YIDS","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"},"canonical_sha256":"00efbc20722c720a6ea725e19879559f008a727b567aed4b112e093ba3cdcd61","source":{"kind":"arxiv","id":"1604.06984","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06984","created_at":"2026-05-18T01:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06984v3","created_at":"2026-05-18T01:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06984","created_at":"2026-05-18T01:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"ADX3YIDSFRZA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ADX3YIDSFRZAU3VH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ADX3YIDS","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ADX3YIDSFRZAU3VHEXQZQ6KVT4","target":"record","payload":{"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"},"canonical_sha256":"00efbc20722c720a6ea725e19879559f008a727b567aed4b112e093ba3cdcd61","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"},"source_kind":"arxiv","source_id":"1604.06984","source_version":3,"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-18T01:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+Dna0I3zgaydBHPXBWN1Niu1KAXSOWxoRKX4STYSuJh2DbKh6oalM2BzTDw8wApETcMKp8LQLYnji+r+rm3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:27:46.388408Z"},"content_sha256":"5733e86392a6a235976648150428f6d0b793a29cc7e9000421b3a635e82f9443","schema_version":"1.0","event_id":"sha256:5733e86392a6a235976648150428f6d0b793a29cc7e9000421b3a635e82f9443"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ADX3YIDSFRZAU3VHEXQZQ6KVT4","target":"graph","payload":{"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"},"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-18T01:14:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"me56Vgm4iB4CymgSI6CuNNdNHwc676BO3stJP927TNb/pDCUqD/66GlzZ7P8NVfWP2Gy+NKBrJsn/bekw8paBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:27:46.389208Z"},"content_sha256":"4b4e64a01b17e0b1d61201db39c3c0c644e217bf8af72997c7103bfdffe49e4a","schema_version":"1.0","event_id":"sha256:4b4e64a01b17e0b1d61201db39c3c0c644e217bf8af72997c7103bfdffe49e4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/bundle.json","state_url":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/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-31T00:27:46Z","links":{"resolver":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4","bundle":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/bundle.json","state":"https://pith.science/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADX3YIDSFRZAU3VHEXQZQ6KVT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ADX3YIDSFRZAU3VHEXQZQ6KVT4","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":"34a61a4ac2a68a9a0dce3ccaa90525197ea8041db2ec09852b01f924d45ad9b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-24T05:08:27Z","title_canon_sha256":"334948c4e7beb9050f8dcd1c99bb13cb36fbebe906c8ac7c4487721db930e0c9"},"schema_version":"1.0","source":{"id":"1604.06984","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06984","created_at":"2026-05-18T01:14:12Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06984v3","created_at":"2026-05-18T01:14:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06984","created_at":"2026-05-18T01:14:12Z"},{"alias_kind":"pith_short_12","alias_value":"ADX3YIDSFRZA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ADX3YIDSFRZAU3VH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ADX3YIDS","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:4b4e64a01b17e0b1d61201db39c3c0c644e217bf8af72997c7103bfdffe49e4a","target":"graph","created_at":"2026-05-18T01:14:12Z","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":"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 ","authors_text":"Nan Zhu, Wenbo He, Xue Liu, Yu Hua","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-24T05:08:27Z","title":"PFO: A Parallel Friendly High Performance System for Online Query and Update of Nearest Neighbors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06984","kind":"arxiv","version":3},"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:5733e86392a6a235976648150428f6d0b793a29cc7e9000421b3a635e82f9443","target":"record","created_at":"2026-05-18T01:14:12Z","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":"34a61a4ac2a68a9a0dce3ccaa90525197ea8041db2ec09852b01f924d45ad9b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-24T05:08:27Z","title_canon_sha256":"334948c4e7beb9050f8dcd1c99bb13cb36fbebe906c8ac7c4487721db930e0c9"},"schema_version":"1.0","source":{"id":"1604.06984","kind":"arxiv","version":3}},"canonical_sha256":"00efbc20722c720a6ea725e19879559f008a727b567aed4b112e093ba3cdcd61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00efbc20722c720a6ea725e19879559f008a727b567aed4b112e093ba3cdcd61","first_computed_at":"2026-05-18T01:14:12.294010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:12.294010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIsELdD49rgERIAlZwH+4IpEi/BDAdBuoDE4oe0wT+BQlwl7Omg8BJB95Suva33VslOwVYaO/av8aYt5YumqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:12.294680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06984","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5733e86392a6a235976648150428f6d0b793a29cc7e9000421b3a635e82f9443","sha256:4b4e64a01b17e0b1d61201db39c3c0c644e217bf8af72997c7103bfdffe49e4a"],"state_sha256":"5508c11c3f6e42337e4e0b1ab36883b89d371f453ad1d1b6f8c5984993063e41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkQl8IiguQUYiMuQFCnFeHpyip1RwUwqq92xAnnTR8OEsETMMAo6pnooGrYkPH7c0GPQgMgn/v6EHSYFFImVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:27:46.393564Z","bundle_sha256":"6177dcfe892e9a7a676c47c169c6457f28129172e74c2695fa846ddd99ee0903"}}