{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3NNUU2KE6KAAOQ3VBJN2WOLEYV","short_pith_number":"pith:3NNUU2KE","canonical_record":{"source":{"id":"2501.19300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T16:56:18Z","cross_cats_sorted":[],"title_canon_sha256":"fd8c9b4c63eed82556ca121033651c0d57bb607d1adb968820dee8d29916aeb9","abstract_canon_sha256":"7c9fd41aee8af27bd8129eaeca723428f180c341a7abb314ed4b4856fdbb2b7a"},"schema_version":"1.0"},"canonical_sha256":"db5b4a6944f2800743750a5bab3964c57816917879a26e0e6653301267209760","source":{"kind":"arxiv","id":"2501.19300","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19300","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19300v2","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19300","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"3NNUU2KE6KAA","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"pith_short_16","alias_value":"3NNUU2KE6KAAOQ3V","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"pith_short_8","alias_value":"3NNUU2KE","created_at":"2026-07-05T11:11:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3NNUU2KE6KAAOQ3VBJN2WOLEYV","target":"record","payload":{"canonical_record":{"source":{"id":"2501.19300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T16:56:18Z","cross_cats_sorted":[],"title_canon_sha256":"fd8c9b4c63eed82556ca121033651c0d57bb607d1adb968820dee8d29916aeb9","abstract_canon_sha256":"7c9fd41aee8af27bd8129eaeca723428f180c341a7abb314ed4b4856fdbb2b7a"},"schema_version":"1.0"},"canonical_sha256":"db5b4a6944f2800743750a5bab3964c57816917879a26e0e6653301267209760","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:40.252166Z","signature_b64":"cGsAKl6jKkTE/933SQWN33xGozwObuZy7BXvNzbRGnaAGdJvl5moidnX30lnlb6KAZFYV8rPrTzPeXmMBs9qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db5b4a6944f2800743750a5bab3964c57816917879a26e0e6653301267209760","last_reissued_at":"2026-07-05T11:11:40.251656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:40.251656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.19300","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-05T11:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7nOKq9rzFnA8hvGpEEmofcxdDSDwrTo6Eu45eaI2ZXKRotf7//KzcxjdwW8OUiqCkvPfQP23ofbyEu7qzv8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:53:00.125895Z"},"content_sha256":"22730afadad99f2d6785c3d68e21407fc159be68c2c35ab9471ffc0f709dfe2b","schema_version":"1.0","event_id":"sha256:22730afadad99f2d6785c3d68e21407fc159be68c2c35ab9471ffc0f709dfe2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3NNUU2KE6KAAOQ3VBJN2WOLEYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Offline Learning for Combinatorial Multi-armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlee Joe-Wong, Jinhang Zuo, John C.S. Lui, Siwei Wang, Wei Chen, Xiangxiang Dai, Xutong Liu","submitted_at":"2025-01-31T16:56:18Z","abstract_excerpt":"The combinatorial multi-armed bandit (CMAB) is a fundamental sequential decision-making framework, extensively studied over the past decade. However, existing work primarily focuses on the online setting, overlooking the substantial costs of online interactions and the readily available offline datasets. To overcome these limitations, we introduce Off-CMAB, the first offline learning framework for CMAB. Central to our framework is the combinatorial lower confidence bound (CLCB) algorithm, which combines pessimistic reward estimations with combinatorial solvers. To characterize the quality of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19300","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/2501.19300/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-05T11:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEjSYyn0CHi27KHbDRVigzdihU+hrtWNRpxUVT3HebvY3RJ4FqTetbcCZkWFgqLbaVc9cSmzcG4WiOUiWv2tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:53:00.126421Z"},"content_sha256":"e84b6ba4f5c7da36aaafde12cd5678e216edda29120ea6131029a16fc0c87d27","schema_version":"1.0","event_id":"sha256:e84b6ba4f5c7da36aaafde12cd5678e216edda29120ea6131029a16fc0c87d27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV/bundle.json","state_url":"https://pith.science/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV/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-08-08T11:53:00Z","links":{"resolver":"https://pith.science/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV","bundle":"https://pith.science/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV/bundle.json","state":"https://pith.science/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NNUU2KE6KAAOQ3VBJN2WOLEYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3NNUU2KE6KAAOQ3VBJN2WOLEYV","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":"7c9fd41aee8af27bd8129eaeca723428f180c341a7abb314ed4b4856fdbb2b7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T16:56:18Z","title_canon_sha256":"fd8c9b4c63eed82556ca121033651c0d57bb607d1adb968820dee8d29916aeb9"},"schema_version":"1.0","source":{"id":"2501.19300","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19300","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19300v2","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19300","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"3NNUU2KE6KAA","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"pith_short_16","alias_value":"3NNUU2KE6KAAOQ3V","created_at":"2026-07-05T11:11:40Z"},{"alias_kind":"pith_short_8","alias_value":"3NNUU2KE","created_at":"2026-07-05T11:11:40Z"}],"graph_snapshots":[{"event_id":"sha256:e84b6ba4f5c7da36aaafde12cd5678e216edda29120ea6131029a16fc0c87d27","target":"graph","created_at":"2026-07-05T11:11:40Z","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/2501.19300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The combinatorial multi-armed bandit (CMAB) is a fundamental sequential decision-making framework, extensively studied over the past decade. However, existing work primarily focuses on the online setting, overlooking the substantial costs of online interactions and the readily available offline datasets. To overcome these limitations, we introduce Off-CMAB, the first offline learning framework for CMAB. Central to our framework is the combinatorial lower confidence bound (CLCB) algorithm, which combines pessimistic reward estimations with combinatorial solvers. To characterize the quality of o","authors_text":"Carlee Joe-Wong, Jinhang Zuo, John C.S. Lui, Siwei Wang, Wei Chen, Xiangxiang Dai, Xutong Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T16:56:18Z","title":"Offline Learning for Combinatorial Multi-armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19300","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:22730afadad99f2d6785c3d68e21407fc159be68c2c35ab9471ffc0f709dfe2b","target":"record","created_at":"2026-07-05T11:11:40Z","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":"7c9fd41aee8af27bd8129eaeca723428f180c341a7abb314ed4b4856fdbb2b7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T16:56:18Z","title_canon_sha256":"fd8c9b4c63eed82556ca121033651c0d57bb607d1adb968820dee8d29916aeb9"},"schema_version":"1.0","source":{"id":"2501.19300","kind":"arxiv","version":2}},"canonical_sha256":"db5b4a6944f2800743750a5bab3964c57816917879a26e0e6653301267209760","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db5b4a6944f2800743750a5bab3964c57816917879a26e0e6653301267209760","first_computed_at":"2026-07-05T11:11:40.251656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:40.251656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cGsAKl6jKkTE/933SQWN33xGozwObuZy7BXvNzbRGnaAGdJvl5moidnX30lnlb6KAZFYV8rPrTzPeXmMBs9qBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:40.252166Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.19300","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22730afadad99f2d6785c3d68e21407fc159be68c2c35ab9471ffc0f709dfe2b","sha256:e84b6ba4f5c7da36aaafde12cd5678e216edda29120ea6131029a16fc0c87d27"],"state_sha256":"d901cb8ef3f0a7a96872a4b8da5d535c470553a07ab8f89481c9fff899486722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70g092RYQAUBbuP/lblK304gI94jSvn07zJyvsQWmtLYC7OAIEodGnXCEBTozuHd0fCQX5Zwqo23fDtyG4fvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:53:00.131393Z","bundle_sha256":"8ee0ca18abbbdfd6f0383f3dade988cca289dccdb9d7d767ced6a0891ee11293"}}