{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YR5MZLPQKWMQKY5VQYILZBLHCM","short_pith_number":"pith:YR5MZLPQ","canonical_record":{"source":{"id":"2203.12577","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-23T17:37:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a87f23f1070d0716aba35270a837d35e597ff247b0287c4f1b8883adbbb6cc26","abstract_canon_sha256":"2750bf028370d8d429fc04df55f1f1ab8e570e7f68dec04098e4a1e9da3f69fe"},"schema_version":"1.0"},"canonical_sha256":"c47accadf055990563b58610bc856713082f8285cf2180c3bb9a5cee6a7d9781","source":{"kind":"arxiv","id":"2203.12577","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.12577","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"2203.12577v3","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.12577","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"YR5MZLPQKWMQ","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"pith_short_16","alias_value":"YR5MZLPQKWMQKY5V","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"pith_short_8","alias_value":"YR5MZLPQ","created_at":"2026-07-05T05:04:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YR5MZLPQKWMQKY5VQYILZBLHCM","target":"record","payload":{"canonical_record":{"source":{"id":"2203.12577","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-23T17:37:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a87f23f1070d0716aba35270a837d35e597ff247b0287c4f1b8883adbbb6cc26","abstract_canon_sha256":"2750bf028370d8d429fc04df55f1f1ab8e570e7f68dec04098e4a1e9da3f69fe"},"schema_version":"1.0"},"canonical_sha256":"c47accadf055990563b58610bc856713082f8285cf2180c3bb9a5cee6a7d9781","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:47.464459Z","signature_b64":"/mjiQPbM5GNVVKzTZiy86pRBF6yRBihf4zccIMNyHzuruD7qBVOaDXIobH8DNaqHzR9k6mW5/zgYNDxER5x5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c47accadf055990563b58610bc856713082f8285cf2180c3bb9a5cee6a7d9781","last_reissued_at":"2026-07-05T05:04:47.463956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:47.463956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.12577","source_version":3,"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-07-05T05:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rYyzskwZZKDkZSRax6DKCmpI6Bs9f9v9wmm2rehwKrxDilVOR4Z0G48lLHpeoUn0EsNpt4lz8kfA/kJziwYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:21:53.076935Z"},"content_sha256":"ba54185c4db3f0da9518ea9f1cdf77a9b099a6e790aaca5ec9c3f8ec5cbe773f","schema_version":"1.0","event_id":"sha256:ba54185c4db3f0da9518ea9f1cdf77a9b099a6e790aaca5ec9c3f8ec5cbe773f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YR5MZLPQKWMQKY5VQYILZBLHCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Regret for Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Vial, R. Srikant, Sanjay Shakkottai, Sujay Sanghavi","submitted_at":"2022-03-23T17:37:43Z","abstract_excerpt":"Cascading bandits is a natural and popular model that frames the task of learning to rank from Bernoulli click feedback in a bandit setting. For the case of unstructured rewards, we prove matching upper and lower bounds for the problem-independent (i.e., gap-free) regret, both of which strictly improve the best known. A key observation is that the hard instances of this problem are those with small mean rewards, i.e., the small click-through rates that are most relevant in practice. Based on this, and the fact that small mean implies small variance for Bernoullis, our key technical result show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.12577","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.12577/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PBzhokDeWnrZThvt0VCbfZN95o/SkmaMmAjRsdSLeL+rZCFSE3Tobc5XTjoWTTDxxBf/AAgl6AmgLC+lyyUzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:21:53.077663Z"},"content_sha256":"e8a91534daa756ace7b1a0ff5edb88ad7c9236b4dbb622a3aaaa64e6ca248985","schema_version":"1.0","event_id":"sha256:e8a91534daa756ace7b1a0ff5edb88ad7c9236b4dbb622a3aaaa64e6ca248985"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YR5MZLPQKWMQKY5VQYILZBLHCM/bundle.json","state_url":"https://pith.science/pith/YR5MZLPQKWMQKY5VQYILZBLHCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YR5MZLPQKWMQKY5VQYILZBLHCM/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-08-12T04:21:53Z","links":{"resolver":"https://pith.science/pith/YR5MZLPQKWMQKY5VQYILZBLHCM","bundle":"https://pith.science/pith/YR5MZLPQKWMQKY5VQYILZBLHCM/bundle.json","state":"https://pith.science/pith/YR5MZLPQKWMQKY5VQYILZBLHCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YR5MZLPQKWMQKY5VQYILZBLHCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YR5MZLPQKWMQKY5VQYILZBLHCM","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":"2750bf028370d8d429fc04df55f1f1ab8e570e7f68dec04098e4a1e9da3f69fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-23T17:37:43Z","title_canon_sha256":"a87f23f1070d0716aba35270a837d35e597ff247b0287c4f1b8883adbbb6cc26"},"schema_version":"1.0","source":{"id":"2203.12577","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.12577","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"2203.12577v3","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.12577","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"YR5MZLPQKWMQ","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"pith_short_16","alias_value":"YR5MZLPQKWMQKY5V","created_at":"2026-07-05T05:04:47Z"},{"alias_kind":"pith_short_8","alias_value":"YR5MZLPQ","created_at":"2026-07-05T05:04:47Z"}],"graph_snapshots":[{"event_id":"sha256:e8a91534daa756ace7b1a0ff5edb88ad7c9236b4dbb622a3aaaa64e6ca248985","target":"graph","created_at":"2026-07-05T05:04:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.12577/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cascading bandits is a natural and popular model that frames the task of learning to rank from Bernoulli click feedback in a bandit setting. For the case of unstructured rewards, we prove matching upper and lower bounds for the problem-independent (i.e., gap-free) regret, both of which strictly improve the best known. A key observation is that the hard instances of this problem are those with small mean rewards, i.e., the small click-through rates that are most relevant in practice. Based on this, and the fact that small mean implies small variance for Bernoullis, our key technical result show","authors_text":"Daniel Vial, R. Srikant, Sanjay Shakkottai, Sujay Sanghavi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-23T17:37:43Z","title":"Minimax Regret for Cascading Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.12577","kind":"arxiv","version":3},"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:ba54185c4db3f0da9518ea9f1cdf77a9b099a6e790aaca5ec9c3f8ec5cbe773f","target":"record","created_at":"2026-07-05T05:04:47Z","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":"2750bf028370d8d429fc04df55f1f1ab8e570e7f68dec04098e4a1e9da3f69fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-23T17:37:43Z","title_canon_sha256":"a87f23f1070d0716aba35270a837d35e597ff247b0287c4f1b8883adbbb6cc26"},"schema_version":"1.0","source":{"id":"2203.12577","kind":"arxiv","version":3}},"canonical_sha256":"c47accadf055990563b58610bc856713082f8285cf2180c3bb9a5cee6a7d9781","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c47accadf055990563b58610bc856713082f8285cf2180c3bb9a5cee6a7d9781","first_computed_at":"2026-07-05T05:04:47.463956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:47.463956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mjiQPbM5GNVVKzTZiy86pRBF6yRBihf4zccIMNyHzuruD7qBVOaDXIobH8DNaqHzR9k6mW5/zgYNDxER5x5Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:47.464459Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.12577","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba54185c4db3f0da9518ea9f1cdf77a9b099a6e790aaca5ec9c3f8ec5cbe773f","sha256:e8a91534daa756ace7b1a0ff5edb88ad7c9236b4dbb622a3aaaa64e6ca248985"],"state_sha256":"f5a70a2bcbab0b3302665ab37ea59520523248d4d5223c1953925fba81dfe7e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qd8atStQ/M8EySijXHoIfQ1UHU58kVByt331vysaJFacfkuwhVsA0N2O6UfoO5Lpaxcx+xVjKzLJNK2BGofCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T04:21:53.088635Z","bundle_sha256":"96f8df3a294619d460cd35b84888f826851baa9a5becb230bd48677d3a4d9407"}}