{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:H6MQBUIG3CJUYKJT2ISVOIQNKZ","short_pith_number":"pith:H6MQBUIG","canonical_record":{"source":{"id":"1901.09252","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-26T17:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"71917df767502856800509a66f279cdb4640bcdcede3a10ab24c39da078c2513","abstract_canon_sha256":"b1bc3cec7891739aaba373c0d99c2ba45844f2af16a396ae8fea63cccf05a69e"},"schema_version":"1.0"},"canonical_sha256":"3f9900d106d8934c2933d22557220d567f694e9d2efbbe704ed3f24046ebce9f","source":{"kind":"arxiv","id":"1901.09252","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09252","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09252v5","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09252","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"H6MQBUIG3CJU","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"H6MQBUIG3CJUYKJT","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"H6MQBUIG","created_at":"2026-07-05T01:21:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:H6MQBUIG3CJUYKJT2ISVOIQNKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09252","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-26T17:54:50Z","cross_cats_sorted":[],"title_canon_sha256":"71917df767502856800509a66f279cdb4640bcdcede3a10ab24c39da078c2513","abstract_canon_sha256":"b1bc3cec7891739aaba373c0d99c2ba45844f2af16a396ae8fea63cccf05a69e"},"schema_version":"1.0"},"canonical_sha256":"3f9900d106d8934c2933d22557220d567f694e9d2efbbe704ed3f24046ebce9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:33.700962Z","signature_b64":"lPkbVtSo/rf0ec72mRUvF266OGPlGN2bGlZXkmydfWDpkLaWoAPglR4mwcSsqwZhAGvTxrvLcNOLqTLvDyBcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9900d106d8934c2933d22557220d567f694e9d2efbbe704ed3f24046ebce9f","last_reissued_at":"2026-07-05T01:21:33.700384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:33.700384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09252","source_version":5,"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-07-05T01:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2q69k3o2ntiACcbo/TJf3XapTPCGQ/0ds6fZvvnuyAwtivnY6+H3NVmEmHOvLKKgHk5SHSUE2l9oLYU91VhuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:13:50.726716Z"},"content_sha256":"ae05cf444261b15a2868aeb4bdb29c00e1e6f753e2bf151645ab310f4782cea9","schema_version":"1.0","event_id":"sha256:ae05cf444261b15a2868aeb4bdb29c00e1e6f753e2bf151645ab310f4782cea9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:H6MQBUIG3CJUYKJT2ISVOIQNKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Luca Schenato, Marco Todescato, Nicola Bastianello, Ruggero Carli","submitted_at":"2019-01-26T17:54:50Z","abstract_excerpt":"In this work we focus on the problem of minimizing the sum of convex cost functions in a distributed fashion over a peer-to-peer network. In particular, we are interested in the case in which communications between nodes are prone to failures and the agents are not synchronized among themselves. We address the problem proposing a modified version of the relaxed ADMM, which corresponds to the Peaceman-Rachford splitting method applied to the dual. By exploiting results from operator theory, we are able to prove the almost sure convergence of the proposed algorithm under general assumptions on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09252","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.09252/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pt0TnlZI0IzZ60Ivoy79bej5evGXw64zTC42eyLc80QuPbSLfJIruXp3xwGx6+5aXgEY1WetbdEFenAFEJyxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:13:50.727279Z"},"content_sha256":"ef1f97733ddb3a4f9ad3f1dab10383c0af60469577f1ff21bb3fbe05d4191e4a","schema_version":"1.0","event_id":"sha256:ef1f97733ddb3a4f9ad3f1dab10383c0af60469577f1ff21bb3fbe05d4191e4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ/bundle.json","state_url":"https://pith.science/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ/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-08-07T06:13:50Z","links":{"resolver":"https://pith.science/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ","bundle":"https://pith.science/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ/bundle.json","state":"https://pith.science/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6MQBUIG3CJUYKJT2ISVOIQNKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:H6MQBUIG3CJUYKJT2ISVOIQNKZ","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":"b1bc3cec7891739aaba373c0d99c2ba45844f2af16a396ae8fea63cccf05a69e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-26T17:54:50Z","title_canon_sha256":"71917df767502856800509a66f279cdb4640bcdcede3a10ab24c39da078c2513"},"schema_version":"1.0","source":{"id":"1901.09252","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09252","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09252v5","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09252","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"H6MQBUIG3CJU","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"H6MQBUIG3CJUYKJT","created_at":"2026-07-05T01:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"H6MQBUIG","created_at":"2026-07-05T01:21:33Z"}],"graph_snapshots":[{"event_id":"sha256:ef1f97733ddb3a4f9ad3f1dab10383c0af60469577f1ff21bb3fbe05d4191e4a","target":"graph","created_at":"2026-07-05T01:21:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1901.09252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we focus on the problem of minimizing the sum of convex cost functions in a distributed fashion over a peer-to-peer network. In particular, we are interested in the case in which communications between nodes are prone to failures and the agents are not synchronized among themselves. We address the problem proposing a modified version of the relaxed ADMM, which corresponds to the Peaceman-Rachford splitting method applied to the dual. By exploiting results from operator theory, we are able to prove the almost sure convergence of the proposed algorithm under general assumptions on t","authors_text":"Luca Schenato, Marco Todescato, Nicola Bastianello, Ruggero Carli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-26T17:54:50Z","title":"Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09252","kind":"arxiv","version":5},"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:ae05cf444261b15a2868aeb4bdb29c00e1e6f753e2bf151645ab310f4782cea9","target":"record","created_at":"2026-07-05T01:21:33Z","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":"b1bc3cec7891739aaba373c0d99c2ba45844f2af16a396ae8fea63cccf05a69e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-26T17:54:50Z","title_canon_sha256":"71917df767502856800509a66f279cdb4640bcdcede3a10ab24c39da078c2513"},"schema_version":"1.0","source":{"id":"1901.09252","kind":"arxiv","version":5}},"canonical_sha256":"3f9900d106d8934c2933d22557220d567f694e9d2efbbe704ed3f24046ebce9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f9900d106d8934c2933d22557220d567f694e9d2efbbe704ed3f24046ebce9f","first_computed_at":"2026-07-05T01:21:33.700384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:21:33.700384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lPkbVtSo/rf0ec72mRUvF266OGPlGN2bGlZXkmydfWDpkLaWoAPglR4mwcSsqwZhAGvTxrvLcNOLqTLvDyBcBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:21:33.700962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09252","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae05cf444261b15a2868aeb4bdb29c00e1e6f753e2bf151645ab310f4782cea9","sha256:ef1f97733ddb3a4f9ad3f1dab10383c0af60469577f1ff21bb3fbe05d4191e4a"],"state_sha256":"2f1c1d86aea08a53986ac73aa44fa563fd5f37d0e1f4f09844283abac7c563e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIxF0nTCTuqcU9Z7Wpm+EzyqIZDFaVyHETEJA0OnY8YQw+K6YdI1dS5XJ9VE43uliMn1avclV1CqS2Hl7Nt0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:13:50.732620Z","bundle_sha256":"800297a01e880cbbcd89fe0d4176db8d06a2bc63b9deb2c8471c3806ec20df88"}}