{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OTXMAXDAN4KQ75ZQPUO3N2ELA2","short_pith_number":"pith:OTXMAXDA","canonical_record":{"source":{"id":"1909.06724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-15T03:39:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c8c8dd9c6d5153c63be30075f106ebad3f58ff7a05fd828bd6227656e6e41b72","abstract_canon_sha256":"d2301850624f11f728ecc5fc825a9c5713fc1e2bd8969078740b736f7eabee96"},"schema_version":"1.0"},"canonical_sha256":"74eec05c606f150ff7307d1db6e88b06b549c930e42747644466e1c06b5961b0","source":{"kind":"arxiv","id":"1909.06724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.06724","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1909.06724v1","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06724","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"OTXMAXDAN4KQ","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"pith_short_16","alias_value":"OTXMAXDAN4KQ75ZQ","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"pith_short_8","alias_value":"OTXMAXDA","created_at":"2026-07-05T00:53:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OTXMAXDAN4KQ75ZQPUO3N2ELA2","target":"record","payload":{"canonical_record":{"source":{"id":"1909.06724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-15T03:39:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c8c8dd9c6d5153c63be30075f106ebad3f58ff7a05fd828bd6227656e6e41b72","abstract_canon_sha256":"d2301850624f11f728ecc5fc825a9c5713fc1e2bd8969078740b736f7eabee96"},"schema_version":"1.0"},"canonical_sha256":"74eec05c606f150ff7307d1db6e88b06b549c930e42747644466e1c06b5961b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:51.223917Z","signature_b64":"1RJziumopM/JavfFSJFvYLmfOgWUdBBeUoppyoYuSg8R4PjuyE5FxWVWDCwdOXP1DdhFlb0WoMuLeshG72POBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74eec05c606f150ff7307d1db6e88b06b549c930e42747644466e1c06b5961b0","last_reissued_at":"2026-07-05T00:53:51.223518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:51.223518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.06724","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-07-05T00:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ryYedpfgl6dLm4bZOVLA1NmLRsp1GqNrn5/ofRGPiGG+1AeZ0+Lyqf1iyJpVeFywenSCLiuIX99mPzeQN2YmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:23:07.823838Z"},"content_sha256":"66627dcd8ce0f84ee66438225d6e49468657895de0146e02b27dff8860701b76","schema_version":"1.0","event_id":"sha256:66627dcd8ce0f84ee66438225d6e49468657895de0146e02b27dff8860701b76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OTXMAXDAN4KQ75ZQPUO3N2ELA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Censored Linearized ADMM for Decentralized Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Qing Ling, Weiyu Li, Yaohua Liu, Zhi Tian","submitted_at":"2019-09-15T03:39:46Z","abstract_excerpt":"In this paper, we propose a communication- and computation-efficient algorithm to solve a convex consensus optimization problem defined over a decentralized network. A remarkable existing algorithm to solve this problem is the alternating direction method of multipliers (ADMM), in which at every iteration every node updates its local variable through combining neighboring variables and solving an optimization subproblem. The proposed algorithm, called as COmmunication-censored Linearized ADMM (COLA), leverages a linearization technique to reduce the iteration-wise computation cost of ADMM and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06724","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.06724/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-05T00:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpQ0jKpRViVFBCiAFOs0FaPIPtEsd3wd/eGchsq1oz5etZ/wNySU+NXFJXIAKz4bijO7uM0eY8C3LLU/Zhu+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:23:07.824534Z"},"content_sha256":"aa904cc60df0f8ae7ebaf5952775c00f3b4c6c94c970ad6aa36119059c580d94","schema_version":"1.0","event_id":"sha256:aa904cc60df0f8ae7ebaf5952775c00f3b4c6c94c970ad6aa36119059c580d94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2/bundle.json","state_url":"https://pith.science/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2/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-19T16:23:07Z","links":{"resolver":"https://pith.science/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2","bundle":"https://pith.science/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2/bundle.json","state":"https://pith.science/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTXMAXDAN4KQ75ZQPUO3N2ELA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OTXMAXDAN4KQ75ZQPUO3N2ELA2","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":"d2301850624f11f728ecc5fc825a9c5713fc1e2bd8969078740b736f7eabee96","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-15T03:39:46Z","title_canon_sha256":"c8c8dd9c6d5153c63be30075f106ebad3f58ff7a05fd828bd6227656e6e41b72"},"schema_version":"1.0","source":{"id":"1909.06724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.06724","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1909.06724v1","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06724","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"OTXMAXDAN4KQ","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"pith_short_16","alias_value":"OTXMAXDAN4KQ75ZQ","created_at":"2026-07-05T00:53:51Z"},{"alias_kind":"pith_short_8","alias_value":"OTXMAXDA","created_at":"2026-07-05T00:53:51Z"}],"graph_snapshots":[{"event_id":"sha256:aa904cc60df0f8ae7ebaf5952775c00f3b4c6c94c970ad6aa36119059c580d94","target":"graph","created_at":"2026-07-05T00:53:51Z","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/1909.06724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a communication- and computation-efficient algorithm to solve a convex consensus optimization problem defined over a decentralized network. A remarkable existing algorithm to solve this problem is the alternating direction method of multipliers (ADMM), in which at every iteration every node updates its local variable through combining neighboring variables and solving an optimization subproblem. The proposed algorithm, called as COmmunication-censored Linearized ADMM (COLA), leverages a linearization technique to reduce the iteration-wise computation cost of ADMM and ","authors_text":"Qing Ling, Weiyu Li, Yaohua Liu, Zhi Tian","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-15T03:39:46Z","title":"Communication-Censored Linearized ADMM for Decentralized Consensus Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06724","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:66627dcd8ce0f84ee66438225d6e49468657895de0146e02b27dff8860701b76","target":"record","created_at":"2026-07-05T00:53:51Z","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":"d2301850624f11f728ecc5fc825a9c5713fc1e2bd8969078740b736f7eabee96","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-15T03:39:46Z","title_canon_sha256":"c8c8dd9c6d5153c63be30075f106ebad3f58ff7a05fd828bd6227656e6e41b72"},"schema_version":"1.0","source":{"id":"1909.06724","kind":"arxiv","version":1}},"canonical_sha256":"74eec05c606f150ff7307d1db6e88b06b549c930e42747644466e1c06b5961b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74eec05c606f150ff7307d1db6e88b06b549c930e42747644466e1c06b5961b0","first_computed_at":"2026-07-05T00:53:51.223518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:53:51.223518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1RJziumopM/JavfFSJFvYLmfOgWUdBBeUoppyoYuSg8R4PjuyE5FxWVWDCwdOXP1DdhFlb0WoMuLeshG72POBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:53:51.223917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.06724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66627dcd8ce0f84ee66438225d6e49468657895de0146e02b27dff8860701b76","sha256:aa904cc60df0f8ae7ebaf5952775c00f3b4c6c94c970ad6aa36119059c580d94"],"state_sha256":"d7b08168b0cc3a1b3d7bf9e167ed76d9a1c3179efaa9cb703f9344098c0cd1ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omx/kMN8tYThMiccrplM1Qx3Nl0QQXeZHw8ZynmNkJ7LS+q57XWi0LhPLj2JhKk9GY4T1WAgh3PSd3jGYQ1TCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:23:07.833872Z","bundle_sha256":"0918e4c770af9943e0b0f3154bd6ef215f2cefac92b3ed1e70772a72c79f5fcb"}}