{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HQXMBNCIWUECCIH4M3C4BQIPIG","short_pith_number":"pith:HQXMBNCI","canonical_record":{"source":{"id":"1705.09549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T12:08:50Z","cross_cats_sorted":[],"title_canon_sha256":"b49df3ff3be18a873d6f615b6174f0b5f4733a12906ce3e97fa440a3cbf03257","abstract_canon_sha256":"b6a2d45f4455efb85e10d158ea17cb710d76631f56b6c377d82a5760e84dbfe5"},"schema_version":"1.0"},"canonical_sha256":"3c2ec0b448b5082120fc66c5c0c10f419b34fef14537ea6e44e0ae53ebb79e94","source":{"kind":"arxiv","id":"1705.09549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09549","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09549v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09549","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"HQXMBNCIWUEC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HQXMBNCIWUECCIH4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HQXMBNCI","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HQXMBNCIWUECCIH4M3C4BQIPIG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T12:08:50Z","cross_cats_sorted":[],"title_canon_sha256":"b49df3ff3be18a873d6f615b6174f0b5f4733a12906ce3e97fa440a3cbf03257","abstract_canon_sha256":"b6a2d45f4455efb85e10d158ea17cb710d76631f56b6c377d82a5760e84dbfe5"},"schema_version":"1.0"},"canonical_sha256":"3c2ec0b448b5082120fc66c5c0c10f419b34fef14537ea6e44e0ae53ebb79e94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.385963Z","signature_b64":"1ufIj/MLw6qdPh95Z+yFuDXWvJ1tfn9mwn5+/vsiKs2/2NW108ymP+WGYRbu1zMMIShTmOVAVvjQ1ij3BLZDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c2ec0b448b5082120fc66c5c0c10f419b34fef14537ea6e44e0ae53ebb79e94","last_reissued_at":"2026-05-18T00:43:38.385493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.385493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09549","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kvfILRhQ3EyTHgy8Rb9Z/+QcTVCchIpOuFObuCtGhcTb0HVHs+o4ueaa9flE4M7zN5B6COh2KABmqzbeDEJFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:13:58.978406Z"},"content_sha256":"9e49e0bcfdfed823cb1891317a2b2f6ca34ca338a8efddc139a16d857677b993","schema_version":"1.0","event_id":"sha256:9e49e0bcfdfed823cb1891317a2b2f6ca34ca338a8efddc139a16d857677b993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HQXMBNCIWUECCIH4M3C4BQIPIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Residual Expansion Algorithm: Fast and Effective Optimization for Nonconvex Least Squares Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daiki Ikami, Kiyoharu Aizawa, Toshihiko Yamasaki","submitted_at":"2017-05-26T12:08:50Z","abstract_excerpt":"We propose the residual expansion (RE) algorithm: a global (or near-global) optimization method for nonconvex least squares problems. Unlike most existing nonconvex optimization techniques, the RE algorithm is not based on either stochastic or multi-point searches; therefore, it can achieve fast global optimization. Moreover, the RE algorithm is easy to implement and successful in high-dimensional optimization. The RE algorithm exhibits excellent empirical performance in terms of k-means clustering, point-set registration, optimized product quantization, and blind image deblurring."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09549","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-18T00:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6juZaEX61Av10LDpER95ifiPEowrE1jhovxruosOKP9TWlE0oFv8+CmdDCmJzhb5SzGwQyaF4w/aadGpVHhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:13:58.979156Z"},"content_sha256":"d8b826857d1ce896800facb95b163055365ed29b2a34b58fa88c8fc953594a95","schema_version":"1.0","event_id":"sha256:d8b826857d1ce896800facb95b163055365ed29b2a34b58fa88c8fc953594a95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQXMBNCIWUECCIH4M3C4BQIPIG/bundle.json","state_url":"https://pith.science/pith/HQXMBNCIWUECCIH4M3C4BQIPIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQXMBNCIWUECCIH4M3C4BQIPIG/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-26T13:13:58Z","links":{"resolver":"https://pith.science/pith/HQXMBNCIWUECCIH4M3C4BQIPIG","bundle":"https://pith.science/pith/HQXMBNCIWUECCIH4M3C4BQIPIG/bundle.json","state":"https://pith.science/pith/HQXMBNCIWUECCIH4M3C4BQIPIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQXMBNCIWUECCIH4M3C4BQIPIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HQXMBNCIWUECCIH4M3C4BQIPIG","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":"b6a2d45f4455efb85e10d158ea17cb710d76631f56b6c377d82a5760e84dbfe5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T12:08:50Z","title_canon_sha256":"b49df3ff3be18a873d6f615b6174f0b5f4733a12906ce3e97fa440a3cbf03257"},"schema_version":"1.0","source":{"id":"1705.09549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09549","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09549v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09549","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"HQXMBNCIWUEC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HQXMBNCIWUECCIH4","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HQXMBNCI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d8b826857d1ce896800facb95b163055365ed29b2a34b58fa88c8fc953594a95","target":"graph","created_at":"2026-05-18T00:43:38Z","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":"We propose the residual expansion (RE) algorithm: a global (or near-global) optimization method for nonconvex least squares problems. Unlike most existing nonconvex optimization techniques, the RE algorithm is not based on either stochastic or multi-point searches; therefore, it can achieve fast global optimization. Moreover, the RE algorithm is easy to implement and successful in high-dimensional optimization. The RE algorithm exhibits excellent empirical performance in terms of k-means clustering, point-set registration, optimized product quantization, and blind image deblurring.","authors_text":"Daiki Ikami, Kiyoharu Aizawa, Toshihiko Yamasaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T12:08:50Z","title":"Residual Expansion Algorithm: Fast and Effective Optimization for Nonconvex Least Squares Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09549","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:9e49e0bcfdfed823cb1891317a2b2f6ca34ca338a8efddc139a16d857677b993","target":"record","created_at":"2026-05-18T00:43:38Z","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":"b6a2d45f4455efb85e10d158ea17cb710d76631f56b6c377d82a5760e84dbfe5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-05-26T12:08:50Z","title_canon_sha256":"b49df3ff3be18a873d6f615b6174f0b5f4733a12906ce3e97fa440a3cbf03257"},"schema_version":"1.0","source":{"id":"1705.09549","kind":"arxiv","version":1}},"canonical_sha256":"3c2ec0b448b5082120fc66c5c0c10f419b34fef14537ea6e44e0ae53ebb79e94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c2ec0b448b5082120fc66c5c0c10f419b34fef14537ea6e44e0ae53ebb79e94","first_computed_at":"2026-05-18T00:43:38.385493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.385493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ufIj/MLw6qdPh95Z+yFuDXWvJ1tfn9mwn5+/vsiKs2/2NW108ymP+WGYRbu1zMMIShTmOVAVvjQ1ij3BLZDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.385963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e49e0bcfdfed823cb1891317a2b2f6ca34ca338a8efddc139a16d857677b993","sha256:d8b826857d1ce896800facb95b163055365ed29b2a34b58fa88c8fc953594a95"],"state_sha256":"9c24884d019ad0a899f5e1f93f324253753d93ee7dfe8c83baf732aea36cbadc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"968HzahrO39C54/6rqqc/sKjY0x6XZ7eBvNuwXzD4Y7X8Ggyt2I8jxqrPUc4I0wZNamjWAoz4sH/PQtMFnvfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:13:58.982837Z","bundle_sha256":"1fc1b42268ca940cae5ded338212d2b40c2e6907f7c87aff145092c494abaa75"}}