{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PCO4ETYWCWCTDTFWGM7VVXXK3F","short_pith_number":"pith:PCO4ETYW","canonical_record":{"source":{"id":"2303.02532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-05T00:26:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7700fa6bb141410b605c6c3cb4a943b91973728b972ec9e7d466286935bda38e","abstract_canon_sha256":"c1c7ad892978cb3b44c8f60d666c75f0d3308dbb3c57c09027465a7cde59d1a1"},"schema_version":"1.0"},"canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","source":{"kind":"arxiv","id":"2303.02532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.02532","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"arxiv_version","alias_value":"2303.02532v1","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.02532","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"pith_short_12","alias_value":"PCO4ETYWCWCT","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"pith_short_16","alias_value":"PCO4ETYWCWCTDTFW","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"pith_short_8","alias_value":"PCO4ETYW","created_at":"2026-07-05T05:48:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PCO4ETYWCWCTDTFWGM7VVXXK3F","target":"record","payload":{"canonical_record":{"source":{"id":"2303.02532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-05T00:26:10Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7700fa6bb141410b605c6c3cb4a943b91973728b972ec9e7d466286935bda38e","abstract_canon_sha256":"c1c7ad892978cb3b44c8f60d666c75f0d3308dbb3c57c09027465a7cde59d1a1"},"schema_version":"1.0"},"canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:12.451908Z","signature_b64":"LkKEBUcw4UStDxguxCCD8leLrt5n2VkxvLh7jlxeTqaO3mNuRVuumav/CSJwEjUsZiq0Ca7Hu7ONoglFr6aFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","last_reissued_at":"2026-07-05T05:48:12.451519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:12.451519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.02532","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-07-05T05:48:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7QD/Isa0V9KdgPav7I4ztyqw5yw2236cPsxIOKxsahsSHSYlyownl0uwzgnaKXgTXRwrRz6JXGG1xvE/2cPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:11:47.862751Z"},"content_sha256":"3e451e20c2d2b1535e6cc54134bf09db9368b7582f0ebc9eed79322d78625eae","schema_version":"1.0","event_id":"sha256:3e451e20c2d2b1535e6cc54134bf09db9368b7582f0ebc9eed79322d78625eae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PCO4ETYWCWCTDTFWGM7VVXXK3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jia Liu, Songtao Lu, Xin Zhang, Zhuqing Liu","submitted_at":"2023-03-05T00:26:10Z","abstract_excerpt":"Recently, min-max optimization problems have received increasing attention due to their wide range of applications in machine learning (ML). However, most existing min-max solution techniques are either single-machine or distributed algorithms coordinated by a central server. In this paper, we focus on the decentralized min-max optimization for learning with domain constraints, where multiple agents collectively solve a nonconvex-strongly-concave min-max saddle point problem without coordination from any server. Decentralized min-max optimization problems with domain constraints underpins many"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.02532","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/2303.02532/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:48:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klpbYCDHlTUkGengrTd7bAbEpirFJ89r868sNixHvPx8lNlO1lg3ybJ+hArtrI5eP1AbjjS18C6a1MZZf0fHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:11:47.863267Z"},"content_sha256":"c3c069fb555f9b53b5e4ca350a6c19bd7b80702dfd91a3c2112045924f24a75d","schema_version":"1.0","event_id":"sha256:c3c069fb555f9b53b5e4ca350a6c19bd7b80702dfd91a3c2112045924f24a75d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/bundle.json","state_url":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/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-18T19:11:47Z","links":{"resolver":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F","bundle":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/bundle.json","state":"https://pith.science/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCO4ETYWCWCTDTFWGM7VVXXK3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PCO4ETYWCWCTDTFWGM7VVXXK3F","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":"c1c7ad892978cb3b44c8f60d666c75f0d3308dbb3c57c09027465a7cde59d1a1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-05T00:26:10Z","title_canon_sha256":"7700fa6bb141410b605c6c3cb4a943b91973728b972ec9e7d466286935bda38e"},"schema_version":"1.0","source":{"id":"2303.02532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.02532","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"arxiv_version","alias_value":"2303.02532v1","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.02532","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"pith_short_12","alias_value":"PCO4ETYWCWCT","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"pith_short_16","alias_value":"PCO4ETYWCWCTDTFW","created_at":"2026-07-05T05:48:12Z"},{"alias_kind":"pith_short_8","alias_value":"PCO4ETYW","created_at":"2026-07-05T05:48:12Z"}],"graph_snapshots":[{"event_id":"sha256:c3c069fb555f9b53b5e4ca350a6c19bd7b80702dfd91a3c2112045924f24a75d","target":"graph","created_at":"2026-07-05T05:48:12Z","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/2303.02532/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, min-max optimization problems have received increasing attention due to their wide range of applications in machine learning (ML). However, most existing min-max solution techniques are either single-machine or distributed algorithms coordinated by a central server. In this paper, we focus on the decentralized min-max optimization for learning with domain constraints, where multiple agents collectively solve a nonconvex-strongly-concave min-max saddle point problem without coordination from any server. Decentralized min-max optimization problems with domain constraints underpins many","authors_text":"Jia Liu, Songtao Lu, Xin Zhang, Zhuqing Liu","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-05T00:26:10Z","title":"PRECISION: Decentralized Constrained Min-Max Learning with Low Communication and Sample Complexities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.02532","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:3e451e20c2d2b1535e6cc54134bf09db9368b7582f0ebc9eed79322d78625eae","target":"record","created_at":"2026-07-05T05:48:12Z","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":"c1c7ad892978cb3b44c8f60d666c75f0d3308dbb3c57c09027465a7cde59d1a1","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-05T00:26:10Z","title_canon_sha256":"7700fa6bb141410b605c6c3cb4a943b91973728b972ec9e7d466286935bda38e"},"schema_version":"1.0","source":{"id":"2303.02532","kind":"arxiv","version":1}},"canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"789dc24f16158531ccb6333f5adeead958537c485c7a2463e1c6858ac25d62aa","first_computed_at":"2026-07-05T05:48:12.451519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:48:12.451519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LkKEBUcw4UStDxguxCCD8leLrt5n2VkxvLh7jlxeTqaO3mNuRVuumav/CSJwEjUsZiq0Ca7Hu7ONoglFr6aFBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:48:12.451908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.02532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e451e20c2d2b1535e6cc54134bf09db9368b7582f0ebc9eed79322d78625eae","sha256:c3c069fb555f9b53b5e4ca350a6c19bd7b80702dfd91a3c2112045924f24a75d"],"state_sha256":"930550dc87b650b7cddb4c750cfed50b1230d230f4e1196b07378c4ff0ea681d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MMVYzIc5oI1da2S/AUzu2utyqwBACY++KdBcce20majAID5oVtYkK8V18CC/2RoiGOV1Nuw65KZMBNBznNSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T19:11:47.867929Z","bundle_sha256":"1d4f1dd542928585204356689f70e33af104e897b0c5cd00769701a67329d2d9"}}