{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:74PMNHERNYZFSCFMMF7MWARCLF","short_pith_number":"pith:74PMNHER","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"},"canonical_sha256":"ff1ec69c916e325908ac617ecb02225970f7bb7e1891261052bfb0bef28ffd4f","source":{"kind":"arxiv","id":"1805.06963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06963","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06963v1","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06963","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"74PMNHERNYZF","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74PMNHERNYZFSCFM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74PMNHER","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:74PMNHERNYZFSCFMMF7MWARCLF","target":"record","payload":{"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"},"canonical_sha256":"ff1ec69c916e325908ac617ecb02225970f7bb7e1891261052bfb0bef28ffd4f","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"},"source_kind":"arxiv","source_id":"1805.06963","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-05-18T00:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzAA80GkrtOjakn9KzZnI6HHNklu4aGSWCDzJ8sHxBx468yoxZAFtybktMCgqdtReVo4IHhWa+S61MAuQ73MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:27:14.210707Z"},"content_sha256":"9ee0a4e91ebad25da1b7974c65948b1d6f63a65025f88cfc7df0f5233db79a26","schema_version":"1.0","event_id":"sha256:9ee0a4e91ebad25da1b7974c65948b1d6f63a65025f88cfc7df0f5233db79a26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:74PMNHERNYZFSCFMMF7MWARCLF","target":"graph","payload":{"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"},"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-05-18T00:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xz2p8BZZBroM0Oo6YWN4cdtTQgaltOBIbIi1RYNeKayhpuu/0lAeTZt0bBDDon1jvZ9OksFLSslNEUaUwU2rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:27:14.211686Z"},"content_sha256":"7273c137db3753a63c934f43cf032cf3d922a6a184f4f8a6ae6c9585f0a00622","schema_version":"1.0","event_id":"sha256:7273c137db3753a63c934f43cf032cf3d922a6a184f4f8a6ae6c9585f0a00622"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/bundle.json","state_url":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74PMNHERNYZFSCFMMF7MWARCLF/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-08T04:27:14Z","links":{"resolver":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF","bundle":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/bundle.json","state":"https://pith.science/pith/74PMNHERNYZFSCFMMF7MWARCLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74PMNHERNYZFSCFMMF7MWARCLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:74PMNHERNYZFSCFMMF7MWARCLF","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":"d765cc9b57218a2501420893b2a7dd48db9c42ab143916220732ebe3785b3a56","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-17T20:44:36Z","title_canon_sha256":"fadb4dded395ae57eba859c04800e7b46ff3dc4f980e771c1712354500bc6ce8"},"schema_version":"1.0","source":{"id":"1805.06963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06963","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06963v1","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06963","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"74PMNHERNYZF","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74PMNHERNYZFSCFM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74PMNHER","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:7273c137db3753a63c934f43cf032cf3d922a6a184f4f8a6ae6c9585f0a00622","target":"graph","created_at":"2026-05-18T00:15:42Z","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"},"paper":{"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","authors_text":"Gesualdo Scutari, Ying Sun","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-17T20:44:36Z","title":"Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06963","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:9ee0a4e91ebad25da1b7974c65948b1d6f63a65025f88cfc7df0f5233db79a26","target":"record","created_at":"2026-05-18T00:15:42Z","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":"d765cc9b57218a2501420893b2a7dd48db9c42ab143916220732ebe3785b3a56","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-17T20:44:36Z","title_canon_sha256":"fadb4dded395ae57eba859c04800e7b46ff3dc4f980e771c1712354500bc6ce8"},"schema_version":"1.0","source":{"id":"1805.06963","kind":"arxiv","version":1}},"canonical_sha256":"ff1ec69c916e325908ac617ecb02225970f7bb7e1891261052bfb0bef28ffd4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff1ec69c916e325908ac617ecb02225970f7bb7e1891261052bfb0bef28ffd4f","first_computed_at":"2026-05-18T00:15:42.635971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:42.635971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DUhqVbDGGlSqdgCLodXjPUs3V1rUpW74jFWcBYmC/wf8IfYebP8e3PzuK5OAel8rPAyraHAeHL6Enk63nACmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:42.636669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ee0a4e91ebad25da1b7974c65948b1d6f63a65025f88cfc7df0f5233db79a26","sha256:7273c137db3753a63c934f43cf032cf3d922a6a184f4f8a6ae6c9585f0a00622"],"state_sha256":"71bc941a029cc9f2fb0a3c1135d056b7913a5938b5539f6f4ef3b2704ab049b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alG7+oSNf+xP1OhH2L04My19U5qVaDQ4c9hZBPb/evUPUG5jVxCTyRewtQPOMkh2jRrCKFx9cvPy66P8NLkgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:27:14.218428Z","bundle_sha256":"eb4471ea5c9589bd60e29ef3ba76844ee905d6991782fe877e9f05e334728d40"}}