{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5O3H7BCICNL2LYCKZ42BIG5ORZ","short_pith_number":"pith:5O3H7BCI","canonical_record":{"source":{"id":"1902.03794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-11T09:59:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9bdee4c7737e7040023d373cfb7d899d47bf2b50d05b2d973a3ef7db43e15639","abstract_canon_sha256":"05d59c0d1a4dc5cc0ab6ceeb0866f337b199deb98728b7e86fb858a4468f61ed"},"schema_version":"1.0"},"canonical_sha256":"ebb67f84481357a5e04acf34141bae8e4d2a1befd2e65c52dc53832f37ee9fab","source":{"kind":"arxiv","id":"1902.03794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03794","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03794v2","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03794","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"pith_short_12","alias_value":"5O3H7BCICNL2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5O3H7BCICNL2LYCK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5O3H7BCI","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5O3H7BCICNL2LYCKZ42BIG5ORZ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-11T09:59:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9bdee4c7737e7040023d373cfb7d899d47bf2b50d05b2d973a3ef7db43e15639","abstract_canon_sha256":"05d59c0d1a4dc5cc0ab6ceeb0866f337b199deb98728b7e86fb858a4468f61ed"},"schema_version":"1.0"},"canonical_sha256":"ebb67f84481357a5e04acf34141bae8e4d2a1befd2e65c52dc53832f37ee9fab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:48.472045Z","signature_b64":"snj4GVxcHnAoLLGlEMRWd+VYHVapUWg9kAhWnHN7SDtJBt0qre4XAPDyAndnrOgtMdVFNk3Q2lMRKrjgT5RQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb67f84481357a5e04acf34141bae8e4d2a1befd2e65c52dc53832f37ee9fab","last_reissued_at":"2026-05-17T23:42:48.471533Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:48.471533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03794","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-17T23:42:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhfAJ2yTFvyNRmvv8kZxvdyVZhgSrJ5X6MzsC97CXl/J276XsdUVWYX5Ty6rzmgaCZxwwRZYikPrC+PsPrmqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:01:05.547108Z"},"content_sha256":"b19633b146b78f93095742f1eea0a188d49ab0225d258ed44213b7c8e40e21dd","schema_version":"1.0","event_id":"sha256:b19633b146b78f93095742f1eea0a188d49ab0225d258ed44213b7c8e40e21dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5O3H7BCICNL2LYCKZ42BIG5ORZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Michal Valko, Pierre Perrault, Vianney Perchet","submitted_at":"2019-02-11T09:59:05Z","abstract_excerpt":"We improve the efficiency of algorithms for stochastic \\emph{combinatorial semi-bandits}. In most interesting problems, state-of-the-art algorithms take advantage of structural properties of rewards, such as \\emph{independence}. However, while being optimal in terms of asymptotic regret, these algorithms are inefficient. In our paper, we first reduce their implementation to a specific \\emph{submodular maximization}. Then, in case of \\emph{matroid} constraints, we design adapted approximation routines, thereby providing the first efficient algorithms that rely on reward structure to improve reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03794","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":""},"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-17T23:42:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eA3onfd8+k976TZ/pIWH3SwqtgONkJeMoS+4BfH29R8FgIYDQFe7UJd9fGTxOBOFnzsUUcI+JV8eEZ/AB3/3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:01:05.547456Z"},"content_sha256":"c43187f9dc692d63923c186582f03b0a980c5d93932e33ec25641684087edd76","schema_version":"1.0","event_id":"sha256:c43187f9dc692d63923c186582f03b0a980c5d93932e33ec25641684087edd76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ/bundle.json","state_url":"https://pith.science/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ/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-06-27T12:01:05Z","links":{"resolver":"https://pith.science/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ","bundle":"https://pith.science/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ/bundle.json","state":"https://pith.science/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5O3H7BCICNL2LYCKZ42BIG5ORZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5O3H7BCICNL2LYCKZ42BIG5ORZ","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":"05d59c0d1a4dc5cc0ab6ceeb0866f337b199deb98728b7e86fb858a4468f61ed","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-11T09:59:05Z","title_canon_sha256":"9bdee4c7737e7040023d373cfb7d899d47bf2b50d05b2d973a3ef7db43e15639"},"schema_version":"1.0","source":{"id":"1902.03794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03794","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03794v2","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03794","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"pith_short_12","alias_value":"5O3H7BCICNL2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5O3H7BCICNL2LYCK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5O3H7BCI","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c43187f9dc692d63923c186582f03b0a980c5d93932e33ec25641684087edd76","target":"graph","created_at":"2026-05-17T23:42:48Z","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"},"paper":{"abstract_excerpt":"We improve the efficiency of algorithms for stochastic \\emph{combinatorial semi-bandits}. In most interesting problems, state-of-the-art algorithms take advantage of structural properties of rewards, such as \\emph{independence}. However, while being optimal in terms of asymptotic regret, these algorithms are inefficient. In our paper, we first reduce their implementation to a specific \\emph{submodular maximization}. Then, in case of \\emph{matroid} constraints, we design adapted approximation routines, thereby providing the first efficient algorithms that rely on reward structure to improve reg","authors_text":"Michal Valko, Pierre Perrault, Vianney Perchet","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-11T09:59:05Z","title":"Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03794","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:b19633b146b78f93095742f1eea0a188d49ab0225d258ed44213b7c8e40e21dd","target":"record","created_at":"2026-05-17T23:42:48Z","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":"05d59c0d1a4dc5cc0ab6ceeb0866f337b199deb98728b7e86fb858a4468f61ed","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-11T09:59:05Z","title_canon_sha256":"9bdee4c7737e7040023d373cfb7d899d47bf2b50d05b2d973a3ef7db43e15639"},"schema_version":"1.0","source":{"id":"1902.03794","kind":"arxiv","version":2}},"canonical_sha256":"ebb67f84481357a5e04acf34141bae8e4d2a1befd2e65c52dc53832f37ee9fab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb67f84481357a5e04acf34141bae8e4d2a1befd2e65c52dc53832f37ee9fab","first_computed_at":"2026-05-17T23:42:48.471533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:48.471533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"snj4GVxcHnAoLLGlEMRWd+VYHVapUWg9kAhWnHN7SDtJBt0qre4XAPDyAndnrOgtMdVFNk3Q2lMRKrjgT5RQAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:48.472045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b19633b146b78f93095742f1eea0a188d49ab0225d258ed44213b7c8e40e21dd","sha256:c43187f9dc692d63923c186582f03b0a980c5d93932e33ec25641684087edd76"],"state_sha256":"3ac8892a880d068d999c264bdfe87e533bbf0694f7c5f8f721826e3f2cc80a91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPJLmfg2wkVeObMnI4uVyFPYY+kPXx7jPfWaGylam5nUlBU6uoB+zf+hA4FnZaTPFXvkonwKoqgBxUCKfXgZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:01:05.549228Z","bundle_sha256":"53f65c077e20cfab0b1850a84f6e3a6fa547e701b3273380746c02f90ee26a35"}}