{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:74PMNHERNYZFSCFMMF7MWARCLF","short_pith_number":"pith:74PMNHER","schema_version":"1.0","canonical_sha256":"ff1ec69c916e325908ac617ecb02225970f7bb7e1891261052bfb0bef28ffd4f","source":{"kind":"arxiv","id":"1805.06963","version":1},"attestation_state":"computed","paper":{"title":"Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Ying Sun","submitted_at":"2018-05-17T20:44:36Z","abstract_excerpt":"Recent years have witnessed a surge of interest in parallel and distributed optimization methods for large-scale systems. In particular, nonconvex large-scale optimization problems have found a wide range of applications in several engineering fields. The design and the analysis of such complex, large-scale, systems pose several challenges and call for the development of new optimization models and algorithms. The major contribution of this paper is to put forth a general, unified, algorithmic framework, based on Successive Convex Approximation (SCA) techniques, for the parallel and distribute"},"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":"1805.06963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-17T20:44:36Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"fadb4dded395ae57eba859c04800e7b46ff3dc4f980e771c1712354500bc6ce8","abstract_canon_sha256":"d765cc9b57218a2501420893b2a7dd48db9c42ab143916220732ebe3785b3a56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:42.636669Z","signature_b64":"DUhqVbDGGlSqdgCLodXjPUs3V1rUpW74jFWcBYmC/wf8IfYebP8e3PzuK5OAel8rPAyraHAeHL6Enk63nACmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff1ec69c916e325908ac617ecb02225970f7bb7e1891261052bfb0bef28ffd4f","last_reissued_at":"2026-05-18T00:15:42.635971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:42.635971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Gesualdo Scutari, Ying Sun","submitted_at":"2018-05-17T20:44:36Z","abstract_excerpt":"Recent years have witnessed a surge of interest in parallel and distributed optimization methods for large-scale systems. In particular, nonconvex large-scale optimization problems have found a wide range of applications in several engineering fields. The design and the analysis of such complex, large-scale, systems pose several challenges and call for the development of new optimization models and algorithms. The major contribution of this paper is to put forth a general, unified, algorithmic framework, based on Successive Convex Approximation (SCA) techniques, for the parallel and distribute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06963","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":"1805.06963","created_at":"2026-05-18T00:15:42.636067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06963v1","created_at":"2026-05-18T00:15:42.636067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06963","created_at":"2026-05-18T00:15:42.636067+00:00"},{"alias_kind":"pith_short_12","alias_value":"74PMNHERNYZF","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"74PMNHERNYZFSCFM","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"74PMNHER","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04952","citing_title":"Optimization for Semantic-Aware Resource Allocation under CPT-based Utilities","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF","json":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF.json","graph_json":"https://pith.science/api/pith-number/74PMNHERNYZFSCFMMF7MWARCLF/graph.json","events_json":"https://pith.science/api/pith-number/74PMNHERNYZFSCFMMF7MWARCLF/events.json","paper":"https://pith.science/paper/74PMNHER"},"agent_actions":{"view_html":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF","download_json":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF.json","view_paper":"https://pith.science/paper/74PMNHER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06963&json=true","fetch_graph":"https://pith.science/api/pith-number/74PMNHERNYZFSCFMMF7MWARCLF/graph.json","fetch_events":"https://pith.science/api/pith-number/74PMNHERNYZFSCFMMF7MWARCLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/action/storage_attestation","attest_author":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/action/author_attestation","sign_citation":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/action/citation_signature","submit_replication":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/action/replication_record"}},"created_at":"2026-05-18T00:15:42.636067+00:00","updated_at":"2026-05-18T00:15:42.636067+00:00"}