{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Y37LN6AG2CCQXG344LNZKCIROO","short_pith_number":"pith:Y37LN6AG","canonical_record":{"source":{"id":"2411.00229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-10-31T21:54:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8661528b7210a0ae8b283c250d097a4506fc07ce9df8a405f6d13810aa006b61","abstract_canon_sha256":"cccb5b3d7d26cfd6ee644f045b69960222134c515bb07c7e793558c776ec11ce"},"schema_version":"1.0"},"canonical_sha256":"c6feb6f806d0850b9b7ce2db95091173afb2adc79f5e1064c392514ea6630a31","source":{"kind":"arxiv","id":"2411.00229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.00229","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"2411.00229v2","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00229","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"Y37LN6AG2CCQ","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"Y37LN6AG2CCQXG34","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"Y37LN6AG","created_at":"2026-07-05T10:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Y37LN6AG2CCQXG344LNZKCIROO","target":"record","payload":{"canonical_record":{"source":{"id":"2411.00229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-10-31T21:54:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8661528b7210a0ae8b283c250d097a4506fc07ce9df8a405f6d13810aa006b61","abstract_canon_sha256":"cccb5b3d7d26cfd6ee644f045b69960222134c515bb07c7e793558c776ec11ce"},"schema_version":"1.0"},"canonical_sha256":"c6feb6f806d0850b9b7ce2db95091173afb2adc79f5e1064c392514ea6630a31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:25.548056Z","signature_b64":"xhhciu7Vxih7hmcfhMbIdWiglQP2HaIDsIXz+BtG80r3Hzp0B4R0/Wniv3Gy1Ua4Hs8oeC3IqoGI+IKAjv8xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6feb6f806d0850b9b7ce2db95091173afb2adc79f5e1064c392514ea6630a31","last_reissued_at":"2026-07-05T10:28:25.547106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:25.547106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.00229","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-05T10:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTG9sDT19nTA51STl9fSW0rfBrh45Bl0HeOGYTnUEQYbw0pQtnkqZbrLqRdF2eHMbjFh685X/Wij99rdpYIBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:22:10.578901Z"},"content_sha256":"902de0c75dc284c943bd07d8389fdc5e89e51c5192867cdeafad45902e618997","schema_version":"1.0","event_id":"sha256:902de0c75dc284c943bd07d8389fdc5e89e51c5192867cdeafad45902e618997"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Y37LN6AG2CCQXG344LNZKCIROO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Empirical Divergence for Sub-Gaussian Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kapilan Balagopalan, Kwang-Sung Jun","submitted_at":"2024-10-31T21:54:44Z","abstract_excerpt":"We propose a novel linear bandit algorithm called LinMED (Linear Minimum Empirical Divergence), which is a linear extension of the MED algorithm that was originally designed for multi-armed bandits. LinMED is a randomized algorithm that admits a closed-form computation of the arm sampling probabilities, unlike the popular randomized algorithm called linear Thompson sampling. Such a feature proves useful for off-policy evaluation where the unbiased evaluation requires accurately computing the sampling probability. We prove that LinMED enjoys a near-optimal regret bound of $d\\sqrt{n}$ up to loga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00229","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/2411.00229/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-05T10:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNy5P1piWDpDSoZJmLup1scGSKEolZEvn8ZqldSFQHofTPHmFpRyGfK2WA9FMLjw5J6x6Tu+kncEzEqIYu3yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:22:10.579263Z"},"content_sha256":"6932874aca034df6a6cbbfa4e75c6a0a7ab6269084023c5590eef68a39211c82","schema_version":"1.0","event_id":"sha256:6932874aca034df6a6cbbfa4e75c6a0a7ab6269084023c5590eef68a39211c82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y37LN6AG2CCQXG344LNZKCIROO/bundle.json","state_url":"https://pith.science/pith/Y37LN6AG2CCQXG344LNZKCIROO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y37LN6AG2CCQXG344LNZKCIROO/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-07T08:22:10Z","links":{"resolver":"https://pith.science/pith/Y37LN6AG2CCQXG344LNZKCIROO","bundle":"https://pith.science/pith/Y37LN6AG2CCQXG344LNZKCIROO/bundle.json","state":"https://pith.science/pith/Y37LN6AG2CCQXG344LNZKCIROO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y37LN6AG2CCQXG344LNZKCIROO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Y37LN6AG2CCQXG344LNZKCIROO","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":"cccb5b3d7d26cfd6ee644f045b69960222134c515bb07c7e793558c776ec11ce","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-10-31T21:54:44Z","title_canon_sha256":"8661528b7210a0ae8b283c250d097a4506fc07ce9df8a405f6d13810aa006b61"},"schema_version":"1.0","source":{"id":"2411.00229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.00229","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"2411.00229v2","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00229","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"Y37LN6AG2CCQ","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"Y37LN6AG2CCQXG34","created_at":"2026-07-05T10:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"Y37LN6AG","created_at":"2026-07-05T10:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:6932874aca034df6a6cbbfa4e75c6a0a7ab6269084023c5590eef68a39211c82","target":"graph","created_at":"2026-07-05T10:28:25Z","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/2411.00229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel linear bandit algorithm called LinMED (Linear Minimum Empirical Divergence), which is a linear extension of the MED algorithm that was originally designed for multi-armed bandits. LinMED is a randomized algorithm that admits a closed-form computation of the arm sampling probabilities, unlike the popular randomized algorithm called linear Thompson sampling. Such a feature proves useful for off-policy evaluation where the unbiased evaluation requires accurately computing the sampling probability. We prove that LinMED enjoys a near-optimal regret bound of $d\\sqrt{n}$ up to loga","authors_text":"Kapilan Balagopalan, Kwang-Sung Jun","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-10-31T21:54:44Z","title":"Minimum Empirical Divergence for Sub-Gaussian Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00229","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:902de0c75dc284c943bd07d8389fdc5e89e51c5192867cdeafad45902e618997","target":"record","created_at":"2026-07-05T10:28:25Z","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":"cccb5b3d7d26cfd6ee644f045b69960222134c515bb07c7e793558c776ec11ce","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-10-31T21:54:44Z","title_canon_sha256":"8661528b7210a0ae8b283c250d097a4506fc07ce9df8a405f6d13810aa006b61"},"schema_version":"1.0","source":{"id":"2411.00229","kind":"arxiv","version":2}},"canonical_sha256":"c6feb6f806d0850b9b7ce2db95091173afb2adc79f5e1064c392514ea6630a31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6feb6f806d0850b9b7ce2db95091173afb2adc79f5e1064c392514ea6630a31","first_computed_at":"2026-07-05T10:28:25.547106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:25.547106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xhhciu7Vxih7hmcfhMbIdWiglQP2HaIDsIXz+BtG80r3Hzp0B4R0/Wniv3Gy1Ua4Hs8oeC3IqoGI+IKAjv8xDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:25.548056Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.00229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:902de0c75dc284c943bd07d8389fdc5e89e51c5192867cdeafad45902e618997","sha256:6932874aca034df6a6cbbfa4e75c6a0a7ab6269084023c5590eef68a39211c82"],"state_sha256":"c600a588cf782325990c0bd7efe9a41bd4c3162820761dfc6cdce0a4f5c40968"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIKnpvWkpGsIG2v8hx0Yqfi9IrEPILARow7thgRhfLPObjR/wSU87PuhqU6eX9pb2ABFmj4DMxmuVEYgDMkECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:22:10.581149Z","bundle_sha256":"d1920ebc13952bf5ee1fe6f5b3eeca1f98ca4e1a2cd84eca332847a88bc0d979"}}