{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZFMYKSLM7J7QJAPUD643XHLD7U","short_pith_number":"pith:ZFMYKSLM","schema_version":"1.0","canonical_sha256":"c95985496cfa7f0481f41fb9bb9d63fd16c1fc6bb34580aa839f6cc1f0bd0713","source":{"kind":"arxiv","id":"1405.3222","version":2},"attestation_state":"computed","paper":{"title":"Efficient Implementations of the Generalized Lasso Dual Path Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.CO","authors_text":"Ryan Tibshirani, Taylor Arnold","submitted_at":"2014-05-13T16:42:45Z","abstract_excerpt":"We consider efficient implementations of the generalized lasso dual path algorithm of Tibshirani and Taylor (2011). We first describe a generic approach that covers any penalty matrix D and any (full column rank) matrix X of predictor variables. We then describe fast implementations for the special cases of trend filtering problems, fused lasso problems, and sparse fused lasso problems, both with X=I and a general matrix X. These specialized implementations offer a considerable improvement over the generic implementation, both in terms of numerical stability and efficiency of the solution path"},"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":"1405.3222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-05-13T16:42:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"da7d5b62062e258a344429ad1f45b4c3d6f3a0a75066d912a3dfd70e458909a3","abstract_canon_sha256":"b838ad74fed1530d92651be2e4a239651574d8ea8c83738017558b0bd686e090"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:46.035474Z","signature_b64":"XOVOzP4rermbgAW7qQB+MRjLaKmc+gM2WBUaCf7NPxUSeGT+iKwIcbEbNUjk3lWd8D5NVJ12OF+oSRpqF/NYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95985496cfa7f0481f41fb9bb9d63fd16c1fc6bb34580aa839f6cc1f0bd0713","last_reissued_at":"2026-05-18T02:38:46.034986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:46.034986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Implementations of the Generalized Lasso Dual Path Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.CO","authors_text":"Ryan Tibshirani, Taylor Arnold","submitted_at":"2014-05-13T16:42:45Z","abstract_excerpt":"We consider efficient implementations of the generalized lasso dual path algorithm of Tibshirani and Taylor (2011). We first describe a generic approach that covers any penalty matrix D and any (full column rank) matrix X of predictor variables. We then describe fast implementations for the special cases of trend filtering problems, fused lasso problems, and sparse fused lasso problems, both with X=I and a general matrix X. These specialized implementations offer a considerable improvement over the generic implementation, both in terms of numerical stability and efficiency of the solution path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3222","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":"1405.3222","created_at":"2026-05-18T02:38:46.035061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.3222v2","created_at":"2026-05-18T02:38:46.035061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3222","created_at":"2026-05-18T02:38:46.035061+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFMYKSLM7J7Q","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFMYKSLM7J7QJAPU","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFMYKSLM","created_at":"2026-05-18T12:28:59.999130+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/ZFMYKSLM7J7QJAPUD643XHLD7U","json":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U.json","graph_json":"https://pith.science/api/pith-number/ZFMYKSLM7J7QJAPUD643XHLD7U/graph.json","events_json":"https://pith.science/api/pith-number/ZFMYKSLM7J7QJAPUD643XHLD7U/events.json","paper":"https://pith.science/paper/ZFMYKSLM"},"agent_actions":{"view_html":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U","download_json":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U.json","view_paper":"https://pith.science/paper/ZFMYKSLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.3222&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFMYKSLM7J7QJAPUD643XHLD7U/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFMYKSLM7J7QJAPUD643XHLD7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/action/storage_attestation","attest_author":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/action/author_attestation","sign_citation":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/action/citation_signature","submit_replication":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/action/replication_record"}},"created_at":"2026-05-18T02:38:46.035061+00:00","updated_at":"2026-05-18T02:38:46.035061+00:00"}