{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JWW2ARCJNHTIU34S4G4Z6LUNW6","short_pith_number":"pith:JWW2ARCJ","schema_version":"1.0","canonical_sha256":"4dada0444969e68a6f92e1b99f2e8db7baa8cf7e4b5637442429fc3edbc35a29","source":{"kind":"arxiv","id":"2104.07186","version":1},"attestation_state":"computed","paper":{"title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Jamie Callan, Luyu Gao, Zhuyun Dai","submitted_at":"2021-04-15T00:53:54Z","abstract_excerpt":"Classical information retrieval systems such as BM25 rely on exact lexical match and carry out search efficiently with inverted list index. Recent neural IR models shifts towards soft semantic matching all query document terms, but they lose the computation efficiency of exact match systems. This paper presents COIL, a contextualized exact match retrieval architecture that brings semantic lexical matching. COIL scoring is based on overlapping query document tokens' contextualized representations. The new architecture stores contextualized token representations in inverted lists, bringing toget"},"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":"2104.07186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-04-15T00:53:54Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"a6958cb0199aa86aef608a9d0f230d09358031c6beba9df75b1b94d9ce1a3f23","abstract_canon_sha256":"a84d1ecebcc516adc35dbe44030afc92b0b078d8531d6cc0fed44a37c121baaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:18.818368Z","signature_b64":"G1ryf0PSXLsh2snOe4Bn7XBqB7xmdHE4IR84aFQpq3VhaEqLBbegOqjmexOXz5NHS6zaCPi9wOV/qQ+qhIqtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dada0444969e68a6f92e1b99f2e8db7baa8cf7e4b5637442429fc3edbc35a29","last_reissued_at":"2026-07-05T02:32:18.817973Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:18.817973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Jamie Callan, Luyu Gao, Zhuyun Dai","submitted_at":"2021-04-15T00:53:54Z","abstract_excerpt":"Classical information retrieval systems such as BM25 rely on exact lexical match and carry out search efficiently with inverted list index. Recent neural IR models shifts towards soft semantic matching all query document terms, but they lose the computation efficiency of exact match systems. This paper presents COIL, a contextualized exact match retrieval architecture that brings semantic lexical matching. COIL scoring is based on overlapping query document tokens' contextualized representations. The new architecture stores contextualized token representations in inverted lists, bringing toget"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07186","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.07186/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":"2104.07186","created_at":"2026-07-05T02:32:18.818026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.07186v1","created_at":"2026-07-05T02:32:18.818026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07186","created_at":"2026-07-05T02:32:18.818026+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWW2ARCJNHTI","created_at":"2026-07-05T02:32:18.818026+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWW2ARCJNHTIU34S","created_at":"2026-07-05T02:32:18.818026+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWW2ARCJ","created_at":"2026-07-05T02:32:18.818026+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.00004","citing_title":"Why Advanced Encoders Lag on Sparse Retrieval? The Answer and an Approach to Bridging Vocabulary Gaps","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.23475","citing_title":"Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddings","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27445","citing_title":"RAGe: A Retrieval-Augmented Generation Evaluation Framework","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2509.16621","citing_title":"The Role of Vocabularies in Learning Sparse Representations for Ranking","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02815","citing_title":"Unified and Efficient Approach for Multi-Vector Similarity Search","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03676","citing_title":"Are LLM-Based Retrievers Worth Their Cost? An Empirical Study of Efficiency, Robustness, and Reasoning Overhead","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2402.03216","citing_title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6","json":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6.json","graph_json":"https://pith.science/api/pith-number/JWW2ARCJNHTIU34S4G4Z6LUNW6/graph.json","events_json":"https://pith.science/api/pith-number/JWW2ARCJNHTIU34S4G4Z6LUNW6/events.json","paper":"https://pith.science/paper/JWW2ARCJ"},"agent_actions":{"view_html":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6","download_json":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6.json","view_paper":"https://pith.science/paper/JWW2ARCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.07186&json=true","fetch_graph":"https://pith.science/api/pith-number/JWW2ARCJNHTIU34S4G4Z6LUNW6/graph.json","fetch_events":"https://pith.science/api/pith-number/JWW2ARCJNHTIU34S4G4Z6LUNW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6/action/storage_attestation","attest_author":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6/action/author_attestation","sign_citation":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6/action/citation_signature","submit_replication":"https://pith.science/pith/JWW2ARCJNHTIU34S4G4Z6LUNW6/action/replication_record"}},"created_at":"2026-07-05T02:32:18.818026+00:00","updated_at":"2026-07-05T02:32:18.818026+00:00"}