{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5GPANPYKSRYPVTXQ5NHSPFXGJV","short_pith_number":"pith:5GPANPYK","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"},"canonical_sha256":"e99e06bf0a9470facef0eb4f2796e64d65f64d2f393ca124870c2b2127c9760a","source":{"kind":"arxiv","id":"1603.01860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01860","created_at":"2026-05-18T01:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01860v1","created_at":"2026-05-18T01:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01860","created_at":"2026-05-18T01:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"5GPANPYKSRYP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5GPANPYKSRYPVTXQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5GPANPYK","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5GPANPYKSRYPVTXQ5NHSPFXGJV","target":"record","payload":{"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"},"canonical_sha256":"e99e06bf0a9470facef0eb4f2796e64d65f64d2f393ca124870c2b2127c9760a","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"},"source_kind":"arxiv","source_id":"1603.01860","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndxkdGLddjaocRuxGXKWytxXpFrTuExIcgxFtfcLtn5lecaPZdnlnKOb6WtH7smLtYDROGnJq6zpkE4J5PLzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:29.205792Z"},"content_sha256":"933d7a5d44cec776f8c22e596a0e28954e17d63e83365f914347c4f858bb56af","schema_version":"1.0","event_id":"sha256:933d7a5d44cec776f8c22e596a0e28954e17d63e83365f914347c4f858bb56af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5GPANPYKSRYPVTXQ5NHSPFXGJV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/WQb9BaKSUlGUqsRAiKV1SvTJJzQsWBJm+MqquTXcCDKRreA8D8p060mqbl6UZwEl7nkHuZGRxC2+Y99YTvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:29.206554Z"},"content_sha256":"9ca6aa49746fd6439e89f90434473ba0b664752f2bafe009812a7d6b3cdc6db1","schema_version":"1.0","event_id":"sha256:9ca6aa49746fd6439e89f90434473ba0b664752f2bafe009812a7d6b3cdc6db1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/bundle.json","state_url":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T20:09:29Z","links":{"resolver":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV","bundle":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/bundle.json","state":"https://pith.science/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GPANPYKSRYPVTXQ5NHSPFXGJV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5GPANPYKSRYPVTXQ5NHSPFXGJV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d5d9d896b3d113b2da7100e195b6e0e3ada1cff8cf78f5b89b25c7eb5f39f931","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T19:01:53Z","title_canon_sha256":"e321d28f9ab14ecfd4b9dee312cf300ffccd8add7316c19568bc5fab680b883d"},"schema_version":"1.0","source":{"id":"1603.01860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01860","created_at":"2026-05-18T01:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01860v1","created_at":"2026-05-18T01:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01860","created_at":"2026-05-18T01:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"5GPANPYKSRYP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5GPANPYKSRYPVTXQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5GPANPYK","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:9ca6aa49746fd6439e89f90434473ba0b664752f2bafe009812a7d6b3cdc6db1","target":"graph","created_at":"2026-05-18T01:08:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ambuj Tewari, Sougata Chaudhuri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T19:01:53Z","title":"Generalization error bounds for learning to rank: Does the length of document lists matter?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01860","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:933d7a5d44cec776f8c22e596a0e28954e17d63e83365f914347c4f858bb56af","target":"record","created_at":"2026-05-18T01:08:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d5d9d896b3d113b2da7100e195b6e0e3ada1cff8cf78f5b89b25c7eb5f39f931","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-06T19:01:53Z","title_canon_sha256":"e321d28f9ab14ecfd4b9dee312cf300ffccd8add7316c19568bc5fab680b883d"},"schema_version":"1.0","source":{"id":"1603.01860","kind":"arxiv","version":1}},"canonical_sha256":"e99e06bf0a9470facef0eb4f2796e64d65f64d2f393ca124870c2b2127c9760a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e99e06bf0a9470facef0eb4f2796e64d65f64d2f393ca124870c2b2127c9760a","first_computed_at":"2026-05-18T01:08:18.231226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:18.231226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mk9rLjMg3szs61t17FFlyhqtgafkVZOAkldJdXU6SrWniDCA9TZIUxykVVgsU2qhRI5p0KdaMGxwocaNuT34Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:18.231926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:933d7a5d44cec776f8c22e596a0e28954e17d63e83365f914347c4f858bb56af","sha256:9ca6aa49746fd6439e89f90434473ba0b664752f2bafe009812a7d6b3cdc6db1"],"state_sha256":"9ce6d7d67a3fca115a19f368b725bc8ed9f7e437a9649ff6b7e2236de15bb443"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xnm3Kqj81j9jmuQ8UIr0nhkDFlYKR2pZ8md9tU/NCwDd4cwoK+dDESTVRPquSnQI24sF3iwMKTrbvJDNvLRQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:29.210388Z","bundle_sha256":"deea1224fe13c99518c15a49f4d294d7c9cf3966d6a314d81290e65d07493741"}}