{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A7ZSDZBHWIYNDXORQX3M2AQE4W","short_pith_number":"pith:A7ZSDZBH","canonical_record":{"source":{"id":"1711.09446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-26T19:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"296b18ee806ad49173bda18e9b85fc3c31aad9196dc093f01f2dd4aeaddbcc1d","abstract_canon_sha256":"63699074bf424d21f02f08f9eac06be852fbf3496241c80658fd9b3d9f589a53"},"schema_version":"1.0"},"canonical_sha256":"07f321e427b230d1ddd185f6cd0204e59971bf8dacfdea21391b4dba613ec739","source":{"kind":"arxiv","id":"1711.09446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09446","created_at":"2026-05-18T00:29:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09446v1","created_at":"2026-05-18T00:29:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09446","created_at":"2026-05-18T00:29:35Z"},{"alias_kind":"pith_short_12","alias_value":"A7ZSDZBHWIYN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A7ZSDZBHWIYNDXOR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A7ZSDZBH","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A7ZSDZBHWIYNDXORQX3M2AQE4W","target":"record","payload":{"canonical_record":{"source":{"id":"1711.09446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-26T19:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"296b18ee806ad49173bda18e9b85fc3c31aad9196dc093f01f2dd4aeaddbcc1d","abstract_canon_sha256":"63699074bf424d21f02f08f9eac06be852fbf3496241c80658fd9b3d9f589a53"},"schema_version":"1.0"},"canonical_sha256":"07f321e427b230d1ddd185f6cd0204e59971bf8dacfdea21391b4dba613ec739","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:35.538966Z","signature_b64":"ahQIaoh9GTVCyUzp6j2N03sKJU7bb2fIctVJA3MCD5DmsDcKw5ht3uOPQNuZsk5c//OWsQ8YzricpXz8dH7sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f321e427b230d1ddd185f6cd0204e59971bf8dacfdea21391b4dba613ec739","last_reissued_at":"2026-05-18T00:29:35.538369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:35.538369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.09446","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-18T00:29:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bjqi+/40xSvxLWhaQEpwkYPz1nzRgyGJFCpAsd6kWYL2+c1fK99SfTSzmH6+UpBLRfDdx7WP71YAN5tqDYRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:58.592710Z"},"content_sha256":"08ca9c4b293f4ed95c1397fae76c778c09ff029a0d353cc0859279e5d4fb4143","schema_version":"1.0","event_id":"sha256:08ca9c4b293f4ed95c1397fae76c778c09ff029a0d353cc0859279e5d4fb4143"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A7ZSDZBHWIYNDXORQX3M2AQE4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balancing Speed and Quality in Online Learning to Rank for Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Harrie Oosterhuis, Maarten de Rijke","submitted_at":"2017-11-26T19:56:19Z","abstract_excerpt":"In Online Learning to Rank (OLTR) the aim is to find an optimal ranking model by interacting with users. When learning from user behavior, systems must interact with users while simultaneously learning from those interactions. Unlike other Learning to Rank (LTR) settings, existing research in this field has been limited to linear models. This is due to the speed-quality tradeoff that arises when selecting models: complex models are more expressive and can find the best rankings but need more user interactions to do so, a requirement that risks frustrating users during training. Conversely, sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09446","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-18T00:29:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7N5o0brMDXNOuPEEd+EOM2XlluhixSiS5bhjmJEGonvWZwiKsOQ9N56uuiGKKfnLrSNa0tYxTDSMFUQF/skqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:58.593056Z"},"content_sha256":"da92d423e2c57c46d29cfb81ce611c9cb3a70fda066f4ac7bf0e82eb44b3c2f0","schema_version":"1.0","event_id":"sha256:da92d423e2c57c46d29cfb81ce611c9cb3a70fda066f4ac7bf0e82eb44b3c2f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W/bundle.json","state_url":"https://pith.science/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W/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-05T14:07:58Z","links":{"resolver":"https://pith.science/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W","bundle":"https://pith.science/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W/bundle.json","state":"https://pith.science/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7ZSDZBHWIYNDXORQX3M2AQE4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A7ZSDZBHWIYNDXORQX3M2AQE4W","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":"63699074bf424d21f02f08f9eac06be852fbf3496241c80658fd9b3d9f589a53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-26T19:56:19Z","title_canon_sha256":"296b18ee806ad49173bda18e9b85fc3c31aad9196dc093f01f2dd4aeaddbcc1d"},"schema_version":"1.0","source":{"id":"1711.09446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09446","created_at":"2026-05-18T00:29:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09446v1","created_at":"2026-05-18T00:29:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09446","created_at":"2026-05-18T00:29:35Z"},{"alias_kind":"pith_short_12","alias_value":"A7ZSDZBHWIYN","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A7ZSDZBHWIYNDXOR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A7ZSDZBH","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:da92d423e2c57c46d29cfb81ce611c9cb3a70fda066f4ac7bf0e82eb44b3c2f0","target":"graph","created_at":"2026-05-18T00:29:35Z","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":"In Online Learning to Rank (OLTR) the aim is to find an optimal ranking model by interacting with users. When learning from user behavior, systems must interact with users while simultaneously learning from those interactions. Unlike other Learning to Rank (LTR) settings, existing research in this field has been limited to linear models. This is due to the speed-quality tradeoff that arises when selecting models: complex models are more expressive and can find the best rankings but need more user interactions to do so, a requirement that risks frustrating users during training. Conversely, sim","authors_text":"Harrie Oosterhuis, Maarten de Rijke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-26T19:56:19Z","title":"Balancing Speed and Quality in Online Learning to Rank for Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09446","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:08ca9c4b293f4ed95c1397fae76c778c09ff029a0d353cc0859279e5d4fb4143","target":"record","created_at":"2026-05-18T00:29:35Z","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":"63699074bf424d21f02f08f9eac06be852fbf3496241c80658fd9b3d9f589a53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-26T19:56:19Z","title_canon_sha256":"296b18ee806ad49173bda18e9b85fc3c31aad9196dc093f01f2dd4aeaddbcc1d"},"schema_version":"1.0","source":{"id":"1711.09446","kind":"arxiv","version":1}},"canonical_sha256":"07f321e427b230d1ddd185f6cd0204e59971bf8dacfdea21391b4dba613ec739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07f321e427b230d1ddd185f6cd0204e59971bf8dacfdea21391b4dba613ec739","first_computed_at":"2026-05-18T00:29:35.538369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:35.538369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ahQIaoh9GTVCyUzp6j2N03sKJU7bb2fIctVJA3MCD5DmsDcKw5ht3uOPQNuZsk5c//OWsQ8YzricpXz8dH7sBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:35.538966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08ca9c4b293f4ed95c1397fae76c778c09ff029a0d353cc0859279e5d4fb4143","sha256:da92d423e2c57c46d29cfb81ce611c9cb3a70fda066f4ac7bf0e82eb44b3c2f0"],"state_sha256":"385a952784b229217d602039758701495f24b146282b386351265b6697048ea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fhUM49SBj90k5pH1vg9N1LPFJzXMy05snp72qJeFoc41buCDzbVRsv+TpVRmc4sVanX+ebghGrdKcXdk/8P3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:07:58.594985Z","bundle_sha256":"b6645c65ff66b6b647becb0158a2c9638093c7af519be39ef339f80088ad30fc"}}