{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YKH7VAIBKSDNHAJSBGVTQY2ZHV","short_pith_number":"pith:YKH7VAIB","canonical_record":{"source":{"id":"1007.3706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-21T18:25:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"efc36c432274c19153885501e0a85627ff635f5a5bf4287bd9460d6ba91d8fb3","abstract_canon_sha256":"3c25b9b90d6700d20b6148fc290151d9060abe0f7ac7bbd20527a45fc9c1aff0"},"schema_version":"1.0"},"canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","source":{"kind":"arxiv","id":"1007.3706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.3706","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1007.3706v2","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3706","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"YKH7VAIBKSDN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YKH7VAIBKSDNHAJS","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YKH7VAIB","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YKH7VAIBKSDNHAJSBGVTQY2ZHV","target":"record","payload":{"canonical_record":{"source":{"id":"1007.3706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-21T18:25:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"efc36c432274c19153885501e0a85627ff635f5a5bf4287bd9460d6ba91d8fb3","abstract_canon_sha256":"3c25b9b90d6700d20b6148fc290151d9060abe0f7ac7bbd20527a45fc9c1aff0"},"schema_version":"1.0"},"canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:11.917367Z","signature_b64":"9gi0RgsSl6UgJcI9o2ikkKHwHnHTDEt3eZnRcLJHpM7xWgPeRB5XitwgLKPBuMJSxTylbivWhsExOpb3jgbKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","last_reissued_at":"2026-05-18T02:06:11.916780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:11.916780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.3706","source_version":2,"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-18T02:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"diqy+fv4j1hrJeT3IJDBFi0IdMd8y+A2JPPwUAio2glB6i2HKOuao0vq/FpWmTrJzRN07lQF17YVZybO7CKnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:23:03.440113Z"},"content_sha256":"5996b634f2387040ac4a50e976cb3b91201912efb6aa7e76b20b2aa44e4ae5a7","schema_version":"1.0","event_id":"sha256:5996b634f2387040ac4a50e976cb3b91201912efb6aa7e76b20b2aa44e4ae5a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YKH7VAIBKSDNHAJSBGVTQY2ZHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","submitted_at":"2010-07-21T18:25:33Z","abstract_excerpt":"We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3706","kind":"arxiv","version":2},"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-18T02:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzxFCfn+NEFNCw5GW93LQktYVwIduyxOgVECQ9u0iQPJu8Hbf7pfxYhh8TYh/tRkPVF5381XgAEeE4nd5dx4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:23:03.440787Z"},"content_sha256":"189d93aba7b7d9c39d1775bad754199b9cbf0d2268d0cdd9f87fc24d83a56006","schema_version":"1.0","event_id":"sha256:189d93aba7b7d9c39d1775bad754199b9cbf0d2268d0cdd9f87fc24d83a56006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/bundle.json","state_url":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/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-05-26T06:23:03Z","links":{"resolver":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV","bundle":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/bundle.json","state":"https://pith.science/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKH7VAIBKSDNHAJSBGVTQY2ZHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YKH7VAIBKSDNHAJSBGVTQY2ZHV","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":"3c25b9b90d6700d20b6148fc290151d9060abe0f7ac7bbd20527a45fc9c1aff0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-21T18:25:33Z","title_canon_sha256":"efc36c432274c19153885501e0a85627ff635f5a5bf4287bd9460d6ba91d8fb3"},"schema_version":"1.0","source":{"id":"1007.3706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.3706","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1007.3706v2","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3706","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"YKH7VAIBKSDN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YKH7VAIBKSDNHAJS","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YKH7VAIB","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:189d93aba7b7d9c39d1775bad754199b9cbf0d2268d0cdd9f87fc24d83a56006","target":"graph","created_at":"2026-05-18T02:06:11Z","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 distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-M","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-21T18:25:33Z","title":"Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3706","kind":"arxiv","version":2},"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:5996b634f2387040ac4a50e976cb3b91201912efb6aa7e76b20b2aa44e4ae5a7","target":"record","created_at":"2026-05-18T02:06:11Z","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":"3c25b9b90d6700d20b6148fc290151d9060abe0f7ac7bbd20527a45fc9c1aff0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-21T18:25:33Z","title_canon_sha256":"efc36c432274c19153885501e0a85627ff635f5a5bf4287bd9460d6ba91d8fb3"},"schema_version":"1.0","source":{"id":"1007.3706","kind":"arxiv","version":2}},"canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c28ffa81015486d3813209ab3863593d536840d6db82772b9006f779e1d1f706","first_computed_at":"2026-05-18T02:06:11.916780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:11.916780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9gi0RgsSl6UgJcI9o2ikkKHwHnHTDEt3eZnRcLJHpM7xWgPeRB5XitwgLKPBuMJSxTylbivWhsExOpb3jgbKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:11.917367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.3706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5996b634f2387040ac4a50e976cb3b91201912efb6aa7e76b20b2aa44e4ae5a7","sha256:189d93aba7b7d9c39d1775bad754199b9cbf0d2268d0cdd9f87fc24d83a56006"],"state_sha256":"d3015596a13f4772a8a0cbaa1000599a78be488bb7d1c6ea4155897c69366be7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWW31qvmsj5H6zG0HW7r4S4li0JyWJ9vI42GCAGj5T20YFg23U6uhNZnbvgdVl8T0garrRt3FS86D9lAkHDRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:23:03.444377Z","bundle_sha256":"e10fb94b47821e2d6ad6f4969bfb997f9ee3b8b7743420913e10f9c3d8f97575"}}