{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GLMH2PLYCRMIGPD4XXGHQAVEW3","short_pith_number":"pith:GLMH2PLY","schema_version":"1.0","canonical_sha256":"32d87d3d781458833c7cbdcc7802a4b6ef1a4eb4edddaa51ffb56f54824acaea","source":{"kind":"arxiv","id":"2402.10866","version":2},"attestation_state":"computed","paper":{"title":"EcoRank: Budget-Constrained Text Re-ranking Using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jannat Ara Meem, Muhammad Shihab Rashid, Vagelis Hristidis, Yue Dong","submitted_at":"2024-02-16T18:03:42Z","abstract_excerpt":"Large Language Models (LLMs) have achieved state-of-the-art performance in text re-ranking. This process includes queries and candidate passages in the prompts, utilizing pointwise, listwise, and pairwise prompting strategies. A limitation of these ranking strategies with LLMs is their cost: the process can become expensive due to API charges, which are based on the number of input and output tokens. We study how to maximize the re-ranking performance given a budget, by navigating the vast search spaces of prompt choices, LLM APIs, and budget splits. We propose a suite of budget-constrained me"},"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.10866","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-02-16T18:03:42Z","cross_cats_sorted":[],"title_canon_sha256":"1e525b62fc7a7da3187a69e6ae344a66ef9ee4088199510df9dfe79c05927765","abstract_canon_sha256":"11f4773a6caba4bc4229a50c16b1764a6b314fb7d4923316d256bf65278d2710"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:01.974687Z","signature_b64":"tyOCk9bgwc1iLwU1aoOk0Qk8y4hDO7ODAqtQslJvjnSENgZ8JoqIAk/OPMPWHKHP8xoGS6gYgwLssXUti5kLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d87d3d781458833c7cbdcc7802a4b6ef1a4eb4edddaa51ffb56f54824acaea","last_reissued_at":"2026-07-05T08:24:01.974180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:01.974180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EcoRank: Budget-Constrained Text Re-ranking Using Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jannat Ara Meem, Muhammad Shihab Rashid, Vagelis Hristidis, Yue Dong","submitted_at":"2024-02-16T18:03:42Z","abstract_excerpt":"Large Language Models (LLMs) have achieved state-of-the-art performance in text re-ranking. This process includes queries and candidate passages in the prompts, utilizing pointwise, listwise, and pairwise prompting strategies. A limitation of these ranking strategies with LLMs is their cost: the process can become expensive due to API charges, which are based on the number of input and output tokens. We study how to maximize the re-ranking performance given a budget, by navigating the vast search spaces of prompt choices, LLM APIs, and budget splits. We propose a suite of budget-constrained me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10866","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/2402.10866/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.10866","created_at":"2026-07-05T08:24:01.974239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10866v2","created_at":"2026-07-05T08:24:01.974239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10866","created_at":"2026-07-05T08:24:01.974239+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLMH2PLYCRMI","created_at":"2026-07-05T08:24:01.974239+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLMH2PLYCRMIGPD4","created_at":"2026-07-05T08:24:01.974239+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLMH2PLY","created_at":"2026-07-05T08:24:01.974239+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27810","citing_title":"LRanker: LLM Ranker for Massive Candidates","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3","json":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3.json","graph_json":"https://pith.science/api/pith-number/GLMH2PLYCRMIGPD4XXGHQAVEW3/graph.json","events_json":"https://pith.science/api/pith-number/GLMH2PLYCRMIGPD4XXGHQAVEW3/events.json","paper":"https://pith.science/paper/GLMH2PLY"},"agent_actions":{"view_html":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3","download_json":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3.json","view_paper":"https://pith.science/paper/GLMH2PLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10866&json=true","fetch_graph":"https://pith.science/api/pith-number/GLMH2PLYCRMIGPD4XXGHQAVEW3/graph.json","fetch_events":"https://pith.science/api/pith-number/GLMH2PLYCRMIGPD4XXGHQAVEW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3/action/storage_attestation","attest_author":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3/action/author_attestation","sign_citation":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3/action/citation_signature","submit_replication":"https://pith.science/pith/GLMH2PLYCRMIGPD4XXGHQAVEW3/action/replication_record"}},"created_at":"2026-07-05T08:24:01.974239+00:00","updated_at":"2026-07-05T08:24:01.974239+00:00"}