{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DFQO7R67YPU446SUMGWXIY3SLO","short_pith_number":"pith:DFQO7R67","canonical_record":{"source":{"id":"1805.01685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-04T09:41:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fb7f9ab0debd010355bcc341b4eff94776dbe063ef4890252d2b51cd29480a9b","abstract_canon_sha256":"9f27f6ad57974bf4265940456ac1f0beed83c688acac8eb6f3300cbd85857ce9"},"schema_version":"1.0"},"canonical_sha256":"1960efc7dfc3e9ce7a5461ad7463725b9aa3f6e8f0805cb9583542b38e47c786","source":{"kind":"arxiv","id":"1805.01685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01685","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01685v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01685","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"DFQO7R67YPU4","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DFQO7R67YPU446SU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DFQO7R67","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DFQO7R67YPU446SUMGWXIY3SLO","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-04T09:41:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fb7f9ab0debd010355bcc341b4eff94776dbe063ef4890252d2b51cd29480a9b","abstract_canon_sha256":"9f27f6ad57974bf4265940456ac1f0beed83c688acac8eb6f3300cbd85857ce9"},"schema_version":"1.0"},"canonical_sha256":"1960efc7dfc3e9ce7a5461ad7463725b9aa3f6e8f0805cb9583542b38e47c786","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:47.069741Z","signature_b64":"AQLS3RQH9ugQ03x+VCZfgg6agOg93sbczEH9gOTky6qc32nNwU+9Gb2cRE1tW+U0tPAo7pveGO3xlBXwTQmVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1960efc7dfc3e9ce7a5461ad7463725b9aa3f6e8f0805cb9583542b38e47c786","last_reissued_at":"2026-05-18T00:16:47.069038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:47.069038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01685","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-05-18T00:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiMNzkZBQ24ySjSf/YaRtEHwl3jE29aXibYjn2igJxwEEDTZdskd+eRsuEGgTaI3BN6xjRUGY7mEWDgFbvk5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:57:26.193039Z"},"content_sha256":"62ec34dce6a15fc9a59862e45145c3beddbbf2ac236ae1edf047575d5a52917a","schema_version":"1.0","event_id":"sha256:62ec34dce6a15fc9a59862e45145c3beddbbf2ac236ae1edf047575d5a52917a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DFQO7R67YPU446SUMGWXIY3SLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jungseul Ok, Liang Li, Wei Chen, Weiran Huang","submitted_at":"2018-05-04T09:41:15Z","abstract_excerpt":"We study the Combinatorial Pure Exploration problem with Continuous and Separable reward functions (CPE-CS) in the stochastic multi-armed bandit setting. In a CPE-CS instance, we are given several stochastic arms with unknown distributions, as well as a collection of possible decisions. Each decision has a reward according to the distributions of arms. The goal is to identify the decision with the maximum reward, using as few arm samples as possible. The problem generalizes the combinatorial pure exploration problem with linear rewards, which has attracted significant attention in recent years"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01685","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":""},"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-18T00:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"if2EPA8ZlNHqJGP7HbBbR3Ts8LTs9jx940JytNXDTk+Dk3Yt7Iy4QAPfBs1C6aSD/x18JESdY6mrK13aWjv9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:57:26.193722Z"},"content_sha256":"4e35a3eb379cefd02cc3270ab5e8935a46a2883c8043f848672213b7110282ac","schema_version":"1.0","event_id":"sha256:4e35a3eb379cefd02cc3270ab5e8935a46a2883c8043f848672213b7110282ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFQO7R67YPU446SUMGWXIY3SLO/bundle.json","state_url":"https://pith.science/pith/DFQO7R67YPU446SUMGWXIY3SLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFQO7R67YPU446SUMGWXIY3SLO/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-27T03:57:26Z","links":{"resolver":"https://pith.science/pith/DFQO7R67YPU446SUMGWXIY3SLO","bundle":"https://pith.science/pith/DFQO7R67YPU446SUMGWXIY3SLO/bundle.json","state":"https://pith.science/pith/DFQO7R67YPU446SUMGWXIY3SLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFQO7R67YPU446SUMGWXIY3SLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DFQO7R67YPU446SUMGWXIY3SLO","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":"9f27f6ad57974bf4265940456ac1f0beed83c688acac8eb6f3300cbd85857ce9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-04T09:41:15Z","title_canon_sha256":"fb7f9ab0debd010355bcc341b4eff94776dbe063ef4890252d2b51cd29480a9b"},"schema_version":"1.0","source":{"id":"1805.01685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01685","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01685v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01685","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"DFQO7R67YPU4","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DFQO7R67YPU446SU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DFQO7R67","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:4e35a3eb379cefd02cc3270ab5e8935a46a2883c8043f848672213b7110282ac","target":"graph","created_at":"2026-05-18T00:16:47Z","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 study the Combinatorial Pure Exploration problem with Continuous and Separable reward functions (CPE-CS) in the stochastic multi-armed bandit setting. In a CPE-CS instance, we are given several stochastic arms with unknown distributions, as well as a collection of possible decisions. Each decision has a reward according to the distributions of arms. The goal is to identify the decision with the maximum reward, using as few arm samples as possible. The problem generalizes the combinatorial pure exploration problem with linear rewards, which has attracted significant attention in recent years","authors_text":"Jungseul Ok, Liang Li, Wei Chen, Weiran Huang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-04T09:41:15Z","title":"Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01685","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:62ec34dce6a15fc9a59862e45145c3beddbbf2ac236ae1edf047575d5a52917a","target":"record","created_at":"2026-05-18T00:16:47Z","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":"9f27f6ad57974bf4265940456ac1f0beed83c688acac8eb6f3300cbd85857ce9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-04T09:41:15Z","title_canon_sha256":"fb7f9ab0debd010355bcc341b4eff94776dbe063ef4890252d2b51cd29480a9b"},"schema_version":"1.0","source":{"id":"1805.01685","kind":"arxiv","version":1}},"canonical_sha256":"1960efc7dfc3e9ce7a5461ad7463725b9aa3f6e8f0805cb9583542b38e47c786","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1960efc7dfc3e9ce7a5461ad7463725b9aa3f6e8f0805cb9583542b38e47c786","first_computed_at":"2026-05-18T00:16:47.069038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.069038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQLS3RQH9ugQ03x+VCZfgg6agOg93sbczEH9gOTky6qc32nNwU+9Gb2cRE1tW+U0tPAo7pveGO3xlBXwTQmVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.069741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62ec34dce6a15fc9a59862e45145c3beddbbf2ac236ae1edf047575d5a52917a","sha256:4e35a3eb379cefd02cc3270ab5e8935a46a2883c8043f848672213b7110282ac"],"state_sha256":"2724d03ed81e4048b5e437483c47d678dd62ba3ef1f19096ab8fb51e4fe03706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ybN7B7FZsOFYdefpe/sv2T3iRx6LGinLxzaziXUGDWo3787R8QnWymmu+A4WLlR1w8QqKE9iZckx25reKLzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:57:26.197019Z","bundle_sha256":"54cd1cb1be777aac2d40cd25d915c975c0b612d72a4f78b348e346f88b89ba6c"}}