{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3K7TAPO4JLMFWY3TLJ7LA3ZLCT","short_pith_number":"pith:3K7TAPO4","canonical_record":{"source":{"id":"1806.02248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728","abstract_canon_sha256":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021"},"schema_version":"1.0"},"canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","source":{"kind":"arxiv","id":"1806.02248","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02248","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02248v2","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02248","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"3K7TAPO4JLMF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3K7TAPO4JLMFWY3T","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3K7TAPO4","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3K7TAPO4JLMFWY3TLJ7LA3ZLCT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728","abstract_canon_sha256":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021"},"schema_version":"1.0"},"canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:59.629653Z","signature_b64":"1m4UrnYAGtND8UGA9PNic0FJVUUQ4raYSkU1am0aKtfBcYYjG6y7pEOakyUAXtcf6CbnjiZvWVNWxVEx2+YNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","last_reissued_at":"2026-05-17T23:50:59.628826Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:59.628826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02248","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-17T23:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UopPoKcju7+iBdWihp+dqN9M2QhnbasuyH07qrgq82GO7xms/1kRUMwIpwJKBQtW4alHxWRi0n8/VlHF54kWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:27:54.140854Z"},"content_sha256":"8a2c61d4653fd867c0e7f24bf4aa587b28f9ba9e759da45db98483d2c43903de","schema_version":"1.0","event_id":"sha256:8a2c61d4653fd867c0e7f24bf4aa587b28f9ba9e759da45db98483d2c43903de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3K7TAPO4JLMFWY3TLJ7LA3ZLCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TopRank: A practical algorithm for online stochastic ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Branislav Kveton, Csaba Szepesvari, Shuai Li, Tor Lattimore","submitted_at":"2018-06-06T15:33:08Z","abstract_excerpt":"Online learning to rank is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms have been proposed for this problem that assume a specific click model connecting rankings and user behavior. We propose a generalized click model that encompasses many existing models, including the position-based and cascade models. Our generalization motivates a novel online learning algorithm based on topological sort, which we call TopRank. TopRank is (a) more natural than "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02248","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-17T23:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vpy/1ZhQ7iOlRY3TUGjhbciCHwTEq7/9xnZYqDHmhrmbJV1pDW+BfwUx7dWvJX3lAdHFSA0tdmDmGg4WbV2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:27:54.141248Z"},"content_sha256":"6d46a6b79adaab9c5efe9d0dc9048d9520a307f73f8deb166fad2745df826c0a","schema_version":"1.0","event_id":"sha256:6d46a6b79adaab9c5efe9d0dc9048d9520a307f73f8deb166fad2745df826c0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/bundle.json","state_url":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/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-31T22:27:54Z","links":{"resolver":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT","bundle":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/bundle.json","state":"https://pith.science/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3K7TAPO4JLMFWY3TLJ7LA3ZLCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3K7TAPO4JLMFWY3TLJ7LA3ZLCT","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":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728"},"schema_version":"1.0","source":{"id":"1806.02248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02248","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02248v2","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02248","created_at":"2026-05-17T23:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"3K7TAPO4JLMF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3K7TAPO4JLMFWY3T","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3K7TAPO4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:6d46a6b79adaab9c5efe9d0dc9048d9520a307f73f8deb166fad2745df826c0a","target":"graph","created_at":"2026-05-17T23:50:59Z","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 is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms have been proposed for this problem that assume a specific click model connecting rankings and user behavior. We propose a generalized click model that encompasses many existing models, including the position-based and cascade models. Our generalization motivates a novel online learning algorithm based on topological sort, which we call TopRank. TopRank is (a) more natural than ","authors_text":"Branislav Kveton, Csaba Szepesvari, Shuai Li, Tor Lattimore","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","title":"TopRank: A practical algorithm for online stochastic ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02248","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:8a2c61d4653fd867c0e7f24bf4aa587b28f9ba9e759da45db98483d2c43903de","target":"record","created_at":"2026-05-17T23:50:59Z","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":"f5e272628dd6892fe45fd050c6c67c0f1cd110b693cb3216225ee2ed5f184021","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:33:08Z","title_canon_sha256":"e6fdc405df41af80cd77e20a6dcb76091aef5fb98ac05207ead2c204bb3e9728"},"schema_version":"1.0","source":{"id":"1806.02248","kind":"arxiv","version":2}},"canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dabf303ddc4ad85b63735a7eb06f2b14f30e85b2a6f9f2d9464876d507f6aa67","first_computed_at":"2026-05-17T23:50:59.628826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:59.628826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1m4UrnYAGtND8UGA9PNic0FJVUUQ4raYSkU1am0aKtfBcYYjG6y7pEOakyUAXtcf6CbnjiZvWVNWxVEx2+YNCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:59.629653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a2c61d4653fd867c0e7f24bf4aa587b28f9ba9e759da45db98483d2c43903de","sha256:6d46a6b79adaab9c5efe9d0dc9048d9520a307f73f8deb166fad2745df826c0a"],"state_sha256":"0654dc256ef76a581fbd8e2a1f44a2d83e167b8bf29ba7ae0f47de103c48814e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/YwzrFMl8dx7T9hzqn3DDfVT3VdO1COCe8yD2cQ7hRWqrisotivzhcJO2MoaJ4v7Ci2cllw64X8jx3HTJvFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:27:54.144860Z","bundle_sha256":"ebcfe57b627fc971bd94f4dc4d17a1b221df8d62effb703db5ff282a658cae55"}}