{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4WOF5Q3JO5V23XTLTJ5WHZVYMA","short_pith_number":"pith:4WOF5Q3J","schema_version":"1.0","canonical_sha256":"e59c5ec369776badde6b9a7b63e6b86030fa0bfb2363fdb53775e02674a125bd","source":{"kind":"arxiv","id":"2305.02996","version":2},"attestation_state":"computed","paper":{"title":"Efficient k-NN Search with Cross-Encoders using Adaptive Multi-Round CUR Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Andrew McCallum, Manzil Zaheer, Nicholas Monath, Nishant Yadav","submitted_at":"2023-05-04T17:01:17Z","abstract_excerpt":"Cross-encoder models, which jointly encode and score a query-item pair, are prohibitively expensive for direct k-nearest neighbor (k-NN) search. Consequently, k-NN search typically employs a fast approximate retrieval (e.g. using BM25 or dual-encoder vectors), followed by reranking with a cross-encoder; however, the retrieval approximation often has detrimental recall regret. This problem is tackled by ANNCUR (Yadav et al., 2022), a recent work that employs a cross-encoder only, making search efficient using a relatively small number of anchor items, and a CUR matrix factorization. While ANNCU"},"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":"2305.02996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-05-04T17:01:17Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"6e9bfb613eb5e7fcb2e47c90e40b641fc7b3dbdff432039d93c4b39cd2815c5a","abstract_canon_sha256":"13e2278caf5aa9eab48cb9e0fbbe26acf1c9382639231d7f75cecf92e14b20e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:58.600561Z","signature_b64":"sw/hHxCC+miZHAeiz5NUGWSy5k+CFuh7qEBBIOMWnCeDZEFVxUh8rRsBNBmin6z+kYISumBlOy8ajjJubnItAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59c5ec369776badde6b9a7b63e6b86030fa0bfb2363fdb53775e02674a125bd","last_reissued_at":"2026-07-05T07:03:58.600071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:58.600071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient k-NN Search with Cross-Encoders using Adaptive Multi-Round CUR Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Andrew McCallum, Manzil Zaheer, Nicholas Monath, Nishant Yadav","submitted_at":"2023-05-04T17:01:17Z","abstract_excerpt":"Cross-encoder models, which jointly encode and score a query-item pair, are prohibitively expensive for direct k-nearest neighbor (k-NN) search. Consequently, k-NN search typically employs a fast approximate retrieval (e.g. using BM25 or dual-encoder vectors), followed by reranking with a cross-encoder; however, the retrieval approximation often has detrimental recall regret. This problem is tackled by ANNCUR (Yadav et al., 2022), a recent work that employs a cross-encoder only, making search efficient using a relatively small number of anchor items, and a CUR matrix factorization. While ANNCU"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02996","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.02996/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.02996","created_at":"2026-07-05T07:03:58.600129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02996v2","created_at":"2026-07-05T07:03:58.600129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02996","created_at":"2026-07-05T07:03:58.600129+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WOF5Q3JO5V2","created_at":"2026-07-05T07:03:58.600129+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WOF5Q3JO5V23XTL","created_at":"2026-07-05T07:03:58.600129+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WOF5Q3J","created_at":"2026-07-05T07:03:58.600129+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/4WOF5Q3JO5V23XTLTJ5WHZVYMA","json":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA.json","graph_json":"https://pith.science/api/pith-number/4WOF5Q3JO5V23XTLTJ5WHZVYMA/graph.json","events_json":"https://pith.science/api/pith-number/4WOF5Q3JO5V23XTLTJ5WHZVYMA/events.json","paper":"https://pith.science/paper/4WOF5Q3J"},"agent_actions":{"view_html":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA","download_json":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA.json","view_paper":"https://pith.science/paper/4WOF5Q3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02996&json=true","fetch_graph":"https://pith.science/api/pith-number/4WOF5Q3JO5V23XTLTJ5WHZVYMA/graph.json","fetch_events":"https://pith.science/api/pith-number/4WOF5Q3JO5V23XTLTJ5WHZVYMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA/action/storage_attestation","attest_author":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA/action/author_attestation","sign_citation":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA/action/citation_signature","submit_replication":"https://pith.science/pith/4WOF5Q3JO5V23XTLTJ5WHZVYMA/action/replication_record"}},"created_at":"2026-07-05T07:03:58.600129+00:00","updated_at":"2026-07-05T07:03:58.600129+00:00"}