{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q2Q75EPKWUSCQOCBFQTEAUFI42","short_pith_number":"pith:Q2Q75EPK","canonical_record":{"source":{"id":"1905.12733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T21:14:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6f3f8c563f364c166d53f59824f5241794a5faef96167a52da189d61c4214cfb","abstract_canon_sha256":"5f1d47a11c26e228201597b0e5abe5577b2c448702869e7c63013682b2f2bed8"},"schema_version":"1.0"},"canonical_sha256":"86a1fe91eab5242838412c264050a8e6aaab5f45863e2ebc5a44ce17a8813c89","source":{"kind":"arxiv","id":"1905.12733","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12733","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12733v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12733","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"Q2Q75EPKWUSC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q2Q75EPKWUSCQOCB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q2Q75EPK","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q2Q75EPKWUSCQOCBFQTEAUFI42","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T21:14:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6f3f8c563f364c166d53f59824f5241794a5faef96167a52da189d61c4214cfb","abstract_canon_sha256":"5f1d47a11c26e228201597b0e5abe5577b2c448702869e7c63013682b2f2bed8"},"schema_version":"1.0"},"canonical_sha256":"86a1fe91eab5242838412c264050a8e6aaab5f45863e2ebc5a44ce17a8813c89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.775335Z","signature_b64":"vZp1TdErWhGeNN4MQK7/HVuVbOXc5QT+t0EaFLD0uEJZN8Y0Lp8CYJ1b0UAjrXl9fuRHMUaTeWiMpJAwwoGgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86a1fe91eab5242838412c264050a8e6aaab5f45863e2ebc5a44ce17a8813c89","last_reissued_at":"2026-05-17T23:44:39.774894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.774894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12733","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-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFeKHBD4R6t8yu98gkIC9rBy6YOHicYCfe8ZLRqxUJT1yjJlrG+Q2upJ4+P/4Wf9W8mMHdRMeGEka+VxBmNbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:01:13.907170Z"},"content_sha256":"7c4528604865f2f50fe5f44070294ce25ebf1f2fe5039e98ff6f6d8013939a86","schema_version":"1.0","event_id":"sha256:7c4528604865f2f50fe5f44070294ce25ebf1f2fe5039e98ff6f6d8013939a86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q2Q75EPKWUSCQOCBFQTEAUFI42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Min-Max Optimization with Application to Minimal Bounding Sphere","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Hakan Gokcesu, Kaan Gokcesu, Suleyman Serdar Kozat","submitted_at":"2019-05-29T21:14:07Z","abstract_excerpt":"We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an arbitrarily small positive optimality gap of $\\delta$ in $\\tilde{O}(1/\\sqrt{\\delta})$ computational complexity (up to logarithmic factors) as opposed to the state-of-the-art strong-convexity computational requirement of $O(1/\\delta)$. We apply this important result to the well-known minimal bounding sphere problem and demonstrate that we can achieve a $(1+\\vareps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12733","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-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeR24iA8d8XdCmlQ04tl3kRXxMxqmAnxuJoA36PwWiDh76CrNmF+XpmI2HYTIksEkRCnnbBoTzJjYGtMYzdjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:01:13.907693Z"},"content_sha256":"d5e8c6714028b42b37c3f795ffe4e777b744f8e21c7c04bb76019562bcc48b25","schema_version":"1.0","event_id":"sha256:d5e8c6714028b42b37c3f795ffe4e777b744f8e21c7c04bb76019562bcc48b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42/bundle.json","state_url":"https://pith.science/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42/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:01:13Z","links":{"resolver":"https://pith.science/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42","bundle":"https://pith.science/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42/bundle.json","state":"https://pith.science/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2Q75EPKWUSCQOCBFQTEAUFI42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q2Q75EPKWUSCQOCBFQTEAUFI42","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":"5f1d47a11c26e228201597b0e5abe5577b2c448702869e7c63013682b2f2bed8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T21:14:07Z","title_canon_sha256":"6f3f8c563f364c166d53f59824f5241794a5faef96167a52da189d61c4214cfb"},"schema_version":"1.0","source":{"id":"1905.12733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12733","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12733v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12733","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"Q2Q75EPKWUSC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q2Q75EPKWUSCQOCB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q2Q75EPK","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:d5e8c6714028b42b37c3f795ffe4e777b744f8e21c7c04bb76019562bcc48b25","target":"graph","created_at":"2026-05-17T23:44:39Z","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 study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an arbitrarily small positive optimality gap of $\\delta$ in $\\tilde{O}(1/\\sqrt{\\delta})$ computational complexity (up to logarithmic factors) as opposed to the state-of-the-art strong-convexity computational requirement of $O(1/\\delta)$. We apply this important result to the well-known minimal bounding sphere problem and demonstrate that we can achieve a $(1+\\vareps","authors_text":"Hakan Gokcesu, Kaan Gokcesu, Suleyman Serdar Kozat","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T21:14:07Z","title":"Accelerating Min-Max Optimization with Application to Minimal Bounding Sphere"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12733","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:7c4528604865f2f50fe5f44070294ce25ebf1f2fe5039e98ff6f6d8013939a86","target":"record","created_at":"2026-05-17T23:44:39Z","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":"5f1d47a11c26e228201597b0e5abe5577b2c448702869e7c63013682b2f2bed8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-29T21:14:07Z","title_canon_sha256":"6f3f8c563f364c166d53f59824f5241794a5faef96167a52da189d61c4214cfb"},"schema_version":"1.0","source":{"id":"1905.12733","kind":"arxiv","version":1}},"canonical_sha256":"86a1fe91eab5242838412c264050a8e6aaab5f45863e2ebc5a44ce17a8813c89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86a1fe91eab5242838412c264050a8e6aaab5f45863e2ebc5a44ce17a8813c89","first_computed_at":"2026-05-17T23:44:39.774894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:39.774894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vZp1TdErWhGeNN4MQK7/HVuVbOXc5QT+t0EaFLD0uEJZN8Y0Lp8CYJ1b0UAjrXl9fuRHMUaTeWiMpJAwwoGgDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:39.775335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c4528604865f2f50fe5f44070294ce25ebf1f2fe5039e98ff6f6d8013939a86","sha256:d5e8c6714028b42b37c3f795ffe4e777b744f8e21c7c04bb76019562bcc48b25"],"state_sha256":"695de8069cd9f5edf8cbdc75e9573adccdcb41adba6be612d5e757e797c022b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rydvgwzdern9sSY6zHaB4IEZ91dSv/4v9phyV7IIpIhMMyr7Y0FjKUycX4QSPecxYTczwan1ivpragL/1wrkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:01:13.910590Z","bundle_sha256":"661087cd218317c93752cfd7bf8ce50204236e62452dabaa940b72e3980ff2c9"}}