{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TUYIO2ICAIWKJ2UWI57VS4IKKF","short_pith_number":"pith:TUYIO2IC","canonical_record":{"source":{"id":"1606.03742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-12T17:08:43Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"3c6c99c1de6f7d1e184751899ac860d2936b18af606778cebb3258ed60d6720f","abstract_canon_sha256":"f199ec2cc576ea93b5f1a14b376e4c5d7118220a6c10aa57ff37fd269755bad9"},"schema_version":"1.0"},"canonical_sha256":"9d30876902022ca4ea96477f59710a5156575ad4cbbf7b13dface55278768863","source":{"kind":"arxiv","id":"1606.03742","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03742","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03742v2","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03742","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"TUYIO2ICAIWK","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUYIO2ICAIWKJ2UW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUYIO2IC","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TUYIO2ICAIWKJ2UWI57VS4IKKF","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-12T17:08:43Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"3c6c99c1de6f7d1e184751899ac860d2936b18af606778cebb3258ed60d6720f","abstract_canon_sha256":"f199ec2cc576ea93b5f1a14b376e4c5d7118220a6c10aa57ff37fd269755bad9"},"schema_version":"1.0"},"canonical_sha256":"9d30876902022ca4ea96477f59710a5156575ad4cbbf7b13dface55278768863","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:41.326530Z","signature_b64":"6xZpcFuDTsIfSl/xHAazdFF/YPvgv9LPKL4QwI0ZwV3Ph0ISqMGjnXFfAFuoLjMrBewXAnxpXsKQY8YxlzbNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d30876902022ca4ea96477f59710a5156575ad4cbbf7b13dface55278768863","last_reissued_at":"2026-05-18T00:40:41.325827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:41.325827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03742","source_version":2,"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-18T00:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40lEbY4wE8Weym0rHQK+CxYHeI+4KOB9/Sc2MhnwkeEA7lk0Ngu8pfbICdcswGH8IiJ+pkQtD4DYtvQ9UVrVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:17:37.329356Z"},"content_sha256":"a8211f5a84a170b81555a5cfbd3296f0b115a38e53d6e8946de2c63f7860c9d2","schema_version":"1.0","event_id":"sha256:a8211f5a84a170b81555a5cfbd3296f0b115a38e53d6e8946de2c63f7860c9d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TUYIO2ICAIWKJ2UWI57VS4IKKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Application-Driven Near-Data Processing for Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Amrita Mazumdar, Armin Alaghi, Carlo C. Del Mundo, Luis Ceze, Mark Oskin, Vincent T. Lee","submitted_at":"2016-06-12T17:08:43Z","abstract_excerpt":"Similarity search is a key to a variety of applications including content-based search for images and video, recommendation systems, data deduplication, natural language processing, computer vision, databases, computational biology, and computer graphics. At its core, similarity search manifests as k-nearest neighbors (kNN), a computationally simple primitive consisting of highly parallel distance calculations and a global top-k sort. However, kNN is poorly supported by today's architectures because of its high memory bandwidth requirements.\n  This paper proposes an application-driven near-dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03742","kind":"arxiv","version":2},"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-18T00:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0m4Rk8ji1CLhksAa2o7EhR1pLNdmsRHwuA3nyYFk193IFGNZHlmZg7uHYxBUYBqT1GPUBWv24hLEbt1cA2oPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:17:37.329709Z"},"content_sha256":"51fb4d5df477f6236982d03b5868637be7bcd2549f88bafcad6d74c12e9d4f37","schema_version":"1.0","event_id":"sha256:51fb4d5df477f6236982d03b5868637be7bcd2549f88bafcad6d74c12e9d4f37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/bundle.json","state_url":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/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-06-04T00:17:37Z","links":{"resolver":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF","bundle":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/bundle.json","state":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TUYIO2ICAIWKJ2UWI57VS4IKKF","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":"f199ec2cc576ea93b5f1a14b376e4c5d7118220a6c10aa57ff37fd269755bad9","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-12T17:08:43Z","title_canon_sha256":"3c6c99c1de6f7d1e184751899ac860d2936b18af606778cebb3258ed60d6720f"},"schema_version":"1.0","source":{"id":"1606.03742","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03742","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03742v2","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03742","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"TUYIO2ICAIWK","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TUYIO2ICAIWKJ2UW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TUYIO2IC","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:51fb4d5df477f6236982d03b5868637be7bcd2549f88bafcad6d74c12e9d4f37","target":"graph","created_at":"2026-05-18T00:40:41Z","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 key to a variety of applications including content-based search for images and video, recommendation systems, data deduplication, natural language processing, computer vision, databases, computational biology, and computer graphics. At its core, similarity search manifests as k-nearest neighbors (kNN), a computationally simple primitive consisting of highly parallel distance calculations and a global top-k sort. However, kNN is poorly supported by today's architectures because of its high memory bandwidth requirements.\n  This paper proposes an application-driven near-dat","authors_text":"Amrita Mazumdar, Armin Alaghi, Carlo C. Del Mundo, Luis Ceze, Mark Oskin, Vincent T. Lee","cross_cats":["cs.AR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-12T17:08:43Z","title":"Application-Driven Near-Data Processing for Similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03742","kind":"arxiv","version":2},"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:a8211f5a84a170b81555a5cfbd3296f0b115a38e53d6e8946de2c63f7860c9d2","target":"record","created_at":"2026-05-18T00:40:41Z","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":"f199ec2cc576ea93b5f1a14b376e4c5d7118220a6c10aa57ff37fd269755bad9","cross_cats_sorted":["cs.AR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-12T17:08:43Z","title_canon_sha256":"3c6c99c1de6f7d1e184751899ac860d2936b18af606778cebb3258ed60d6720f"},"schema_version":"1.0","source":{"id":"1606.03742","kind":"arxiv","version":2}},"canonical_sha256":"9d30876902022ca4ea96477f59710a5156575ad4cbbf7b13dface55278768863","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d30876902022ca4ea96477f59710a5156575ad4cbbf7b13dface55278768863","first_computed_at":"2026-05-18T00:40:41.325827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:41.325827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6xZpcFuDTsIfSl/xHAazdFF/YPvgv9LPKL4QwI0ZwV3Ph0ISqMGjnXFfAFuoLjMrBewXAnxpXsKQY8YxlzbNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:41.326530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03742","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8211f5a84a170b81555a5cfbd3296f0b115a38e53d6e8946de2c63f7860c9d2","sha256:51fb4d5df477f6236982d03b5868637be7bcd2549f88bafcad6d74c12e9d4f37"],"state_sha256":"a88ebea8dd6c5b0f896250062746781418f23b90955e3002b0107754767f0c8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRg/CNjPkkdoQmclseQBQweZmly4nGMfpnyP8Ate5V4wk99gK5Dxbsq2nGUvBtrv3T2cgGEkIR/ZafibAFLIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:17:37.331659Z","bundle_sha256":"c5d5af4af1de48bf7d2b215577a00e684df6d850bf9990be80b5618ef5e7ccde"}}