{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VMI2UUSP7FK6C6C55THKTMSTPW","short_pith_number":"pith:VMI2UUSP","schema_version":"1.0","canonical_sha256":"ab11aa524ff955e1785deccea9b2537daf7a77397a85e23087af0e6c62cd16e0","source":{"kind":"arxiv","id":"2501.07111","version":1},"attestation_state":"computed","paper":{"title":"ListConRanker: A Contrastive Text Reranker with Listwise Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Junhao Zheng, Junlong Liu, Qianli Ma, Ruihui Zhao, Yangyang Kang, Yue Ma","submitted_at":"2025-01-13T07:51:46Z","abstract_excerpt":"Reranker models aim to re-rank the passages based on the semantics similarity between the given query and passages, which have recently received more attention due to the wide application of the Retrieval-Augmented Generation. Most previous methods apply pointwise encoding, meaning that it can only encode the context of the query for each passage input into the model. However, for the reranker model, given a query, the comparison results between passages are even more important, which is called listwise encoding. Besides, previous models are trained using the cross-entropy loss function, which"},"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":"2501.07111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-01-13T07:51:46Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"3a4b58734db6bd40cf1ec2ff89047cb30272faeae2d38dea35ac7c3376807702","abstract_canon_sha256":"801013537bf4c0c4f8fbdecbc56187538096be15d8dcf83725060acaad94d704"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:15.468245Z","signature_b64":"b+tFdySs37qsL3nNAZvS9hsxrtiVRv5LyIawlNXiT5T/FoBDuxOFb9vf/R35tdSEXLbmurqfGbK3OsmA1GlDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab11aa524ff955e1785deccea9b2537daf7a77397a85e23087af0e6c62cd16e0","last_reissued_at":"2026-07-05T10:00:15.467657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:15.467657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ListConRanker: A Contrastive Text Reranker with Listwise Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Junhao Zheng, Junlong Liu, Qianli Ma, Ruihui Zhao, Yangyang Kang, Yue Ma","submitted_at":"2025-01-13T07:51:46Z","abstract_excerpt":"Reranker models aim to re-rank the passages based on the semantics similarity between the given query and passages, which have recently received more attention due to the wide application of the Retrieval-Augmented Generation. Most previous methods apply pointwise encoding, meaning that it can only encode the context of the query for each passage input into the model. However, for the reranker model, given a query, the comparison results between passages are even more important, which is called listwise encoding. Besides, previous models are trained using the cross-entropy loss function, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07111","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/2501.07111/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":"2501.07111","created_at":"2026-07-05T10:00:15.467736+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07111v1","created_at":"2026-07-05T10:00:15.467736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07111","created_at":"2026-07-05T10:00:15.467736+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMI2UUSP7FK6","created_at":"2026-07-05T10:00:15.467736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMI2UUSP7FK6C6C5","created_at":"2026-07-05T10:00:15.467736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMI2UUSP","created_at":"2026-07-05T10:00:15.467736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00520","citing_title":"ERank: Fusing Supervised Fine-Tuning and Reinforcement Learning for Effective and Efficient Text Reranking","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW","json":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW.json","graph_json":"https://pith.science/api/pith-number/VMI2UUSP7FK6C6C55THKTMSTPW/graph.json","events_json":"https://pith.science/api/pith-number/VMI2UUSP7FK6C6C55THKTMSTPW/events.json","paper":"https://pith.science/paper/VMI2UUSP"},"agent_actions":{"view_html":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW","download_json":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW.json","view_paper":"https://pith.science/paper/VMI2UUSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07111&json=true","fetch_graph":"https://pith.science/api/pith-number/VMI2UUSP7FK6C6C55THKTMSTPW/graph.json","fetch_events":"https://pith.science/api/pith-number/VMI2UUSP7FK6C6C55THKTMSTPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW/action/storage_attestation","attest_author":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW/action/author_attestation","sign_citation":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW/action/citation_signature","submit_replication":"https://pith.science/pith/VMI2UUSP7FK6C6C55THKTMSTPW/action/replication_record"}},"created_at":"2026-07-05T10:00:15.467736+00:00","updated_at":"2026-07-05T10:00:15.467736+00:00"}