{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZFSOFYJ26G3A5JBPNEXMS7VE3H","short_pith_number":"pith:ZFSOFYJ2","canonical_record":{"source":{"id":"2211.00778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T22:45:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"38559b1095df340ccdbe1edf6d55dc51d501cbbbaf300fc3e3a4294bc882f2a1","abstract_canon_sha256":"51443e1404adc1df1dd569d9156b2044a161a4e4fc1943cb84a11d3ae4daa1ee"},"schema_version":"1.0"},"canonical_sha256":"c964e2e13af1b60ea42f692ec97ea4d9dbdcfb205a564016b7ea90a600d64c6c","source":{"kind":"arxiv","id":"2211.00778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.00778","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.00778v1","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00778","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZFSOFYJ26G3A","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_16","alias_value":"ZFSOFYJ26G3A5JBP","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_8","alias_value":"ZFSOFYJ2","created_at":"2026-07-05T05:12:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZFSOFYJ26G3A5JBPNEXMS7VE3H","target":"record","payload":{"canonical_record":{"source":{"id":"2211.00778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T22:45:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"38559b1095df340ccdbe1edf6d55dc51d501cbbbaf300fc3e3a4294bc882f2a1","abstract_canon_sha256":"51443e1404adc1df1dd569d9156b2044a161a4e4fc1943cb84a11d3ae4daa1ee"},"schema_version":"1.0"},"canonical_sha256":"c964e2e13af1b60ea42f692ec97ea4d9dbdcfb205a564016b7ea90a600d64c6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:34.736069Z","signature_b64":"0cA0dr+ZGUNGe5hizjheYkYbX2gfHJ6dbAYt/dJZ/ZqlumLJcX8Zn3mYXh7QaDFPiPXxB2xybr32VxW2clJGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c964e2e13af1b60ea42f692ec97ea4d9dbdcfb205a564016b7ea90a600d64c6c","last_reissued_at":"2026-07-05T05:12:34.735552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:34.735552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.00778","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-07-05T05:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RBjTdoaV1FgOU/IjjDhq94Ak7IVIUYBfpMOMIK+X0YyRma/A6Yg8KcymVGhOUV1CfWMSdyMAR+3C/JJw6RPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:25:54.336607Z"},"content_sha256":"8fcbb5257f9ff5eb7ac12c994844f2b2ec73b5bb649eed2c52d127e60838c7d6","schema_version":"1.0","event_id":"sha256:8fcbb5257f9ff5eb7ac12c994844f2b2ec73b5bb649eed2c52d127e60838c7d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZFSOFYJ26G3A5JBPNEXMS7VE3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monte Carlo Tree Descent for Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Sicun Gao, Yaoguang Zhai","submitted_at":"2022-11-01T22:45:10Z","abstract_excerpt":"The key to Black-Box Optimization is to efficiently search through input regions with potentially widely-varying numerical properties, to achieve low-regret descent and fast progress toward the optima. Monte Carlo Tree Search (MCTS) methods have recently been introduced to improve Bayesian optimization by computing better partitioning of the search space that balances exploration and exploitation. Extending this promising framework, we study how to further integrate sample-based descent for faster optimization. We design novel ways of expanding Monte Carlo search trees, with new descent method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00778","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.00778/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-05T05:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gzvH/aqZ1++/xB01ooZb8dUNFD0VuEqmOZ7KZ+Ab3eG0WQxhIylHGybHRs/7oWshQo7tYyTLZaVfrSv0w2GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:25:54.337578Z"},"content_sha256":"6530d08693679ba6a53e03b8bfa78ec79491b1d58ce2a5fd885eb36e777f5fd6","schema_version":"1.0","event_id":"sha256:6530d08693679ba6a53e03b8bfa78ec79491b1d58ce2a5fd885eb36e777f5fd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H/bundle.json","state_url":"https://pith.science/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H/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-06T15:25:54Z","links":{"resolver":"https://pith.science/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H","bundle":"https://pith.science/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H/bundle.json","state":"https://pith.science/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFSOFYJ26G3A5JBPNEXMS7VE3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZFSOFYJ26G3A5JBPNEXMS7VE3H","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":"51443e1404adc1df1dd569d9156b2044a161a4e4fc1943cb84a11d3ae4daa1ee","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T22:45:10Z","title_canon_sha256":"38559b1095df340ccdbe1edf6d55dc51d501cbbbaf300fc3e3a4294bc882f2a1"},"schema_version":"1.0","source":{"id":"2211.00778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.00778","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"2211.00778v1","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00778","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZFSOFYJ26G3A","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_16","alias_value":"ZFSOFYJ26G3A5JBP","created_at":"2026-07-05T05:12:34Z"},{"alias_kind":"pith_short_8","alias_value":"ZFSOFYJ2","created_at":"2026-07-05T05:12:34Z"}],"graph_snapshots":[{"event_id":"sha256:6530d08693679ba6a53e03b8bfa78ec79491b1d58ce2a5fd885eb36e777f5fd6","target":"graph","created_at":"2026-07-05T05:12:34Z","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/2211.00778/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The key to Black-Box Optimization is to efficiently search through input regions with potentially widely-varying numerical properties, to achieve low-regret descent and fast progress toward the optima. Monte Carlo Tree Search (MCTS) methods have recently been introduced to improve Bayesian optimization by computing better partitioning of the search space that balances exploration and exploitation. Extending this promising framework, we study how to further integrate sample-based descent for faster optimization. We design novel ways of expanding Monte Carlo search trees, with new descent method","authors_text":"Sicun Gao, Yaoguang Zhai","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T22:45:10Z","title":"Monte Carlo Tree Descent for Black-Box Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00778","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:8fcbb5257f9ff5eb7ac12c994844f2b2ec73b5bb649eed2c52d127e60838c7d6","target":"record","created_at":"2026-07-05T05:12:34Z","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":"51443e1404adc1df1dd569d9156b2044a161a4e4fc1943cb84a11d3ae4daa1ee","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-01T22:45:10Z","title_canon_sha256":"38559b1095df340ccdbe1edf6d55dc51d501cbbbaf300fc3e3a4294bc882f2a1"},"schema_version":"1.0","source":{"id":"2211.00778","kind":"arxiv","version":1}},"canonical_sha256":"c964e2e13af1b60ea42f692ec97ea4d9dbdcfb205a564016b7ea90a600d64c6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c964e2e13af1b60ea42f692ec97ea4d9dbdcfb205a564016b7ea90a600d64c6c","first_computed_at":"2026-07-05T05:12:34.735552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:12:34.735552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0cA0dr+ZGUNGe5hizjheYkYbX2gfHJ6dbAYt/dJZ/ZqlumLJcX8Zn3mYXh7QaDFPiPXxB2xybr32VxW2clJGBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:12:34.736069Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.00778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fcbb5257f9ff5eb7ac12c994844f2b2ec73b5bb649eed2c52d127e60838c7d6","sha256:6530d08693679ba6a53e03b8bfa78ec79491b1d58ce2a5fd885eb36e777f5fd6"],"state_sha256":"14778eb9f3b1aed1b5a6da193b66d605f6836f9c0326d9eaaf129aac283b3778"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QODrlUAWPmfbSJF+tDpGnoMDy3nW4iQKdvdGGDd2QVPltA7W29QqDlmLBFlaoB+QyJamKiWp1rgXLMIUwCyjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T15:25:54.344502Z","bundle_sha256":"5f20d0a1ac32cc99332f4500a8f394271a21b875414191e5911abb8902c3a190"}}