{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CFXAEGSI5WSNNDFU7INMH65WZ7","short_pith_number":"pith:CFXAEGSI","canonical_record":{"source":{"id":"1906.10602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-25T15:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"b538da8821ea14ba26aa74176f37d12a152e045d1cb180a8bdf7d3695218563d","abstract_canon_sha256":"cd7adfd1f95a77287c9db3b3a6225d9ec40c9e58869a44b563ceb7a74bad6dac"},"schema_version":"1.0"},"canonical_sha256":"116e021a48eda4d68cb4fa1ac3fbb6cfcc629308cfd7ae646ae8b2c31fcc660e","source":{"kind":"arxiv","id":"1906.10602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10602","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10602v1","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10602","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"CFXAEGSI5WSN","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CFXAEGSI5WSNNDFU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CFXAEGSI","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CFXAEGSI5WSNNDFU7INMH65WZ7","target":"record","payload":{"canonical_record":{"source":{"id":"1906.10602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-25T15:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"b538da8821ea14ba26aa74176f37d12a152e045d1cb180a8bdf7d3695218563d","abstract_canon_sha256":"cd7adfd1f95a77287c9db3b3a6225d9ec40c9e58869a44b563ceb7a74bad6dac"},"schema_version":"1.0"},"canonical_sha256":"116e021a48eda4d68cb4fa1ac3fbb6cfcc629308cfd7ae646ae8b2c31fcc660e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:15.853579Z","signature_b64":"SSShsyf4tirHDntfvrQPN0z4Aa/DgO7c450kIBb6Rpk36O/b1X9CDEwhsw6ZSjsh7naOpyfx4IJyN6LDOAyaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116e021a48eda4d68cb4fa1ac3fbb6cfcc629308cfd7ae646ae8b2c31fcc660e","last_reissued_at":"2026-05-17T23:42:15.852934Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:15.852934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.10602","source_version":1,"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-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+pk761TEV0Z6Yu0XgTBbPrCxFqMX9gHjDHtjYUGhwcIQ91k+mlzIgIbz8kdjrycMav4/nTZ5WP0IjTbSnqiyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:17:54.728051Z"},"content_sha256":"75024e16236f366e1de28c006f357b01c6f78694348e8dc1165ccf045dd76cff","schema_version":"1.0","event_id":"sha256:75024e16236f366e1de28c006f357b01c6f78694348e8dc1165ccf045dd76cff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CFXAEGSI5WSNNDFU7INMH65WZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pyramid: A General Framework for Distributed Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chenyu Jiang, James Cheng, Kelvin K.W. Ng, Shiyuan Deng, Xiao Yan","submitted_at":"2019-06-25T15:23:52Z","abstract_excerpt":"Similarity search is a core component in various applications such as image matching, product recommendation and low-shot classification. However, single machine solutions are usually insufficient due to the large cardinality of modern datasets and stringent latency requirement of on-line query processing. We present Pyramid, a general and efficient framework for distributed similarity search. Pyramid supports search with popular similarity functions including Euclidean distance, angular distance and inner product. Different from existing distributed solutions that are based on KD-tree or loca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10602","kind":"arxiv","version":1},"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-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9IDypU9DBHaGATqGI4Kkf3A1WUGmwtbr9m96/uGMXLGzDmgXeCZIpHCUh+AKE4yNirID31tlPf7a/KqVn7qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:17:54.728627Z"},"content_sha256":"a6036acdb76cfaf123623ada2e0bcfc434e1dcdf79a9a6b8dea9003f7e638434","schema_version":"1.0","event_id":"sha256:a6036acdb76cfaf123623ada2e0bcfc434e1dcdf79a9a6b8dea9003f7e638434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFXAEGSI5WSNNDFU7INMH65WZ7/bundle.json","state_url":"https://pith.science/pith/CFXAEGSI5WSNNDFU7INMH65WZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFXAEGSI5WSNNDFU7INMH65WZ7/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-26T00:17:54Z","links":{"resolver":"https://pith.science/pith/CFXAEGSI5WSNNDFU7INMH65WZ7","bundle":"https://pith.science/pith/CFXAEGSI5WSNNDFU7INMH65WZ7/bundle.json","state":"https://pith.science/pith/CFXAEGSI5WSNNDFU7INMH65WZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFXAEGSI5WSNNDFU7INMH65WZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CFXAEGSI5WSNNDFU7INMH65WZ7","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":"cd7adfd1f95a77287c9db3b3a6225d9ec40c9e58869a44b563ceb7a74bad6dac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-25T15:23:52Z","title_canon_sha256":"b538da8821ea14ba26aa74176f37d12a152e045d1cb180a8bdf7d3695218563d"},"schema_version":"1.0","source":{"id":"1906.10602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10602","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10602v1","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10602","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"CFXAEGSI5WSN","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CFXAEGSI5WSNNDFU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CFXAEGSI","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:a6036acdb76cfaf123623ada2e0bcfc434e1dcdf79a9a6b8dea9003f7e638434","target":"graph","created_at":"2026-05-17T23:42:15Z","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":"Similarity search is a core component in various applications such as image matching, product recommendation and low-shot classification. However, single machine solutions are usually insufficient due to the large cardinality of modern datasets and stringent latency requirement of on-line query processing. We present Pyramid, a general and efficient framework for distributed similarity search. Pyramid supports search with popular similarity functions including Euclidean distance, angular distance and inner product. Different from existing distributed solutions that are based on KD-tree or loca","authors_text":"Chenyu Jiang, James Cheng, Kelvin K.W. Ng, Shiyuan Deng, Xiao Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-25T15:23:52Z","title":"Pyramid: A General Framework for Distributed Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10602","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:75024e16236f366e1de28c006f357b01c6f78694348e8dc1165ccf045dd76cff","target":"record","created_at":"2026-05-17T23:42:15Z","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":"cd7adfd1f95a77287c9db3b3a6225d9ec40c9e58869a44b563ceb7a74bad6dac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-25T15:23:52Z","title_canon_sha256":"b538da8821ea14ba26aa74176f37d12a152e045d1cb180a8bdf7d3695218563d"},"schema_version":"1.0","source":{"id":"1906.10602","kind":"arxiv","version":1}},"canonical_sha256":"116e021a48eda4d68cb4fa1ac3fbb6cfcc629308cfd7ae646ae8b2c31fcc660e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"116e021a48eda4d68cb4fa1ac3fbb6cfcc629308cfd7ae646ae8b2c31fcc660e","first_computed_at":"2026-05-17T23:42:15.852934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:15.852934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SSShsyf4tirHDntfvrQPN0z4Aa/DgO7c450kIBb6Rpk36O/b1X9CDEwhsw6ZSjsh7naOpyfx4IJyN6LDOAyaCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:15.853579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75024e16236f366e1de28c006f357b01c6f78694348e8dc1165ccf045dd76cff","sha256:a6036acdb76cfaf123623ada2e0bcfc434e1dcdf79a9a6b8dea9003f7e638434"],"state_sha256":"bb12f347043953543f5f10b8cfa838ca048995f8558ab6786042f63807a985cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBLeneGSlnSn3lF3hZ6buZVSu/wAQvsetDOzZoPIgXJLYCcEnodHsAbHX0GwAOmgjk/kcMZ3uDKDk3RSa0byBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:17:54.732089Z","bundle_sha256":"f037965b81e7619460b0ef442fc8ad40a603182d051afeb08f19a597e7e9da76"}}