{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:LLNEFMNHQW7L7A3EEEMQXOXYGM","short_pith_number":"pith:LLNEFMNH","canonical_record":{"source":{"id":"2105.11586","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-25T00:08:47Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"35faba4c330aacf6a6432fdad718eb72032971df9e4cd6a74356a320b914f84f","abstract_canon_sha256":"b94f15ad7b55540598897f5997fc79e854cabb6c0228966b7533fc130c7ee27d"},"schema_version":"1.0"},"canonical_sha256":"5ada42b1a785bebf836421190bbaf83339808d118442c51306495b89c68b8128","source":{"kind":"arxiv","id":"2105.11586","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11586","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11586v4","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11586","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"LLNEFMNHQW7L","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"pith_short_16","alias_value":"LLNEFMNHQW7L7A3E","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"pith_short_8","alias_value":"LLNEFMNH","created_at":"2026-07-05T03:45:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:LLNEFMNHQW7L7A3EEEMQXOXYGM","target":"record","payload":{"canonical_record":{"source":{"id":"2105.11586","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-25T00:08:47Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"35faba4c330aacf6a6432fdad718eb72032971df9e4cd6a74356a320b914f84f","abstract_canon_sha256":"b94f15ad7b55540598897f5997fc79e854cabb6c0228966b7533fc130c7ee27d"},"schema_version":"1.0"},"canonical_sha256":"5ada42b1a785bebf836421190bbaf83339808d118442c51306495b89c68b8128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:45:09.263627Z","signature_b64":"LhcUsp/D7ZJwhE1eUWCQ4166u5NxalslH5pEtmL4CYgh/DesZBsTvT4JhAy6bvzTqnLE+dGUgrl2/0i/bP+hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ada42b1a785bebf836421190bbaf83339808d118442c51306495b89c68b8128","last_reissued_at":"2026-07-05T03:45:09.263194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:45:09.263194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.11586","source_version":4,"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-05T03:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbaqxzX+OFHamUr7EoK7Ugbzm2HsIbVkw1K0DqJYc5n3a6BWb+vnbDkURXHlR0yShreLWZpV2KM2vfo7zT1nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:29:49.994494Z"},"content_sha256":"fef985a0f1805a86613dbdccc0f71622b08d6a23485972a724751acbf90cd261","schema_version":"1.0","event_id":"sha256:fef985a0f1805a86613dbdccc0f71622b08d6a23485972a724751acbf90cd261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:LLNEFMNHQW7L7A3EEEMQXOXYGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saddle Point Optimization with Approximate Minimization Oracle and its Application to Robust Berthing Control","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"Atsuo Maki, Yoshiki Miyauchi, Youhei Akimoto","submitted_at":"2021-05-25T00:08:47Z","abstract_excerpt":"We propose an approach to saddle point optimization relying only on oracles that solve minimization problems approximately. We analyze its convergence property on a strongly convex--concave problem and show its linear convergence toward the global min--max saddle point. Based on the convergence analysis, we develop a heuristic approach to adapt the learning rate. An implementation of the developed approach using the (1+1)-CMA-ES as the minimization oracle, namely Adversarial-CMA-ES, is shown to outperform several existing approaches on test problems. Numerical evaluation confirms the tightness"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11586","kind":"arxiv","version":4},"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/2105.11586/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-05T03:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGyhpNrEb08CdZ4ELXTEYterccDirbeMbII5H5CB1VZNSl18iirEz27a+3kpLxPh5h7e6qjbrRy7D2vecaeUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:29:49.995026Z"},"content_sha256":"de86d3aa33a02fb4970428a9a1b4dd6ea31713f4992983e10099251e7ab44e17","schema_version":"1.0","event_id":"sha256:de86d3aa33a02fb4970428a9a1b4dd6ea31713f4992983e10099251e7ab44e17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM/bundle.json","state_url":"https://pith.science/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM/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-23T11:29:49Z","links":{"resolver":"https://pith.science/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM","bundle":"https://pith.science/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM/bundle.json","state":"https://pith.science/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLNEFMNHQW7L7A3EEEMQXOXYGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LLNEFMNHQW7L7A3EEEMQXOXYGM","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":"b94f15ad7b55540598897f5997fc79e854cabb6c0228966b7533fc130c7ee27d","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-25T00:08:47Z","title_canon_sha256":"35faba4c330aacf6a6432fdad718eb72032971df9e4cd6a74356a320b914f84f"},"schema_version":"1.0","source":{"id":"2105.11586","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11586","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11586v4","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11586","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"LLNEFMNHQW7L","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"pith_short_16","alias_value":"LLNEFMNHQW7L7A3E","created_at":"2026-07-05T03:45:09Z"},{"alias_kind":"pith_short_8","alias_value":"LLNEFMNH","created_at":"2026-07-05T03:45:09Z"}],"graph_snapshots":[{"event_id":"sha256:de86d3aa33a02fb4970428a9a1b4dd6ea31713f4992983e10099251e7ab44e17","target":"graph","created_at":"2026-07-05T03:45:09Z","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/2105.11586/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an approach to saddle point optimization relying only on oracles that solve minimization problems approximately. We analyze its convergence property on a strongly convex--concave problem and show its linear convergence toward the global min--max saddle point. Based on the convergence analysis, we develop a heuristic approach to adapt the learning rate. An implementation of the developed approach using the (1+1)-CMA-ES as the minimization oracle, namely Adversarial-CMA-ES, is shown to outperform several existing approaches on test problems. Numerical evaluation confirms the tightness","authors_text":"Atsuo Maki, Yoshiki Miyauchi, Youhei Akimoto","cross_cats":["cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-25T00:08:47Z","title":"Saddle Point Optimization with Approximate Minimization Oracle and its Application to Robust Berthing Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11586","kind":"arxiv","version":4},"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:fef985a0f1805a86613dbdccc0f71622b08d6a23485972a724751acbf90cd261","target":"record","created_at":"2026-07-05T03:45:09Z","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":"b94f15ad7b55540598897f5997fc79e854cabb6c0228966b7533fc130c7ee27d","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-05-25T00:08:47Z","title_canon_sha256":"35faba4c330aacf6a6432fdad718eb72032971df9e4cd6a74356a320b914f84f"},"schema_version":"1.0","source":{"id":"2105.11586","kind":"arxiv","version":4}},"canonical_sha256":"5ada42b1a785bebf836421190bbaf83339808d118442c51306495b89c68b8128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ada42b1a785bebf836421190bbaf83339808d118442c51306495b89c68b8128","first_computed_at":"2026-07-05T03:45:09.263194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:45:09.263194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LhcUsp/D7ZJwhE1eUWCQ4166u5NxalslH5pEtmL4CYgh/DesZBsTvT4JhAy6bvzTqnLE+dGUgrl2/0i/bP+hCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:45:09.263627Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.11586","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fef985a0f1805a86613dbdccc0f71622b08d6a23485972a724751acbf90cd261","sha256:de86d3aa33a02fb4970428a9a1b4dd6ea31713f4992983e10099251e7ab44e17"],"state_sha256":"fb957f5d496d65df5de9706d0bc5da19644309578518c0cb71ecca2fc24f9f85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y46H0w0eaHsaTwSKJ+3f5/t27zDgk2F4gBS50b/Ii8/n9aPydsrYsbieXUY0jz2tfGhZoRBYTLe7ld/IoCkyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T11:29:49.999830Z","bundle_sha256":"2ac76fbd407f841a5af509dde6b781f4986f7a079f8397f097fd39768fcd1533"}}