{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TL4HENH5O5PD5K32ORO6I3YFCH","short_pith_number":"pith:TL4HENH5","schema_version":"1.0","canonical_sha256":"9af87234fd775e3eab7a745de46f0511ec97306849100f468282792de835c780","source":{"kind":"arxiv","id":"1410.7690","version":5},"attestation_state":"computed","paper":{"title":"Trend Filtering on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Alex Smola, James Sharpnack, Ryan J. Tibshirani, Yu-Xiang Wang","submitted_at":"2014-10-28T16:22:32Z","abstract_excerpt":"We introduce a family of adaptive estimators on graphs, based on penalizing the $\\ell_1$ norm of discrete graph differences. This generalizes the idea of trend filtering [Kim et al. (2009), Tibshirani (2014)], used for univariate nonparametric regression, to graphs. Analogous to the univariate case, graph trend filtering exhibits a level of local adaptivity unmatched by the usual $\\ell_2$-based graph smoothers. It is also defined by a convex minimization problem that is readily solved (e.g., by fast ADMM or Newton algorithms). We demonstrate the merits of graph trend filtering through examples"},"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":"1410.7690","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-28T16:22:32Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"title_canon_sha256":"57d93891fe139ed7d70966932a83acc83b6c9b7d50342968f63148a7c90794aa","abstract_canon_sha256":"df8bdf988e0f9deee85ea9c91ddc182aa217011febda6c1b607f7acf581f9fc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:58.719822Z","signature_b64":"rHY81s7F26LC/bdpJsIOkf4DFUnYUwI51r+DRRaonKvebrNurrE33o/4MoXoOrw6RwhYrEcw6p9JQ/emj6OCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9af87234fd775e3eab7a745de46f0511ec97306849100f468282792de835c780","last_reissued_at":"2026-05-18T01:12:58.719487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:58.719487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trend Filtering on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Alex Smola, James Sharpnack, Ryan J. Tibshirani, Yu-Xiang Wang","submitted_at":"2014-10-28T16:22:32Z","abstract_excerpt":"We introduce a family of adaptive estimators on graphs, based on penalizing the $\\ell_1$ norm of discrete graph differences. This generalizes the idea of trend filtering [Kim et al. (2009), Tibshirani (2014)], used for univariate nonparametric regression, to graphs. Analogous to the univariate case, graph trend filtering exhibits a level of local adaptivity unmatched by the usual $\\ell_2$-based graph smoothers. It is also defined by a convex minimization problem that is readily solved (e.g., by fast ADMM or Newton algorithms). We demonstrate the merits of graph trend filtering through examples"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7690","kind":"arxiv","version":5},"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":"1410.7690","created_at":"2026-05-18T01:12:58.719542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7690v5","created_at":"2026-05-18T01:12:58.719542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7690","created_at":"2026-05-18T01:12:58.719542+00:00"},{"alias_kind":"pith_short_12","alias_value":"TL4HENH5O5PD","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TL4HENH5O5PD5K32","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TL4HENH5","created_at":"2026-05-18T12:28:49.207871+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/TL4HENH5O5PD5K32ORO6I3YFCH","json":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH.json","graph_json":"https://pith.science/api/pith-number/TL4HENH5O5PD5K32ORO6I3YFCH/graph.json","events_json":"https://pith.science/api/pith-number/TL4HENH5O5PD5K32ORO6I3YFCH/events.json","paper":"https://pith.science/paper/TL4HENH5"},"agent_actions":{"view_html":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH","download_json":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH.json","view_paper":"https://pith.science/paper/TL4HENH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7690&json=true","fetch_graph":"https://pith.science/api/pith-number/TL4HENH5O5PD5K32ORO6I3YFCH/graph.json","fetch_events":"https://pith.science/api/pith-number/TL4HENH5O5PD5K32ORO6I3YFCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/action/storage_attestation","attest_author":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/action/author_attestation","sign_citation":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/action/citation_signature","submit_replication":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/action/replication_record"}},"created_at":"2026-05-18T01:12:58.719542+00:00","updated_at":"2026-05-18T01:12:58.719542+00:00"}