{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SIRXY42APFSXST6WDKSPJMVLJH","short_pith_number":"pith:SIRXY42A","schema_version":"1.0","canonical_sha256":"92237c73407965794fd61aa4f4b2ab49cf533d51a9d85edaefa00bba95cf942c","source":{"kind":"arxiv","id":"1512.04011","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.04011","created_at":"2026-05-18T01:13:00.345936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04011v2","created_at":"2026-05-18T01:13:00.345936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04011","created_at":"2026-05-18T01:13:00.345936+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIRXY42APFSX","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIRXY42APFSXST6W","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIRXY42A","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH","json":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH.json","graph_json":"https://pith.science/api/pith-number/SIRXY42APFSXST6WDKSPJMVLJH/graph.json","events_json":"https://pith.science/api/pith-number/SIRXY42APFSXST6WDKSPJMVLJH/events.json","paper":"https://pith.science/paper/SIRXY42A"},"agent_actions":{"view_html":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH","download_json":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH.json","view_paper":"https://pith.science/paper/SIRXY42A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04011&json=true","fetch_graph":"https://pith.science/api/pith-number/SIRXY42APFSXST6WDKSPJMVLJH/graph.json","fetch_events":"https://pith.science/api/pith-number/SIRXY42APFSXST6WDKSPJMVLJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/action/storage_attestation","attest_author":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/action/author_attestation","sign_citation":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/action/citation_signature","submit_replication":"https://pith.science/pith/SIRXY42APFSXST6WDKSPJMVLJH/action/replication_record"}},"created_at":"2026-05-18T01:13:00.345936+00:00","updated_at":"2026-05-18T01:13:00.345936+00:00"}