{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:46ABNLJ2E2TGIYNRFPY6ACYPKG","short_pith_number":"pith:46ABNLJ2","canonical_record":{"source":{"id":"1603.03518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:50:59Z","cross_cats_sorted":[],"title_canon_sha256":"a9614a37e3914e7fa4c78b48d032c7139c9cc0a84a7c78b4f0a73be1f98d254b","abstract_canon_sha256":"0d91fe9e65559f3bfcdc47c2aec039748d2e669c2154fb9d3287684223712241"},"schema_version":"1.0"},"canonical_sha256":"e78016ad3a26a66461b12bf1e00b0f519079005b3f54a3eccc1c14cb63ea162c","source":{"kind":"arxiv","id":"1603.03518","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03518","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03518v2","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03518","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"46ABNLJ2E2TG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"46ABNLJ2E2TGIYNR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"46ABNLJ2","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:46ABNLJ2E2TGIYNRFPY6ACYPKG","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03518","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:50:59Z","cross_cats_sorted":[],"title_canon_sha256":"a9614a37e3914e7fa4c78b48d032c7139c9cc0a84a7c78b4f0a73be1f98d254b","abstract_canon_sha256":"0d91fe9e65559f3bfcdc47c2aec039748d2e669c2154fb9d3287684223712241"},"schema_version":"1.0"},"canonical_sha256":"e78016ad3a26a66461b12bf1e00b0f519079005b3f54a3eccc1c14cb63ea162c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:00.779470Z","signature_b64":"UDuv3yMoYDBEZGUw1PEagM0NufHpeA6X9Sys2lcLjanJGaVF0Jd24d/cL4tiXAiLOMoRaoA+Guj2FGN3UJf/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e78016ad3a26a66461b12bf1e00b0f519079005b3f54a3eccc1c14cb63ea162c","last_reissued_at":"2026-05-18T00:11:00.778823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:00.778823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03518","source_version":2,"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-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sisYC6i2wbkLtmwyM56IQyoJMCnGev10+z2eEGJ8KAhf+z9xqcX1RI/wW7eh3TlGddwuWnoCCb3/2XH9XKXgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:48:01.922095Z"},"content_sha256":"1425f5136e07cac963628097d4d0042455c9e468b46cab313fb41f8a0fbe7eea","schema_version":"1.0","event_id":"sha256:1425f5136e07cac963628097d4d0042455c9e468b46cab313fb41f8a0fbe7eea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:46ABNLJ2E2TGIYNRFPY6ACYPKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional Black-box Optimization via Divide and Approximate Conquer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ke Tang, Peng Yang, Xin Yao","submitted_at":"2016-03-11T04:50:59Z","abstract_excerpt":"Divide and Conquer (DC) is conceptually well suited to high-dimensional optimization by decomposing a problem into multiple small-scale sub-problems. However, appealing performance can be seldom observed when the sub-problems are interdependent. This paper suggests that the major difficulty of tackling interdependent sub-problems lies in the precise evaluation of a partial solution (to a sub-problem), which can be overwhelmingly costly and thus makes sub-problems non-trivial to conquer. Thus, we propose an approximation approach, named Divide and Approximate Conquer (DAC), which reduces the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03518","kind":"arxiv","version":2},"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-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PMIRZQ2MVYsHEyq95GPYPM1RtRyQor+f22vGQx/WA9u+NEsbLWco64dqs3Y6H6j3IozmzldwdiDydp705x5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:48:01.922500Z"},"content_sha256":"0ce789bbd7ec29dff65d744eeee470c77d4a24144baa6d8029134692a8b7cfce","schema_version":"1.0","event_id":"sha256:0ce789bbd7ec29dff65d744eeee470c77d4a24144baa6d8029134692a8b7cfce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG/bundle.json","state_url":"https://pith.science/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG/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-25T18:48:01Z","links":{"resolver":"https://pith.science/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG","bundle":"https://pith.science/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG/bundle.json","state":"https://pith.science/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46ABNLJ2E2TGIYNRFPY6ACYPKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:46ABNLJ2E2TGIYNRFPY6ACYPKG","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":"0d91fe9e65559f3bfcdc47c2aec039748d2e669c2154fb9d3287684223712241","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:50:59Z","title_canon_sha256":"a9614a37e3914e7fa4c78b48d032c7139c9cc0a84a7c78b4f0a73be1f98d254b"},"schema_version":"1.0","source":{"id":"1603.03518","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03518","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03518v2","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03518","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"46ABNLJ2E2TG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"46ABNLJ2E2TGIYNR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"46ABNLJ2","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:0ce789bbd7ec29dff65d744eeee470c77d4a24144baa6d8029134692a8b7cfce","target":"graph","created_at":"2026-05-18T00:11:00Z","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":"Divide and Conquer (DC) is conceptually well suited to high-dimensional optimization by decomposing a problem into multiple small-scale sub-problems. However, appealing performance can be seldom observed when the sub-problems are interdependent. This paper suggests that the major difficulty of tackling interdependent sub-problems lies in the precise evaluation of a partial solution (to a sub-problem), which can be overwhelmingly costly and thus makes sub-problems non-trivial to conquer. Thus, we propose an approximation approach, named Divide and Approximate Conquer (DAC), which reduces the co","authors_text":"Ke Tang, Peng Yang, Xin Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:50:59Z","title":"High-dimensional Black-box Optimization via Divide and Approximate Conquer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03518","kind":"arxiv","version":2},"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:1425f5136e07cac963628097d4d0042455c9e468b46cab313fb41f8a0fbe7eea","target":"record","created_at":"2026-05-18T00:11:00Z","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":"0d91fe9e65559f3bfcdc47c2aec039748d2e669c2154fb9d3287684223712241","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:50:59Z","title_canon_sha256":"a9614a37e3914e7fa4c78b48d032c7139c9cc0a84a7c78b4f0a73be1f98d254b"},"schema_version":"1.0","source":{"id":"1603.03518","kind":"arxiv","version":2}},"canonical_sha256":"e78016ad3a26a66461b12bf1e00b0f519079005b3f54a3eccc1c14cb63ea162c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e78016ad3a26a66461b12bf1e00b0f519079005b3f54a3eccc1c14cb63ea162c","first_computed_at":"2026-05-18T00:11:00.778823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:00.778823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UDuv3yMoYDBEZGUw1PEagM0NufHpeA6X9Sys2lcLjanJGaVF0Jd24d/cL4tiXAiLOMoRaoA+Guj2FGN3UJf/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:00.779470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03518","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1425f5136e07cac963628097d4d0042455c9e468b46cab313fb41f8a0fbe7eea","sha256:0ce789bbd7ec29dff65d744eeee470c77d4a24144baa6d8029134692a8b7cfce"],"state_sha256":"e50a07846fc8279e51d704d21b8456f418b7e44964cf299719fc7a20193e875e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqmySFFQSWtz/tK6krG9ICdIgrchI8LWb9IuCZ2gGAtWgp9wvoXmdfjYqc2sThxp2abHCZOKRXdbsnP9T7vnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:48:01.925587Z","bundle_sha256":"e7a43ce687edb5d122b5c2a6b9abe55355d252b9e133b96251343511d373677a"}}