{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WEY3MJM4M334QG2TMXM7FYKJUX","short_pith_number":"pith:WEY3MJM4","canonical_record":{"source":{"id":"2606.19050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-17T13:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"ec20a9b70314826f738fdefddb5c290862e0cefe22bc90e0f28caf95170d6560","abstract_canon_sha256":"53148c9dedff88b498661e5efbcaaeb97e41a927c5a9ddfbc610d26f9d28ff44"},"schema_version":"1.0"},"canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","source":{"kind":"arxiv","id":"2606.19050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19050","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19050v1","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19050","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"WEY3MJM4M334","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"pith_short_16","alias_value":"WEY3MJM4M334QG2T","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"pith_short_8","alias_value":"WEY3MJM4","created_at":"2026-06-19T16:11:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WEY3MJM4M334QG2TMXM7FYKJUX","target":"record","payload":{"canonical_record":{"source":{"id":"2606.19050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-17T13:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"ec20a9b70314826f738fdefddb5c290862e0cefe22bc90e0f28caf95170d6560","abstract_canon_sha256":"53148c9dedff88b498661e5efbcaaeb97e41a927c5a9ddfbc610d26f9d28ff44"},"schema_version":"1.0"},"canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:55.404972Z","signature_b64":"14DUkUA3IL3N4Ph4QeVEJfg3zzh60ecQgq5xYSZOFFdrugDWSIlUVe0zEvsgR/RZFkZK0x6H/Sn7R56BviuMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","last_reissued_at":"2026-06-19T16:11:55.404619Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:55.404619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.19050","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-06-19T16:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfuCG8pkEpuknOx8EL09Mebk6JwoKQ5d527LK45tVTsQc9YZSjOBZ6Ftnh4dqASJCRNJV4Mz9XyGOReTD0GOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:58:38.423213Z"},"content_sha256":"8c1a26b428f4862b56a920b930930e1c8383cfbf762cb8b62e8f834323fbe492","schema_version":"1.0","event_id":"sha256:8c1a26b428f4862b56a920b930930e1c8383cfbf762cb8b62e8f834323fbe492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WEY3MJM4M334QG2TMXM7FYKJUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xinhao Ying, Yangyang Xu","submitted_at":"2026-06-17T13:17:06Z","abstract_excerpt":"Minimax problems arise in many applications, including robust learning and Stackelberg models. Most existing methods for minimax problems address unconstrained or projection-friendly settings, while functional constrained minimax problems remain far less explored. We study a class of convex-(strongly-)concave minimax problems with functional constraints. By exploiting strong duality, we incorporate the inner-maximization functional constraints into the objective. This allows us to efficiently obtain inexact gradients of the primal function of the reformulation and to design a proximal augmente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19050","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.19050/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-06-19T16:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehBejdkusx4MAeJFVjT1trvwpAKGeCprBzg531lfqaEBrvecHzbdBnX1GUbiugyNsn60n74gmdPThulgeIb2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:58:38.423602Z"},"content_sha256":"dd884f9277dc9005879d1f9eb3a1e887b1ba69470ed11831a5b6130607bcaabb","schema_version":"1.0","event_id":"sha256:dd884f9277dc9005879d1f9eb3a1e887b1ba69470ed11831a5b6130607bcaabb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/bundle.json","state_url":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEY3MJM4M334QG2TMXM7FYKJUX/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-06-28T04:58:38Z","links":{"resolver":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX","bundle":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/bundle.json","state":"https://pith.science/pith/WEY3MJM4M334QG2TMXM7FYKJUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEY3MJM4M334QG2TMXM7FYKJUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WEY3MJM4M334QG2TMXM7FYKJUX","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":"53148c9dedff88b498661e5efbcaaeb97e41a927c5a9ddfbc610d26f9d28ff44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-17T13:17:06Z","title_canon_sha256":"ec20a9b70314826f738fdefddb5c290862e0cefe22bc90e0f28caf95170d6560"},"schema_version":"1.0","source":{"id":"2606.19050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19050","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19050v1","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19050","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"WEY3MJM4M334","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"pith_short_16","alias_value":"WEY3MJM4M334QG2T","created_at":"2026-06-19T16:11:55Z"},{"alias_kind":"pith_short_8","alias_value":"WEY3MJM4","created_at":"2026-06-19T16:11:55Z"}],"graph_snapshots":[{"event_id":"sha256:dd884f9277dc9005879d1f9eb3a1e887b1ba69470ed11831a5b6130607bcaabb","target":"graph","created_at":"2026-06-19T16:11:55Z","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/2606.19050/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimax problems arise in many applications, including robust learning and Stackelberg models. Most existing methods for minimax problems address unconstrained or projection-friendly settings, while functional constrained minimax problems remain far less explored. We study a class of convex-(strongly-)concave minimax problems with functional constraints. By exploiting strong duality, we incorporate the inner-maximization functional constraints into the objective. This allows us to efficiently obtain inexact gradients of the primal function of the reformulation and to design a proximal augmente","authors_text":"Xinhao Ying, Yangyang Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-17T13:17:06Z","title":"First-Order Methods for Solving Convex (Strongly) Concave Minimax Problems with Functional Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19050","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:8c1a26b428f4862b56a920b930930e1c8383cfbf762cb8b62e8f834323fbe492","target":"record","created_at":"2026-06-19T16:11:55Z","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":"53148c9dedff88b498661e5efbcaaeb97e41a927c5a9ddfbc610d26f9d28ff44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-17T13:17:06Z","title_canon_sha256":"ec20a9b70314826f738fdefddb5c290862e0cefe22bc90e0f28caf95170d6560"},"schema_version":"1.0","source":{"id":"2606.19050","kind":"arxiv","version":1}},"canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b131b6259c66f7c81b5365d9f2e149a5cb770a9eb92696c1ca29b1561f5dc4a6","first_computed_at":"2026-06-19T16:11:55.404619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:55.404619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"14DUkUA3IL3N4Ph4QeVEJfg3zzh60ecQgq5xYSZOFFdrugDWSIlUVe0zEvsgR/RZFkZK0x6H/Sn7R56BviuMCw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:55.404972Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c1a26b428f4862b56a920b930930e1c8383cfbf762cb8b62e8f834323fbe492","sha256:dd884f9277dc9005879d1f9eb3a1e887b1ba69470ed11831a5b6130607bcaabb"],"state_sha256":"e86d09320cde5dca76402fc6bcc556d98816156a73a69270659d0cabe7ac1ae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LaFni735X989kXSbPc7YUw9PlQr26lw7jmHoTgY5AGWGe8IIAKLjeFoo+7+0pDBj6Tc3HNfuavCclzhnTd+KAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T04:58:38.425643Z","bundle_sha256":"ed4784ca547144777f87f5150908f3664a136bd9b478861bb3fe107f2d823d8b"}}