{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IB7MHMVZDAPBM7AX23E5ZKXD7X","short_pith_number":"pith:IB7MHMVZ","canonical_record":{"source":{"id":"2511.10619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-13T18:46:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6aa755b40998f138f946bac1f8c5b53a549301cf0b38c491bc9b4cc55a317a8","abstract_canon_sha256":"35b1b850675ae6a87ce6851900dea854c2094f9db5dea9519c39c55fb225f569"},"schema_version":"1.0"},"canonical_sha256":"407ec3b2b9181e167c17d6c9dcaae3fdef99eebbbd4cbc914762d5d237c4e807","source":{"kind":"arxiv","id":"2511.10619","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.10619","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"2511.10619v2","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.10619","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"IB7MHMVZDAPB","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_16","alias_value":"IB7MHMVZDAPBM7AX","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_8","alias_value":"IB7MHMVZ","created_at":"2026-05-22T01:03:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IB7MHMVZDAPBM7AX23E5ZKXD7X","target":"record","payload":{"canonical_record":{"source":{"id":"2511.10619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-13T18:46:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6aa755b40998f138f946bac1f8c5b53a549301cf0b38c491bc9b4cc55a317a8","abstract_canon_sha256":"35b1b850675ae6a87ce6851900dea854c2094f9db5dea9519c39c55fb225f569"},"schema_version":"1.0"},"canonical_sha256":"407ec3b2b9181e167c17d6c9dcaae3fdef99eebbbd4cbc914762d5d237c4e807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:49.658739Z","signature_b64":"H9p8VqA2Ejs2+yhySn6HA8Bx/qQgeucosnZLfjZl0vgO/gh1GXu0gYHDG9P4UoRWgydt1O1dQKoaor6VvM8zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"407ec3b2b9181e167c17d6c9dcaae3fdef99eebbbd4cbc914762d5d237c4e807","last_reissued_at":"2026-05-22T01:03:49.657433Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:49.657433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.10619","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-22T01:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVyyEKVXdmpWjckXElUI6RgpWAL1tcbM3fBOrVnwnh7+i/YovXcydETegaMvNjUQnME5C0WZKlQaxs6yqfWCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:50:34.908568Z"},"content_sha256":"d3821f8377245d37c6271faa858b15451341f9e02f78634372c47f67730b6204","schema_version":"1.0","event_id":"sha256:d3821f8377245d37c6271faa858b15451341f9e02f78634372c47f67730b6204"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IB7MHMVZDAPBM7AX23E5ZKXD7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avrim Blum, Dravyansh Sharma, Kavya Ravichandran, Marten Garicano","submitted_at":"2025-11-13T18:46:56Z","abstract_excerpt":"The improving multi-armed bandits problem is a formal model for allocating effort under uncertainty, motivated by scenarios such as investing research effort into new technologies, performing clinical trials, and hyperparameter selection from learning curves. Each pull of an arm provides reward that increases monotonically with diminishing returns. A growing line of work has designed algorithms for improving bandits, albeit with somewhat pessimistic worst-case guarantees. Indeed, strong lower bounds of $\\Omega(k)$ and $\\Omega(\\sqrt{k})$ multiplicative approximation factors are known for both d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.10619","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/2511.10619/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-05-22T01:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BL7xiASrYZfAWhvSaQ4IAJemdzHbi2VYTE51zVwc/V/QmuKBMAUYjk5/FAN0SN6aq59+7RWLMem23j6zIx03Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:50:34.909071Z"},"content_sha256":"c21953b838a860bb84a3256f6d1f8d93f2399b1ae9309c0d3f37489adc3b752f","schema_version":"1.0","event_id":"sha256:c21953b838a860bb84a3256f6d1f8d93f2399b1ae9309c0d3f37489adc3b752f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X/bundle.json","state_url":"https://pith.science/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X/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-31T18:50:34Z","links":{"resolver":"https://pith.science/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X","bundle":"https://pith.science/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X/bundle.json","state":"https://pith.science/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IB7MHMVZDAPBM7AX23E5ZKXD7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IB7MHMVZDAPBM7AX23E5ZKXD7X","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":"35b1b850675ae6a87ce6851900dea854c2094f9db5dea9519c39c55fb225f569","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-13T18:46:56Z","title_canon_sha256":"d6aa755b40998f138f946bac1f8c5b53a549301cf0b38c491bc9b4cc55a317a8"},"schema_version":"1.0","source":{"id":"2511.10619","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.10619","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"2511.10619v2","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.10619","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"IB7MHMVZDAPB","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_16","alias_value":"IB7MHMVZDAPBM7AX","created_at":"2026-05-22T01:03:49Z"},{"alias_kind":"pith_short_8","alias_value":"IB7MHMVZ","created_at":"2026-05-22T01:03:49Z"}],"graph_snapshots":[{"event_id":"sha256:c21953b838a860bb84a3256f6d1f8d93f2399b1ae9309c0d3f37489adc3b752f","target":"graph","created_at":"2026-05-22T01:03:49Z","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/2511.10619/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The improving multi-armed bandits problem is a formal model for allocating effort under uncertainty, motivated by scenarios such as investing research effort into new technologies, performing clinical trials, and hyperparameter selection from learning curves. Each pull of an arm provides reward that increases monotonically with diminishing returns. A growing line of work has designed algorithms for improving bandits, albeit with somewhat pessimistic worst-case guarantees. Indeed, strong lower bounds of $\\Omega(k)$ and $\\Omega(\\sqrt{k})$ multiplicative approximation factors are known for both d","authors_text":"Avrim Blum, Dravyansh Sharma, Kavya Ravichandran, Marten Garicano","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-13T18:46:56Z","title":"Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.10619","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:d3821f8377245d37c6271faa858b15451341f9e02f78634372c47f67730b6204","target":"record","created_at":"2026-05-22T01:03:49Z","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":"35b1b850675ae6a87ce6851900dea854c2094f9db5dea9519c39c55fb225f569","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-13T18:46:56Z","title_canon_sha256":"d6aa755b40998f138f946bac1f8c5b53a549301cf0b38c491bc9b4cc55a317a8"},"schema_version":"1.0","source":{"id":"2511.10619","kind":"arxiv","version":2}},"canonical_sha256":"407ec3b2b9181e167c17d6c9dcaae3fdef99eebbbd4cbc914762d5d237c4e807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"407ec3b2b9181e167c17d6c9dcaae3fdef99eebbbd4cbc914762d5d237c4e807","first_computed_at":"2026-05-22T01:03:49.657433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:49.657433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H9p8VqA2Ejs2+yhySn6HA8Bx/qQgeucosnZLfjZl0vgO/gh1GXu0gYHDG9P4UoRWgydt1O1dQKoaor6VvM8zCg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:49.658739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.10619","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3821f8377245d37c6271faa858b15451341f9e02f78634372c47f67730b6204","sha256:c21953b838a860bb84a3256f6d1f8d93f2399b1ae9309c0d3f37489adc3b752f"],"state_sha256":"fdb3e09d976feb742256e9ab8dafe5730a283197df7bec1b51bca72b0e02434d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JytgCa+m0NNXM8EEHXa3BHiBv9i4VdnT6WtqakAgTU/3UiNL7vCwc+3avpA7XHmgj3xJXTN183KuYGbOE/jXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:50:34.912264Z","bundle_sha256":"38e4162f7bbe94ecca960be8bf13ca72511cfb7719f1ff83ea7cd38b08dc26d3"}}