{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3E2T65NAQONBPRZQ7O2J6ANEBM","short_pith_number":"pith:3E2T65NA","canonical_record":{"source":{"id":"2212.02724","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-06T03:25:44Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"87a6e098c0831cc10447c4e8edc4492b80de3316dff0037c910e1dfddf777619","abstract_canon_sha256":"7b22bd519e4b6adcb5c172e0dd76e2feb33ec07684bbaab7ac2d99ab7fdcd855"},"schema_version":"1.0"},"canonical_sha256":"d9353f75a0839a17c730fbb49f01a40b2763e7e327f68859d8a9b4cfbf5077c7","source":{"kind":"arxiv","id":"2212.02724","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02724","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02724v3","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02724","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"3E2T65NAQONB","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"3E2T65NAQONBPRZQ","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"3E2T65NA","created_at":"2026-07-05T08:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3E2T65NAQONBPRZQ7O2J6ANEBM","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02724","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-06T03:25:44Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"87a6e098c0831cc10447c4e8edc4492b80de3316dff0037c910e1dfddf777619","abstract_canon_sha256":"7b22bd519e4b6adcb5c172e0dd76e2feb33ec07684bbaab7ac2d99ab7fdcd855"},"schema_version":"1.0"},"canonical_sha256":"d9353f75a0839a17c730fbb49f01a40b2763e7e327f68859d8a9b4cfbf5077c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:01.877691Z","signature_b64":"whWsYfVygl+A0zgYKz8Mgq3VWEvjO+DndtQgxvz+vU5c6I8xgeXWSCRYU/E6DPJL5I63PLyRaeZJ/Npw2AnBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9353f75a0839a17c730fbb49f01a40b2763e7e327f68859d8a9b4cfbf5077c7","last_reissued_at":"2026-07-05T08:30:01.877224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:01.877224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02724","source_version":3,"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-05T08:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkH+s9TgLcER2lsVgODqF/o9ohRZa8vCnqlpJP4VThSBkx8bjZsHVdVYX8J719i6uMhLzBPsL+KhX7mWNu1hDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:41:53.462016Z"},"content_sha256":"a2e6d1f8079f80c980922ed388e27d8f99cc95b3145f6d143f8fc6a78be12133","schema_version":"1.0","event_id":"sha256:a2e6d1f8079f80c980922ed388e27d8f99cc95b3145f6d143f8fc6a78be12133"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3E2T65NAQONBPRZQ7O2J6ANEBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongchang Gao","submitted_at":"2022-12-06T03:25:44Z","abstract_excerpt":"Minimax optimization problems have attracted significant attention in recent years due to their widespread application in numerous machine learning models. To solve the minimax problem, a wide variety of stochastic optimization methods have been proposed. However, most of them ignore the distributed setting where the training data is distributed on multiple workers. In this paper, we developed a novel decentralized stochastic gradient descent ascent method for the finite-sum minimax problem. In particular, by employing the variance-reduced gradient, our method can achieve $O(\\frac{\\sqrt{n}\\kap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02724","kind":"arxiv","version":3},"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/2212.02724/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-05T08:30:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1wObSFeSf37zzmCQpb8P0FmGWNl00v9Af+1NvvtBa8eFpOlQqWutAatMQIcwgoGavIKQy+hTIVf17G8YNIVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:41:53.462573Z"},"content_sha256":"0823762a0f103afdfc29df8e68c7a3aa6688c00a6398c4bea0992f911d73850b","schema_version":"1.0","event_id":"sha256:0823762a0f103afdfc29df8e68c7a3aa6688c00a6398c4bea0992f911d73850b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3E2T65NAQONBPRZQ7O2J6ANEBM/bundle.json","state_url":"https://pith.science/pith/3E2T65NAQONBPRZQ7O2J6ANEBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3E2T65NAQONBPRZQ7O2J6ANEBM/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-08T23:41:53Z","links":{"resolver":"https://pith.science/pith/3E2T65NAQONBPRZQ7O2J6ANEBM","bundle":"https://pith.science/pith/3E2T65NAQONBPRZQ7O2J6ANEBM/bundle.json","state":"https://pith.science/pith/3E2T65NAQONBPRZQ7O2J6ANEBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3E2T65NAQONBPRZQ7O2J6ANEBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3E2T65NAQONBPRZQ7O2J6ANEBM","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":"7b22bd519e4b6adcb5c172e0dd76e2feb33ec07684bbaab7ac2d99ab7fdcd855","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-06T03:25:44Z","title_canon_sha256":"87a6e098c0831cc10447c4e8edc4492b80de3316dff0037c910e1dfddf777619"},"schema_version":"1.0","source":{"id":"2212.02724","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02724","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02724v3","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02724","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"pith_short_12","alias_value":"3E2T65NAQONB","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"3E2T65NAQONBPRZQ","created_at":"2026-07-05T08:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"3E2T65NA","created_at":"2026-07-05T08:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:0823762a0f103afdfc29df8e68c7a3aa6688c00a6398c4bea0992f911d73850b","target":"graph","created_at":"2026-07-05T08:30:01Z","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/2212.02724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimax optimization problems have attracted significant attention in recent years due to their widespread application in numerous machine learning models. To solve the minimax problem, a wide variety of stochastic optimization methods have been proposed. However, most of them ignore the distributed setting where the training data is distributed on multiple workers. In this paper, we developed a novel decentralized stochastic gradient descent ascent method for the finite-sum minimax problem. In particular, by employing the variance-reduced gradient, our method can achieve $O(\\frac{\\sqrt{n}\\kap","authors_text":"Hongchang Gao","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-06T03:25:44Z","title":"Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02724","kind":"arxiv","version":3},"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:a2e6d1f8079f80c980922ed388e27d8f99cc95b3145f6d143f8fc6a78be12133","target":"record","created_at":"2026-07-05T08:30:01Z","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":"7b22bd519e4b6adcb5c172e0dd76e2feb33ec07684bbaab7ac2d99ab7fdcd855","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-12-06T03:25:44Z","title_canon_sha256":"87a6e098c0831cc10447c4e8edc4492b80de3316dff0037c910e1dfddf777619"},"schema_version":"1.0","source":{"id":"2212.02724","kind":"arxiv","version":3}},"canonical_sha256":"d9353f75a0839a17c730fbb49f01a40b2763e7e327f68859d8a9b4cfbf5077c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9353f75a0839a17c730fbb49f01a40b2763e7e327f68859d8a9b4cfbf5077c7","first_computed_at":"2026-07-05T08:30:01.877224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:30:01.877224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whWsYfVygl+A0zgYKz8Mgq3VWEvjO+DndtQgxvz+vU5c6I8xgeXWSCRYU/E6DPJL5I63PLyRaeZJ/Npw2AnBAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:30:01.877691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02724","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2e6d1f8079f80c980922ed388e27d8f99cc95b3145f6d143f8fc6a78be12133","sha256:0823762a0f103afdfc29df8e68c7a3aa6688c00a6398c4bea0992f911d73850b"],"state_sha256":"0c006b5006867371396c9882897f947289ca549154dcce8f51992a1d4bf82d17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v40nxZWizQk3mzZSThuH09oHcpPRO5byNYLVY2wOKg1j+jHjQHNoKjJTxrkL3I7cgKl0+oBBmf7MARwflAh/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:41:53.467332Z","bundle_sha256":"e3118512c69e05af1ee583c52ec4b9967671fe09884a8ed12b13de8c41fa0dd5"}}