{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F2Q7IOAZASYKQ5TLDZZHTRVR5X","short_pith_number":"pith:F2Q7IOAZ","canonical_record":{"source":{"id":"1304.5590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-20T06:04:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"de3fcd42d5d085a0940a5b6f5046893859b51e363bbf1ea14192bb4bfbd18d93","abstract_canon_sha256":"0053061c96680f0aeada8ae88229fb90ff7cc44938f13c8336526cb5b636cf82"},"schema_version":"1.0"},"canonical_sha256":"2ea1f4381904b0a8766b1e7279c6b1eddc222eb4382a163960bab9f319def7df","source":{"kind":"arxiv","id":"1304.5590","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5590","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5590v2","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5590","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"F2Q7IOAZASYK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F2Q7IOAZASYKQ5TL","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F2Q7IOAZ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F2Q7IOAZASYKQ5TLDZZHTRVR5X","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-20T06:04:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"de3fcd42d5d085a0940a5b6f5046893859b51e363bbf1ea14192bb4bfbd18d93","abstract_canon_sha256":"0053061c96680f0aeada8ae88229fb90ff7cc44938f13c8336526cb5b636cf82"},"schema_version":"1.0"},"canonical_sha256":"2ea1f4381904b0a8766b1e7279c6b1eddc222eb4382a163960bab9f319def7df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.362193Z","signature_b64":"izQaIBNjwvyZxMILL/wAh3c/uq1Q/9MemFrkMvkFW56gSCqOFVGk4JoyvvJycDDqpukoUkC5VOuXm6ExpqjHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea1f4381904b0a8766b1e7279c6b1eddc222eb4382a163960bab9f319def7df","last_reissued_at":"2026-05-18T00:58:17.361341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.361341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5590","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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPQ2kQ2X/B8LwbXX8ldoLMcG8cZdNL4GldSDyF+BVF6lJZYWt8ffB+VM671fDIQ6DnmOpFinfhyS4ZVA2U44DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:31:55.431382Z"},"content_sha256":"5cc6bdcc44c8b5454141dd16b4901cfa1e1b967240d28bd4cd94d450231d4e94","schema_version":"1.0","event_id":"sha256:5cc6bdcc44c8b5454141dd16b4901cfa1e1b967240d28bd4cd94d450231d4e94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F2Q7IOAZASYKQ5TLDZZHTRVR5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Angelia Nedi\\'c, Anna Scaglione, Tsung-Hui Chang","submitted_at":"2013-04-20T06:04:44Z","abstract_excerpt":"Various distributed optimization methods have been developed for solving problems which have simple local constraint sets and whose objective function is the sum of local cost functions of distributed agents in a network. Motivated by emerging applications in smart grid and distributed sparse regression, this paper studies distributed optimization methods for solving general problems which have a coupled global cost function and have inequality constraints. We consider a network scenario where each agent has no global knowledge and can access only its local mapping and constraint functions. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5590","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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWheB3MQxMTGUP+TVL1BMxZLEUVd+DmWac1vXwA6YeQnv7koClTs9wpT59IDPGQ0HCrDLXE5WEYVHRE2yKgoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:31:55.432126Z"},"content_sha256":"9ca1d30d2c6d91a39c510b6fbb2b5cfe1b4be83ba5068df8cabc72a90c965c13","schema_version":"1.0","event_id":"sha256:9ca1d30d2c6d91a39c510b6fbb2b5cfe1b4be83ba5068df8cabc72a90c965c13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X/bundle.json","state_url":"https://pith.science/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X/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-27T02:31:55Z","links":{"resolver":"https://pith.science/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X","bundle":"https://pith.science/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X/bundle.json","state":"https://pith.science/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2Q7IOAZASYKQ5TLDZZHTRVR5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F2Q7IOAZASYKQ5TLDZZHTRVR5X","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":"0053061c96680f0aeada8ae88229fb90ff7cc44938f13c8336526cb5b636cf82","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-20T06:04:44Z","title_canon_sha256":"de3fcd42d5d085a0940a5b6f5046893859b51e363bbf1ea14192bb4bfbd18d93"},"schema_version":"1.0","source":{"id":"1304.5590","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5590","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5590v2","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5590","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"F2Q7IOAZASYK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F2Q7IOAZASYKQ5TL","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F2Q7IOAZ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:9ca1d30d2c6d91a39c510b6fbb2b5cfe1b4be83ba5068df8cabc72a90c965c13","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"Various distributed optimization methods have been developed for solving problems which have simple local constraint sets and whose objective function is the sum of local cost functions of distributed agents in a network. Motivated by emerging applications in smart grid and distributed sparse regression, this paper studies distributed optimization methods for solving general problems which have a coupled global cost function and have inequality constraints. We consider a network scenario where each agent has no global knowledge and can access only its local mapping and constraint functions. To","authors_text":"Angelia Nedi\\'c, Anna Scaglione, Tsung-Hui Chang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-20T06:04:44Z","title":"Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5590","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:5cc6bdcc44c8b5454141dd16b4901cfa1e1b967240d28bd4cd94d450231d4e94","target":"record","created_at":"2026-05-18T00:58:17Z","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":"0053061c96680f0aeada8ae88229fb90ff7cc44938f13c8336526cb5b636cf82","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-20T06:04:44Z","title_canon_sha256":"de3fcd42d5d085a0940a5b6f5046893859b51e363bbf1ea14192bb4bfbd18d93"},"schema_version":"1.0","source":{"id":"1304.5590","kind":"arxiv","version":2}},"canonical_sha256":"2ea1f4381904b0a8766b1e7279c6b1eddc222eb4382a163960bab9f319def7df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea1f4381904b0a8766b1e7279c6b1eddc222eb4382a163960bab9f319def7df","first_computed_at":"2026-05-18T00:58:17.361341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.361341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izQaIBNjwvyZxMILL/wAh3c/uq1Q/9MemFrkMvkFW56gSCqOFVGk4JoyvvJycDDqpukoUkC5VOuXm6ExpqjHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.362193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5590","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cc6bdcc44c8b5454141dd16b4901cfa1e1b967240d28bd4cd94d450231d4e94","sha256:9ca1d30d2c6d91a39c510b6fbb2b5cfe1b4be83ba5068df8cabc72a90c965c13"],"state_sha256":"295f3b9c8a773a5f366a6ea0f7b6d625c6cef7f831578e677537b24051794b57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYJIDw9Hfd8XC3gaLbD3V4YmFgDK7QZTZoxD13HvqxKIGbmapVfXOjbSTdGoMWsSvWU0Vg+ijcqPX+PzeqQGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:31:55.435793Z","bundle_sha256":"dc20553a40713311f09e03dede089fce5f7f6550ddb1aa1b7b9fba17e1cf9c51"}}