{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZFMYKSLM7J7QJAPUD643XHLD7U","short_pith_number":"pith:ZFMYKSLM","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"},"canonical_sha256":"c95985496cfa7f0481f41fb9bb9d63fd16c1fc6bb34580aa839f6cc1f0bd0713","source":{"kind":"arxiv","id":"1405.3222","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3222","created_at":"2026-05-18T02:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3222v2","created_at":"2026-05-18T02:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3222","created_at":"2026-05-18T02:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZFMYKSLM7J7Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFMYKSLM7J7QJAPU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFMYKSLM","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZFMYKSLM7J7QJAPUD643XHLD7U","target":"record","payload":{"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"},"canonical_sha256":"c95985496cfa7f0481f41fb9bb9d63fd16c1fc6bb34580aa839f6cc1f0bd0713","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"},"source_kind":"arxiv","source_id":"1405.3222","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-18T02:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfqe4J2LvLRkvpZlOBdSOLMbcrEWfVKJlFsmC9UV/CA0PJIAvp6ePtbiB/MPhsbz/hBzSpBFVXsNb8DkcegQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:40:52.776241Z"},"content_sha256":"bc4e1d3cb0e8f206bf705ec0bfbbc2f89111abade9ae393695822b9695fa4073","schema_version":"1.0","event_id":"sha256:bc4e1d3cb0e8f206bf705ec0bfbbc2f89111abade9ae393695822b9695fa4073"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZFMYKSLM7J7QJAPUD643XHLD7U","target":"graph","payload":{"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"},"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-18T02:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2oplFQgFXC+FeB+5UYEs+axvg7iVO0Rwt1cO1g734/Iwft6bn2DMbddU3vS0UgXtlKCziPpS/Oe68fqOuONDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:40:52.776609Z"},"content_sha256":"9b23feda09073a99519e98bc68caf8fc97104704ea4967741ae7eeb82120091d","schema_version":"1.0","event_id":"sha256:9b23feda09073a99519e98bc68caf8fc97104704ea4967741ae7eeb82120091d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/bundle.json","state_url":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/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-05T10:40:52Z","links":{"resolver":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U","bundle":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/bundle.json","state":"https://pith.science/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFMYKSLM7J7QJAPUD643XHLD7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZFMYKSLM7J7QJAPUD643XHLD7U","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":"b838ad74fed1530d92651be2e4a239651574d8ea8c83738017558b0bd686e090","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-05-13T16:42:45Z","title_canon_sha256":"da7d5b62062e258a344429ad1f45b4c3d6f3a0a75066d912a3dfd70e458909a3"},"schema_version":"1.0","source":{"id":"1405.3222","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.3222","created_at":"2026-05-18T02:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1405.3222v2","created_at":"2026-05-18T02:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.3222","created_at":"2026-05-18T02:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZFMYKSLM7J7Q","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFMYKSLM7J7QJAPU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFMYKSLM","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:9b23feda09073a99519e98bc68caf8fc97104704ea4967741ae7eeb82120091d","target":"graph","created_at":"2026-05-18T02:38:46Z","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 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","authors_text":"Ryan Tibshirani, Taylor Arnold","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-05-13T16:42:45Z","title":"Efficient Implementations of the Generalized Lasso Dual Path Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.3222","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:bc4e1d3cb0e8f206bf705ec0bfbbc2f89111abade9ae393695822b9695fa4073","target":"record","created_at":"2026-05-18T02:38:46Z","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":"b838ad74fed1530d92651be2e4a239651574d8ea8c83738017558b0bd686e090","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-05-13T16:42:45Z","title_canon_sha256":"da7d5b62062e258a344429ad1f45b4c3d6f3a0a75066d912a3dfd70e458909a3"},"schema_version":"1.0","source":{"id":"1405.3222","kind":"arxiv","version":2}},"canonical_sha256":"c95985496cfa7f0481f41fb9bb9d63fd16c1fc6bb34580aa839f6cc1f0bd0713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c95985496cfa7f0481f41fb9bb9d63fd16c1fc6bb34580aa839f6cc1f0bd0713","first_computed_at":"2026-05-18T02:38:46.034986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:46.034986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XOVOzP4rermbgAW7qQB+MRjLaKmc+gM2WBUaCf7NPxUSeGT+iKwIcbEbNUjk3lWd8D5NVJ12OF+oSRpqF/NYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:46.035474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.3222","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc4e1d3cb0e8f206bf705ec0bfbbc2f89111abade9ae393695822b9695fa4073","sha256:9b23feda09073a99519e98bc68caf8fc97104704ea4967741ae7eeb82120091d"],"state_sha256":"862cfdc5481d426e603729b34c91a8b5e9343b6f1950cf9f001288880755bd2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sblqWiC6bpC8qvNIE7H9NEcvl0TmVLZFRQ5SsLtwPb06bCxmi6FVPvBItM7E2dx/fVLaHoyEvMfd0K2sXUHnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:40:52.778530Z","bundle_sha256":"7fb5ce5d78ef09fa55b46de951c82507cfe5101764f3479ef42e0ebfa0b26221"}}