{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:3SD6YJDFI4FXSCMY55AG3KSP4X","short_pith_number":"pith:3SD6YJDF","schema_version":"1.0","canonical_sha256":"dc87ec2465470b790998ef406daa4fe5deb5268998e1917ac47454e523a0bff7","source":{"kind":"arxiv","id":"0910.0526","version":1},"attestation_state":"computed","paper":{"title":"A path algorithm for the Fused Lasso Signal Approximator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Holger Hoefling","submitted_at":"2009-10-03T09:03:31Z","abstract_excerpt":"The Lasso is a very well known penalized regression model, which adds an $L_{1}$ penalty with parameter $\\lambda_{1}$ on the coefficients to the squared error loss function. The Fused Lasso extends this model by also putting an $L_{1}$ penalty with parameter $\\lambda_{2}$ on the difference of neighboring coefficients, assuming there is a natural ordering. In this paper, we develop a fast path algorithm for solving the Fused Lasso Signal Approximator that computes the solutions for all values of $\\lambda_1$ and $\\lambda_2$. In the supplement, we also give an algorithm for the general Fused Lass"},"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":"0910.0526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-10-03T09:03:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b818feb31865011f95db8e781b0fad61f4979f3249e299bdee4dfcc01d03a6a4","abstract_canon_sha256":"45ebb67eea0e95542feff73f5f5ae7c298d4ff6c08970561c2a947aff64d1a0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:53:38.495006Z","signature_b64":"BhnGeIXnOjeue+8C8iHIKAMAGPHiDNkLSQ+g2JDrrlYCYYg40Z+CtI3pbkT7RqjnvHmzKilar8RiFePwc5lhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc87ec2465470b790998ef406daa4fe5deb5268998e1917ac47454e523a0bff7","last_reissued_at":"2026-07-04T15:53:38.494573Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:53:38.494573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A path algorithm for the Fused Lasso Signal Approximator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Holger Hoefling","submitted_at":"2009-10-03T09:03:31Z","abstract_excerpt":"The Lasso is a very well known penalized regression model, which adds an $L_{1}$ penalty with parameter $\\lambda_{1}$ on the coefficients to the squared error loss function. The Fused Lasso extends this model by also putting an $L_{1}$ penalty with parameter $\\lambda_{2}$ on the difference of neighboring coefficients, assuming there is a natural ordering. In this paper, we develop a fast path algorithm for solving the Fused Lasso Signal Approximator that computes the solutions for all values of $\\lambda_1$ and $\\lambda_2$. In the supplement, we also give an algorithm for the general Fused Lass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0526","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0910.0526/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0910.0526","created_at":"2026-07-04T15:53:38.494628+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.0526v1","created_at":"2026-07-04T15:53:38.494628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0526","created_at":"2026-07-04T15:53:38.494628+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SD6YJDFI4FX","created_at":"2026-07-04T15:53:38.494628+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SD6YJDFI4FXSCMY","created_at":"2026-07-04T15:53:38.494628+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SD6YJDF","created_at":"2026-07-04T15:53:38.494628+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/3SD6YJDFI4FXSCMY55AG3KSP4X","json":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X.json","graph_json":"https://pith.science/api/pith-number/3SD6YJDFI4FXSCMY55AG3KSP4X/graph.json","events_json":"https://pith.science/api/pith-number/3SD6YJDFI4FXSCMY55AG3KSP4X/events.json","paper":"https://pith.science/paper/3SD6YJDF"},"agent_actions":{"view_html":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X","download_json":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X.json","view_paper":"https://pith.science/paper/3SD6YJDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.0526&json=true","fetch_graph":"https://pith.science/api/pith-number/3SD6YJDFI4FXSCMY55AG3KSP4X/graph.json","fetch_events":"https://pith.science/api/pith-number/3SD6YJDFI4FXSCMY55AG3KSP4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X/action/storage_attestation","attest_author":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X/action/author_attestation","sign_citation":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X/action/citation_signature","submit_replication":"https://pith.science/pith/3SD6YJDFI4FXSCMY55AG3KSP4X/action/replication_record"}},"created_at":"2026-07-04T15:53:38.494628+00:00","updated_at":"2026-07-04T15:53:38.494628+00:00"}