{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IUKRH6FGUTUWRR6Y3KF4XZWLCG","short_pith_number":"pith:IUKRH6FG","schema_version":"1.0","canonical_sha256":"451513f8a6a4e968c7d8da8bcbe6cb11a011c0cf2aea50f67bc0664db02f23c9","source":{"kind":"arxiv","id":"2411.12064","version":3},"attestation_state":"computed","paper":{"title":"TSPRank: Bridging Pairwise and Listwise Methods with a Bilinear Travelling Salesman Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Shay B. Cohen, Tiejun Ma, Weixian Waylon Li, Yftah Ziser, Yifei Xie","submitted_at":"2024-11-18T21:10:14Z","abstract_excerpt":"Traditional Learning-To-Rank (LETOR) approaches, including pairwise methods like RankNet and LambdaMART, often fall short by solely focusing on pairwise comparisons, leading to sub-optimal global rankings. Conversely, deep learning based listwise methods, while aiming to optimise entire lists, require complex tuning and yield only marginal improvements over robust pairwise models. To overcome these limitations, we introduce Travelling Salesman Problem Rank (TSPRank), a hybrid pairwise-listwise ranking method. TSPRank reframes the ranking problem as a Travelling Salesman Problem (TSP), a well-k"},"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":"2411.12064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-18T21:10:14Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"fcb083d4e2ba54c29661e281da71d5f7af57742febed6c5114c6bc746446c3ac","abstract_canon_sha256":"0524a49050905c56149ea2d733419f6a327a6505e21f349f892ec90dce92ff71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:37.614576Z","signature_b64":"Af4Kyy62Xsgq6mwgbEt3xw4vFAjJOxmd2lAU6HtkUqEOKK3ViQR9Sh5+FU0Sse3ykZJ4SEdQBsmPX4n5v+c9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451513f8a6a4e968c7d8da8bcbe6cb11a011c0cf2aea50f67bc0664db02f23c9","last_reissued_at":"2026-07-05T10:37:37.614003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:37.614003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TSPRank: Bridging Pairwise and Listwise Methods with a Bilinear Travelling Salesman Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Shay B. Cohen, Tiejun Ma, Weixian Waylon Li, Yftah Ziser, Yifei Xie","submitted_at":"2024-11-18T21:10:14Z","abstract_excerpt":"Traditional Learning-To-Rank (LETOR) approaches, including pairwise methods like RankNet and LambdaMART, often fall short by solely focusing on pairwise comparisons, leading to sub-optimal global rankings. Conversely, deep learning based listwise methods, while aiming to optimise entire lists, require complex tuning and yield only marginal improvements over robust pairwise models. To overcome these limitations, we introduce Travelling Salesman Problem Rank (TSPRank), a hybrid pairwise-listwise ranking method. TSPRank reframes the ranking problem as a Travelling Salesman Problem (TSP), a well-k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12064","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/2411.12064/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":"2411.12064","created_at":"2026-07-05T10:37:37.614066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.12064v3","created_at":"2026-07-05T10:37:37.614066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12064","created_at":"2026-07-05T10:37:37.614066+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUKRH6FGUTUW","created_at":"2026-07-05T10:37:37.614066+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUKRH6FGUTUWRR6Y","created_at":"2026-07-05T10:37:37.614066+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUKRH6FG","created_at":"2026-07-05T10:37:37.614066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16746","citing_title":"Pre-training Time Series Models with Stock Data Customization","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG","json":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG.json","graph_json":"https://pith.science/api/pith-number/IUKRH6FGUTUWRR6Y3KF4XZWLCG/graph.json","events_json":"https://pith.science/api/pith-number/IUKRH6FGUTUWRR6Y3KF4XZWLCG/events.json","paper":"https://pith.science/paper/IUKRH6FG"},"agent_actions":{"view_html":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG","download_json":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG.json","view_paper":"https://pith.science/paper/IUKRH6FG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.12064&json=true","fetch_graph":"https://pith.science/api/pith-number/IUKRH6FGUTUWRR6Y3KF4XZWLCG/graph.json","fetch_events":"https://pith.science/api/pith-number/IUKRH6FGUTUWRR6Y3KF4XZWLCG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG/action/storage_attestation","attest_author":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG/action/author_attestation","sign_citation":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG/action/citation_signature","submit_replication":"https://pith.science/pith/IUKRH6FGUTUWRR6Y3KF4XZWLCG/action/replication_record"}},"created_at":"2026-07-05T10:37:37.614066+00:00","updated_at":"2026-07-05T10:37:37.614066+00:00"}