{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AHQLE7LPHCOHSBGCK6ZSVKUSAL","short_pith_number":"pith:AHQLE7LP","canonical_record":{"source":{"id":"2401.04812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-09T20:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"013f466397f94b8b1f20a2a1aa97c7b9fa6804a29a6654d55bd0f64fec74955e","abstract_canon_sha256":"1b28c95e035ced31be030de6da65a1af78f3d7142b908835059c395d74ff63a5"},"schema_version":"1.0"},"canonical_sha256":"01e0b27d6f389c7904c257b32aaa9202ecdf02e0dfd2c67aa837ad6d252a542a","source":{"kind":"arxiv","id":"2401.04812","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.04812","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"2401.04812v3","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04812","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"AHQLE7LPHCOH","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"AHQLE7LPHCOHSBGC","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"AHQLE7LP","created_at":"2026-07-05T07:47:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AHQLE7LPHCOHSBGCK6ZSVKUSAL","target":"record","payload":{"canonical_record":{"source":{"id":"2401.04812","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-09T20:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"013f466397f94b8b1f20a2a1aa97c7b9fa6804a29a6654d55bd0f64fec74955e","abstract_canon_sha256":"1b28c95e035ced31be030de6da65a1af78f3d7142b908835059c395d74ff63a5"},"schema_version":"1.0"},"canonical_sha256":"01e0b27d6f389c7904c257b32aaa9202ecdf02e0dfd2c67aa837ad6d252a542a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:07.782279Z","signature_b64":"1NnmPEC9u79ym76YKcOa3iMLRs+Ds9nQvvGSjpoJMZrOjf450hUaVAbW9w9pb/QHbv85TejzpEraaTrVAJ7bDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01e0b27d6f389c7904c257b32aaa9202ecdf02e0dfd2c67aa837ad6d252a542a","last_reissued_at":"2026-07-05T07:47:07.781786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:07.781786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.04812","source_version":3,"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-05T07:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDdMV9qZGFp0gc8Mjv2Orn0XcwVQeZrm7Bpz7C69ShuD4hL9ETGpHIy78w4uvok+PMuGTdYu5envySnM0uBmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:29:36.195815Z"},"content_sha256":"9529a33cafe132f1a3c6ba7ab950b1b6a959ae7218d0ebe90dbca6732562a1a0","schema_version":"1.0","event_id":"sha256:9529a33cafe132f1a3c6ba7ab950b1b6a959ae7218d0ebe90dbca6732562a1a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AHQLE7LPHCOHSBGCK6ZSVKUSAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample-and-Bound for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sicun Gao, Yaoguang Zhai, Zhizhen Qin","submitted_at":"2024-01-09T20:45:47Z","abstract_excerpt":"Standard approaches for global optimization of non-convex functions, such as branch-and-bound, maintain partition trees to systematically prune the domain. The tree size grows exponentially in the number of dimensions. We propose new sampling-based methods for non-convex optimization that adapts Monte Carlo Tree Search (MCTS) to improve efficiency. Instead of the standard use of visitation count in Upper Confidence Bounds, we utilize numerical overapproximations of the objective as an uncertainty metric, and also take into account of sampled estimates of first-order and second-order informatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.04812","kind":"arxiv","version":3},"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/2401.04812/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-05T07:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RZV3VNdGTd5aT6AnLkR60V+C8P3qB0PeopQCKsl/bxmfWez8UK0xDNFi+V9f9RkAnXi6ftsHNUJep1TalHZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:29:36.196431Z"},"content_sha256":"d8737965c94ca77ec5f30da40b7bfb76778ca3a6abab5cfb2975d03258dce238","schema_version":"1.0","event_id":"sha256:d8737965c94ca77ec5f30da40b7bfb76778ca3a6abab5cfb2975d03258dce238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL/bundle.json","state_url":"https://pith.science/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL/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-06T16:29:36Z","links":{"resolver":"https://pith.science/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL","bundle":"https://pith.science/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL/bundle.json","state":"https://pith.science/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHQLE7LPHCOHSBGCK6ZSVKUSAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AHQLE7LPHCOHSBGCK6ZSVKUSAL","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":"1b28c95e035ced31be030de6da65a1af78f3d7142b908835059c395d74ff63a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-09T20:45:47Z","title_canon_sha256":"013f466397f94b8b1f20a2a1aa97c7b9fa6804a29a6654d55bd0f64fec74955e"},"schema_version":"1.0","source":{"id":"2401.04812","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.04812","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"2401.04812v3","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04812","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"AHQLE7LPHCOH","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"pith_short_16","alias_value":"AHQLE7LPHCOHSBGC","created_at":"2026-07-05T07:47:07Z"},{"alias_kind":"pith_short_8","alias_value":"AHQLE7LP","created_at":"2026-07-05T07:47:07Z"}],"graph_snapshots":[{"event_id":"sha256:d8737965c94ca77ec5f30da40b7bfb76778ca3a6abab5cfb2975d03258dce238","target":"graph","created_at":"2026-07-05T07:47:07Z","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/2401.04812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Standard approaches for global optimization of non-convex functions, such as branch-and-bound, maintain partition trees to systematically prune the domain. The tree size grows exponentially in the number of dimensions. We propose new sampling-based methods for non-convex optimization that adapts Monte Carlo Tree Search (MCTS) to improve efficiency. Instead of the standard use of visitation count in Upper Confidence Bounds, we utilize numerical overapproximations of the objective as an uncertainty metric, and also take into account of sampled estimates of first-order and second-order informatio","authors_text":"Sicun Gao, Yaoguang Zhai, Zhizhen Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-09T20:45:47Z","title":"Sample-and-Bound for Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.04812","kind":"arxiv","version":3},"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:9529a33cafe132f1a3c6ba7ab950b1b6a959ae7218d0ebe90dbca6732562a1a0","target":"record","created_at":"2026-07-05T07:47:07Z","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":"1b28c95e035ced31be030de6da65a1af78f3d7142b908835059c395d74ff63a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-01-09T20:45:47Z","title_canon_sha256":"013f466397f94b8b1f20a2a1aa97c7b9fa6804a29a6654d55bd0f64fec74955e"},"schema_version":"1.0","source":{"id":"2401.04812","kind":"arxiv","version":3}},"canonical_sha256":"01e0b27d6f389c7904c257b32aaa9202ecdf02e0dfd2c67aa837ad6d252a542a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01e0b27d6f389c7904c257b32aaa9202ecdf02e0dfd2c67aa837ad6d252a542a","first_computed_at":"2026-07-05T07:47:07.781786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:47:07.781786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1NnmPEC9u79ym76YKcOa3iMLRs+Ds9nQvvGSjpoJMZrOjf450hUaVAbW9w9pb/QHbv85TejzpEraaTrVAJ7bDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:47:07.782279Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.04812","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9529a33cafe132f1a3c6ba7ab950b1b6a959ae7218d0ebe90dbca6732562a1a0","sha256:d8737965c94ca77ec5f30da40b7bfb76778ca3a6abab5cfb2975d03258dce238"],"state_sha256":"c7c6e79220215cb75a660c818ceb9b5f832d97d1168643d98353a16394ae2330"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hS5ExDLHDMfBwsH3+UoQmZ8tyo9bVa78ViyMLsLFBh1NwNeGfc33ytoSSK5uMh3w2HpWaHY9vmsoIlUI9LyLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:29:36.205111Z","bundle_sha256":"a9412be40d55883229d81c6cb1a72a77753610f56e4efea20e2a9d256e57a851"}}