{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SIRXY42APFSXST6WDKSPJMVLJH","short_pith_number":"pith:SIRXY42A","canonical_record":{"source":{"id":"1512.04011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-13T06:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"26f3481eeb00242a6d60735349603dee80223303cff430098e3057d401712e77","abstract_canon_sha256":"09594530aee9984d54917178b771ece0fa30350ce2cfa41cd827644e71f19c08"},"schema_version":"1.0"},"canonical_sha256":"92237c73407965794fd61aa4f4b2ab49cf533d51a9d85edaefa00bba95cf942c","source":{"kind":"arxiv","id":"1512.04011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04011","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04011v2","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04011","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"SIRXY42APFSX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SIRXY42APFSXST6W","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SIRXY42A","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SIRXY42APFSXST6WDKSPJMVLJH","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-13T06:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"26f3481eeb00242a6d60735349603dee80223303cff430098e3057d401712e77","abstract_canon_sha256":"09594530aee9984d54917178b771ece0fa30350ce2cfa41cd827644e71f19c08"},"schema_version":"1.0"},"canonical_sha256":"92237c73407965794fd61aa4f4b2ab49cf533d51a9d85edaefa00bba95cf942c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:00.346240Z","signature_b64":"VkDNe/R3AqqFlVzG0IBMFJ+KgDZwWxMwGKrle//kAJhInRPL00x+xP+XxSm7Pzu2ZM58ndoGemwFhLGGloghCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92237c73407965794fd61aa4f4b2ab49cf533d51a9d85edaefa00bba95cf942c","last_reissued_at":"2026-05-18T01:13:00.345878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:00.345878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04011","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:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKP+emIJjaTugJkpKd7K477d3V5a5E14FVy0/YfOnq4C7Bg3N92XmqbIO85GtrsweHEZ9MVKZe9JFZCmaHzcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:12:14.931451Z"},"content_sha256":"d211d943d9751680ac8bc472b3a802d9eafb13f3eee334a1f3b2fda0045e9bba","schema_version":"1.0","event_id":"sha256:d211d943d9751680ac8bc472b3a802d9eafb13f3eee334a1f3b2fda0045e9bba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SIRXY42APFSXST6WDKSPJMVLJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"L1-Regularized Distributed Optimization: A Communication-Efficient Primal-Dual Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Martin Jaggi, Michael I. Jordan, Simone Forte, Virginia Smith","submitted_at":"2015-12-13T06:49:00Z","abstract_excerpt":"Despite the importance of sparsity in many large-scale applications, there are few methods for distributed optimization of sparsity-inducing objectives. In this paper, we present a communication-efficient framework for L1-regularized optimization in the distributed environment. By viewing classical objectives in a more general primal-dual setting, we develop a new class of methods that can be efficiently distributed and applied to common sparsity-inducing models, such as Lasso, sparse logistic regression, and elastic net-regularized problems. We provide theoretical convergence guarantees for o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04011","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:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wg4d0oKAiZYZ3emF8RgKtqMuXK+/OjSbTS0Nbc0GqwPmAZHaJNq7tytiVDrXkZz2AsU2sr0drcI3+UHO+W90CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:12:14.931804Z"},"content_sha256":"43c091375148e6363de56fbd12f7371cd3795a55f67b1639aa471e790a5598cb","schema_version":"1.0","event_id":"sha256:43c091375148e6363de56fbd12f7371cd3795a55f67b1639aa471e790a5598cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/bundle.json","state_url":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIRXY42APFSXST6WDKSPJMVLJH/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-03T17:12:14Z","links":{"resolver":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH","bundle":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/bundle.json","state":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIRXY42APFSXST6WDKSPJMVLJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SIRXY42APFSXST6WDKSPJMVLJH","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":"09594530aee9984d54917178b771ece0fa30350ce2cfa41cd827644e71f19c08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-13T06:49:00Z","title_canon_sha256":"26f3481eeb00242a6d60735349603dee80223303cff430098e3057d401712e77"},"schema_version":"1.0","source":{"id":"1512.04011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04011","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04011v2","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04011","created_at":"2026-05-18T01:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"SIRXY42APFSX","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SIRXY42APFSXST6W","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SIRXY42A","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:43c091375148e6363de56fbd12f7371cd3795a55f67b1639aa471e790a5598cb","target":"graph","created_at":"2026-05-18T01:13:00Z","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":"Despite the importance of sparsity in many large-scale applications, there are few methods for distributed optimization of sparsity-inducing objectives. In this paper, we present a communication-efficient framework for L1-regularized optimization in the distributed environment. By viewing classical objectives in a more general primal-dual setting, we develop a new class of methods that can be efficiently distributed and applied to common sparsity-inducing models, such as Lasso, sparse logistic regression, and elastic net-regularized problems. We provide theoretical convergence guarantees for o","authors_text":"Martin Jaggi, Michael I. Jordan, Simone Forte, Virginia Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-13T06:49:00Z","title":"L1-Regularized Distributed Optimization: A Communication-Efficient Primal-Dual Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04011","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:d211d943d9751680ac8bc472b3a802d9eafb13f3eee334a1f3b2fda0045e9bba","target":"record","created_at":"2026-05-18T01:13:00Z","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":"09594530aee9984d54917178b771ece0fa30350ce2cfa41cd827644e71f19c08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-13T06:49:00Z","title_canon_sha256":"26f3481eeb00242a6d60735349603dee80223303cff430098e3057d401712e77"},"schema_version":"1.0","source":{"id":"1512.04011","kind":"arxiv","version":2}},"canonical_sha256":"92237c73407965794fd61aa4f4b2ab49cf533d51a9d85edaefa00bba95cf942c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92237c73407965794fd61aa4f4b2ab49cf533d51a9d85edaefa00bba95cf942c","first_computed_at":"2026-05-18T01:13:00.345878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:00.345878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VkDNe/R3AqqFlVzG0IBMFJ+KgDZwWxMwGKrle//kAJhInRPL00x+xP+XxSm7Pzu2ZM58ndoGemwFhLGGloghCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:00.346240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d211d943d9751680ac8bc472b3a802d9eafb13f3eee334a1f3b2fda0045e9bba","sha256:43c091375148e6363de56fbd12f7371cd3795a55f67b1639aa471e790a5598cb"],"state_sha256":"2c79a013189c934669aaca6d9c386164f2f65f556aac9c77bd46167030891d4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YC5ZNUwor6aFUUKMuhxRDObmofq5GLmTMZhg6livNHRBsjSkt/mreLmzRJWpKblkyz9bs8ccfMyvEwjSPu86AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:12:14.933779Z","bundle_sha256":"44f0c1ab45f9325e76ac684183220fc1737a179f3a2a5d9a1392ecbed6081b53"}}