{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WWRQVH53SGK2QMJFI67LHFWUHC","short_pith_number":"pith:WWRQVH53","canonical_record":{"source":{"id":"1607.04817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-17T01:41:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8828f3f68acdedf4d5ff13c9aff6265425374dc4c10fad98293bb143f0eb192e","abstract_canon_sha256":"2b778f28d27df1681c94b3c83deef974d0f8e1ae716b59f39fbe3aab6963edce"},"schema_version":"1.0"},"canonical_sha256":"b5a30a9fbb9195a8312547beb396d43887e0d0d425458c18471d96b49db0f419","source":{"kind":"arxiv","id":"1607.04817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04817","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04817v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04817","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"WWRQVH53SGK2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WWRQVH53SGK2QMJF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WWRQVH53","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WWRQVH53SGK2QMJFI67LHFWUHC","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-17T01:41:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8828f3f68acdedf4d5ff13c9aff6265425374dc4c10fad98293bb143f0eb192e","abstract_canon_sha256":"2b778f28d27df1681c94b3c83deef974d0f8e1ae716b59f39fbe3aab6963edce"},"schema_version":"1.0"},"canonical_sha256":"b5a30a9fbb9195a8312547beb396d43887e0d0d425458c18471d96b49db0f419","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:56.557490Z","signature_b64":"0Ta1sjNLu6a4hnByDF9+9i6I53mulKraaTxCIQgSYRUNvRTF11h5JcE0OsR2HHoGesieJ+AIYhmFK1t1uecaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a30a9fbb9195a8312547beb396d43887e0d0d425458c18471d96b49db0f419","last_reissued_at":"2026-05-18T01:10:56.556938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:56.556938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04817","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-05-18T01:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSzGaEHYn+jsqPIZByCUoG/KeRNOmLZesa9uu7nf0VKT6O3QKLMItUsKLSYPMv2I2Zvr/UUB4YZh41IglqI6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:18:56.899865Z"},"content_sha256":"6c885058ee0d3cc183b29a52c2d20e8d6e4dd247a71af92d5e4e9c5aaa4c21b8","schema_version":"1.0","event_id":"sha256:6c885058ee0d3cc183b29a52c2d20e8d6e4dd247a71af92d5e4e9c5aaa4c21b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WWRQVH53SGK2QMJFI67LHFWUHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Continuous Optimization with Error Bound and Fast Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Kenji Kawaguchi, Xiaoyu Zheng, Yu Maruyama","submitted_at":"2016-07-17T01:41:16Z","abstract_excerpt":"This paper considers global optimization with a black-box unknown objective function that can be non-convex and non-differentiable. Such a difficult optimization problem arises in many real-world applications, such as parameter tuning in machine learning, engineering design problem, and planning with a complex physics simulator. This paper proposes a new global optimization algorithm, called Locally Oriented Global Optimization (LOGO), to aim for both fast convergence in practice and finite-time error bound in theory. The advantage and usage of the new algorithm are illustrated via theoretical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04817","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":""},"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-18T01:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9bhZljEC9thm2G+Vjsw0b9oT9iAj9M8ZpmSQJGAtCCY3VyqDg2x/BiqNxz3FHmP1MFqlasL/ogkK5exb6QmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:18:56.900496Z"},"content_sha256":"724fdc55761be652f16031743217cf046a23aa5e30aa9daaec1a3e6c8f63aecd","schema_version":"1.0","event_id":"sha256:724fdc55761be652f16031743217cf046a23aa5e30aa9daaec1a3e6c8f63aecd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWRQVH53SGK2QMJFI67LHFWUHC/bundle.json","state_url":"https://pith.science/pith/WWRQVH53SGK2QMJFI67LHFWUHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWRQVH53SGK2QMJFI67LHFWUHC/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-05-29T17:18:56Z","links":{"resolver":"https://pith.science/pith/WWRQVH53SGK2QMJFI67LHFWUHC","bundle":"https://pith.science/pith/WWRQVH53SGK2QMJFI67LHFWUHC/bundle.json","state":"https://pith.science/pith/WWRQVH53SGK2QMJFI67LHFWUHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWRQVH53SGK2QMJFI67LHFWUHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WWRQVH53SGK2QMJFI67LHFWUHC","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":"2b778f28d27df1681c94b3c83deef974d0f8e1ae716b59f39fbe3aab6963edce","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-17T01:41:16Z","title_canon_sha256":"8828f3f68acdedf4d5ff13c9aff6265425374dc4c10fad98293bb143f0eb192e"},"schema_version":"1.0","source":{"id":"1607.04817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04817","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04817v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04817","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"WWRQVH53SGK2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WWRQVH53SGK2QMJF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WWRQVH53","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:724fdc55761be652f16031743217cf046a23aa5e30aa9daaec1a3e6c8f63aecd","target":"graph","created_at":"2026-05-18T01:10:56Z","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":"This paper considers global optimization with a black-box unknown objective function that can be non-convex and non-differentiable. Such a difficult optimization problem arises in many real-world applications, such as parameter tuning in machine learning, engineering design problem, and planning with a complex physics simulator. This paper proposes a new global optimization algorithm, called Locally Oriented Global Optimization (LOGO), to aim for both fast convergence in practice and finite-time error bound in theory. The advantage and usage of the new algorithm are illustrated via theoretical","authors_text":"Kenji Kawaguchi, Xiaoyu Zheng, Yu Maruyama","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-17T01:41:16Z","title":"Global Continuous Optimization with Error Bound and Fast Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04817","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:6c885058ee0d3cc183b29a52c2d20e8d6e4dd247a71af92d5e4e9c5aaa4c21b8","target":"record","created_at":"2026-05-18T01:10:56Z","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":"2b778f28d27df1681c94b3c83deef974d0f8e1ae716b59f39fbe3aab6963edce","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-17T01:41:16Z","title_canon_sha256":"8828f3f68acdedf4d5ff13c9aff6265425374dc4c10fad98293bb143f0eb192e"},"schema_version":"1.0","source":{"id":"1607.04817","kind":"arxiv","version":1}},"canonical_sha256":"b5a30a9fbb9195a8312547beb396d43887e0d0d425458c18471d96b49db0f419","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5a30a9fbb9195a8312547beb396d43887e0d0d425458c18471d96b49db0f419","first_computed_at":"2026-05-18T01:10:56.556938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:56.556938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Ta1sjNLu6a4hnByDF9+9i6I53mulKraaTxCIQgSYRUNvRTF11h5JcE0OsR2HHoGesieJ+AIYhmFK1t1uecaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:56.557490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c885058ee0d3cc183b29a52c2d20e8d6e4dd247a71af92d5e4e9c5aaa4c21b8","sha256:724fdc55761be652f16031743217cf046a23aa5e30aa9daaec1a3e6c8f63aecd"],"state_sha256":"018e0e0cf44ba1d45c324ffd565dce4b4c94da2803ae0a2f478876f5a18f8ff7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWTHoQBafvS3vaAXM2KxjX3HnXRBNAcbg+xDqKP93olnOJKePfJ1DdiIrtvrT/IQpKhJPC+AghK53dV6Dpb7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:18:56.903938Z","bundle_sha256":"237b6e2345f0f5c25c5f5ff689d8019e42da28dfe93a77a7a6340019f7956b8d"}}