{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WS5MIE6I7GY46R7XMMG7RFEZ2Q","short_pith_number":"pith:WS5MIE6I","schema_version":"1.0","canonical_sha256":"b4bac413c8f9b1cf47f7630df89499d42484cc07f5dcb32482a7ee16e8794037","source":{"kind":"arxiv","id":"1804.11223","version":3},"attestation_state":"computed","paper":{"title":"Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting","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-04-30T14:15:38Z","abstract_excerpt":"Consider the setting where each vertex of a graph has a function, and communications can only occur between vertices connected by an edge. We wish to minimize the sum of these functions. For the case when each function is the sum of a strongly convex quadratic and a convex function, we propose a distributed version of Dykstra's algorithm. The computations to optimize the dual objective function can run asynchronously without a global clock, and in a distributed manner without a central controller. Convergence to the primal minimizer is deterministic instead of being probabilistic, and is guara"},"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":"1804.11223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-30T14:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"73e2a5924ec5efddea2c4659a2f7b5edf62717e8a57d964b79a8640259155a50","abstract_canon_sha256":"8cde54cc32388b6ee3cb6ca7a0403d9e87100babc4fe9f62032f27f8cdd2f38e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:43.704706Z","signature_b64":"q6CFSWrp37I+r55+R3kpnuc+Z7BXyZEqF0s3RGDjOeawIWX2Kye52qafVQzQUdUzonhLr+3XBUUcx0FSdn07Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4bac413c8f9b1cf47f7630df89499d42484cc07f5dcb32482a7ee16e8794037","last_reissued_at":"2026-05-17T23:59:43.704087Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:43.704087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting","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-04-30T14:15:38Z","abstract_excerpt":"Consider the setting where each vertex of a graph has a function, and communications can only occur between vertices connected by an edge. We wish to minimize the sum of these functions. For the case when each function is the sum of a strongly convex quadratic and a convex function, we propose a distributed version of Dykstra's algorithm. The computations to optimize the dual objective function can run asynchronously without a global clock, and in a distributed manner without a central controller. Convergence to the primal minimizer is deterministic instead of being probabilistic, and is guara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11223","kind":"arxiv","version":3},"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":"1804.11223","created_at":"2026-05-17T23:59:43.704160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11223v3","created_at":"2026-05-17T23:59:43.704160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11223","created_at":"2026-05-17T23:59:43.704160+00:00"},{"alias_kind":"pith_short_12","alias_value":"WS5MIE6I7GY4","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WS5MIE6I7GY46R7X","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WS5MIE6I","created_at":"2026-05-18T12:33:01.666342+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/WS5MIE6I7GY46R7XMMG7RFEZ2Q","json":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q.json","graph_json":"https://pith.science/api/pith-number/WS5MIE6I7GY46R7XMMG7RFEZ2Q/graph.json","events_json":"https://pith.science/api/pith-number/WS5MIE6I7GY46R7XMMG7RFEZ2Q/events.json","paper":"https://pith.science/paper/WS5MIE6I"},"agent_actions":{"view_html":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q","download_json":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q.json","view_paper":"https://pith.science/paper/WS5MIE6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11223&json=true","fetch_graph":"https://pith.science/api/pith-number/WS5MIE6I7GY46R7XMMG7RFEZ2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/WS5MIE6I7GY46R7XMMG7RFEZ2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q/action/storage_attestation","attest_author":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q/action/author_attestation","sign_citation":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q/action/citation_signature","submit_replication":"https://pith.science/pith/WS5MIE6I7GY46R7XMMG7RFEZ2Q/action/replication_record"}},"created_at":"2026-05-17T23:59:43.704160+00:00","updated_at":"2026-05-17T23:59:43.704160+00:00"}