{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NV4IDODUSYNMUGUB5VEYW2Q7AY","short_pith_number":"pith:NV4IDODU","schema_version":"1.0","canonical_sha256":"6d7881b874961aca1a81ed498b6a1f06025bce8ccf15f58055fd8def0c87ef14","source":{"kind":"arxiv","id":"1505.06475","version":3},"attestation_state":"computed","paper":{"title":"A Fast and Flexible Algorithm for the Graph-Fused Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"James G. Scott, Wesley Tansey","submitted_at":"2015-05-24T20:18:00Z","abstract_excerpt":"We propose a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. Our key insight is to decompose the graph into a set of trails which can then each be solved efficiently using techniques for the ordinary (1D) fused lasso. We leverage these trails in a proximal algorithm that alternates between closed form primal updates and fast dual trail updates. The resulting techinque is both faster than previous GFL methods and more flexible in the choice "},"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":"1505.06475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-24T20:18:00Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"2340c4bc5c309d6dba8d89e7c8ee193c8affbfb6fc3c9d5f14f38b320daa0f74","abstract_canon_sha256":"48666e4b574375b417f6323e6dab1344fd2953c033b6e6fb249f3012ec1fd11c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.190938Z","signature_b64":"dYA5yBNgiDTMTNS+P833XIMEOdo+2oa3LeUJxiDU0hpMGbW6XRv8IAu9uWJ6+wVi6ozjmzmuB7zlRI5K0dPVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d7881b874961aca1a81ed498b6a1f06025bce8ccf15f58055fd8def0c87ef14","last_reissued_at":"2026-05-18T01:59:57.190364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.190364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast and Flexible Algorithm for the Graph-Fused Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"James G. Scott, Wesley Tansey","submitted_at":"2015-05-24T20:18:00Z","abstract_excerpt":"We propose a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. Our key insight is to decompose the graph into a set of trails which can then each be solved efficiently using techniques for the ordinary (1D) fused lasso. We leverage these trails in a proximal algorithm that alternates between closed form primal updates and fast dual trail updates. The resulting techinque is both faster than previous GFL methods and more flexible in the choice "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06475","kind":"arxiv","version":3},"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":"1505.06475","created_at":"2026-05-18T01:59:57.190437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06475v3","created_at":"2026-05-18T01:59:57.190437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06475","created_at":"2026-05-18T01:59:57.190437+00:00"},{"alias_kind":"pith_short_12","alias_value":"NV4IDODUSYNM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NV4IDODUSYNMUGUB","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NV4IDODU","created_at":"2026-05-18T12:29:34.919912+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/NV4IDODUSYNMUGUB5VEYW2Q7AY","json":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY.json","graph_json":"https://pith.science/api/pith-number/NV4IDODUSYNMUGUB5VEYW2Q7AY/graph.json","events_json":"https://pith.science/api/pith-number/NV4IDODUSYNMUGUB5VEYW2Q7AY/events.json","paper":"https://pith.science/paper/NV4IDODU"},"agent_actions":{"view_html":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY","download_json":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY.json","view_paper":"https://pith.science/paper/NV4IDODU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06475&json=true","fetch_graph":"https://pith.science/api/pith-number/NV4IDODUSYNMUGUB5VEYW2Q7AY/graph.json","fetch_events":"https://pith.science/api/pith-number/NV4IDODUSYNMUGUB5VEYW2Q7AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY/action/storage_attestation","attest_author":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY/action/author_attestation","sign_citation":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY/action/citation_signature","submit_replication":"https://pith.science/pith/NV4IDODUSYNMUGUB5VEYW2Q7AY/action/replication_record"}},"created_at":"2026-05-18T01:59:57.190437+00:00","updated_at":"2026-05-18T01:59:57.190437+00:00"}