{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DCFPL3RPUACYOX6ZFC6UXDMQ7M","short_pith_number":"pith:DCFPL3RP","canonical_record":{"source":{"id":"2603.21180","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-22T11:47:20Z","cross_cats_sorted":["stat.CO","stat.ME","stat.ML"],"title_canon_sha256":"17c146c9b7af9956c5f049f3c259b94beb2b2bc5b1ee742e4c0ad14e5d18304f","abstract_canon_sha256":"7caab0afb98dae47b8fb199dfc217472078b99a0d41b937d354400297159a952"},"schema_version":"1.0"},"canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","source":{"kind":"arxiv","id":"2603.21180","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.21180","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.21180v4","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.21180","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"DCFPL3RPUACY","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_16","alias_value":"DCFPL3RPUACYOX6Z","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_8","alias_value":"DCFPL3RP","created_at":"2026-06-04T01:08:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DCFPL3RPUACYOX6ZFC6UXDMQ7M","target":"record","payload":{"canonical_record":{"source":{"id":"2603.21180","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-22T11:47:20Z","cross_cats_sorted":["stat.CO","stat.ME","stat.ML"],"title_canon_sha256":"17c146c9b7af9956c5f049f3c259b94beb2b2bc5b1ee742e4c0ad14e5d18304f","abstract_canon_sha256":"7caab0afb98dae47b8fb199dfc217472078b99a0d41b937d354400297159a952"},"schema_version":"1.0"},"canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:49.005345Z","signature_b64":"JVKtFSyCQ7sWIyRnDt8qJDu6BvSgDJjqv5UiSBowmHzdN7GTjv67cdt1Jk2sk8ds1sWWR5TjWK37rk72mYgmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","last_reissued_at":"2026-06-04T01:08:49.004877Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:49.004877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.21180","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-06-04T01:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9gxjZPE63lwrSbwciuyPOzZVu7ShTlBQSftM5LVopzqRd6FOBo3yxefe7J8ZZD26EgEiC2oTXrz5IUj69jLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:56:35.408831Z"},"content_sha256":"b4ad78b2793ff83d70c38385c906131decaceef489996f9fd5011efafa313307","schema_version":"1.0","event_id":"sha256:b4ad78b2793ff83d70c38385c906131decaceef489996f9fd5011efafa313307"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DCFPL3RPUACYOX6ZFC6UXDMQ7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ALMAB-DC: Active Learning, Multi-Armed Bandits, and Distributed Computing for Sequential Experimental Design and Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","cross_cats":["stat.CO","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Foo Hui-Mean, Yuan-chin I Chang","submitted_at":"2026-03-22T11:47:20Z","abstract_excerpt":"Sequential experimental design under expensive, gradient-free objectives is a central challenge in computational statistics: evaluation budgets are tightly constrained and information must be extracted efficiently from each observation. We propose \\textbf{ALMAB-DC}, a GP-based sequential design framework combining active learning, multi-armed bandits (MAB), and distributed asynchronous computing for expensive black-box experimentation. A Gaussian process surrogate with uncertainty-aware acquisition identifies informative query points; a UCB or Thompson-sampling bandit controller allocates eval"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"ALMAB-DC achieves lower simple regret than Equal Spacing, Random, and D-optimal designs on statistical tasks, 93.4% CIFAR-10 accuracy outperforming BOHB and Optuna, 36.9% drag reduction, 50% RL improvement, and 7.5x speedup at K=16, with all advantages statistically significant.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Gaussian process surrogate accurately models the black-box objective and that the UCB/Thompson sampling bandit controller with asynchronous scheduler effectively allocates evaluations without significant overhead or synchronization issues.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ALMAB-DC integrates Gaussian process active learning with multi-armed bandit allocation and distributed asynchronous computing to achieve lower regret and faster wall-clock performance in sequential experimental design.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9505a03ab8dd0d292de9eb3e470795325d8126ea178c754c495e7fe7ffd07437"},"source":{"id":"2603.21180","kind":"arxiv","version":4},"verdict":{"id":"25452ec5-db9c-4cb2-b0a0-73640a864df8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T07:12:13.237692Z","strongest_claim":"ALMAB-DC achieves lower simple regret than Equal Spacing, Random, and D-optimal designs on statistical tasks, 93.4% CIFAR-10 accuracy outperforming BOHB and Optuna, 36.9% drag reduction, 50% RL improvement, and 7.5x speedup at K=16, with all advantages statistically significant.","one_line_summary":"ALMAB-DC integrates Gaussian process active learning with multi-armed bandit allocation and distributed asynchronous computing to achieve lower regret and faster wall-clock performance in sequential experimental design.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Gaussian process surrogate accurately models the black-box objective and that the UCB/Thompson sampling bandit controller with asynchronous scheduler effectively allocates evaluations without significant overhead or synchronization issues.","pith_extraction_headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.21180/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":2,"snapshot_sha256":"b51a747aa0fdc5041e199a619c3e1497d24ee5fa4e7372409adaaeb0b37005f3"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"25452ec5-db9c-4cb2-b0a0-73640a864df8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fshBeD0AP4PhcaT/3ImCaJQ26ZnjCQpGIafDVjw4OhDS8C69ESS6/2JE2AEwTj4yCEpe+l0ak9b/4qztQ+CcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:56:35.409860Z"},"content_sha256":"0526a87d6efeb3d8a6dcf1fc6711fcba8ffd78cd51209793069e2ada28f53672","schema_version":"1.0","event_id":"sha256:0526a87d6efeb3d8a6dcf1fc6711fcba8ffd78cd51209793069e2ada28f53672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/bundle.json","state_url":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/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-10T10:56:35Z","links":{"resolver":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M","bundle":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/bundle.json","state":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DCFPL3RPUACYOX6ZFC6UXDMQ7M","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":"7caab0afb98dae47b8fb199dfc217472078b99a0d41b937d354400297159a952","cross_cats_sorted":["stat.CO","stat.ME","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-22T11:47:20Z","title_canon_sha256":"17c146c9b7af9956c5f049f3c259b94beb2b2bc5b1ee742e4c0ad14e5d18304f"},"schema_version":"1.0","source":{"id":"2603.21180","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.21180","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.21180v4","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.21180","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"DCFPL3RPUACY","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_16","alias_value":"DCFPL3RPUACYOX6Z","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_8","alias_value":"DCFPL3RP","created_at":"2026-06-04T01:08:49Z"}],"graph_snapshots":[{"event_id":"sha256:0526a87d6efeb3d8a6dcf1fc6711fcba8ffd78cd51209793069e2ada28f53672","target":"graph","created_at":"2026-06-04T01:08:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"ALMAB-DC achieves lower simple regret than Equal Spacing, Random, and D-optimal designs on statistical tasks, 93.4% CIFAR-10 accuracy outperforming BOHB and Optuna, 36.9% drag reduction, 50% RL improvement, and 7.5x speedup at K=16, with all advantages statistically significant."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The Gaussian process surrogate accurately models the black-box objective and that the UCB/Thompson sampling bandit controller with asynchronous scheduler effectively allocates evaluations without significant overhead or synchronization issues."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ALMAB-DC integrates Gaussian process active learning with multi-armed bandit allocation and distributed asynchronous computing to achieve lower regret and faster wall-clock performance in sequential experimental design."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks."}],"snapshot_sha256":"9505a03ab8dd0d292de9eb3e470795325d8126ea178c754c495e7fe7ffd07437"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b51a747aa0fdc5041e199a619c3e1497d24ee5fa4e7372409adaaeb0b37005f3"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.21180/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequential experimental design under expensive, gradient-free objectives is a central challenge in computational statistics: evaluation budgets are tightly constrained and information must be extracted efficiently from each observation. We propose \\textbf{ALMAB-DC}, a GP-based sequential design framework combining active learning, multi-armed bandits (MAB), and distributed asynchronous computing for expensive black-box experimentation. A Gaussian process surrogate with uncertainty-aware acquisition identifies informative query points; a UCB or Thompson-sampling bandit controller allocates eval","authors_text":"Foo Hui-Mean, Yuan-chin I Chang","cross_cats":["stat.CO","stat.ME","stat.ML"],"headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-22T11:47:20Z","title":"ALMAB-DC: Active Learning, Multi-Armed Bandits, and Distributed Computing for Sequential Experimental Design and Black-Box Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.21180","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T07:12:13.237692Z","id":"25452ec5-db9c-4cb2-b0a0-73640a864df8","model_set":{"reader":"grok-4.3"},"one_line_summary":"ALMAB-DC integrates Gaussian process active learning with multi-armed bandit allocation and distributed asynchronous computing to achieve lower regret and faster wall-clock performance in sequential experimental design.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","strongest_claim":"ALMAB-DC achieves lower simple regret than Equal Spacing, Random, and D-optimal designs on statistical tasks, 93.4% CIFAR-10 accuracy outperforming BOHB and Optuna, 36.9% drag reduction, 50% RL improvement, and 7.5x speedup at K=16, with all advantages statistically significant.","weakest_assumption":"The Gaussian process surrogate accurately models the black-box objective and that the UCB/Thompson sampling bandit controller with asynchronous scheduler effectively allocates evaluations without significant overhead or synchronization issues."}},"verdict_id":"25452ec5-db9c-4cb2-b0a0-73640a864df8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4ad78b2793ff83d70c38385c906131decaceef489996f9fd5011efafa313307","target":"record","created_at":"2026-06-04T01:08:49Z","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":"7caab0afb98dae47b8fb199dfc217472078b99a0d41b937d354400297159a952","cross_cats_sorted":["stat.CO","stat.ME","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-22T11:47:20Z","title_canon_sha256":"17c146c9b7af9956c5f049f3c259b94beb2b2bc5b1ee742e4c0ad14e5d18304f"},"schema_version":"1.0","source":{"id":"2603.21180","kind":"arxiv","version":4}},"canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","first_computed_at":"2026-06-04T01:08:49.004877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:49.004877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JVKtFSyCQ7sWIyRnDt8qJDu6BvSgDJjqv5UiSBowmHzdN7GTjv67cdt1Jk2sk8ds1sWWR5TjWK37rk72mYgmCw==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:49.005345Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.21180","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4ad78b2793ff83d70c38385c906131decaceef489996f9fd5011efafa313307","sha256:0526a87d6efeb3d8a6dcf1fc6711fcba8ffd78cd51209793069e2ada28f53672"],"state_sha256":"310b9948098a91d891b7170a4d50ffbd98def5acee8ab68a8d58daaa919af083"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzlGvQvH7uxgArXrfYxKQGnlR63lRVYmykxW7AX7Jr8RrMgqetLlbvJiZDe2kzBn2HEm4dhKjPk++azYZS3/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:56:35.415661Z","bundle_sha256":"20b63aebbe5576f15d7b481d4e4a7b0d93e2cd345228276766b53029b1a7de38"}}