{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QMWH7CQVKOJ2IRBAPA7PQX5AEH","short_pith_number":"pith:QMWH7CQV","schema_version":"1.0","canonical_sha256":"832c7f8a155393a44420783ef85fa021cfeb139913d0d8ea4d30416a355a37db","source":{"kind":"arxiv","id":"1609.03784","version":4},"attestation_state":"computed","paper":{"title":"A Fast Proximal Gradient Algorithm for Decentralized Composite Optimization over Directed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Jinshan Zeng, Mingwen Wang, Tao He","submitted_at":"2016-09-13T11:49:36Z","abstract_excerpt":"This paper proposes a fast decentralized algorithm for solving a consensus optimization problem defined in a directed networked multi-agent system, where the local objective functions have the smooth+nonsmooth composite form, and are possibly nonconvex. Examples of such problems include decentralized compressed sensing and constrained quadratic programming problems, as well as many decentralized regularization problems. We extend the existing algorithms PG-EXTRA and ExtraPush to a new algorithm PG-ExtraPush for composite consensus optimization over a directed network. This algorithm takes adva"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.03784","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-13T11:49:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"584a6bb2192e035dd8b63dd1c7ea96ea2f3bc1418bf0e9bb5637954dda6d83a5","abstract_canon_sha256":"7347aa86350485e256f28625aff99404d67daa2e2b7ab31202e9b8d815e23abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:58.762626Z","signature_b64":"Mvd/okQa59/roZ8pzFlC8moNPhIp6yQwdLTXhJxUV0/U7cnE/TLArnBeFLcjscZ3v494JoipGEloRcADMRnZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"832c7f8a155393a44420783ef85fa021cfeb139913d0d8ea4d30416a355a37db","last_reissued_at":"2026-05-18T00:47:58.762122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:58.762122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Proximal Gradient Algorithm for Decentralized Composite Optimization over Directed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Jinshan Zeng, Mingwen Wang, Tao He","submitted_at":"2016-09-13T11:49:36Z","abstract_excerpt":"This paper proposes a fast decentralized algorithm for solving a consensus optimization problem defined in a directed networked multi-agent system, where the local objective functions have the smooth+nonsmooth composite form, and are possibly nonconvex. Examples of such problems include decentralized compressed sensing and constrained quadratic programming problems, as well as many decentralized regularization problems. We extend the existing algorithms PG-EXTRA and ExtraPush to a new algorithm PG-ExtraPush for composite consensus optimization over a directed network. This algorithm takes adva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03784","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.03784","created_at":"2026-05-18T00:47:58.762196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03784v4","created_at":"2026-05-18T00:47:58.762196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03784","created_at":"2026-05-18T00:47:58.762196+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMWH7CQVKOJ2","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMWH7CQVKOJ2IRBA","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMWH7CQV","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH","json":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH.json","graph_json":"https://pith.science/api/pith-number/QMWH7CQVKOJ2IRBAPA7PQX5AEH/graph.json","events_json":"https://pith.science/api/pith-number/QMWH7CQVKOJ2IRBAPA7PQX5AEH/events.json","paper":"https://pith.science/paper/QMWH7CQV"},"agent_actions":{"view_html":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH","download_json":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH.json","view_paper":"https://pith.science/paper/QMWH7CQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03784&json=true","fetch_graph":"https://pith.science/api/pith-number/QMWH7CQVKOJ2IRBAPA7PQX5AEH/graph.json","fetch_events":"https://pith.science/api/pith-number/QMWH7CQVKOJ2IRBAPA7PQX5AEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH/action/storage_attestation","attest_author":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH/action/author_attestation","sign_citation":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH/action/citation_signature","submit_replication":"https://pith.science/pith/QMWH7CQVKOJ2IRBAPA7PQX5AEH/action/replication_record"}},"created_at":"2026-05-18T00:47:58.762196+00:00","updated_at":"2026-05-18T00:47:58.762196+00:00"}