{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SB7KDGCMVEXGXYUFD3SO3AYV2R","short_pith_number":"pith:SB7KDGCM","schema_version":"1.0","canonical_sha256":"907ea1984ca92e6be2851ee4ed8315d448e9a7361bebd39cccde44eecb400d62","source":{"kind":"arxiv","id":"2409.17745","version":3},"attestation_state":"computed","paper":{"title":"Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Andrew Parry, Debasis Ganguly, Debasis Samanta, Nilanjan Sinhababu, Pabitra Mitra","submitted_at":"2024-09-26T11:19:09Z","abstract_excerpt":"A supervised ranking model, despite its advantage of being effective, usually involves complex processing - typically multiple stages of task-specific pre-training and fine-tuning. This has motivated researchers to explore simpler pipelines leveraging large language models (LLMs) that are capable of working in a zero-shot manner. However, since zero-shot inference does not make use of a training set of pairs of queries and their relevant documents, its performance is mostly worse than that of supervised models, which are trained on such example pairs. Motivated by the existing findings that tr"},"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":"2409.17745","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-09-26T11:19:09Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"02b4face72f264d6eb9c9b7a85aacdaacc6f323ef94566666c93ffc8468d9035","abstract_canon_sha256":"735598e5f27ba0a5ac22c53ebd53b258bf8aed489d47a911ee8a43a9130e40b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:21.879419Z","signature_b64":"Xu+nDJpx+7ogQbmX7wCGqZLQ/LkXomMDqgblf6IU0rVNiHnldJx6UE4F/ntSeTKM6WXI9wpV++qn84r7bAxeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"907ea1984ca92e6be2851ee4ed8315d448e9a7361bebd39cccde44eecb400d62","last_reissued_at":"2026-07-05T09:16:21.878833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:21.878833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.IR","authors_text":"Andrew Parry, Debasis Ganguly, Debasis Samanta, Nilanjan Sinhababu, Pabitra Mitra","submitted_at":"2024-09-26T11:19:09Z","abstract_excerpt":"A supervised ranking model, despite its advantage of being effective, usually involves complex processing - typically multiple stages of task-specific pre-training and fine-tuning. This has motivated researchers to explore simpler pipelines leveraging large language models (LLMs) that are capable of working in a zero-shot manner. However, since zero-shot inference does not make use of a training set of pairs of queries and their relevant documents, its performance is mostly worse than that of supervised models, which are trained on such example pairs. Motivated by the existing findings that tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.17745","kind":"arxiv","version":3},"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/2409.17745/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":"2409.17745","created_at":"2026-07-05T09:16:21.878902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.17745v3","created_at":"2026-07-05T09:16:21.878902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.17745","created_at":"2026-07-05T09:16:21.878902+00:00"},{"alias_kind":"pith_short_12","alias_value":"SB7KDGCMVEXG","created_at":"2026-07-05T09:16:21.878902+00:00"},{"alias_kind":"pith_short_16","alias_value":"SB7KDGCMVEXGXYUF","created_at":"2026-07-05T09:16:21.878902+00:00"},{"alias_kind":"pith_short_8","alias_value":"SB7KDGCM","created_at":"2026-07-05T09:16:21.878902+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21099","citing_title":"Rewrite-to-Rank: Optimizing Ad Visibility via Retrieval-Aware Text Rewriting","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R","json":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R.json","graph_json":"https://pith.science/api/pith-number/SB7KDGCMVEXGXYUFD3SO3AYV2R/graph.json","events_json":"https://pith.science/api/pith-number/SB7KDGCMVEXGXYUFD3SO3AYV2R/events.json","paper":"https://pith.science/paper/SB7KDGCM"},"agent_actions":{"view_html":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R","download_json":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R.json","view_paper":"https://pith.science/paper/SB7KDGCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.17745&json=true","fetch_graph":"https://pith.science/api/pith-number/SB7KDGCMVEXGXYUFD3SO3AYV2R/graph.json","fetch_events":"https://pith.science/api/pith-number/SB7KDGCMVEXGXYUFD3SO3AYV2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R/action/storage_attestation","attest_author":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R/action/author_attestation","sign_citation":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R/action/citation_signature","submit_replication":"https://pith.science/pith/SB7KDGCMVEXGXYUFD3SO3AYV2R/action/replication_record"}},"created_at":"2026-07-05T09:16:21.878902+00:00","updated_at":"2026-07-05T09:16:21.878902+00:00"}