{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J5GLMGZGYO3VOMVIOIJBAKHATD","short_pith_number":"pith:J5GLMGZG","schema_version":"1.0","canonical_sha256":"4f4cb61b26c3b75732a872121028e098fe81ddbaea48601017f554057ab79aea","source":{"kind":"arxiv","id":"1811.11811","version":1},"attestation_state":"computed","paper":{"title":"An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Haewon Jeong, Jukka Kohonen, Malhar Chaudhari, Pulkit Grover, Sanghamitra Dutta, Teemu Roos, Utsav Sheth, Yaoqing Yang","submitted_at":"2018-11-28T20:22:31Z","abstract_excerpt":"We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix multiplication in terms of recovery threshold under storage constraints. In approximate nearest neighbor algorithms, it is common to construct efficient in-memory indexes to improve query response time. One such strategy is Multiple Random Projection Trees (MRPT), which reduces the set of candidate points over which Euclidean distance calculations are performed. However, this may result in a high memory footprint an"},"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":"1811.11811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-28T20:22:31Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"92153380056ab268d12fd14d76b280d9bd446214bb014abb1db00c2f0bd390fb","abstract_canon_sha256":"5ea9edfc752bf6a3ea742ff6c931acc1b48cc30972fadca97d19ba8f73de2b0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:37.593910Z","signature_b64":"ZbooaIiMviQ576jLzm5SJJApB6jafiOb0d5ck58bpOTQ/UY0ytUVQaBTsXI5wqwT89N77XWMl07w1QRgZUPnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4cb61b26c3b75732a872121028e098fe81ddbaea48601017f554057ab79aea","last_reissued_at":"2026-05-17T23:59:37.593107Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:37.593107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Haewon Jeong, Jukka Kohonen, Malhar Chaudhari, Pulkit Grover, Sanghamitra Dutta, Teemu Roos, Utsav Sheth, Yaoqing Yang","submitted_at":"2018-11-28T20:22:31Z","abstract_excerpt":"We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix multiplication in terms of recovery threshold under storage constraints. In approximate nearest neighbor algorithms, it is common to construct efficient in-memory indexes to improve query response time. One such strategy is Multiple Random Projection Trees (MRPT), which reduces the set of candidate points over which Euclidean distance calculations are performed. However, this may result in a high memory footprint an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11811","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.11811","created_at":"2026-05-17T23:59:37.593241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11811v1","created_at":"2026-05-17T23:59:37.593241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11811","created_at":"2026-05-17T23:59:37.593241+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5GLMGZGYO3V","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5GLMGZGYO3VOMVI","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5GLMGZG","created_at":"2026-05-18T12:32:31.084164+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/J5GLMGZGYO3VOMVIOIJBAKHATD","json":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD.json","graph_json":"https://pith.science/api/pith-number/J5GLMGZGYO3VOMVIOIJBAKHATD/graph.json","events_json":"https://pith.science/api/pith-number/J5GLMGZGYO3VOMVIOIJBAKHATD/events.json","paper":"https://pith.science/paper/J5GLMGZG"},"agent_actions":{"view_html":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD","download_json":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD.json","view_paper":"https://pith.science/paper/J5GLMGZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11811&json=true","fetch_graph":"https://pith.science/api/pith-number/J5GLMGZGYO3VOMVIOIJBAKHATD/graph.json","fetch_events":"https://pith.science/api/pith-number/J5GLMGZGYO3VOMVIOIJBAKHATD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD/action/storage_attestation","attest_author":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD/action/author_attestation","sign_citation":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD/action/citation_signature","submit_replication":"https://pith.science/pith/J5GLMGZGYO3VOMVIOIJBAKHATD/action/replication_record"}},"created_at":"2026-05-17T23:59:37.593241+00:00","updated_at":"2026-05-17T23:59:37.593241+00:00"}