{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OTOEMGBEQZT6JGIUM3QVXR6OPP","short_pith_number":"pith:OTOEMGBE","canonical_record":{"source":{"id":"1905.11549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-28T00:40:01Z","cross_cats_sorted":["cs.DC","cs.LG","cs.NI","math.ST","stat.TH"],"title_canon_sha256":"b0fd2bfe0122a0e07e1fe609e5b26e59a353c0614d2f7dbf05c677f06eef5408","abstract_canon_sha256":"7123906109c4a8f1887ad1d47a3517e09a0955d5387503468835e23306f33f62"},"schema_version":"1.0"},"canonical_sha256":"74dc4618248667e4991466e15bc7ce7bf886d5749ff4a3c00b955a8d7d3615b2","source":{"kind":"arxiv","id":"1905.11549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11549","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11549v1","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11549","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"OTOEMGBEQZT6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OTOEMGBEQZT6JGIU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OTOEMGBE","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OTOEMGBEQZT6JGIUM3QVXR6OPP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-28T00:40:01Z","cross_cats_sorted":["cs.DC","cs.LG","cs.NI","math.ST","stat.TH"],"title_canon_sha256":"b0fd2bfe0122a0e07e1fe609e5b26e59a353c0614d2f7dbf05c677f06eef5408","abstract_canon_sha256":"7123906109c4a8f1887ad1d47a3517e09a0955d5387503468835e23306f33f62"},"schema_version":"1.0"},"canonical_sha256":"74dc4618248667e4991466e15bc7ce7bf886d5749ff4a3c00b955a8d7d3615b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:53.075562Z","signature_b64":"GXTibetdN7iAC9doFrCbDIaVv6uXibh8t/gu7UnqHkFmZns5/5YzgHkAzb0jvxnq3YNchOaDCawlGYNOARfrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74dc4618248667e4991466e15bc7ce7bf886d5749ff4a3c00b955a8d7d3615b2","last_reissued_at":"2026-05-17T23:44:53.074915Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:53.074915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11549","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-05-17T23:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0ZoYmq9CVL92SFZE4IYNuVPqDWIDR5eBnLrZktBTxkfxh3BLVOoKekNSQ3vxa3maHvcgRTkQsQ96CeiYLnBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:44:33.361245Z"},"content_sha256":"8526b027ec5388bdfd152328d17354cd0e071a6329a05c717405ea3eabfe407c","schema_version":"1.0","event_id":"sha256:8526b027ec5388bdfd152328d17354cd0e071a6329a05c717405ea3eabfe407c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OTOEMGBEQZT6JGIUM3QVXR6OPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Linear Model Clustering over Networks: A Tree-Based Fused-Lasso ADMM Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.NI","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Jia Liu, Xin Zhang, Zhengyuan Zhu","submitted_at":"2019-05-28T00:40:01Z","abstract_excerpt":"In this work, we consider to improve the model estimation efficiency by aggregating the neighbors' information as well as identify the subgroup membership for each node in the network. A tree-based $l_1$ penalty is proposed to save the computation and communication cost. We design a decentralized generalized alternating direction method of multiplier algorithm for solving the objective function in parallel. The theoretical properties are derived to guarantee both the model consistency and the algorithm convergence. Thorough numerical experiments are also conducted to back up our theory, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11549","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":""},"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-17T23:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6NnI3KcX9rDKBTB7eyuElBjce9xfwbIvKEx/R2KTrUHWDYA1YmFA83MiiEkLyDFbsBGDF5pSq3atXLhG9MACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:44:33.361953Z"},"content_sha256":"9c05c86a5ac5f5d0961975952e60ff874dcbf16e8c8485846607fdc2c1790320","schema_version":"1.0","event_id":"sha256:9c05c86a5ac5f5d0961975952e60ff874dcbf16e8c8485846607fdc2c1790320"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP/bundle.json","state_url":"https://pith.science/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP/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-06-09T06:44:33Z","links":{"resolver":"https://pith.science/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP","bundle":"https://pith.science/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP/bundle.json","state":"https://pith.science/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTOEMGBEQZT6JGIUM3QVXR6OPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OTOEMGBEQZT6JGIUM3QVXR6OPP","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":"7123906109c4a8f1887ad1d47a3517e09a0955d5387503468835e23306f33f62","cross_cats_sorted":["cs.DC","cs.LG","cs.NI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-28T00:40:01Z","title_canon_sha256":"b0fd2bfe0122a0e07e1fe609e5b26e59a353c0614d2f7dbf05c677f06eef5408"},"schema_version":"1.0","source":{"id":"1905.11549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11549","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11549v1","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11549","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"OTOEMGBEQZT6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OTOEMGBEQZT6JGIU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OTOEMGBE","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:9c05c86a5ac5f5d0961975952e60ff874dcbf16e8c8485846607fdc2c1790320","target":"graph","created_at":"2026-05-17T23:44:53Z","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":"In this work, we consider to improve the model estimation efficiency by aggregating the neighbors' information as well as identify the subgroup membership for each node in the network. A tree-based $l_1$ penalty is proposed to save the computation and communication cost. We design a decentralized generalized alternating direction method of multiplier algorithm for solving the objective function in parallel. The theoretical properties are derived to guarantee both the model consistency and the algorithm convergence. Thorough numerical experiments are also conducted to back up our theory, which ","authors_text":"Jia Liu, Xin Zhang, Zhengyuan Zhu","cross_cats":["cs.DC","cs.LG","cs.NI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-28T00:40:01Z","title":"Distributed Linear Model Clustering over Networks: A Tree-Based Fused-Lasso ADMM Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11549","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:8526b027ec5388bdfd152328d17354cd0e071a6329a05c717405ea3eabfe407c","target":"record","created_at":"2026-05-17T23:44:53Z","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":"7123906109c4a8f1887ad1d47a3517e09a0955d5387503468835e23306f33f62","cross_cats_sorted":["cs.DC","cs.LG","cs.NI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-28T00:40:01Z","title_canon_sha256":"b0fd2bfe0122a0e07e1fe609e5b26e59a353c0614d2f7dbf05c677f06eef5408"},"schema_version":"1.0","source":{"id":"1905.11549","kind":"arxiv","version":1}},"canonical_sha256":"74dc4618248667e4991466e15bc7ce7bf886d5749ff4a3c00b955a8d7d3615b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74dc4618248667e4991466e15bc7ce7bf886d5749ff4a3c00b955a8d7d3615b2","first_computed_at":"2026-05-17T23:44:53.074915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:53.074915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GXTibetdN7iAC9doFrCbDIaVv6uXibh8t/gu7UnqHkFmZns5/5YzgHkAzb0jvxnq3YNchOaDCawlGYNOARfrCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:53.075562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8526b027ec5388bdfd152328d17354cd0e071a6329a05c717405ea3eabfe407c","sha256:9c05c86a5ac5f5d0961975952e60ff874dcbf16e8c8485846607fdc2c1790320"],"state_sha256":"2a66eb3fc07223ebcab95814f313765c5fd2692e7c9dc688a390bd467a4860d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REV4E5D5jVNk8nFxnghgfEWHsu0rXHBoNGJNPHpozBHE+zG8tWNEGv9h13nmgd4ix3gAytZA5S62t2UGM8MQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:44:33.367060Z","bundle_sha256":"dead4c0f2df10311eb446e9253355d5553d92015a1ebe2e5a8309c718fc66fe8"}}