{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YRRMKSODSCLW2YHOGATLZC6E2C","short_pith_number":"pith:YRRMKSOD","canonical_record":{"source":{"id":"1707.07443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-24T09:01:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a439ef256112efca09af45e71bc9178aefe151fadef8e4f8f9005528dfb65ddf","abstract_canon_sha256":"da7908b1b37738e93db68e51a185b8bc3aa5d738d1f08619bdda02060209c672"},"schema_version":"1.0"},"canonical_sha256":"c462c549c390976d60ee3026bc8bc4d0bfcbde9725a297313533dbc48e78bace","source":{"kind":"arxiv","id":"1707.07443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07443","created_at":"2026-05-18T00:39:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07443v1","created_at":"2026-05-18T00:39:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07443","created_at":"2026-05-18T00:39:42Z"},{"alias_kind":"pith_short_12","alias_value":"YRRMKSODSCLW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YRRMKSODSCLW2YHO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YRRMKSOD","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YRRMKSODSCLW2YHOGATLZC6E2C","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-24T09:01:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a439ef256112efca09af45e71bc9178aefe151fadef8e4f8f9005528dfb65ddf","abstract_canon_sha256":"da7908b1b37738e93db68e51a185b8bc3aa5d738d1f08619bdda02060209c672"},"schema_version":"1.0"},"canonical_sha256":"c462c549c390976d60ee3026bc8bc4d0bfcbde9725a297313533dbc48e78bace","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:42.175673Z","signature_b64":"Xt3+ZhF0E5pZwLSITZeJee3T8+n0KxojleChc6fhitNu5LNCnMGQiDPwWMZiWOvdpAdwxfOYAbz2A+4mgTCsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c462c549c390976d60ee3026bc8bc4d0bfcbde9725a297313533dbc48e78bace","last_reissued_at":"2026-05-18T00:39:42.174957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:42.174957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07443","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:39:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yZhXg1WDML7+B4+0PoXtAzSIB8dVORKjao9op751XBRgs2fOszal4igAZDeg2Bj9rEvmm49DQ3NDbANbl5LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:28:35.108588Z"},"content_sha256":"86fe8885dfedbb5ab4ebac5f1fa98165e3063fad3a160b87cace9e01946e7d4b","schema_version":"1.0","event_id":"sha256:86fe8885dfedbb5ab4ebac5f1fa98165e3063fad3a160b87cace9e01946e7d4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YRRMKSODSCLW2YHOGATLZC6E2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms: A Case with Bounded Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"A. \\\"Omer Sar{\\i}ta\\c{c}, Cem Tekin","submitted_at":"2017-07-24T09:01:46Z","abstract_excerpt":"In this paper, we study the combinatorial multi-armed bandit problem (CMAB) with probabilistically triggered arms (PTAs). Under the assumption that the arm triggering probabilities (ATPs) are positive for all arms, we prove that a class of upper confidence bound (UCB) policies, named Combinatorial UCB with exploration rate $\\kappa$ (CUCB-$\\kappa$), and Combinatorial Thompson Sampling (CTS), which estimates the expected states of the arms via Thompson sampling, achieve bounded regret. In addition, we prove that CUCB-$0$ and CTS incur $O(\\sqrt{T})$ gap-independent regret. These results improve t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07443","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:39:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MT8DItWWE+2T63VyZadOzAUEkOkMXLfcE3jkKdUcIB2TVSkyKc4LYG1Kb7yQRiozFU3U3SpUlE5LrAUazfLkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:28:35.109238Z"},"content_sha256":"08f5e08efdbae2a4c08cbfccb3eb8b58849aa340fe5fd1e23feee0d5bce4e49c","schema_version":"1.0","event_id":"sha256:08f5e08efdbae2a4c08cbfccb3eb8b58849aa340fe5fd1e23feee0d5bce4e49c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRRMKSODSCLW2YHOGATLZC6E2C/bundle.json","state_url":"https://pith.science/pith/YRRMKSODSCLW2YHOGATLZC6E2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRRMKSODSCLW2YHOGATLZC6E2C/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-29T17:28:35Z","links":{"resolver":"https://pith.science/pith/YRRMKSODSCLW2YHOGATLZC6E2C","bundle":"https://pith.science/pith/YRRMKSODSCLW2YHOGATLZC6E2C/bundle.json","state":"https://pith.science/pith/YRRMKSODSCLW2YHOGATLZC6E2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRRMKSODSCLW2YHOGATLZC6E2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YRRMKSODSCLW2YHOGATLZC6E2C","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":"da7908b1b37738e93db68e51a185b8bc3aa5d738d1f08619bdda02060209c672","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-24T09:01:46Z","title_canon_sha256":"a439ef256112efca09af45e71bc9178aefe151fadef8e4f8f9005528dfb65ddf"},"schema_version":"1.0","source":{"id":"1707.07443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07443","created_at":"2026-05-18T00:39:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07443v1","created_at":"2026-05-18T00:39:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07443","created_at":"2026-05-18T00:39:42Z"},{"alias_kind":"pith_short_12","alias_value":"YRRMKSODSCLW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YRRMKSODSCLW2YHO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YRRMKSOD","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:08f5e08efdbae2a4c08cbfccb3eb8b58849aa340fe5fd1e23feee0d5bce4e49c","target":"graph","created_at":"2026-05-18T00:39:42Z","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":"In this paper, we study the combinatorial multi-armed bandit problem (CMAB) with probabilistically triggered arms (PTAs). Under the assumption that the arm triggering probabilities (ATPs) are positive for all arms, we prove that a class of upper confidence bound (UCB) policies, named Combinatorial UCB with exploration rate $\\kappa$ (CUCB-$\\kappa$), and Combinatorial Thompson Sampling (CTS), which estimates the expected states of the arms via Thompson sampling, achieve bounded regret. In addition, we prove that CUCB-$0$ and CTS incur $O(\\sqrt{T})$ gap-independent regret. These results improve t","authors_text":"A. \\\"Omer Sar{\\i}ta\\c{c}, Cem Tekin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-24T09:01:46Z","title":"Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms: A Case with Bounded Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07443","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:86fe8885dfedbb5ab4ebac5f1fa98165e3063fad3a160b87cace9e01946e7d4b","target":"record","created_at":"2026-05-18T00:39:42Z","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":"da7908b1b37738e93db68e51a185b8bc3aa5d738d1f08619bdda02060209c672","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-24T09:01:46Z","title_canon_sha256":"a439ef256112efca09af45e71bc9178aefe151fadef8e4f8f9005528dfb65ddf"},"schema_version":"1.0","source":{"id":"1707.07443","kind":"arxiv","version":1}},"canonical_sha256":"c462c549c390976d60ee3026bc8bc4d0bfcbde9725a297313533dbc48e78bace","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c462c549c390976d60ee3026bc8bc4d0bfcbde9725a297313533dbc48e78bace","first_computed_at":"2026-05-18T00:39:42.174957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:42.174957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xt3+ZhF0E5pZwLSITZeJee3T8+n0KxojleChc6fhitNu5LNCnMGQiDPwWMZiWOvdpAdwxfOYAbz2A+4mgTCsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:42.175673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86fe8885dfedbb5ab4ebac5f1fa98165e3063fad3a160b87cace9e01946e7d4b","sha256:08f5e08efdbae2a4c08cbfccb3eb8b58849aa340fe5fd1e23feee0d5bce4e49c"],"state_sha256":"78ff266483a634c1109c3ab450ea81431c4eadc6206dbfa31e86ae7f59e3a0eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsdXe014Dlu3XroB1iDrjTTbhT6rzpXz5d22b1sPC7LV6pBRZVtDRzDNGap+jWlE0g6iWVzUNQV7FC7rf3RBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:28:35.113152Z","bundle_sha256":"321596376d4d8fad14c14b59a9f73f2ed7ae409e80da6443ac16f34b5e5ef3d4"}}