{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AI35YAETXJEEYJ2D7IXR6XJIQ2","short_pith_number":"pith:AI35YAET","canonical_record":{"source":{"id":"2406.04137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T14:57:52Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7b2b06f002ea78774e82cdde326202538cfd65705c8d556aef95069a13e789eb","abstract_canon_sha256":"d16d720df7ffa9e8796eaada044b417d7154e52daaabdefc7c1a94f203692708"},"schema_version":"1.0"},"canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","source":{"kind":"arxiv","id":"2406.04137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.04137","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"2406.04137v1","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04137","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"AI35YAETXJEE","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"pith_short_16","alias_value":"AI35YAETXJEEYJ2D","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"pith_short_8","alias_value":"AI35YAET","created_at":"2026-07-05T08:28:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AI35YAETXJEEYJ2D7IXR6XJIQ2","target":"record","payload":{"canonical_record":{"source":{"id":"2406.04137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T14:57:52Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7b2b06f002ea78774e82cdde326202538cfd65705c8d556aef95069a13e789eb","abstract_canon_sha256":"d16d720df7ffa9e8796eaada044b417d7154e52daaabdefc7c1a94f203692708"},"schema_version":"1.0"},"canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:21.210119Z","signature_b64":"ns+jCgaIL9Z2I7MbGox56bTh3VRXdw8f5DMPk93CHqW9MLra5WDyc1U6LY5lwqV5L6C7NfLzHfqlLjzy07dJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","last_reissued_at":"2026-07-05T08:28:21.209660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:21.209660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.04137","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-07-05T08:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leq/a3n2M5uIoyFJujBQyF1Yfpn61G43gC3XUTZFS1I1H6reoC1kjdQkh6QDoCI/sm/Pjfy8AUrEg4NAg8LVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T03:15:59.227746Z"},"content_sha256":"782f565b0f45605bf37425fa64d4b2f6fcce0794e615f780f07060f4a72195a3","schema_version":"1.0","event_id":"sha256:782f565b0f45605bf37425fa64d4b2f6fcce0794e615f780f07060f4a72195a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AI35YAETXJEEYJ2D7IXR6XJIQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Batched Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Pan Xu, Tianyuan Jin, Xuanfei Ren","submitted_at":"2024-06-06T14:57:52Z","abstract_excerpt":"We introduce the E$^4$ algorithm for the batched linear bandit problem, incorporating an Explore-Estimate-Eliminate-Exploit framework. With a proper choice of exploration rate, we prove E$^4$ achieves the finite-time minimax optimal regret with only $O(\\log\\log T)$ batches, and the asymptotically optimal regret with only $3$ batches as $T\\rightarrow\\infty$, where $T$ is the time horizon. We further prove a lower bound on the batch complexity of linear contextual bandits showing that any asymptotically optimal algorithm must require at least $3$ batches in expectation as $T\\rightarrow\\infty$, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.04137/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-05T08:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+mXK9Ppnrxo6w0hkXVm/mOIQOmTWo/XRfdygWZgOL5uhLFg9xKQUR6D6oWodKZE/qVLHzu78ESkW5k3cjSrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T03:15:59.228131Z"},"content_sha256":"8ebb9e21057c65019c770e41430004996dae62dbfcd7417d1983becdaf9bb0aa","schema_version":"1.0","event_id":"sha256:8ebb9e21057c65019c770e41430004996dae62dbfcd7417d1983becdaf9bb0aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/bundle.json","state_url":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/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-16T03:15:59Z","links":{"resolver":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2","bundle":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/bundle.json","state":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AI35YAETXJEEYJ2D7IXR6XJIQ2","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":"d16d720df7ffa9e8796eaada044b417d7154e52daaabdefc7c1a94f203692708","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T14:57:52Z","title_canon_sha256":"7b2b06f002ea78774e82cdde326202538cfd65705c8d556aef95069a13e789eb"},"schema_version":"1.0","source":{"id":"2406.04137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.04137","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"2406.04137v1","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04137","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"AI35YAETXJEE","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"pith_short_16","alias_value":"AI35YAETXJEEYJ2D","created_at":"2026-07-05T08:28:21Z"},{"alias_kind":"pith_short_8","alias_value":"AI35YAET","created_at":"2026-07-05T08:28:21Z"}],"graph_snapshots":[{"event_id":"sha256:8ebb9e21057c65019c770e41430004996dae62dbfcd7417d1983becdaf9bb0aa","target":"graph","created_at":"2026-07-05T08:28:21Z","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/2406.04137/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the E$^4$ algorithm for the batched linear bandit problem, incorporating an Explore-Estimate-Eliminate-Exploit framework. With a proper choice of exploration rate, we prove E$^4$ achieves the finite-time minimax optimal regret with only $O(\\log\\log T)$ batches, and the asymptotically optimal regret with only $3$ batches as $T\\rightarrow\\infty$, where $T$ is the time horizon. We further prove a lower bound on the batch complexity of linear contextual bandits showing that any asymptotically optimal algorithm must require at least $3$ batches in expectation as $T\\rightarrow\\infty$, w","authors_text":"Pan Xu, Tianyuan Jin, Xuanfei Ren","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T14:57:52Z","title":"Optimal Batched Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04137","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:782f565b0f45605bf37425fa64d4b2f6fcce0794e615f780f07060f4a72195a3","target":"record","created_at":"2026-07-05T08:28:21Z","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":"d16d720df7ffa9e8796eaada044b417d7154e52daaabdefc7c1a94f203692708","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T14:57:52Z","title_canon_sha256":"7b2b06f002ea78774e82cdde326202538cfd65705c8d556aef95069a13e789eb"},"schema_version":"1.0","source":{"id":"2406.04137","kind":"arxiv","version":1}},"canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","first_computed_at":"2026-07-05T08:28:21.209660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:21.209660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ns+jCgaIL9Z2I7MbGox56bTh3VRXdw8f5DMPk93CHqW9MLra5WDyc1U6LY5lwqV5L6C7NfLzHfqlLjzy07dJBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:21.210119Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.04137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:782f565b0f45605bf37425fa64d4b2f6fcce0794e615f780f07060f4a72195a3","sha256:8ebb9e21057c65019c770e41430004996dae62dbfcd7417d1983becdaf9bb0aa"],"state_sha256":"4a42325df5fd62bcabbe2ab446752a40a18a16bcc414e703e7d5eacc5b986665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNirKBk+KdZNyIRCQXDzBl7ZnrArbJZ2u1YRNjb8AZ2abAb8GoNAqhpeSbiPpNCoim57ZsRvIMh0usQLijLtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T03:15:59.230362Z","bundle_sha256":"4188a5aa69d6ed06b54b1c89d7d2b5ceb581947107db488b3a0ad1f49c09a993"}}