{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K5EQMINFLGGUJS7SHAMLCWF4RI","short_pith_number":"pith:K5EQMINF","schema_version":"1.0","canonical_sha256":"57490621a5598d44cbf23818b158bc8a1ad638a18b7453d879c627f3f86d13ac","source":{"kind":"arxiv","id":"2408.17344","version":2},"attestation_state":"computed","paper":{"title":"rerankers: A Lightweight Python Library to Unify Ranking Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Benjamin Clavi\\'e","submitted_at":"2024-08-30T15:16:52Z","abstract_excerpt":"This paper presents rerankers, a Python library which provides an easy-to-use interface to the most commonly used re-ranking approaches. Re-ranking is an integral component of many retrieval pipelines; however, there exist numerous approaches to it, relying on different implementation methods. rerankers unifies these methods into a single user-friendly interface, allowing practitioners and researchers alike to explore different methods while only changing a single line of Python code. Moreover ,rerankers ensures that its implementations are done with the fewest dependencies possible, and re-us"},"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":"2408.17344","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-08-30T15:16:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fbd9b0c58c8747ec135cad0ffc1d225cf1aefec569e2afa2f5171a1ef2f54365","abstract_canon_sha256":"2f0abfe402d5c68b324c47cd78f3550e5eda7adff21ede5ea17fabcfb1103a4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:25.637310Z","signature_b64":"hbXUQ7Nw92QtnAot9MnAOKrKGuLPffL7Fk59VifZrEfpfhQX2Y1bgHQiaN4qzge9FReCcGz+ntxIGUXSQpbqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57490621a5598d44cbf23818b158bc8a1ad638a18b7453d879c627f3f86d13ac","last_reissued_at":"2026-07-05T09:02:25.636847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:25.636847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"rerankers: A Lightweight Python Library to Unify Ranking Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Benjamin Clavi\\'e","submitted_at":"2024-08-30T15:16:52Z","abstract_excerpt":"This paper presents rerankers, a Python library which provides an easy-to-use interface to the most commonly used re-ranking approaches. Re-ranking is an integral component of many retrieval pipelines; however, there exist numerous approaches to it, relying on different implementation methods. rerankers unifies these methods into a single user-friendly interface, allowing practitioners and researchers alike to explore different methods while only changing a single line of Python code. Moreover ,rerankers ensures that its implementations are done with the fewest dependencies possible, and re-us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.17344","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/2408.17344/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":"2408.17344","created_at":"2026-07-05T09:02:25.636912+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.17344v2","created_at":"2026-07-05T09:02:25.636912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.17344","created_at":"2026-07-05T09:02:25.636912+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5EQMINFLGGU","created_at":"2026-07-05T09:02:25.636912+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5EQMINFLGGUJS7S","created_at":"2026-07-05T09:02:25.636912+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5EQMINF","created_at":"2026-07-05T09:02:25.636912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.03558","citing_title":"SAGE-HLS: Syntax-Aware AST-Guided LLM for High-Level Synthesis Code Generation","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI","json":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI.json","graph_json":"https://pith.science/api/pith-number/K5EQMINFLGGUJS7SHAMLCWF4RI/graph.json","events_json":"https://pith.science/api/pith-number/K5EQMINFLGGUJS7SHAMLCWF4RI/events.json","paper":"https://pith.science/paper/K5EQMINF"},"agent_actions":{"view_html":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI","download_json":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI.json","view_paper":"https://pith.science/paper/K5EQMINF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.17344&json=true","fetch_graph":"https://pith.science/api/pith-number/K5EQMINFLGGUJS7SHAMLCWF4RI/graph.json","fetch_events":"https://pith.science/api/pith-number/K5EQMINFLGGUJS7SHAMLCWF4RI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI/action/storage_attestation","attest_author":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI/action/author_attestation","sign_citation":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI/action/citation_signature","submit_replication":"https://pith.science/pith/K5EQMINFLGGUJS7SHAMLCWF4RI/action/replication_record"}},"created_at":"2026-07-05T09:02:25.636912+00:00","updated_at":"2026-07-05T09:02:25.636912+00:00"}