{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YUNDSOE67M46AVATJ5YTGUEF45","short_pith_number":"pith:YUNDSOE6","schema_version":"1.0","canonical_sha256":"c51a39389efb39e054134f71335085e75a83c00d760c93d6911820a16515b64b","source":{"kind":"arxiv","id":"1809.09516","version":2},"attestation_state":"computed","paper":{"title":"A dual ascent algorithm for asynchronous distributed optimization with unreliable directed communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C.H. Jeffrey Pang","submitted_at":"2018-09-25T14:29:53Z","abstract_excerpt":"We show that the averaged consensus algorithm on directed graphs with unreliable communications by Bof-Carli-Schenato has a dual optimization interpretation, which could be extended to the case of distributed optimization. We report on our numerical simulations for the distributed optimization algorithm for smooth and nonsmooth functions."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1809.09516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-25T14:29:53Z","cross_cats_sorted":[],"title_canon_sha256":"96f3c3fa9e0eac0d178ab7aa4ce3376d0e6eb13850ac6bd58b1844f4eea0a98c","abstract_canon_sha256":"a0a5e4e87c7e5d125268a0992a14479b84eb590d71c2b8712f83eb17b6f2d0b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:02.709708Z","signature_b64":"4VsIimM8SCZAJZnAFVykm+2j/12bA3PyI3EQs1EJOlLjA4yXJ35c4CsIgRrq+VgJ8w95NElIwfAZ/UfTA2XvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c51a39389efb39e054134f71335085e75a83c00d760c93d6911820a16515b64b","last_reissued_at":"2026-05-17T23:53:02.709216Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:02.709216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dual ascent algorithm for asynchronous distributed optimization with unreliable directed communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C.H. Jeffrey Pang","submitted_at":"2018-09-25T14:29:53Z","abstract_excerpt":"We show that the averaged consensus algorithm on directed graphs with unreliable communications by Bof-Carli-Schenato has a dual optimization interpretation, which could be extended to the case of distributed optimization. We report on our numerical simulations for the distributed optimization algorithm for smooth and nonsmooth functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09516","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.09516","created_at":"2026-05-17T23:53:02.709288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09516v2","created_at":"2026-05-17T23:53:02.709288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09516","created_at":"2026-05-17T23:53:02.709288+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUNDSOE67M46","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUNDSOE67M46AVAT","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUNDSOE6","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45","json":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45.json","graph_json":"https://pith.science/api/pith-number/YUNDSOE67M46AVATJ5YTGUEF45/graph.json","events_json":"https://pith.science/api/pith-number/YUNDSOE67M46AVATJ5YTGUEF45/events.json","paper":"https://pith.science/paper/YUNDSOE6"},"agent_actions":{"view_html":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45","download_json":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45.json","view_paper":"https://pith.science/paper/YUNDSOE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09516&json=true","fetch_graph":"https://pith.science/api/pith-number/YUNDSOE67M46AVATJ5YTGUEF45/graph.json","fetch_events":"https://pith.science/api/pith-number/YUNDSOE67M46AVATJ5YTGUEF45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45/action/storage_attestation","attest_author":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45/action/author_attestation","sign_citation":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45/action/citation_signature","submit_replication":"https://pith.science/pith/YUNDSOE67M46AVATJ5YTGUEF45/action/replication_record"}},"created_at":"2026-05-17T23:53:02.709288+00:00","updated_at":"2026-05-17T23:53:02.709288+00:00"}