{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4XC7OMPF4KBSSLWGOXQIT556HZ","short_pith_number":"pith:4XC7OMPF","schema_version":"1.0","canonical_sha256":"e5c5f731e5e283292ec675e089f7be3e4e7e10937ea0c7dfed314d213b442268","source":{"kind":"arxiv","id":"2010.02666","version":2},"attestation_state":"computed","paper":{"title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Allan Hanbury, Mete Sertkan, Michael Schr\\\"oder, Sebastian Hofst\\\"atter, Sophia Althammer","submitted_at":"2020-10-06T12:35:53Z","abstract_excerpt":"Retrieval and ranking models are the backbone of many applications such as web search, open domain QA, or text-based recommender systems. The latency of neural ranking models at query time is largely dependent on the architecture and deliberate choices by their designers to trade-off effectiveness for higher efficiency. This focus on low query latency of a rising number of efficient ranking architectures make them feasible for production deployment. In machine learning an increasingly common approach to close the effectiveness gap of more efficient models is to apply knowledge distillation fro"},"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":"2010.02666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-06T12:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"43ec8ab2ad5271f850cd7a456be6cc4ccd561c5970e8fa5f2d330cd256326a82","abstract_canon_sha256":"7a47e7809ebe23efa8bacdb8fea1477b40ced9beb136b9ed45582785ba6be06f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:50.686511Z","signature_b64":"43FcA9tU5RCIwwR3QlBAhnrkO+GWIPyyJOPEumRjsy/Rr25RlS7QgVxvoSHtBUHQLkb2vvt6KUdHFOFJjCH2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5c5f731e5e283292ec675e089f7be3e4e7e10937ea0c7dfed314d213b442268","last_reissued_at":"2026-07-05T02:08:50.686047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:50.686047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Allan Hanbury, Mete Sertkan, Michael Schr\\\"oder, Sebastian Hofst\\\"atter, Sophia Althammer","submitted_at":"2020-10-06T12:35:53Z","abstract_excerpt":"Retrieval and ranking models are the backbone of many applications such as web search, open domain QA, or text-based recommender systems. The latency of neural ranking models at query time is largely dependent on the architecture and deliberate choices by their designers to trade-off effectiveness for higher efficiency. This focus on low query latency of a rising number of efficient ranking architectures make them feasible for production deployment. In machine learning an increasingly common approach to close the effectiveness gap of more efficient models is to apply knowledge distillation fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02666","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/2010.02666/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":"2010.02666","created_at":"2026-07-05T02:08:50.686106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.02666v2","created_at":"2026-07-05T02:08:50.686106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02666","created_at":"2026-07-05T02:08:50.686106+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XC7OMPF4KBS","created_at":"2026-07-05T02:08:50.686106+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XC7OMPF4KBSSLWG","created_at":"2026-07-05T02:08:50.686106+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XC7OMPF","created_at":"2026-07-05T02:08:50.686106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23911","citing_title":"Scaling Dense Retrieval with LLM-Annotated Training Data: Structured Mining and Progressive Curriculum for E-Commerce Sponsored Search","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28522","citing_title":"Search for Coverage: Learning Coverage-Aware Retrieval with Augmented Sub-Question Answerability","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30529","citing_title":"Generalistic or Specific Embeddings, Which is Better? An Empirical Study on Search for Clinical Coding in Non-English Languages","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19628","citing_title":"Understanding Wacky Weights: A Dissection of SPLADE's Learned Term Importance","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2509.12539","citing_title":"LEAF: Knowledge Distillation of Text Embedding Models with Teacher-Aligned Representations","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2509.16621","citing_title":"The Role of Vocabularies in Learning Sparse Representations for Ranking","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2602.15547","citing_title":"jina-embeddings-v5-text: Task-Targeted Embedding Distillation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23734","citing_title":"Prism-Reranker: Beyond Relevance Scoring -- Jointly Producing Contributions and Evidence for Agentic Retrieval","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07930","citing_title":"Unified Supervision for Walmart's Sponsored Search Retrieval via Joint Semantic Relevance and Behavioral Engagement Modeling","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04734","citing_title":"Beyond Hard Negatives: The Importance of Score Distribution in Knowledge Distillation for Dense Retrieval","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14403","citing_title":"A Unified Model and Document Representation for On-Device Retrieval-Augmented Generation","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ","json":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ.json","graph_json":"https://pith.science/api/pith-number/4XC7OMPF4KBSSLWGOXQIT556HZ/graph.json","events_json":"https://pith.science/api/pith-number/4XC7OMPF4KBSSLWGOXQIT556HZ/events.json","paper":"https://pith.science/paper/4XC7OMPF"},"agent_actions":{"view_html":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ","download_json":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ.json","view_paper":"https://pith.science/paper/4XC7OMPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.02666&json=true","fetch_graph":"https://pith.science/api/pith-number/4XC7OMPF4KBSSLWGOXQIT556HZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4XC7OMPF4KBSSLWGOXQIT556HZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ/action/storage_attestation","attest_author":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ/action/author_attestation","sign_citation":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ/action/citation_signature","submit_replication":"https://pith.science/pith/4XC7OMPF4KBSSLWGOXQIT556HZ/action/replication_record"}},"created_at":"2026-07-05T02:08:50.686106+00:00","updated_at":"2026-07-05T02:08:50.686106+00:00"}