{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JKICHC4E3OVXMAR5HCOSB6EXB2","short_pith_number":"pith:JKICHC4E","canonical_record":{"source":{"id":"1804.00130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-31T07:50:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23aa6acc61fb4c5de76126572febaf3fe0599d957a2e45752d306119bfa6b7d7","abstract_canon_sha256":"cbb06714182a21bbe828b93376dcade57eaea3faaac5d428869ad70dc17154c3"},"schema_version":"1.0"},"canonical_sha256":"4a90238b84dbab76023d389d20f8970e9ea1261c650eb7750a99832638841e33","source":{"kind":"arxiv","id":"1804.00130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00130","created_at":"2026-05-18T00:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00130v1","created_at":"2026-05-18T00:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00130","created_at":"2026-05-18T00:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"JKICHC4E3OVX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JKICHC4E3OVXMAR5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JKICHC4E","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JKICHC4E3OVXMAR5HCOSB6EXB2","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-31T07:50:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23aa6acc61fb4c5de76126572febaf3fe0599d957a2e45752d306119bfa6b7d7","abstract_canon_sha256":"cbb06714182a21bbe828b93376dcade57eaea3faaac5d428869ad70dc17154c3"},"schema_version":"1.0"},"canonical_sha256":"4a90238b84dbab76023d389d20f8970e9ea1261c650eb7750a99832638841e33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:38.264436Z","signature_b64":"P5UgN4BwIWmrJQmDOackt25d0GaMwy06G/wUhlPOzcnMES061Nwo0ca675R75P42WHDbRgf038FaDiXukHhqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a90238b84dbab76023d389d20f8970e9ea1261c650eb7750a99832638841e33","last_reissued_at":"2026-05-18T00:19:38.263649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:38.263649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00130","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-18T00:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxr4okL3hslgygS70uBadFKRHoD4dhNl8UmPHei1OLLY+v02rHcYqdKCB55b2biSTFQtnVz7raTUv4l8zstvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:40:09.608182Z"},"content_sha256":"ad5478edbc3939908832bedc0e79a73671b03f3f6ad8b9255e161838482272e5","schema_version":"1.0","event_id":"sha256:ad5478edbc3939908832bedc0e79a73671b03f3f6ad8b9255e161838482272e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JKICHC4E3OVXMAR5HCOSB6EXB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locally Convex Sparse Learning over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ahmed Zaki, Lars K. Rasmussen, Partha P. Mitra, Saikat Chatterjee","submitted_at":"2018-03-31T07:50:38Z","abstract_excerpt":"We consider a distributed learning setup where a sparse signal is estimated over a network. Our main interest is to save communication resource for information exchange over the network and reduce processing time. Each node of the network uses a convex optimization based algorithm that provides a locally optimum solution for that node. The nodes exchange their signal estimates over the network in order to refine their local estimates. At a node, the optimization algorithm is based on an $\\ell_1$-norm minimization with appropriate modifications to promote sparsity as well as to include influenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00130","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-18T00:19:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/Bl/RbFlzqiueMqmumrnLbQVcvzRHeQf3eylk2Y1vQ1Ok4FlM0Qcd6GJUjg8cBS5+9WhQtHN1rzdJiNfssHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:40:09.608545Z"},"content_sha256":"3b0cc82fdb88b8a9d2f7e053ea193f030905e2240663a487f9211cea197b91b5","schema_version":"1.0","event_id":"sha256:3b0cc82fdb88b8a9d2f7e053ea193f030905e2240663a487f9211cea197b91b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKICHC4E3OVXMAR5HCOSB6EXB2/bundle.json","state_url":"https://pith.science/pith/JKICHC4E3OVXMAR5HCOSB6EXB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKICHC4E3OVXMAR5HCOSB6EXB2/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-31T05:40:09Z","links":{"resolver":"https://pith.science/pith/JKICHC4E3OVXMAR5HCOSB6EXB2","bundle":"https://pith.science/pith/JKICHC4E3OVXMAR5HCOSB6EXB2/bundle.json","state":"https://pith.science/pith/JKICHC4E3OVXMAR5HCOSB6EXB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKICHC4E3OVXMAR5HCOSB6EXB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JKICHC4E3OVXMAR5HCOSB6EXB2","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":"cbb06714182a21bbe828b93376dcade57eaea3faaac5d428869ad70dc17154c3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-31T07:50:38Z","title_canon_sha256":"23aa6acc61fb4c5de76126572febaf3fe0599d957a2e45752d306119bfa6b7d7"},"schema_version":"1.0","source":{"id":"1804.00130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00130","created_at":"2026-05-18T00:19:38Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00130v1","created_at":"2026-05-18T00:19:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00130","created_at":"2026-05-18T00:19:38Z"},{"alias_kind":"pith_short_12","alias_value":"JKICHC4E3OVX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JKICHC4E3OVXMAR5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JKICHC4E","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:3b0cc82fdb88b8a9d2f7e053ea193f030905e2240663a487f9211cea197b91b5","target":"graph","created_at":"2026-05-18T00:19:38Z","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":"We consider a distributed learning setup where a sparse signal is estimated over a network. Our main interest is to save communication resource for information exchange over the network and reduce processing time. Each node of the network uses a convex optimization based algorithm that provides a locally optimum solution for that node. The nodes exchange their signal estimates over the network in order to refine their local estimates. At a node, the optimization algorithm is based on an $\\ell_1$-norm minimization with appropriate modifications to promote sparsity as well as to include influenc","authors_text":"Ahmed Zaki, Lars K. Rasmussen, Partha P. Mitra, Saikat Chatterjee","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-31T07:50:38Z","title":"Locally Convex Sparse Learning over Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00130","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:ad5478edbc3939908832bedc0e79a73671b03f3f6ad8b9255e161838482272e5","target":"record","created_at":"2026-05-18T00:19:38Z","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":"cbb06714182a21bbe828b93376dcade57eaea3faaac5d428869ad70dc17154c3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-31T07:50:38Z","title_canon_sha256":"23aa6acc61fb4c5de76126572febaf3fe0599d957a2e45752d306119bfa6b7d7"},"schema_version":"1.0","source":{"id":"1804.00130","kind":"arxiv","version":1}},"canonical_sha256":"4a90238b84dbab76023d389d20f8970e9ea1261c650eb7750a99832638841e33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a90238b84dbab76023d389d20f8970e9ea1261c650eb7750a99832638841e33","first_computed_at":"2026-05-18T00:19:38.263649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:38.263649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5UgN4BwIWmrJQmDOackt25d0GaMwy06G/wUhlPOzcnMES061Nwo0ca675R75P42WHDbRgf038FaDiXukHhqAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:38.264436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad5478edbc3939908832bedc0e79a73671b03f3f6ad8b9255e161838482272e5","sha256:3b0cc82fdb88b8a9d2f7e053ea193f030905e2240663a487f9211cea197b91b5"],"state_sha256":"9bc7bc2c79d1a67b6e3396a893114f90677bfcd2b3418b4970aca908904b4737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Bt4bJP0+jwGlxUj12kKtVJC1I1bsQKiLO3N8atr8N6TZScj6a8Vhcz/9NevfY5j/wbFIgKqcr8LveZv70rjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:40:09.610504Z","bundle_sha256":"927838bbf9256414be72cc18bade4184a6d58f4173869fc4823f59205e7f2a73"}}