{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BFOCP2JRORW62FYYDGFDKD2EZM","short_pith_number":"pith:BFOCP2JR","canonical_record":{"source":{"id":"2203.05717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-11T02:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"861dd24875ddcd2919ad233dac483ede04c97a09ca8fb311d506e8cfeb873a43","abstract_canon_sha256":"0a72760b64331765620e73a8bc5af715641e908574335b52727a747610f8e918"},"schema_version":"1.0"},"canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","source":{"kind":"arxiv","id":"2203.05717","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05717","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05717v2","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05717","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"BFOCP2JRORW6","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"pith_short_16","alias_value":"BFOCP2JRORW62FYY","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"pith_short_8","alias_value":"BFOCP2JR","created_at":"2026-07-05T05:16:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BFOCP2JRORW62FYYDGFDKD2EZM","target":"record","payload":{"canonical_record":{"source":{"id":"2203.05717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-11T02:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"861dd24875ddcd2919ad233dac483ede04c97a09ca8fb311d506e8cfeb873a43","abstract_canon_sha256":"0a72760b64331765620e73a8bc5af715641e908574335b52727a747610f8e918"},"schema_version":"1.0"},"canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:32.776617Z","signature_b64":"J9S0gURjUfeX2PM6bjVvtlTsSThxCfUtoC3Ba9XIw8XkEBE/x4HChr8Ou7cqiBruZamyuLxKwos9/Frc9IdCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","last_reissued_at":"2026-07-05T05:16:32.776155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:32.776155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.05717","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-07-05T05:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDEbA2Qh70yWwPxZoB+cU2n1WX8Ek5L2OKsT8DqsznH00XIYa49Hb+fmU0I7J6SFxlTcmp5GJrz5e0Bdp5iTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:00:38.133279Z"},"content_sha256":"33e6ff0028d3bb7bfde2900bf8fbd3bfe450c8a3310d4df65e15909d180a3579","schema_version":"1.0","event_id":"sha256:33e6ff0028d3bb7bfde2900bf8fbd3bfe450c8a3310d4df65e15909d180a3579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BFOCP2JRORW62FYYDGFDKD2EZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single Loop Gaussian Homotopy Method for Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Hidenori Iwakiri, Shinji Ito, Yuhang Wang","submitted_at":"2022-03-11T02:05:27Z","abstract_excerpt":"The Gaussian homotopy (GH) method is a popular approach to finding better stationary points for non-convex optimization problems by gradually reducing a parameter value $t$, which changes the problem to be solved from an almost convex one to the original target one. Existing GH-based methods repeatedly call an iterative optimization solver to find a stationary point every time $t$ is updated, which incurs high computational costs. We propose a novel single loop framework for GH methods (SLGH) that updates the parameter $t$ and the optimization decision variables at the same. Computational comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05717","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.05717/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:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qFimwPbUsQb1wzsBpGSNxvb+qdBbteDFLyuwfJRBIMeq+/0SiPOO66pdAOJJgJBV1T5riWufzA/kHMGhuRlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:00:38.133798Z"},"content_sha256":"8b6f92d37975256893458956f87b66d9aa639377f8dc7cdf7ad43d38f60854c6","schema_version":"1.0","event_id":"sha256:8b6f92d37975256893458956f87b66d9aa639377f8dc7cdf7ad43d38f60854c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/bundle.json","state_url":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFOCP2JRORW62FYYDGFDKD2EZM/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-08T04:00:38Z","links":{"resolver":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM","bundle":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/bundle.json","state":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFOCP2JRORW62FYYDGFDKD2EZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BFOCP2JRORW62FYYDGFDKD2EZM","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":"0a72760b64331765620e73a8bc5af715641e908574335b52727a747610f8e918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-11T02:05:27Z","title_canon_sha256":"861dd24875ddcd2919ad233dac483ede04c97a09ca8fb311d506e8cfeb873a43"},"schema_version":"1.0","source":{"id":"2203.05717","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05717","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05717v2","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05717","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"BFOCP2JRORW6","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"pith_short_16","alias_value":"BFOCP2JRORW62FYY","created_at":"2026-07-05T05:16:32Z"},{"alias_kind":"pith_short_8","alias_value":"BFOCP2JR","created_at":"2026-07-05T05:16:32Z"}],"graph_snapshots":[{"event_id":"sha256:8b6f92d37975256893458956f87b66d9aa639377f8dc7cdf7ad43d38f60854c6","target":"graph","created_at":"2026-07-05T05:16:32Z","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/2203.05717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Gaussian homotopy (GH) method is a popular approach to finding better stationary points for non-convex optimization problems by gradually reducing a parameter value $t$, which changes the problem to be solved from an almost convex one to the original target one. Existing GH-based methods repeatedly call an iterative optimization solver to find a stationary point every time $t$ is updated, which incurs high computational costs. We propose a novel single loop framework for GH methods (SLGH) that updates the parameter $t$ and the optimization decision variables at the same. Computational comp","authors_text":"Akiko Takeda, Hidenori Iwakiri, Shinji Ito, Yuhang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-11T02:05:27Z","title":"Single Loop Gaussian Homotopy Method for Non-convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05717","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:33e6ff0028d3bb7bfde2900bf8fbd3bfe450c8a3310d4df65e15909d180a3579","target":"record","created_at":"2026-07-05T05:16:32Z","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":"0a72760b64331765620e73a8bc5af715641e908574335b52727a747610f8e918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-11T02:05:27Z","title_canon_sha256":"861dd24875ddcd2919ad233dac483ede04c97a09ca8fb311d506e8cfeb873a43"},"schema_version":"1.0","source":{"id":"2203.05717","kind":"arxiv","version":2}},"canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","first_computed_at":"2026-07-05T05:16:32.776155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:16:32.776155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J9S0gURjUfeX2PM6bjVvtlTsSThxCfUtoC3Ba9XIw8XkEBE/x4HChr8Ou7cqiBruZamyuLxKwos9/Frc9IdCAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:16:32.776617Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.05717","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e6ff0028d3bb7bfde2900bf8fbd3bfe450c8a3310d4df65e15909d180a3579","sha256:8b6f92d37975256893458956f87b66d9aa639377f8dc7cdf7ad43d38f60854c6"],"state_sha256":"c9b62d12b41ee3089110c708cc4f862dac2a257d22d86ad08c9a4b302ba15025"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vteiJZ3XmXtP2QTsY8EHwSW6DxQy0BtJQAEkuZgzQf+oFWr+p6iakFIjwR+GWLwUmovKUUgwoHwrldAXAXarDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:00:38.137857Z","bundle_sha256":"61b55e18f5ea9f85b5507734e96996cd5a8d8ac68c576e15214f19d14bc56bb8"}}