{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5GPANPYKSRYPVTXQ5NHSPFXGJV","short_pith_number":"pith:5GPANPYK","schema_version":"1.0","canonical_sha256":"e99e06bf0a9470facef0eb4f2796e64d65f64d2f393ca124870c2b2127c9760a","source":{"kind":"arxiv","id":"1603.01860","version":1},"attestation_state":"computed","paper":{"title":"Generalization error bounds for learning to rank: Does the length of document lists matter?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Sougata Chaudhuri","submitted_at":"2016-03-06T19:01:53Z","abstract_excerpt":"We consider the generalization ability of algorithms for learning to rank at a query level, a problem also called subset ranking. Existing generalization error bounds necessarily degrade as the size of the document list associated with a query increases. We show that such a degradation is not intrinsic to the problem. For several loss functions, including the cross-entropy loss used in the well known ListNet method, there is \\emph{no} degradation in generalization ability as document lists become longer. We also provide novel generalization error bounds under $\\ell_1$ regularization and faster"},"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":"1603.01860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T19:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"e321d28f9ab14ecfd4b9dee312cf300ffccd8add7316c19568bc5fab680b883d","abstract_canon_sha256":"d5d9d896b3d113b2da7100e195b6e0e3ada1cff8cf78f5b89b25c7eb5f39f931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:18.231926Z","signature_b64":"Mk9rLjMg3szs61t17FFlyhqtgafkVZOAkldJdXU6SrWniDCA9TZIUxykVVgsU2qhRI5p0KdaMGxwocaNuT34Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e99e06bf0a9470facef0eb4f2796e64d65f64d2f393ca124870c2b2127c9760a","last_reissued_at":"2026-05-18T01:08:18.231226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:18.231226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization error bounds for learning to rank: Does the length of document lists matter?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Sougata Chaudhuri","submitted_at":"2016-03-06T19:01:53Z","abstract_excerpt":"We consider the generalization ability of algorithms for learning to rank at a query level, a problem also called subset ranking. Existing generalization error bounds necessarily degrade as the size of the document list associated with a query increases. We show that such a degradation is not intrinsic to the problem. For several loss functions, including the cross-entropy loss used in the well known ListNet method, there is \\emph{no} degradation in generalization ability as document lists become longer. We also provide novel generalization error bounds under $\\ell_1$ regularization and faster"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01860","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":""},"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":"1603.01860","created_at":"2026-05-18T01:08:18.231360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01860v1","created_at":"2026-05-18T01:08:18.231360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01860","created_at":"2026-05-18T01:08:18.231360+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GPANPYKSRYP","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GPANPYKSRYPVTXQ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GPANPYK","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV","json":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV.json","graph_json":"https://pith.science/api/pith-number/5GPANPYKSRYPVTXQ5NHSPFXGJV/graph.json","events_json":"https://pith.science/api/pith-number/5GPANPYKSRYPVTXQ5NHSPFXGJV/events.json","paper":"https://pith.science/paper/5GPANPYK"},"agent_actions":{"view_html":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV","download_json":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV.json","view_paper":"https://pith.science/paper/5GPANPYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01860&json=true","fetch_graph":"https://pith.science/api/pith-number/5GPANPYKSRYPVTXQ5NHSPFXGJV/graph.json","fetch_events":"https://pith.science/api/pith-number/5GPANPYKSRYPVTXQ5NHSPFXGJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/action/storage_attestation","attest_author":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/action/author_attestation","sign_citation":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/action/citation_signature","submit_replication":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/action/replication_record"}},"created_at":"2026-05-18T01:08:18.231360+00:00","updated_at":"2026-05-18T01:08:18.231360+00:00"}