{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5DXN4UP2LMOZ2SADRDLTON5I42","short_pith_number":"pith:5DXN4UP2","canonical_record":{"source":{"id":"1509.02597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-09T01:45:08Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"16df18ae4e327bb30469721797924e8dd801fe2a3926190f70a6a161ad5854cd","abstract_canon_sha256":"32eac35bb4c00635c946f7c44dff29e8d9b9e10aa6294d748e935d8915d1daf2"},"schema_version":"1.0"},"canonical_sha256":"e8eede51fa5b1d9d480388d73737a8e6ac720d563cc8f66b9e07e988dd4c9b45","source":{"kind":"arxiv","id":"1509.02597","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02597","created_at":"2026-05-18T01:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02597v2","created_at":"2026-05-18T01:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02597","created_at":"2026-05-18T01:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"5DXN4UP2LMOZ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5DXN4UP2LMOZ2SAD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5DXN4UP2","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5DXN4UP2LMOZ2SADRDLTON5I42","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-09T01:45:08Z","cross_cats_sorted":["cs.LG","cs.SY"],"title_canon_sha256":"16df18ae4e327bb30469721797924e8dd801fe2a3926190f70a6a161ad5854cd","abstract_canon_sha256":"32eac35bb4c00635c946f7c44dff29e8d9b9e10aa6294d748e935d8915d1daf2"},"schema_version":"1.0"},"canonical_sha256":"e8eede51fa5b1d9d480388d73737a8e6ac720d563cc8f66b9e07e988dd4c9b45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:44.706426Z","signature_b64":"861xUi3+gEiiN7N8fw9Hzy6fT4gM5yK0xypqwTzA200Avw+6Z8vLdc2w4o0BgmsliXXUyV7Z+i15XXEOMMP2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8eede51fa5b1d9d480388d73737a8e6ac720d563cc8f66b9e07e988dd4c9b45","last_reissued_at":"2026-05-18T01:15:44.705888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:44.705888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02597","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-18T01:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32a6FmZEtrSElKhaW5U+Fqa1MlWSJ64ReYH4w8EYafogtxz7lmn1wmh6UutnL2wWi3tS3PY0vH34/DNrnxL6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:49:46.767702Z"},"content_sha256":"60e6e0b99ef5076dc6f261d62e7b3cc13992167d766a79f543cfd98219d6eb61","schema_version":"1.0","event_id":"sha256:60e6e0b99ef5076dc6f261d62e7b3cc13992167d766a79f543cfd98219d6eb61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5DXN4UP2LMOZ2SADRDLTON5I42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY"],"primary_cat":"cs.DC","authors_text":"Mingyi Hong, Tsung-Hui Chang, Wei-Cheng Liao, Xiangfeng Wang","submitted_at":"2015-09-09T01:45:08Z","abstract_excerpt":"Aiming at solving large-scale learning problems, this paper studies distributed optimization methods based on the alternating direction method of multipliers (ADMM). By formulating the learning problem as a consensus problem, the ADMM can be used to solve the consensus problem in a fully parallel fashion over a computer network with a star topology. However, traditional synchronized computation does not scale well with the problem size, as the speed of the algorithm is limited by the slowest workers. This is particularly true in a heterogeneous network where the computing nodes experience diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02597","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-18T01:15:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6GABPCX1D59nymAc4Jf28hO9o9j3MPBHjW4YTXVU95FbCRE04PvT0ZEBtesv++vyBtuYLAqiFdkLHYrPypkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:49:46.768281Z"},"content_sha256":"0fb30b816a4b6da2bb1a259d6ae2b65b047603718c304960fdf36b4771b200a7","schema_version":"1.0","event_id":"sha256:0fb30b816a4b6da2bb1a259d6ae2b65b047603718c304960fdf36b4771b200a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DXN4UP2LMOZ2SADRDLTON5I42/bundle.json","state_url":"https://pith.science/pith/5DXN4UP2LMOZ2SADRDLTON5I42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DXN4UP2LMOZ2SADRDLTON5I42/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-27T08:49:46Z","links":{"resolver":"https://pith.science/pith/5DXN4UP2LMOZ2SADRDLTON5I42","bundle":"https://pith.science/pith/5DXN4UP2LMOZ2SADRDLTON5I42/bundle.json","state":"https://pith.science/pith/5DXN4UP2LMOZ2SADRDLTON5I42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DXN4UP2LMOZ2SADRDLTON5I42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5DXN4UP2LMOZ2SADRDLTON5I42","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":"32eac35bb4c00635c946f7c44dff29e8d9b9e10aa6294d748e935d8915d1daf2","cross_cats_sorted":["cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-09T01:45:08Z","title_canon_sha256":"16df18ae4e327bb30469721797924e8dd801fe2a3926190f70a6a161ad5854cd"},"schema_version":"1.0","source":{"id":"1509.02597","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02597","created_at":"2026-05-18T01:15:44Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02597v2","created_at":"2026-05-18T01:15:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02597","created_at":"2026-05-18T01:15:44Z"},{"alias_kind":"pith_short_12","alias_value":"5DXN4UP2LMOZ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5DXN4UP2LMOZ2SAD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5DXN4UP2","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:0fb30b816a4b6da2bb1a259d6ae2b65b047603718c304960fdf36b4771b200a7","target":"graph","created_at":"2026-05-18T01:15:44Z","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":"Aiming at solving large-scale learning problems, this paper studies distributed optimization methods based on the alternating direction method of multipliers (ADMM). By formulating the learning problem as a consensus problem, the ADMM can be used to solve the consensus problem in a fully parallel fashion over a computer network with a star topology. However, traditional synchronized computation does not scale well with the problem size, as the speed of the algorithm is limited by the slowest workers. This is particularly true in a heterogeneous network where the computing nodes experience diff","authors_text":"Mingyi Hong, Tsung-Hui Chang, Wei-Cheng Liao, Xiangfeng Wang","cross_cats":["cs.LG","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-09T01:45:08Z","title":"Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02597","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:60e6e0b99ef5076dc6f261d62e7b3cc13992167d766a79f543cfd98219d6eb61","target":"record","created_at":"2026-05-18T01:15:44Z","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":"32eac35bb4c00635c946f7c44dff29e8d9b9e10aa6294d748e935d8915d1daf2","cross_cats_sorted":["cs.LG","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-09T01:45:08Z","title_canon_sha256":"16df18ae4e327bb30469721797924e8dd801fe2a3926190f70a6a161ad5854cd"},"schema_version":"1.0","source":{"id":"1509.02597","kind":"arxiv","version":2}},"canonical_sha256":"e8eede51fa5b1d9d480388d73737a8e6ac720d563cc8f66b9e07e988dd4c9b45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8eede51fa5b1d9d480388d73737a8e6ac720d563cc8f66b9e07e988dd4c9b45","first_computed_at":"2026-05-18T01:15:44.705888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:44.705888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"861xUi3+gEiiN7N8fw9Hzy6fT4gM5yK0xypqwTzA200Avw+6Z8vLdc2w4o0BgmsliXXUyV7Z+i15XXEOMMP2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:44.706426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02597","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60e6e0b99ef5076dc6f261d62e7b3cc13992167d766a79f543cfd98219d6eb61","sha256:0fb30b816a4b6da2bb1a259d6ae2b65b047603718c304960fdf36b4771b200a7"],"state_sha256":"c311213e6b228a71cc53e1d1f10063bae31b040e41665c61d40184b833dcc588"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9kJ/weKcVPADBKm6GsgbDlgFBD8XcLpCku9MNO+6GOldA4dMaCCkEC4U9cNm/0XL74vpIB2mwBZi5E6GOHuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:49:46.771435Z","bundle_sha256":"272cd477c02e39bdd09e32e843093e4d019a9a2f00710fa0fc97c2abe6aabd28"}}