{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RDRYZRTIFHR2VLPK3GYHPAOEMW","short_pith_number":"pith:RDRYZRTI","schema_version":"1.0","canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","source":{"kind":"arxiv","id":"1907.08969","version":1},"attestation_state":"computed","paper":{"title":"Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Palomar, Ketan Rajawat, Sandeep Kumar","submitted_at":"2019-07-21T12:46:05Z","abstract_excerpt":"In this two-part work, we propose an algorithmic framework for solving non-convex problems whose objective function is the sum of a number of smooth component functions plus a convex (possibly non-smooth) or/and smooth (possibly non-convex) regularization function. The proposed algorithm incorporates ideas from several existing approaches such as alternate direction method of multipliers (ADMM), successive convex approximation (SCA), distributed and asynchronous algorithms, and inexact gradient methods. Different from a number of existing approaches, however, the proposed framework is flexible"},"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":"1907.08969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-07-21T12:46:05Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"ce1f458f88be5449e28ffaa90385b1a8aac8ebbd1d897e7b0cb669d8671cd327","abstract_canon_sha256":"c99f209e082954edd724fcfa5145b43d571cf85c575e8d714810dd16a9d9beb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:02.546007Z","signature_b64":"CFsrAlDUe/WeOIA1OdD/1lHGIORS97mNRu8kTEwwMnF+G0BpD0v4pcPuJaMZOcVjzQuGnXMEOECZsP/t3AL4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e38cc66829e3aaadead9b07781c46594e7627507577d7f8919bc28852913a7","last_reissued_at":"2026-05-17T23:40:02.545459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:02.545459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel P. Palomar, Ketan Rajawat, Sandeep Kumar","submitted_at":"2019-07-21T12:46:05Z","abstract_excerpt":"In this two-part work, we propose an algorithmic framework for solving non-convex problems whose objective function is the sum of a number of smooth component functions plus a convex (possibly non-smooth) or/and smooth (possibly non-convex) regularization function. The proposed algorithm incorporates ideas from several existing approaches such as alternate direction method of multipliers (ADMM), successive convex approximation (SCA), distributed and asynchronous algorithms, and inexact gradient methods. Different from a number of existing approaches, however, the proposed framework is flexible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08969","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":""},"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":"1907.08969","created_at":"2026-05-17T23:40:02.545533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08969v1","created_at":"2026-05-17T23:40:02.545533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08969","created_at":"2026-05-17T23:40:02.545533+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDRYZRTIFHR2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDRYZRTIFHR2VLPK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDRYZRTI","created_at":"2026-05-18T12:33:27.125529+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/RDRYZRTIFHR2VLPK3GYHPAOEMW","json":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW.json","graph_json":"https://pith.science/api/pith-number/RDRYZRTIFHR2VLPK3GYHPAOEMW/graph.json","events_json":"https://pith.science/api/pith-number/RDRYZRTIFHR2VLPK3GYHPAOEMW/events.json","paper":"https://pith.science/paper/RDRYZRTI"},"agent_actions":{"view_html":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW","download_json":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW.json","view_paper":"https://pith.science/paper/RDRYZRTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08969&json=true","fetch_graph":"https://pith.science/api/pith-number/RDRYZRTIFHR2VLPK3GYHPAOEMW/graph.json","fetch_events":"https://pith.science/api/pith-number/RDRYZRTIFHR2VLPK3GYHPAOEMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/action/storage_attestation","attest_author":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/action/author_attestation","sign_citation":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/action/citation_signature","submit_replication":"https://pith.science/pith/RDRYZRTIFHR2VLPK3GYHPAOEMW/action/replication_record"}},"created_at":"2026-05-17T23:40:02.545533+00:00","updated_at":"2026-05-17T23:40:02.545533+00:00"}