{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:77D4CVTK6KJCGBB7HAGQ3GZEZP","short_pith_number":"pith:77D4CVTK","canonical_record":{"source":{"id":"1805.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T07:56:37Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"f346736d79eb55976d4b3a64ef998f419f30655ced0964c40447fd7210a8c916","abstract_canon_sha256":"b29f925b610ae79c631cb05e226de029f215fb326110e67991e82418092519c8"},"schema_version":"1.0"},"canonical_sha256":"ffc7c1566af29223043f380d0d9b24cbf22e433cfb0e40c74ce3f8ac762a8a76","source":{"kind":"arxiv","id":"1805.00658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00658","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00658v1","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00658","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"77D4CVTK6KJC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"77D4CVTK6KJCGBB7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"77D4CVTK","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:77D4CVTK6KJCGBB7HAGQ3GZEZP","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T07:56:37Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"f346736d79eb55976d4b3a64ef998f419f30655ced0964c40447fd7210a8c916","abstract_canon_sha256":"b29f925b610ae79c631cb05e226de029f215fb326110e67991e82418092519c8"},"schema_version":"1.0"},"canonical_sha256":"ffc7c1566af29223043f380d0d9b24cbf22e433cfb0e40c74ce3f8ac762a8a76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:58.283366Z","signature_b64":"FH6qeNLBd/e6VZyFqrZnoCXHERTsFxJlG80XjQ8ZWZdiELUdC8kspe2BD7K4epiyLP4fPf1nz91ZJ2rDiwJgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffc7c1566af29223043f380d0d9b24cbf22e433cfb0e40c74ce3f8ac762a8a76","last_reissued_at":"2026-05-18T00:16:58.282810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:58.282810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00658","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:16:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04NA1tcz2qv4hZln5LxyDgTgJY0bp1wGRCZNAqOFXJBfGcCrxGlSPE9ep6fXkWvm9ECreHjATGZo6L00LFuoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:06:39.714219Z"},"content_sha256":"90ce46a055375bb0676ba1c38955aedbc35381a09af96aba8c180b4e5dcb0337","schema_version":"1.0","event_id":"sha256:90ce46a055375bb0676ba1c38955aedbc35381a09af96aba8c180b4e5dcb0337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:77D4CVTK6KJCGBB7HAGQ3GZEZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Big-Data Optimization via Block-Iterative Convexification and Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Gesualdo Scutari, Giuseppe Notarstefano, Ivano Notarnicola, Ying Sun","submitted_at":"2018-05-02T07:56:37Z","abstract_excerpt":"In this paper, we study distributed big-data nonconvex optimization in multi-agent networks. We consider the (constrained) minimization of the sum of a smooth (possibly) nonconvex function, i.e., the agents' sum-utility, plus a convex (possibly) nonsmooth regularizer. Our interest is in big-data problems wherein there is a large number of variables to optimize. If treated by means of standard distributed optimization algorithms, these large-scale problems may be intractable, due to the prohibitive local computation and communication burden at each node. We propose a novel distributed solution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00658","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:16:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZcNmrs6Aojtd4x92WTSa6sqFyOy1Y8XLPaXnHuJHf1Zj4xurrU6tf3Iw9pM5z55DXZzrxxgaVeOfiabtdx0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:06:39.714922Z"},"content_sha256":"073c9e8889281c4844b98f2b36a640d43e0ac023d007871bf4b4ea4615b754f3","schema_version":"1.0","event_id":"sha256:073c9e8889281c4844b98f2b36a640d43e0ac023d007871bf4b4ea4615b754f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP/bundle.json","state_url":"https://pith.science/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP/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-06-08T18:06:39Z","links":{"resolver":"https://pith.science/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP","bundle":"https://pith.science/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP/bundle.json","state":"https://pith.science/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77D4CVTK6KJCGBB7HAGQ3GZEZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:77D4CVTK6KJCGBB7HAGQ3GZEZP","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":"b29f925b610ae79c631cb05e226de029f215fb326110e67991e82418092519c8","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T07:56:37Z","title_canon_sha256":"f346736d79eb55976d4b3a64ef998f419f30655ced0964c40447fd7210a8c916"},"schema_version":"1.0","source":{"id":"1805.00658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00658","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00658v1","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00658","created_at":"2026-05-18T00:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"77D4CVTK6KJC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"77D4CVTK6KJCGBB7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"77D4CVTK","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:073c9e8889281c4844b98f2b36a640d43e0ac023d007871bf4b4ea4615b754f3","target":"graph","created_at":"2026-05-18T00:16:58Z","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":"In this paper, we study distributed big-data nonconvex optimization in multi-agent networks. We consider the (constrained) minimization of the sum of a smooth (possibly) nonconvex function, i.e., the agents' sum-utility, plus a convex (possibly) nonsmooth regularizer. Our interest is in big-data problems wherein there is a large number of variables to optimize. If treated by means of standard distributed optimization algorithms, these large-scale problems may be intractable, due to the prohibitive local computation and communication burden at each node. We propose a novel distributed solution ","authors_text":"Gesualdo Scutari, Giuseppe Notarstefano, Ivano Notarnicola, Ying Sun","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T07:56:37Z","title":"Distributed Big-Data Optimization via Block-Iterative Convexification and Averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00658","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:90ce46a055375bb0676ba1c38955aedbc35381a09af96aba8c180b4e5dcb0337","target":"record","created_at":"2026-05-18T00:16:58Z","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":"b29f925b610ae79c631cb05e226de029f215fb326110e67991e82418092519c8","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T07:56:37Z","title_canon_sha256":"f346736d79eb55976d4b3a64ef998f419f30655ced0964c40447fd7210a8c916"},"schema_version":"1.0","source":{"id":"1805.00658","kind":"arxiv","version":1}},"canonical_sha256":"ffc7c1566af29223043f380d0d9b24cbf22e433cfb0e40c74ce3f8ac762a8a76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffc7c1566af29223043f380d0d9b24cbf22e433cfb0e40c74ce3f8ac762a8a76","first_computed_at":"2026-05-18T00:16:58.282810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:58.282810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FH6qeNLBd/e6VZyFqrZnoCXHERTsFxJlG80XjQ8ZWZdiELUdC8kspe2BD7K4epiyLP4fPf1nz91ZJ2rDiwJgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:58.283366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90ce46a055375bb0676ba1c38955aedbc35381a09af96aba8c180b4e5dcb0337","sha256:073c9e8889281c4844b98f2b36a640d43e0ac023d007871bf4b4ea4615b754f3"],"state_sha256":"187fd26e1d2bc4be7261f886a8da116b9f03b24b2d36fbc617507818db4d73cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LjLeHSmvnVwy3CT9MwGe2ORB6vrKPf9x/WHoM/Pn/8M7NPWKpoGv+QHS9RW0CNqxBrLm+0c2rnhrwVm09ozBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:06:39.719028Z","bundle_sha256":"80a0dd2d423488185def6d908c64305f02918a81417638f330be7fc117a3655f"}}