{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LS5RGPVPSB7KTZWAPKX7IZARY6","short_pith_number":"pith:LS5RGPVP","canonical_record":{"source":{"id":"2210.01898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-04T20:36:45Z","cross_cats_sorted":[],"title_canon_sha256":"4ce3b5fc168ca5e7b49df47c22351cdffa4ad8e2102b1293e2562d394ffd8019","abstract_canon_sha256":"e4aaa8381a91e2a36c1d829032e121ddced7498d2cbb204575c85826b2bb1148"},"schema_version":"1.0"},"canonical_sha256":"5cbb133eaf907ea9e6c07aaff46411c7bf91c8386390a65ada401bff919af2eb","source":{"kind":"arxiv","id":"2210.01898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.01898","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"2210.01898v2","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.01898","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"LS5RGPVPSB7K","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"pith_short_16","alias_value":"LS5RGPVPSB7KTZWA","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"pith_short_8","alias_value":"LS5RGPVP","created_at":"2026-07-05T05:41:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LS5RGPVPSB7KTZWAPKX7IZARY6","target":"record","payload":{"canonical_record":{"source":{"id":"2210.01898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-04T20:36:45Z","cross_cats_sorted":[],"title_canon_sha256":"4ce3b5fc168ca5e7b49df47c22351cdffa4ad8e2102b1293e2562d394ffd8019","abstract_canon_sha256":"e4aaa8381a91e2a36c1d829032e121ddced7498d2cbb204575c85826b2bb1148"},"schema_version":"1.0"},"canonical_sha256":"5cbb133eaf907ea9e6c07aaff46411c7bf91c8386390a65ada401bff919af2eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:41:51.233701Z","signature_b64":"DmNGR2wPxaf43y8s2BEd4L2AIVH5RcujmcJSqXMUtGWIJo4aI8w22W75W08z0+IQTQBoxp+8MgxizP/sJaQ7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cbb133eaf907ea9e6c07aaff46411c7bf91c8386390a65ada401bff919af2eb","last_reissued_at":"2026-07-05T05:41:51.233247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:41:51.233247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.01898","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-07-05T05:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fe8aI2OCjc1w3wMcbVK6dEhQju1yh9jccfCgFmyxyuLBtmRkiZ0KbpGk5izWzzoIeJIqSNU87f7cErnzkEdpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:28:11.253335Z"},"content_sha256":"858f93c32b43a1f9969d83b3cf98d49013d160a73430beb7a6d1ca72015b8840","schema_version":"1.0","event_id":"sha256:858f93c32b43a1f9969d83b3cf98d49013d160a73430beb7a6d1ca72015b8840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LS5RGPVPSB7KTZWAPKX7IZARY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Replicable Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alkis Kalavasis, Amin Karbasi, Andreas Krause, Grigoris Velegkas, Hossein Esfandiari, Vahab Mirrokni","submitted_at":"2022-10-04T20:36:45Z","abstract_excerpt":"In this paper, we introduce the notion of replicable policies in the context of stochastic bandits, one of the canonical problems in interactive learning. A policy in the bandit environment is called replicable if it pulls, with high probability, the exact same sequence of arms in two different and independent executions (i.e., under independent reward realizations). We show that not only do replicable policies exist, but also they achieve almost the same optimal (non-replicable) regret bounds in terms of the time horizon. More specifically, in the stochastic multi-armed bandits setting, we de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.01898","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.01898/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:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoujpQNDz+Fgv3Mf3O3Vw0dC1NVNlNZM+HdPjtAbe5L8rLe2G3EBnpc+KEpjD2WkoeN62jmzIRIIjxAYVltFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:28:11.253711Z"},"content_sha256":"9e285ea9cbce3b67f52c1546d87ea4f35a157a4d63cbcde65c1be0e8e841d035","schema_version":"1.0","event_id":"sha256:9e285ea9cbce3b67f52c1546d87ea4f35a157a4d63cbcde65c1be0e8e841d035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS5RGPVPSB7KTZWAPKX7IZARY6/bundle.json","state_url":"https://pith.science/pith/LS5RGPVPSB7KTZWAPKX7IZARY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS5RGPVPSB7KTZWAPKX7IZARY6/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-07-07T04:28:11Z","links":{"resolver":"https://pith.science/pith/LS5RGPVPSB7KTZWAPKX7IZARY6","bundle":"https://pith.science/pith/LS5RGPVPSB7KTZWAPKX7IZARY6/bundle.json","state":"https://pith.science/pith/LS5RGPVPSB7KTZWAPKX7IZARY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS5RGPVPSB7KTZWAPKX7IZARY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LS5RGPVPSB7KTZWAPKX7IZARY6","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":"e4aaa8381a91e2a36c1d829032e121ddced7498d2cbb204575c85826b2bb1148","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-04T20:36:45Z","title_canon_sha256":"4ce3b5fc168ca5e7b49df47c22351cdffa4ad8e2102b1293e2562d394ffd8019"},"schema_version":"1.0","source":{"id":"2210.01898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.01898","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"2210.01898v2","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.01898","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"LS5RGPVPSB7K","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"pith_short_16","alias_value":"LS5RGPVPSB7KTZWA","created_at":"2026-07-05T05:41:51Z"},{"alias_kind":"pith_short_8","alias_value":"LS5RGPVP","created_at":"2026-07-05T05:41:51Z"}],"graph_snapshots":[{"event_id":"sha256:9e285ea9cbce3b67f52c1546d87ea4f35a157a4d63cbcde65c1be0e8e841d035","target":"graph","created_at":"2026-07-05T05:41:51Z","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/2210.01898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce the notion of replicable policies in the context of stochastic bandits, one of the canonical problems in interactive learning. A policy in the bandit environment is called replicable if it pulls, with high probability, the exact same sequence of arms in two different and independent executions (i.e., under independent reward realizations). We show that not only do replicable policies exist, but also they achieve almost the same optimal (non-replicable) regret bounds in terms of the time horizon. More specifically, in the stochastic multi-armed bandits setting, we de","authors_text":"Alkis Kalavasis, Amin Karbasi, Andreas Krause, Grigoris Velegkas, Hossein Esfandiari, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-04T20:36:45Z","title":"Replicable Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.01898","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:858f93c32b43a1f9969d83b3cf98d49013d160a73430beb7a6d1ca72015b8840","target":"record","created_at":"2026-07-05T05:41:51Z","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":"e4aaa8381a91e2a36c1d829032e121ddced7498d2cbb204575c85826b2bb1148","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-04T20:36:45Z","title_canon_sha256":"4ce3b5fc168ca5e7b49df47c22351cdffa4ad8e2102b1293e2562d394ffd8019"},"schema_version":"1.0","source":{"id":"2210.01898","kind":"arxiv","version":2}},"canonical_sha256":"5cbb133eaf907ea9e6c07aaff46411c7bf91c8386390a65ada401bff919af2eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cbb133eaf907ea9e6c07aaff46411c7bf91c8386390a65ada401bff919af2eb","first_computed_at":"2026-07-05T05:41:51.233247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:41:51.233247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DmNGR2wPxaf43y8s2BEd4L2AIVH5RcujmcJSqXMUtGWIJo4aI8w22W75W08z0+IQTQBoxp+8MgxizP/sJaQ7Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:41:51.233701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.01898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:858f93c32b43a1f9969d83b3cf98d49013d160a73430beb7a6d1ca72015b8840","sha256:9e285ea9cbce3b67f52c1546d87ea4f35a157a4d63cbcde65c1be0e8e841d035"],"state_sha256":"ffeef1677f4a646ddc4f23b3f3f13a403e28b1e9b85fbe7ef2c7595a0cbc40f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VzvYvQzIAZR9EznXHrKOG6PDtSEKRRuWZQLJaKpOfuMo4t5l5LQ8PAO1WqOHDirLEHzmMX+JPvxCwry0BZsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:28:11.255690Z","bundle_sha256":"34cc79a77ab48115c3ee4f2950d6619a76daef113781ae827e2f19a39f180e6e"}}