{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GY6LWALGPUX2KP2QU4TNSXC4Y5","short_pith_number":"pith:GY6LWALG","canonical_record":{"source":{"id":"1711.08018","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-21T20:16:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1cd039af4fb61697fa732da9975cee16a8a36031e9762d64849c00e8c0a2f6af","abstract_canon_sha256":"e53574676ad4962e21eed368ddd9ce38afca2acf064f6eba90e3e6f169719266"},"schema_version":"1.0"},"canonical_sha256":"363cbb01667d2fa53f50a726d95c5cc747c0e3d0ebb9342d93002707ecf2dfbc","source":{"kind":"arxiv","id":"1711.08018","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08018","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08018v4","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08018","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"GY6LWALGPUX2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GY6LWALGPUX2KP2Q","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GY6LWALG","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GY6LWALGPUX2KP2QU4TNSXC4Y5","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08018","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-21T20:16:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1cd039af4fb61697fa732da9975cee16a8a36031e9762d64849c00e8c0a2f6af","abstract_canon_sha256":"e53574676ad4962e21eed368ddd9ce38afca2acf064f6eba90e3e6f169719266"},"schema_version":"1.0"},"canonical_sha256":"363cbb01667d2fa53f50a726d95c5cc747c0e3d0ebb9342d93002707ecf2dfbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:59.979913Z","signature_b64":"K3w4W+3D0DyFBJLJGOa5OacxZ1FsGcClXK1sUo3Drjmy75pujFWGP+NvjOj4tfLVW+5UUpA33RUCJ71eOJ3WDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"363cbb01667d2fa53f50a726d95c5cc747c0e3d0ebb9342d93002707ecf2dfbc","last_reissued_at":"2026-05-17T23:44:59.979349Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:59.979349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08018","source_version":4,"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:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ASR9QtnR+rYIjetVpBtmLEshlsc0fW7eM3cjhWiERRSu9lY01qO6uCFZFPHV5uxN4Oqd29G82h2Nb/geJ91Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:55:51.170447Z"},"content_sha256":"6776fb88d54266207aeb67ec8700b8e17011bafdc9ffbae4be8a8c31894fabc2","schema_version":"1.0","event_id":"sha256:6776fb88d54266207aeb67ec8700b8e17011bafdc9ffbae4be8a8c31894fabc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GY6LWALGPUX2KP2QU4TNSXC4Y5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akshay Krishnamurthy, Tongyi Cao","submitted_at":"2017-11-21T20:16:35Z","abstract_excerpt":"We design new algorithms for the combinatorial pure exploration problem in the multi-arm bandit framework. In this problem, we are given $K$ distributions and a collection of subsets $\\mathcal{V} \\subset 2^{[K]}$ of these distributions, and we would like to find the subset $v \\in \\mathcal{V}$ that has largest mean, while collecting, in a sequential fashion, as few samples from the distributions as possible. In both the fixed budget and fixed confidence settings, our algorithms achieve new sample-complexity bounds that provide polynomial improvements on previous results in some settings. Via an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08018","kind":"arxiv","version":4},"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:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCXZPcUdRJcHoiLclkCEfqAtpuAoPeeuimL25VGhQDAt4IuEWu/tE+YousxEJKPf8Xt2fvvypUB/3iYhaai1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:55:51.170992Z"},"content_sha256":"be3679dd677f49d6a1d87fe3c6d0a89c591c93f6d5c8f2dbf8f4f9832a9de245","schema_version":"1.0","event_id":"sha256:be3679dd677f49d6a1d87fe3c6d0a89c591c93f6d5c8f2dbf8f4f9832a9de245"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5/bundle.json","state_url":"https://pith.science/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5/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-01T17:55:51Z","links":{"resolver":"https://pith.science/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5","bundle":"https://pith.science/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5/bundle.json","state":"https://pith.science/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GY6LWALGPUX2KP2QU4TNSXC4Y5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GY6LWALGPUX2KP2QU4TNSXC4Y5","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":"e53574676ad4962e21eed368ddd9ce38afca2acf064f6eba90e3e6f169719266","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-21T20:16:35Z","title_canon_sha256":"1cd039af4fb61697fa732da9975cee16a8a36031e9762d64849c00e8c0a2f6af"},"schema_version":"1.0","source":{"id":"1711.08018","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08018","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08018v4","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08018","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"GY6LWALGPUX2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GY6LWALGPUX2KP2Q","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GY6LWALG","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:be3679dd677f49d6a1d87fe3c6d0a89c591c93f6d5c8f2dbf8f4f9832a9de245","target":"graph","created_at":"2026-05-17T23:44:59Z","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 design new algorithms for the combinatorial pure exploration problem in the multi-arm bandit framework. In this problem, we are given $K$ distributions and a collection of subsets $\\mathcal{V} \\subset 2^{[K]}$ of these distributions, and we would like to find the subset $v \\in \\mathcal{V}$ that has largest mean, while collecting, in a sequential fashion, as few samples from the distributions as possible. In both the fixed budget and fixed confidence settings, our algorithms achieve new sample-complexity bounds that provide polynomial improvements on previous results in some settings. Via an","authors_text":"Akshay Krishnamurthy, Tongyi Cao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-21T20:16:35Z","title":"Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08018","kind":"arxiv","version":4},"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:6776fb88d54266207aeb67ec8700b8e17011bafdc9ffbae4be8a8c31894fabc2","target":"record","created_at":"2026-05-17T23:44:59Z","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":"e53574676ad4962e21eed368ddd9ce38afca2acf064f6eba90e3e6f169719266","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-21T20:16:35Z","title_canon_sha256":"1cd039af4fb61697fa732da9975cee16a8a36031e9762d64849c00e8c0a2f6af"},"schema_version":"1.0","source":{"id":"1711.08018","kind":"arxiv","version":4}},"canonical_sha256":"363cbb01667d2fa53f50a726d95c5cc747c0e3d0ebb9342d93002707ecf2dfbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"363cbb01667d2fa53f50a726d95c5cc747c0e3d0ebb9342d93002707ecf2dfbc","first_computed_at":"2026-05-17T23:44:59.979349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:59.979349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K3w4W+3D0DyFBJLJGOa5OacxZ1FsGcClXK1sUo3Drjmy75pujFWGP+NvjOj4tfLVW+5UUpA33RUCJ71eOJ3WDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:59.979913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08018","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6776fb88d54266207aeb67ec8700b8e17011bafdc9ffbae4be8a8c31894fabc2","sha256:be3679dd677f49d6a1d87fe3c6d0a89c591c93f6d5c8f2dbf8f4f9832a9de245"],"state_sha256":"1fceefa3b576677af4307023a3d4e55b1a658aa13e038f32afcec6265bfa5bd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3eAiFV1Xo0ZxaRt6PhtHX6A/6ukoC3eDoKj9lu++kcCDKXcyph0SHRn90TaYv8851vbqtFL81jbKNdXEa9OBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:55:51.173428Z","bundle_sha256":"7ada542f6fc5d936691bc4f6dee1027a63a169a5876e7b7c4f388ab87132c87c"}}