{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:R7GJJAJM3ANWCM5FP76CD7GZ7N","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":"292ac0f37eac8c1f3a456f865e62037c5ce9ac79eccac9649726c9d2e354ce35","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-23T00:32:04Z","title_canon_sha256":"e94232e83e75b92f931f814b57acee511597ea0296d9397f867d2e61b05defbb"},"schema_version":"1.0","source":{"id":"2210.12579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.12579","created_at":"2026-07-05T05:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"2210.12579v1","created_at":"2026-07-05T05:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12579","created_at":"2026-07-05T05:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"R7GJJAJM3ANW","created_at":"2026-07-05T05:09:30Z"},{"alias_kind":"pith_short_16","alias_value":"R7GJJAJM3ANWCM5F","created_at":"2026-07-05T05:09:30Z"},{"alias_kind":"pith_short_8","alias_value":"R7GJJAJM","created_at":"2026-07-05T05:09:30Z"}],"graph_snapshots":[{"event_id":"sha256:ccfe23e5f50988e98593ed40f7e0d369a50764248344043149f5f35535f250c3","target":"graph","created_at":"2026-07-05T05:09:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.12579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient k-nearest neighbor search is a fundamental task, foundational for many problems in NLP. When the similarity is measured by dot-product between dual-encoder vectors or $\\ell_2$-distance, there already exist many scalable and efficient search methods. But not so when similarity is measured by more accurate and expensive black-box neural similarity models, such as cross-encoders, which jointly encode the query and candidate neighbor. The cross-encoders' high computational cost typically limits their use to reranking candidates retrieved by a cheaper model, such as dual encoder or TF-IDF","authors_text":"Andrew McCallum, Manzil Zaheer, Nicholas Monath, Nishant Yadav, Rico Angell","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-23T00:32:04Z","title":"Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12579","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:4f8ff830a695fb1131be33361f9e1176f21750622c54622d07e1efb83632faf8","target":"record","created_at":"2026-07-05T05:09:30Z","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":"292ac0f37eac8c1f3a456f865e62037c5ce9ac79eccac9649726c9d2e354ce35","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-23T00:32:04Z","title_canon_sha256":"e94232e83e75b92f931f814b57acee511597ea0296d9397f867d2e61b05defbb"},"schema_version":"1.0","source":{"id":"2210.12579","kind":"arxiv","version":1}},"canonical_sha256":"8fcc94812cd81b6133a57ffc21fcd9fb749d1d5549c0d5066f287810413f2279","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fcc94812cd81b6133a57ffc21fcd9fb749d1d5549c0d5066f287810413f2279","first_computed_at":"2026-07-05T05:09:30.108749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:09:30.108749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yDMDxlawfadMdCPF4cfbVvxAHy5F6WUBP77IcEIZkSnllUmsm1Vo9fHlXs1iyWQuPATxcLXsNiT0doo1N8M3Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:09:30.109241Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.12579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f8ff830a695fb1131be33361f9e1176f21750622c54622d07e1efb83632faf8","sha256:ccfe23e5f50988e98593ed40f7e0d369a50764248344043149f5f35535f250c3"],"state_sha256":"b3634c2f3a53c63546c1c3cef2d6757087d8df61ddebb6d6bb264cf9a0509255"}