{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TUYIO2ICAIWKJ2UWI57VS4IKKF","short_pith_number":"pith:TUYIO2IC","schema_version":"1.0","canonical_sha256":"9d30876902022ca4ea96477f59710a5156575ad4cbbf7b13dface55278768863","source":{"kind":"arxiv","id":"1606.03742","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.03742","created_at":"2026-05-18T00:40:41.325921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03742v2","created_at":"2026-05-18T00:40:41.325921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03742","created_at":"2026-05-18T00:40:41.325921+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUYIO2ICAIWK","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUYIO2ICAIWKJ2UW","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUYIO2IC","created_at":"2026-05-18T12:30:46.583412+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/TUYIO2ICAIWKJ2UWI57VS4IKKF","json":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF.json","graph_json":"https://pith.science/api/pith-number/TUYIO2ICAIWKJ2UWI57VS4IKKF/graph.json","events_json":"https://pith.science/api/pith-number/TUYIO2ICAIWKJ2UWI57VS4IKKF/events.json","paper":"https://pith.science/paper/TUYIO2IC"},"agent_actions":{"view_html":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF","download_json":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF.json","view_paper":"https://pith.science/paper/TUYIO2IC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03742&json=true","fetch_graph":"https://pith.science/api/pith-number/TUYIO2ICAIWKJ2UWI57VS4IKKF/graph.json","fetch_events":"https://pith.science/api/pith-number/TUYIO2ICAIWKJ2UWI57VS4IKKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/action/storage_attestation","attest_author":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/action/author_attestation","sign_citation":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/action/citation_signature","submit_replication":"https://pith.science/pith/TUYIO2ICAIWKJ2UWI57VS4IKKF/action/replication_record"}},"created_at":"2026-05-18T00:40:41.325921+00:00","updated_at":"2026-05-18T00:40:41.325921+00:00"}