{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XCOK4CUR3CJC4KLMBCN5734FR5","short_pith_number":"pith:XCOK4CUR","canonical_record":{"source":{"id":"1901.10262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-01-29T13:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"85d04fce7cc96882d22a5f9b13f26f60a6d1e904d39577661860725ef98505bf","abstract_canon_sha256":"103fa77ad23e85f0932c4429aa46640beb8ba85f6252dccf3b9d340269ca2f83"},"schema_version":"1.0"},"canonical_sha256":"b89cae0a91d8922e296c089bdfef858f4b1613056231933404be5e0dc6e49f83","source":{"kind":"arxiv","id":"1901.10262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10262","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10262v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10262","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"XCOK4CUR3CJC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCOK4CUR3CJC4KLM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCOK4CUR","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XCOK4CUR3CJC4KLMBCN5734FR5","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-01-29T13:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"85d04fce7cc96882d22a5f9b13f26f60a6d1e904d39577661860725ef98505bf","abstract_canon_sha256":"103fa77ad23e85f0932c4429aa46640beb8ba85f6252dccf3b9d340269ca2f83"},"schema_version":"1.0"},"canonical_sha256":"b89cae0a91d8922e296c089bdfef858f4b1613056231933404be5e0dc6e49f83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:15.729000Z","signature_b64":"nkLyhmy216f+vtCwZPtDYypNiQAGarQZyZcnxo23RUYV908yelftngLuCJst9+AFZilxOoKBzbZPIWe4WT5PBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89cae0a91d8922e296c089bdfef858f4b1613056231933404be5e0dc6e49f83","last_reissued_at":"2026-05-17T23:55:15.728491Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:15.728491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10262","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-17T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsQzL0+Th9W4GCCY2/CDdPO1Wvp5Wua4wjFYcnwqMJRhJiWsf2zMjptxx3EN5cl82Uim5dBTY8g2RbVJ1mWQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:44.037754Z"},"content_sha256":"144ab444f2df830fe03cb9cadeb68b4d443c291e9b3a67f3a565d93396aa11be","schema_version":"1.0","event_id":"sha256:144ab444f2df830fe03cb9cadeb68b4d443c291e9b3a67f3a565d93396aa11be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XCOK4CUR3CJC4KLMBCN5734FR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Ranking Models in an Online Setting","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":"2019-01-29T13:04:54Z","abstract_excerpt":"Online Learning to Rank (OLTR) methods optimize ranking models by directly interacting with users, which allows them to be very efficient and responsive. All OLTR methods introduced during the past decade have extended on the original OLTR method: Dueling Bandit Gradient Descent (DBGD). Recently, a fundamentally different approach was introduced with the Pairwise Differentiable Gradient Descent (PDGD) algorithm. To date the only comparisons of the two approaches are limited to simulations with cascading click models and low levels of noise. The main outcome so far is that PDGD converges at hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10262","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-17T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoS3FM15RrQtmdw9AjNF+GtKr5mWclEBnbKk3PuMue1RNhqegrhx4OGABy9UF02q0AwJkvLbLefCUlNIsVCvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:44.038091Z"},"content_sha256":"a44a36406494b4901e99623c24e376902e49641b2a344ac15d08c8e78c49cfaf","schema_version":"1.0","event_id":"sha256:a44a36406494b4901e99623c24e376902e49641b2a344ac15d08c8e78c49cfaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCOK4CUR3CJC4KLMBCN5734FR5/bundle.json","state_url":"https://pith.science/pith/XCOK4CUR3CJC4KLMBCN5734FR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCOK4CUR3CJC4KLMBCN5734FR5/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:44Z","links":{"resolver":"https://pith.science/pith/XCOK4CUR3CJC4KLMBCN5734FR5","bundle":"https://pith.science/pith/XCOK4CUR3CJC4KLMBCN5734FR5/bundle.json","state":"https://pith.science/pith/XCOK4CUR3CJC4KLMBCN5734FR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCOK4CUR3CJC4KLMBCN5734FR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XCOK4CUR3CJC4KLMBCN5734FR5","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":"103fa77ad23e85f0932c4429aa46640beb8ba85f6252dccf3b9d340269ca2f83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-01-29T13:04:54Z","title_canon_sha256":"85d04fce7cc96882d22a5f9b13f26f60a6d1e904d39577661860725ef98505bf"},"schema_version":"1.0","source":{"id":"1901.10262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10262","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10262v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10262","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"XCOK4CUR3CJC","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCOK4CUR3CJC4KLM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCOK4CUR","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:a44a36406494b4901e99623c24e376902e49641b2a344ac15d08c8e78c49cfaf","target":"graph","created_at":"2026-05-17T23:55:15Z","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":"Online Learning to Rank (OLTR) methods optimize ranking models by directly interacting with users, which allows them to be very efficient and responsive. All OLTR methods introduced during the past decade have extended on the original OLTR method: Dueling Bandit Gradient Descent (DBGD). Recently, a fundamentally different approach was introduced with the Pairwise Differentiable Gradient Descent (PDGD) algorithm. To date the only comparisons of the two approaches are limited to simulations with cascading click models and low levels of noise. The main outcome so far is that PDGD converges at hig","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":"2019-01-29T13:04:54Z","title":"Optimizing Ranking Models in an Online Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10262","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:144ab444f2df830fe03cb9cadeb68b4d443c291e9b3a67f3a565d93396aa11be","target":"record","created_at":"2026-05-17T23:55:15Z","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":"103fa77ad23e85f0932c4429aa46640beb8ba85f6252dccf3b9d340269ca2f83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-01-29T13:04:54Z","title_canon_sha256":"85d04fce7cc96882d22a5f9b13f26f60a6d1e904d39577661860725ef98505bf"},"schema_version":"1.0","source":{"id":"1901.10262","kind":"arxiv","version":1}},"canonical_sha256":"b89cae0a91d8922e296c089bdfef858f4b1613056231933404be5e0dc6e49f83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89cae0a91d8922e296c089bdfef858f4b1613056231933404be5e0dc6e49f83","first_computed_at":"2026-05-17T23:55:15.728491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:15.728491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nkLyhmy216f+vtCwZPtDYypNiQAGarQZyZcnxo23RUYV908yelftngLuCJst9+AFZilxOoKBzbZPIWe4WT5PBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:15.729000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:144ab444f2df830fe03cb9cadeb68b4d443c291e9b3a67f3a565d93396aa11be","sha256:a44a36406494b4901e99623c24e376902e49641b2a344ac15d08c8e78c49cfaf"],"state_sha256":"f73bfba0242951f24d5cbf9348a8be3fa12d5253fa9e71385d29580f9e981913"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtqJlLgtTgv6qJed6aLX+NRckOzh27FyyduBAF029K3xlhBjZ6e9ZxS0wrk7QFfIgwj75kREf5K4Fdz65SDsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:07:44.040077Z","bundle_sha256":"46a7041d05413b87fadd2e69b66de20117381d07f4aa26df294902fe9cb7915e"}}