{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QGEFPQMOVB3UIEG75EHLFCDS3S","short_pith_number":"pith:QGEFPQMO","canonical_record":{"source":{"id":"1005.5197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-05-28T00:37:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4b729b21d9a31a3b150ec2e77005c34ea395490e3580106714084b4594832097","abstract_canon_sha256":"b3a0ac8940413b6b7964258b3bfae34c310b6e9b76072cced89becaef6c05f55"},"schema_version":"1.0"},"canonical_sha256":"818857c18ea8774410dfe90eb28872dcac1ef0fdc8d46c3a4308b95fe0fe993a","source":{"kind":"arxiv","id":"1005.5197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5197","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5197v2","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5197","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"QGEFPQMOVB3U","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QGEFPQMOVB3UIEG7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QGEFPQMO","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QGEFPQMOVB3UIEG75EHLFCDS3S","target":"record","payload":{"canonical_record":{"source":{"id":"1005.5197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-05-28T00:37:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4b729b21d9a31a3b150ec2e77005c34ea395490e3580106714084b4594832097","abstract_canon_sha256":"b3a0ac8940413b6b7964258b3bfae34c310b6e9b76072cced89becaef6c05f55"},"schema_version":"1.0"},"canonical_sha256":"818857c18ea8774410dfe90eb28872dcac1ef0fdc8d46c3a4308b95fe0fe993a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:32.054004Z","signature_b64":"lxvklNeZWL91cX9CAE8m5P9jx2blVtqr3Y7zcQa2Ka0crwNxlKktk4cl0N+llOkin3ULocWv3xTb5NxcayICBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"818857c18ea8774410dfe90eb28872dcac1ef0fdc8d46c3a4308b95fe0fe993a","last_reissued_at":"2026-05-18T03:46:32.053020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:32.053020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.5197","source_version":2,"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-18T03:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyXBoMAIDdjytcordWQHbgnRy9fMLCCUnXVznWDKLFUgKqFA1o7vf23wkP9pCdwxEFs/AggyZFORe6Zt9GY1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:50:38.632674Z"},"content_sha256":"8af842e99925934f13f18edaa63649f98d7f8009944ae490374af3dd442aa89c","schema_version":"1.0","event_id":"sha256:8af842e99925934f13f18edaa63649f98d7f8009944ae490374af3dd442aa89c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QGEFPQMOVB3UIEG75EHLFCDS3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranked bandits in metric spaces: learning optimally diverse rankings over large document collections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi","submitted_at":"2010-05-28T00:37:22Z","abstract_excerpt":"Most learning to rank research has assumed that the utility of different documents is independent, which results in learned ranking functions that return redundant results. The few approaches that avoid this have rather unsatisfyingly lacked theoretical foundations, or do not scale. We present a learning-to-rank formulation that optimizes the fraction of satisfied users, with several scalable algorithms that explicitly takes document similarity and ranking context into account. Our formulation is a non-trivial common generalization of two multi-armed bandit models from the literature: \"ranked "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5197","kind":"arxiv","version":2},"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-18T03:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vneIq9L+3CpKEc9RN/bGjfhj4s5sJN4eqOTI1t+fTOFHQ/we3bffnBt6Gw5nc9PqBHLFaiYwbVX+1p+041phDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:50:38.633418Z"},"content_sha256":"d0aab7db07b638f958ff07fc2a7f373da3058a6e63499073a31917708a610ec5","schema_version":"1.0","event_id":"sha256:d0aab7db07b638f958ff07fc2a7f373da3058a6e63499073a31917708a610ec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGEFPQMOVB3UIEG75EHLFCDS3S/bundle.json","state_url":"https://pith.science/pith/QGEFPQMOVB3UIEG75EHLFCDS3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGEFPQMOVB3UIEG75EHLFCDS3S/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-06-12T02:50:38Z","links":{"resolver":"https://pith.science/pith/QGEFPQMOVB3UIEG75EHLFCDS3S","bundle":"https://pith.science/pith/QGEFPQMOVB3UIEG75EHLFCDS3S/bundle.json","state":"https://pith.science/pith/QGEFPQMOVB3UIEG75EHLFCDS3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGEFPQMOVB3UIEG75EHLFCDS3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QGEFPQMOVB3UIEG75EHLFCDS3S","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":"b3a0ac8940413b6b7964258b3bfae34c310b6e9b76072cced89becaef6c05f55","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-05-28T00:37:22Z","title_canon_sha256":"4b729b21d9a31a3b150ec2e77005c34ea395490e3580106714084b4594832097"},"schema_version":"1.0","source":{"id":"1005.5197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5197","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5197v2","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5197","created_at":"2026-05-18T03:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"QGEFPQMOVB3U","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QGEFPQMOVB3UIEG7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QGEFPQMO","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:d0aab7db07b638f958ff07fc2a7f373da3058a6e63499073a31917708a610ec5","target":"graph","created_at":"2026-05-18T03:46:32Z","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":"Most learning to rank research has assumed that the utility of different documents is independent, which results in learned ranking functions that return redundant results. The few approaches that avoid this have rather unsatisfyingly lacked theoretical foundations, or do not scale. We present a learning-to-rank formulation that optimizes the fraction of satisfied users, with several scalable algorithms that explicitly takes document similarity and ranking context into account. Our formulation is a non-trivial common generalization of two multi-armed bandit models from the literature: \"ranked ","authors_text":"Aleksandrs Slivkins, Filip Radlinski, Sreenivas Gollapudi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-05-28T00:37:22Z","title":"Ranked bandits in metric spaces: learning optimally diverse rankings over large document collections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5197","kind":"arxiv","version":2},"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:8af842e99925934f13f18edaa63649f98d7f8009944ae490374af3dd442aa89c","target":"record","created_at":"2026-05-18T03:46:32Z","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":"b3a0ac8940413b6b7964258b3bfae34c310b6e9b76072cced89becaef6c05f55","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-05-28T00:37:22Z","title_canon_sha256":"4b729b21d9a31a3b150ec2e77005c34ea395490e3580106714084b4594832097"},"schema_version":"1.0","source":{"id":"1005.5197","kind":"arxiv","version":2}},"canonical_sha256":"818857c18ea8774410dfe90eb28872dcac1ef0fdc8d46c3a4308b95fe0fe993a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"818857c18ea8774410dfe90eb28872dcac1ef0fdc8d46c3a4308b95fe0fe993a","first_computed_at":"2026-05-18T03:46:32.053020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:32.053020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lxvklNeZWL91cX9CAE8m5P9jx2blVtqr3Y7zcQa2Ka0crwNxlKktk4cl0N+llOkin3ULocWv3xTb5NxcayICBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:32.054004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.5197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8af842e99925934f13f18edaa63649f98d7f8009944ae490374af3dd442aa89c","sha256:d0aab7db07b638f958ff07fc2a7f373da3058a6e63499073a31917708a610ec5"],"state_sha256":"8eec3add410f9b544d34b621fef1bcb25a76e5f2f7436256839e1bd7a9135359"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd9MchASVid3eHM/vXWx+xzhcXb67t9YWBVZ2hEMgSZpVkp+SZskZBl+Q7geJNlPzdWhQKk0elp8MtlXet7sAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:50:38.637580Z","bundle_sha256":"535b94a444356b76fafaec0a4e28615be70a72b687ab654ab782194d69f5ea5c"}}