{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UO6DAYQLDCW3VOCGLNR44ZKTLO","short_pith_number":"pith:UO6DAYQL","canonical_record":{"source":{"id":"2505.03719","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-06T17:46:49Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fb8f01bf781dc79d200bce52eb3a1b438835c42e779fc3008f68f1f502b0f145","abstract_canon_sha256":"fad3adfe9a2dc3eacfb85b631cd3b8f70f7e8d7c4c3cf7365656078cdb9d111b"},"schema_version":"1.0"},"canonical_sha256":"a3bc30620b18adbab8465b63ce65535b9adca0f5d50fb200a05f2a616e6a83c5","source":{"kind":"arxiv","id":"2505.03719","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03719","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03719v5","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03719","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"UO6DAYQLDCW3","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"UO6DAYQLDCW3VOCG","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"UO6DAYQL","created_at":"2026-06-25T01:18:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UO6DAYQLDCW3VOCGLNR44ZKTLO","target":"record","payload":{"canonical_record":{"source":{"id":"2505.03719","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-06T17:46:49Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fb8f01bf781dc79d200bce52eb3a1b438835c42e779fc3008f68f1f502b0f145","abstract_canon_sha256":"fad3adfe9a2dc3eacfb85b631cd3b8f70f7e8d7c4c3cf7365656078cdb9d111b"},"schema_version":"1.0"},"canonical_sha256":"a3bc30620b18adbab8465b63ce65535b9adca0f5d50fb200a05f2a616e6a83c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:34.825161Z","signature_b64":"QNAgogp1ujNL/oPqfv/KJFtfONF3V7tdIyT2jbT7x9w5gy8c10Z3NSbNdJTpE50LMRCdDCrp8qPkTsjAa2D3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3bc30620b18adbab8465b63ce65535b9adca0f5d50fb200a05f2a616e6a83c5","last_reissued_at":"2026-06-25T01:18:34.824689Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:34.824689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.03719","source_version":5,"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-25T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDWp7rZAWrCO7wyTeiaEtwa7Ao2S0nkj1NypUX0uoYsu5Nrt2t1048FB5F8fDqSDHMcjmt44Odhq1iT1GEPJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:37:17.610633Z"},"content_sha256":"960ed5cc05ebf606467deb97d85df0405529ee8d956bfad7aab285c6ca7c36f4","schema_version":"1.0","event_id":"sha256:960ed5cc05ebf606467deb97d85df0405529ee8d956bfad7aab285c6ca7c36f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UO6DAYQLDCW3VOCGLNR44ZKTLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Decentralized Constraint-Coupled Optimization: A Dual$^2$ Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A dual squared approach produces two accelerated algorithms for decentralized optimization with shared constraints that converge under milder conditions on the public cost function.","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jingwang Li, Vincent Lau","submitted_at":"2025-05-06T17:46:49Z","abstract_excerpt":"In this paper, we focus on a class of decentralized constraint-coupled optimization problem: $\\min_{x_i \\in \\mathbb{R}^{d_i}, i \\in \\mathcal{I}; y \\in \\mathbb{R}^p}$ $\\sum_{i=1}^n\\left(f_i(x_i) + g_i(x_i)\\right) + h(y) \\ \\text{s.t.} \\ \\sum_{i=1}^{n}A_ix_i = y$, over an undirected and connected network of $n$ agents. Here, $f_i$, $g_i$, and $A_i$ represent private information of agent $i \\in \\mathcal{I} = \\{1, \\cdots, n\\}$, while $h$ is public for all agents. Building on a novel dual$^2$ approach, we develop two accelerated algorithms to solve this problem: the inexact Dual$^2$ Accelerated (iD2"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Both iD2A and MiD2A guarantee asymptotic convergence under a milder condition on h compared to existing algorithms; under additional assumptions they establish linear convergence rates and significantly lower communication and computational complexity bounds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The network is undirected and connected, which is required for the information to propagate sufficiently for the dual updates to coordinate the shared constraint across all agents (stated in the problem formulation).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The Dual² approach produces iD2A and MiD2A gradient methods that achieve asymptotic convergence under milder conditions on the public function and linear rates with reduced communication and computation complexity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A dual squared approach produces two accelerated algorithms for decentralized optimization with shared constraints that converge under milder conditions on the public cost function.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"522bee52f29c8091255e4909996ee2a043ada929df3547416b45ac643569c42c"},"source":{"id":"2505.03719","kind":"arxiv","version":5},"verdict":{"id":"d36f95fe-c930-457c-9f1c-04c0d5fc9a18","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-22T15:54:23.199771Z","strongest_claim":"Both iD2A and MiD2A guarantee asymptotic convergence under a milder condition on h compared to existing algorithms; under additional assumptions they establish linear convergence rates and significantly lower communication and computational complexity bounds.","one_line_summary":"The Dual² approach produces iD2A and MiD2A gradient methods that achieve asymptotic convergence under milder conditions on the public function and linear rates with reduced communication and computation complexity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The network is undirected and connected, which is required for the information to propagate sufficiently for the dual updates to coordinate the shared constraint across all agents (stated in the problem formulation).","pith_extraction_headline":"A dual squared approach produces two accelerated algorithms for decentralized optimization with shared constraints that converge under milder conditions on the public cost function."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.03719/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":2,"snapshot_sha256":"b53424015b5a2d820baa3ce6189036d2eb4a23946d1bbf7999efa529ab9e8cfc"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d36f95fe-c930-457c-9f1c-04c0d5fc9a18"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/SAlxNjg+0+1NToudCaxFH/LqRMnZot4ixyMxb1O1OaNgehb6Kch230HdcxOAmDLd2BMW+9gjLaDiiThbQfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:37:17.611105Z"},"content_sha256":"062941933411507b5a696d668bf38ef85c485a28b350da3755886afb19ef0510","schema_version":"1.0","event_id":"sha256:062941933411507b5a696d668bf38ef85c485a28b350da3755886afb19ef0510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO/bundle.json","state_url":"https://pith.science/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO/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-07-05T02:37:17Z","links":{"resolver":"https://pith.science/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO","bundle":"https://pith.science/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO/bundle.json","state":"https://pith.science/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UO6DAYQLDCW3VOCGLNR44ZKTLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UO6DAYQLDCW3VOCGLNR44ZKTLO","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":"fad3adfe9a2dc3eacfb85b631cd3b8f70f7e8d7c4c3cf7365656078cdb9d111b","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-06T17:46:49Z","title_canon_sha256":"fb8f01bf781dc79d200bce52eb3a1b438835c42e779fc3008f68f1f502b0f145"},"schema_version":"1.0","source":{"id":"2505.03719","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03719","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03719v5","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03719","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"UO6DAYQLDCW3","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"UO6DAYQLDCW3VOCG","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"UO6DAYQL","created_at":"2026-06-25T01:18:34Z"}],"graph_snapshots":[{"event_id":"sha256:062941933411507b5a696d668bf38ef85c485a28b350da3755886afb19ef0510","target":"graph","created_at":"2026-06-25T01:18:34Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Both iD2A and MiD2A guarantee asymptotic convergence under a milder condition on h compared to existing algorithms; under additional assumptions they establish linear convergence rates and significantly lower communication and computational complexity bounds."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The network is undirected and connected, which is required for the information to propagate sufficiently for the dual updates to coordinate the shared constraint across all agents (stated in the problem formulation)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The Dual² approach produces iD2A and MiD2A gradient methods that achieve asymptotic convergence under milder conditions on the public function and linear rates with reduced communication and computation complexity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A dual squared approach produces two accelerated algorithms for decentralized optimization with shared constraints that converge under milder conditions on the public cost function."}],"snapshot_sha256":"522bee52f29c8091255e4909996ee2a043ada929df3547416b45ac643569c42c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b53424015b5a2d820baa3ce6189036d2eb4a23946d1bbf7999efa529ab9e8cfc"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.03719/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we focus on a class of decentralized constraint-coupled optimization problem: $\\min_{x_i \\in \\mathbb{R}^{d_i}, i \\in \\mathcal{I}; y \\in \\mathbb{R}^p}$ $\\sum_{i=1}^n\\left(f_i(x_i) + g_i(x_i)\\right) + h(y) \\ \\text{s.t.} \\ \\sum_{i=1}^{n}A_ix_i = y$, over an undirected and connected network of $n$ agents. Here, $f_i$, $g_i$, and $A_i$ represent private information of agent $i \\in \\mathcal{I} = \\{1, \\cdots, n\\}$, while $h$ is public for all agents. Building on a novel dual$^2$ approach, we develop two accelerated algorithms to solve this problem: the inexact Dual$^2$ Accelerated (iD2","authors_text":"Jingwang Li, Vincent Lau","cross_cats":["cs.SY","eess.SY"],"headline":"A dual squared approach produces two accelerated algorithms for decentralized optimization with shared constraints that converge under milder conditions on the public cost function.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-06T17:46:49Z","title":"Accelerated Decentralized Constraint-Coupled Optimization: A Dual$^2$ Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03719","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-22T15:54:23.199771Z","id":"d36f95fe-c930-457c-9f1c-04c0d5fc9a18","model_set":{"reader":"grok-4.3"},"one_line_summary":"The Dual² approach produces iD2A and MiD2A gradient methods that achieve asymptotic convergence under milder conditions on the public function and linear rates with reduced communication and computation complexity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A dual squared approach produces two accelerated algorithms for decentralized optimization with shared constraints that converge under milder conditions on the public cost function.","strongest_claim":"Both iD2A and MiD2A guarantee asymptotic convergence under a milder condition on h compared to existing algorithms; under additional assumptions they establish linear convergence rates and significantly lower communication and computational complexity bounds.","weakest_assumption":"The network is undirected and connected, which is required for the information to propagate sufficiently for the dual updates to coordinate the shared constraint across all agents (stated in the problem formulation)."}},"verdict_id":"d36f95fe-c930-457c-9f1c-04c0d5fc9a18"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:960ed5cc05ebf606467deb97d85df0405529ee8d956bfad7aab285c6ca7c36f4","target":"record","created_at":"2026-06-25T01:18:34Z","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":"fad3adfe9a2dc3eacfb85b631cd3b8f70f7e8d7c4c3cf7365656078cdb9d111b","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-06T17:46:49Z","title_canon_sha256":"fb8f01bf781dc79d200bce52eb3a1b438835c42e779fc3008f68f1f502b0f145"},"schema_version":"1.0","source":{"id":"2505.03719","kind":"arxiv","version":5}},"canonical_sha256":"a3bc30620b18adbab8465b63ce65535b9adca0f5d50fb200a05f2a616e6a83c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3bc30620b18adbab8465b63ce65535b9adca0f5d50fb200a05f2a616e6a83c5","first_computed_at":"2026-06-25T01:18:34.824689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:34.824689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QNAgogp1ujNL/oPqfv/KJFtfONF3V7tdIyT2jbT7x9w5gy8c10Z3NSbNdJTpE50LMRCdDCrp8qPkTsjAa2D3CQ==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:34.825161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.03719","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:960ed5cc05ebf606467deb97d85df0405529ee8d956bfad7aab285c6ca7c36f4","sha256:062941933411507b5a696d668bf38ef85c485a28b350da3755886afb19ef0510"],"state_sha256":"d2f63431b070fdec8d0abc4675549d33894c75011255e987b4bd4b32577c4d75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLIn/UKrxufL8lfmEmR3JC+xbgynws+R+cAmVRyx2vNQ4E4oIfxuduxjh1ApDAoREKr1f/aT9BEV3uNd6Z/2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T02:37:17.613375Z","bundle_sha256":"7fe212b27dffa3ec9d515cb040554ad95d25764e97f0782a59b09e5e87f89ee7"}}