{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4T3YCBGYO5RY4BRLZG2IALRMGZ","short_pith_number":"pith:4T3YCBGY","canonical_record":{"source":{"id":"1607.00249","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T13:51:55Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"7e13eccc70e3f94ab2636dfad2adb11afb591a975321a5ef33769c44a72697e5","abstract_canon_sha256":"b601cd43d145b7e052311bcac2347aca18c1e09d72819a4cd91739d954f43934"},"schema_version":"1.0"},"canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","source":{"kind":"arxiv","id":"1607.00249","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00249","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00249v3","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00249","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"4T3YCBGYO5RY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4T3YCBGYO5RY4BRL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4T3YCBGY","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4T3YCBGYO5RY4BRLZG2IALRMGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00249","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T13:51:55Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"7e13eccc70e3f94ab2636dfad2adb11afb591a975321a5ef33769c44a72697e5","abstract_canon_sha256":"b601cd43d145b7e052311bcac2347aca18c1e09d72819a4cd91739d954f43934"},"schema_version":"1.0"},"canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:57.938557Z","signature_b64":"JQuICav+EWH+6OnLHlCR4HU89XAvfosvXnS3fi9oC6sYvH/WNkK5Tf9qX27s3P9C8kGnmIzG0pZCuPa7voPaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","last_reissued_at":"2026-05-18T00:54:57.938099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:57.938099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00249","source_version":3,"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:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKqQ0MB2eqlaqaqUZ9E+F0ZxMvVsBA4krFRWeCL+NDJe4RPPPzBV13wtfcaKGi0r9coE/flNY4JiOKhFdbP8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:27:37.043853Z"},"content_sha256":"dfa595e5bae53fd80bfe566b2e2d4270edf7d6687fd9ecbbb12eaa0ca13245e5","schema_version":"1.0","event_id":"sha256:dfa595e5bae53fd80bfe566b2e2d4270edf7d6687fd9ecbbb12eaa0ca13245e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4T3YCBGYO5RY4BRLZG2IALRMGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Nonconvex Multiagent Optimization Over Time-Varying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Daniel Palomar, Gesualdo Scutari, Ying Sun","submitted_at":"2016-07-01T13:51:55Z","abstract_excerpt":"We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00249","kind":"arxiv","version":3},"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:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHiE74CwFkcMUEa5e9U55pdhra7Seif4QfH6XSjze7C9jWypH/hyUm+8isUAObbLyD2NuEH68PkyOzvs56UbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:27:37.044203Z"},"content_sha256":"97e27dc82bcbac5c82de8c268b0e2cde76a405bfd4b901053b21062c1be4dcf4","schema_version":"1.0","event_id":"sha256:97e27dc82bcbac5c82de8c268b0e2cde76a405bfd4b901053b21062c1be4dcf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/bundle.json","state_url":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/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-23T04:27:37Z","links":{"resolver":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ","bundle":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/bundle.json","state":"https://pith.science/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4T3YCBGYO5RY4BRLZG2IALRMGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4T3YCBGYO5RY4BRLZG2IALRMGZ","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":"b601cd43d145b7e052311bcac2347aca18c1e09d72819a4cd91739d954f43934","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T13:51:55Z","title_canon_sha256":"7e13eccc70e3f94ab2636dfad2adb11afb591a975321a5ef33769c44a72697e5"},"schema_version":"1.0","source":{"id":"1607.00249","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00249","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00249v3","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00249","created_at":"2026-05-18T00:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"4T3YCBGYO5RY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4T3YCBGYO5RY4BRL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4T3YCBGY","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:97e27dc82bcbac5c82de8c268b0e2cde76a405bfd4b901053b21062c1be4dcf4","target":"graph","created_at":"2026-05-18T00:54:57Z","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":"We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA","authors_text":"Daniel Palomar, Gesualdo Scutari, Ying Sun","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T13:51:55Z","title":"Distributed Nonconvex Multiagent Optimization Over Time-Varying Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00249","kind":"arxiv","version":3},"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:dfa595e5bae53fd80bfe566b2e2d4270edf7d6687fd9ecbbb12eaa0ca13245e5","target":"record","created_at":"2026-05-18T00:54:57Z","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":"b601cd43d145b7e052311bcac2347aca18c1e09d72819a4cd91739d954f43934","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-01T13:51:55Z","title_canon_sha256":"7e13eccc70e3f94ab2636dfad2adb11afb591a975321a5ef33769c44a72697e5"},"schema_version":"1.0","source":{"id":"1607.00249","kind":"arxiv","version":3}},"canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4f78104d877638e062bc9b4802e2c365a9cbf963549895db80b377b3636a248","first_computed_at":"2026-05-18T00:54:57.938099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:57.938099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JQuICav+EWH+6OnLHlCR4HU89XAvfosvXnS3fi9oC6sYvH/WNkK5Tf9qX27s3P9C8kGnmIzG0pZCuPa7voPaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:57.938557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00249","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfa595e5bae53fd80bfe566b2e2d4270edf7d6687fd9ecbbb12eaa0ca13245e5","sha256:97e27dc82bcbac5c82de8c268b0e2cde76a405bfd4b901053b21062c1be4dcf4"],"state_sha256":"be2fe18eb9a5196ed04e11019c96b3e02396ae23d15ff24231855c5c6fa9c240"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KGambAJgQNu8OK4CzqaLlFuQyGnIm63z7KtuPcAmx9a7t8JiO0ew0uxI5OWM59wS3JKcV4Qua12z3ondy6zAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:27:37.046185Z","bundle_sha256":"0269e715dc44e243ef44f7771c787ee2906e310f041d5141b3eddb9936894c95"}}