{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OZPI7QJCSODOL42TCQJEZRG4UX","short_pith_number":"pith:OZPI7QJC","schema_version":"1.0","canonical_sha256":"765e8fc1229386e5f35314124cc4dca5e3a6ce38cd4a31e4ff1357cb3e92d31d","source":{"kind":"arxiv","id":"2402.12997","version":5},"attestation_state":"computed","paper":{"title":"Towards Trustworthy Reranking: A Simple yet Effective Abstention Mechanism","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"C\\'eline Hudelot, Emmanuel Malherbe, Hippolyte Gisserot-Boukhlef, Manuel Faysse, Pierre Colombo","submitted_at":"2024-02-20T13:25:16Z","abstract_excerpt":"Neural Information Retrieval (NIR) has significantly improved upon heuristic-based Information Retrieval (IR) systems. Yet, failures remain frequent, the models used often being unable to retrieve documents relevant to the user's query. We address this challenge by proposing a lightweight abstention mechanism tailored for real-world constraints, with particular emphasis placed on the reranking phase. We introduce a protocol for evaluating abstention strategies in black-box scenarios (typically encountered when relying on API services), demonstrating their efficacy, and propose a simple yet eff"},"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":"2402.12997","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-20T13:25:16Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7dfaeb5f4ec09671e2a4236af7614133589e143bd940105832466ea57549287a","abstract_canon_sha256":"e2c89aeaccc6a14c54ed6c9c08367e271d3c9a2950f78fed45de37271fcd7063"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:24.734326Z","signature_b64":"Dmg9WSBufsuCX75tPoa2xiAqim/sQu5cSnicstsTokmGtHmfdd5Lqklbid6M0E0EAHKMQgJ2/u1XxhX0i2WgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"765e8fc1229386e5f35314124cc4dca5e3a6ce38cd4a31e4ff1357cb3e92d31d","last_reissued_at":"2026-07-05T09:11:24.733795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:24.733795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Trustworthy Reranking: A Simple yet Effective Abstention Mechanism","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"C\\'eline Hudelot, Emmanuel Malherbe, Hippolyte Gisserot-Boukhlef, Manuel Faysse, Pierre Colombo","submitted_at":"2024-02-20T13:25:16Z","abstract_excerpt":"Neural Information Retrieval (NIR) has significantly improved upon heuristic-based Information Retrieval (IR) systems. Yet, failures remain frequent, the models used often being unable to retrieve documents relevant to the user's query. We address this challenge by proposing a lightweight abstention mechanism tailored for real-world constraints, with particular emphasis placed on the reranking phase. We introduce a protocol for evaluating abstention strategies in black-box scenarios (typically encountered when relying on API services), demonstrating their efficacy, and propose a simple yet eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12997","kind":"arxiv","version":5},"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/2402.12997/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":"2402.12997","created_at":"2026-07-05T09:11:24.733862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12997v5","created_at":"2026-07-05T09:11:24.733862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12997","created_at":"2026-07-05T09:11:24.733862+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZPI7QJCSODO","created_at":"2026-07-05T09:11:24.733862+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZPI7QJCSODOL42T","created_at":"2026-07-05T09:11:24.733862+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZPI7QJC","created_at":"2026-07-05T09:11:24.733862+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24782","citing_title":"Context is Gold to find the Gold Passage: Evaluating and Training Contextual Document Embeddings","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX","json":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX.json","graph_json":"https://pith.science/api/pith-number/OZPI7QJCSODOL42TCQJEZRG4UX/graph.json","events_json":"https://pith.science/api/pith-number/OZPI7QJCSODOL42TCQJEZRG4UX/events.json","paper":"https://pith.science/paper/OZPI7QJC"},"agent_actions":{"view_html":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX","download_json":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX.json","view_paper":"https://pith.science/paper/OZPI7QJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12997&json=true","fetch_graph":"https://pith.science/api/pith-number/OZPI7QJCSODOL42TCQJEZRG4UX/graph.json","fetch_events":"https://pith.science/api/pith-number/OZPI7QJCSODOL42TCQJEZRG4UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX/action/storage_attestation","attest_author":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX/action/author_attestation","sign_citation":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX/action/citation_signature","submit_replication":"https://pith.science/pith/OZPI7QJCSODOL42TCQJEZRG4UX/action/replication_record"}},"created_at":"2026-07-05T09:11:24.733862+00:00","updated_at":"2026-07-05T09:11:24.733862+00:00"}