{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3RPNRTJWVSCTYXTXYCYPHNSNC4","short_pith_number":"pith:3RPNRTJW","schema_version":"1.0","canonical_sha256":"dc5ed8cd36ac853c5e77c0b0f3b64d172e653fe27efebe80f6730097a5085098","source":{"kind":"arxiv","id":"2311.01263","version":1},"attestation_state":"computed","paper":{"title":"Efficient Neural Ranking using Forward Indexes and Lightweight Encoders","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Abhijit Anand, Avishek Anand, Henrik M\\\"uller, Jurek Leonhardt, Koustav Rudra, Megha Khosla","submitted_at":"2023-11-02T14:23:45Z","abstract_excerpt":"Dual-encoder-based dense retrieval models have become the standard in IR. They employ large Transformer-based language models, which are notoriously inefficient in terms of resources and latency. We propose Fast-Forward indexes -- vector forward indexes which exploit the semantic matching capabilities of dual-encoder models for efficient and effective re-ranking. Our framework enables re-ranking at very high retrieval depths and combines the merits of both lexical and semantic matching via score interpolation. Furthermore, in order to mitigate the limitations of dual-encoders, we tackle two ma"},"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":"2311.01263","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2023-11-02T14:23:45Z","cross_cats_sorted":[],"title_canon_sha256":"df7a86081935b0815c967d169ea2b529f5aea433d3742838584074aee344f0ee","abstract_canon_sha256":"6b6c75b20112697cfc7d3610eef00f6d7542203fe598868a429e8ed04be18f3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:23.275282Z","signature_b64":"v1c74goMM24itAZzM6HKkIiwArkjyKUo/Vlle/0u6DJ1jDGpqR6k6gjKWQQQ6QZU7yTSQRkMLBuucZZ72Ow6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc5ed8cd36ac853c5e77c0b0f3b64d172e653fe27efebe80f6730097a5085098","last_reissued_at":"2026-07-05T07:08:23.274732Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:23.274732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Neural Ranking using Forward Indexes and Lightweight Encoders","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Abhijit Anand, Avishek Anand, Henrik M\\\"uller, Jurek Leonhardt, Koustav Rudra, Megha Khosla","submitted_at":"2023-11-02T14:23:45Z","abstract_excerpt":"Dual-encoder-based dense retrieval models have become the standard in IR. They employ large Transformer-based language models, which are notoriously inefficient in terms of resources and latency. We propose Fast-Forward indexes -- vector forward indexes which exploit the semantic matching capabilities of dual-encoder models for efficient and effective re-ranking. Our framework enables re-ranking at very high retrieval depths and combines the merits of both lexical and semantic matching via score interpolation. Furthermore, in order to mitigate the limitations of dual-encoders, we tackle two ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.01263","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/2311.01263/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":"2311.01263","created_at":"2026-07-05T07:08:23.274799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.01263v1","created_at":"2026-07-05T07:08:23.274799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.01263","created_at":"2026-07-05T07:08:23.274799+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RPNRTJWVSCT","created_at":"2026-07-05T07:08:23.274799+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RPNRTJWVSCTYXTX","created_at":"2026-07-05T07:08:23.274799+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RPNRTJW","created_at":"2026-07-05T07:08:23.274799+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05803","citing_title":"FlashCheck: Exploration of Efficient Evidence Retrieval for Fast Fact-Checking","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4","json":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4.json","graph_json":"https://pith.science/api/pith-number/3RPNRTJWVSCTYXTXYCYPHNSNC4/graph.json","events_json":"https://pith.science/api/pith-number/3RPNRTJWVSCTYXTXYCYPHNSNC4/events.json","paper":"https://pith.science/paper/3RPNRTJW"},"agent_actions":{"view_html":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4","download_json":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4.json","view_paper":"https://pith.science/paper/3RPNRTJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.01263&json=true","fetch_graph":"https://pith.science/api/pith-number/3RPNRTJWVSCTYXTXYCYPHNSNC4/graph.json","fetch_events":"https://pith.science/api/pith-number/3RPNRTJWVSCTYXTXYCYPHNSNC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4/action/storage_attestation","attest_author":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4/action/author_attestation","sign_citation":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4/action/citation_signature","submit_replication":"https://pith.science/pith/3RPNRTJWVSCTYXTXYCYPHNSNC4/action/replication_record"}},"created_at":"2026-07-05T07:08:23.274799+00:00","updated_at":"2026-07-05T07:08:23.274799+00:00"}