{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JDQSDU32B3FWD2QHP7T24W3LHN","short_pith_number":"pith:JDQSDU32","schema_version":"1.0","canonical_sha256":"48e121d37a0ecb61ea077fe7ae5b6b3b65a638dc11448c5faa2f076dd7840ab4","source":{"kind":"arxiv","id":"2505.19334","version":1},"attestation_state":"computed","paper":{"title":"Likert or Not: LLM Absolute Relevance Judgments on Fine-Grained Ordinal Scales","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Charles Godfrey, David Ken, Natalia Ostapuk, Ping Nie, Shang Gao, Souheil Inati","submitted_at":"2025-05-25T21:41:35Z","abstract_excerpt":"Large language models (LLMs) obtain state of the art zero shot relevance ranking performance on a variety of information retrieval tasks. The two most common prompts to elicit LLM relevance judgments are pointwise scoring (a.k.a. relevance generation), where the LLM sees a single query-document pair and outputs a single relevance score, and listwise ranking (a.k.a. permutation generation), where the LLM sees a query and a list of documents and outputs a permutation, sorting the documents in decreasing order of relevance. The current research community consensus is that listwise ranking yields "},"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":"2505.19334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-25T21:41:35Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"bbd22af7384b4a3e334836d9d0d015ecfc0cd8bf4d78706aba2c0d786a03907f","abstract_canon_sha256":"af98e5ce392e93cc940f04398904abfb5e477843bda610816456747c17600373"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:28.583550Z","signature_b64":"6fLaTiW2p8bb65JMYDA5+JghAZOTgvOdZ/i5iSGCOkHV+KjHFmYrTaI/szNyd+pdc/8UeBn9flo/FfsQvqBiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48e121d37a0ecb61ea077fe7ae5b6b3b65a638dc11448c5faa2f076dd7840ab4","last_reissued_at":"2026-07-05T11:09:28.583033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:28.583033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Likert or Not: LLM Absolute Relevance Judgments on Fine-Grained Ordinal Scales","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Charles Godfrey, David Ken, Natalia Ostapuk, Ping Nie, Shang Gao, Souheil Inati","submitted_at":"2025-05-25T21:41:35Z","abstract_excerpt":"Large language models (LLMs) obtain state of the art zero shot relevance ranking performance on a variety of information retrieval tasks. The two most common prompts to elicit LLM relevance judgments are pointwise scoring (a.k.a. relevance generation), where the LLM sees a single query-document pair and outputs a single relevance score, and listwise ranking (a.k.a. permutation generation), where the LLM sees a query and a list of documents and outputs a permutation, sorting the documents in decreasing order of relevance. The current research community consensus is that listwise ranking yields "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19334","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/2505.19334/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":"2505.19334","created_at":"2026-07-05T11:09:28.583090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19334v1","created_at":"2026-07-05T11:09:28.583090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19334","created_at":"2026-07-05T11:09:28.583090+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDQSDU32B3FW","created_at":"2026-07-05T11:09:28.583090+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDQSDU32B3FWD2QH","created_at":"2026-07-05T11:09:28.583090+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDQSDU32","created_at":"2026-07-05T11:09:28.583090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09542","citing_title":"LLM-Guided Monte Carlo Tree Search over Knowledge Graphs: Composing Mechanistic Explanations for Drug-Disease Pairs","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN","json":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN.json","graph_json":"https://pith.science/api/pith-number/JDQSDU32B3FWD2QHP7T24W3LHN/graph.json","events_json":"https://pith.science/api/pith-number/JDQSDU32B3FWD2QHP7T24W3LHN/events.json","paper":"https://pith.science/paper/JDQSDU32"},"agent_actions":{"view_html":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN","download_json":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN.json","view_paper":"https://pith.science/paper/JDQSDU32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19334&json=true","fetch_graph":"https://pith.science/api/pith-number/JDQSDU32B3FWD2QHP7T24W3LHN/graph.json","fetch_events":"https://pith.science/api/pith-number/JDQSDU32B3FWD2QHP7T24W3LHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN/action/storage_attestation","attest_author":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN/action/author_attestation","sign_citation":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN/action/citation_signature","submit_replication":"https://pith.science/pith/JDQSDU32B3FWD2QHP7T24W3LHN/action/replication_record"}},"created_at":"2026-07-05T11:09:28.583090+00:00","updated_at":"2026-07-05T11:09:28.583090+00:00"}