{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KLKNQWNNB5I35WSA4KZQKRLB4Z","short_pith_number":"pith:KLKNQWNN","canonical_record":{"source":{"id":"1803.06482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T09:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"621c9483d11fd6feec422ef9abc28a5dd247bc4660d17c25799f8b35de34374e","abstract_canon_sha256":"143a392f0ec446b7911c31614887d26205dcbf73dc15c4ddba115e46f9207425"},"schema_version":"1.0"},"canonical_sha256":"52d4d859ad0f51beda40e2b3054561e641e488c08b40a00a3490abb570c80212","source":{"kind":"arxiv","id":"1803.06482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06482","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06482v1","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06482","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"KLKNQWNNB5I3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KLKNQWNNB5I35WSA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KLKNQWNN","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KLKNQWNNB5I35WSA4KZQKRLB4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T09:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"621c9483d11fd6feec422ef9abc28a5dd247bc4660d17c25799f8b35de34374e","abstract_canon_sha256":"143a392f0ec446b7911c31614887d26205dcbf73dc15c4ddba115e46f9207425"},"schema_version":"1.0"},"canonical_sha256":"52d4d859ad0f51beda40e2b3054561e641e488c08b40a00a3490abb570c80212","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:48.201398Z","signature_b64":"CSL3ccSUhhnv0159AQ6+xsuk3Ycu59slJd1k8rF5Dne8euk6Ns8QAEt9duA3xBDo3vljJaviBKP1DHzyvVirDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d4d859ad0f51beda40e2b3054561e641e488c08b40a00a3490abb570c80212","last_reissued_at":"2026-05-17T23:58:48.200980Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:48.200980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06482","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-17T23:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5O2dT6Y3vtMN6q9OF+8QvFQY7PRslwNIUV7aKPsNontTkYSd3LbLVJkpECGTo7AX6f4vt3tozfZdypewIbvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:08:15.046293Z"},"content_sha256":"dca2e9d1f6be7bf8605f8244d4ca95d093c4968e9cdc968e17452a84807a3a26","schema_version":"1.0","event_id":"sha256:dca2e9d1f6be7bf8605f8244d4ca95d093c4968e9cdc968e17452a84807a3a26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KLKNQWNNB5I35WSA4KZQKRLB4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Distributed Method of Multipliers for Constrained Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Garulli, Antonio Giannitrapani, Francesco Farina, Giuseppe Notarstefano","submitted_at":"2018-03-17T09:22:13Z","abstract_excerpt":"This paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex. We propose an asynchronous distributed optimization algorithm, relying on the centralized Method of Multipliers, in which each node wakes up in an uncoordinated fashion and performs either a descent step on a local Augmented Lagrangian or an ascent step on the local multiplier vector. These two phases are regulated by a distributed logic-AND, which allows nodes to understand when the descent on the (whole) Augmented Lagrangian is sufficiently small. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06482","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-17T23:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iYsi/SWIhjSJMjdQvzHb2aZnpui3DNz3zoWBlVoDA1pSxpwf7kGA54E+qROkjx1Wq6Zy63PnLK9aWrq1llrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:08:15.047009Z"},"content_sha256":"7197c70919192d9e52d300050e11737d5efe976db247935b0194b468cc6af63c","schema_version":"1.0","event_id":"sha256:7197c70919192d9e52d300050e11737d5efe976db247935b0194b468cc6af63c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z/bundle.json","state_url":"https://pith.science/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z/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-06T23:08:15Z","links":{"resolver":"https://pith.science/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z","bundle":"https://pith.science/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z/bundle.json","state":"https://pith.science/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLKNQWNNB5I35WSA4KZQKRLB4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KLKNQWNNB5I35WSA4KZQKRLB4Z","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":"143a392f0ec446b7911c31614887d26205dcbf73dc15c4ddba115e46f9207425","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T09:22:13Z","title_canon_sha256":"621c9483d11fd6feec422ef9abc28a5dd247bc4660d17c25799f8b35de34374e"},"schema_version":"1.0","source":{"id":"1803.06482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06482","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06482v1","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06482","created_at":"2026-05-17T23:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"KLKNQWNNB5I3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KLKNQWNNB5I35WSA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KLKNQWNN","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:7197c70919192d9e52d300050e11737d5efe976db247935b0194b468cc6af63c","target":"graph","created_at":"2026-05-17T23:58:48Z","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":"This paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex. We propose an asynchronous distributed optimization algorithm, relying on the centralized Method of Multipliers, in which each node wakes up in an uncoordinated fashion and performs either a descent step on a local Augmented Lagrangian or an ascent step on the local multiplier vector. These two phases are regulated by a distributed logic-AND, which allows nodes to understand when the descent on the (whole) Augmented Lagrangian is sufficiently small. We","authors_text":"Andrea Garulli, Antonio Giannitrapani, Francesco Farina, Giuseppe Notarstefano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T09:22:13Z","title":"Asynchronous Distributed Method of Multipliers for Constrained Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06482","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:dca2e9d1f6be7bf8605f8244d4ca95d093c4968e9cdc968e17452a84807a3a26","target":"record","created_at":"2026-05-17T23:58:48Z","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":"143a392f0ec446b7911c31614887d26205dcbf73dc15c4ddba115e46f9207425","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T09:22:13Z","title_canon_sha256":"621c9483d11fd6feec422ef9abc28a5dd247bc4660d17c25799f8b35de34374e"},"schema_version":"1.0","source":{"id":"1803.06482","kind":"arxiv","version":1}},"canonical_sha256":"52d4d859ad0f51beda40e2b3054561e641e488c08b40a00a3490abb570c80212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52d4d859ad0f51beda40e2b3054561e641e488c08b40a00a3490abb570c80212","first_computed_at":"2026-05-17T23:58:48.200980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:48.200980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSL3ccSUhhnv0159AQ6+xsuk3Ycu59slJd1k8rF5Dne8euk6Ns8QAEt9duA3xBDo3vljJaviBKP1DHzyvVirDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:48.201398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dca2e9d1f6be7bf8605f8244d4ca95d093c4968e9cdc968e17452a84807a3a26","sha256:7197c70919192d9e52d300050e11737d5efe976db247935b0194b468cc6af63c"],"state_sha256":"1f8dd2e04272d487f07e5039e677abae40f14d535d46169f3224added2d464a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bEk4PGO72dKiib9vtvfkAmUiL9sn0aRN2ad8a70ESvt2eoq9R1rSQgvsp7P0EIXPerddMzI0qJPMzryR38slDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:08:15.051205Z","bundle_sha256":"7e78af728486451331cd7c3256978d09c7a701d30cd6b5090f2895c7e1042922"}}