{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TL4HENH5O5PD5K32ORO6I3YFCH","short_pith_number":"pith:TL4HENH5","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"},"canonical_sha256":"9af87234fd775e3eab7a745de46f0511ec97306849100f468282792de835c780","source":{"kind":"arxiv","id":"1410.7690","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7690","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7690v5","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7690","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"TL4HENH5O5PD","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TL4HENH5O5PD5K32","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TL4HENH5","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TL4HENH5O5PD5K32ORO6I3YFCH","target":"record","payload":{"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"},"canonical_sha256":"9af87234fd775e3eab7a745de46f0511ec97306849100f468282792de835c780","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"},"source_kind":"arxiv","source_id":"1410.7690","source_version":5,"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-18T01:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZfWHX+fXk6gNFZgxmBNeJzN1h6/lH4Jt/d/bIaLXMWNuGLcVEs4grbhd4EUyWGeg52RpKbUiG5Xgjl3w0loAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:12:42.730034Z"},"content_sha256":"32819f028b1b2bf44ff8413b58e8aecaf5a04605e32ab5a88927b2a125112851","schema_version":"1.0","event_id":"sha256:32819f028b1b2bf44ff8413b58e8aecaf5a04605e32ab5a88927b2a125112851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TL4HENH5O5PD5K32ORO6I3YFCH","target":"graph","payload":{"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"},"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-18T01:12:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wiac/z2K29Y3hTsGcXfOGBy2cBH/Nf89RbFmS6BXTT9RHBuPqpd7NIgKzEMgTcG+6OAQZvvtRwMwUdyNqnv9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:12:42.730418Z"},"content_sha256":"6e7e36bc4fcf16ee7e3602c0aedac892c6354cf4244e2949566628202b809314","schema_version":"1.0","event_id":"sha256:6e7e36bc4fcf16ee7e3602c0aedac892c6354cf4244e2949566628202b809314"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/bundle.json","state_url":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TL4HENH5O5PD5K32ORO6I3YFCH/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-05-19T08:12:42Z","links":{"resolver":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH","bundle":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/bundle.json","state":"https://pith.science/pith/TL4HENH5O5PD5K32ORO6I3YFCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TL4HENH5O5PD5K32ORO6I3YFCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TL4HENH5O5PD5K32ORO6I3YFCH","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":"df8bdf988e0f9deee85ea9c91ddc182aa217011febda6c1b607f7acf581f9fc8","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-28T16:22:32Z","title_canon_sha256":"57d93891fe139ed7d70966932a83acc83b6c9b7d50342968f63148a7c90794aa"},"schema_version":"1.0","source":{"id":"1410.7690","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7690","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7690v5","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7690","created_at":"2026-05-18T01:12:58Z"},{"alias_kind":"pith_short_12","alias_value":"TL4HENH5O5PD","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TL4HENH5O5PD5K32","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TL4HENH5","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:6e7e36bc4fcf16ee7e3602c0aedac892c6354cf4244e2949566628202b809314","target":"graph","created_at":"2026-05-18T01:12:58Z","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 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","authors_text":"Alex Smola, James Sharpnack, Ryan J. Tibshirani, Yu-Xiang Wang","cross_cats":["cs.AI","cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-28T16:22:32Z","title":"Trend Filtering on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7690","kind":"arxiv","version":5},"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:32819f028b1b2bf44ff8413b58e8aecaf5a04605e32ab5a88927b2a125112851","target":"record","created_at":"2026-05-18T01:12:58Z","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":"df8bdf988e0f9deee85ea9c91ddc182aa217011febda6c1b607f7acf581f9fc8","cross_cats_sorted":["cs.AI","cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-28T16:22:32Z","title_canon_sha256":"57d93891fe139ed7d70966932a83acc83b6c9b7d50342968f63148a7c90794aa"},"schema_version":"1.0","source":{"id":"1410.7690","kind":"arxiv","version":5}},"canonical_sha256":"9af87234fd775e3eab7a745de46f0511ec97306849100f468282792de835c780","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9af87234fd775e3eab7a745de46f0511ec97306849100f468282792de835c780","first_computed_at":"2026-05-18T01:12:58.719487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:58.719487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rHY81s7F26LC/bdpJsIOkf4DFUnYUwI51r+DRRaonKvebrNurrE33o/4MoXoOrw6RwhYrEcw6p9JQ/emj6OCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:58.719822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7690","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32819f028b1b2bf44ff8413b58e8aecaf5a04605e32ab5a88927b2a125112851","sha256:6e7e36bc4fcf16ee7e3602c0aedac892c6354cf4244e2949566628202b809314"],"state_sha256":"30f4bd7fb6076e85f577240fa749e1f5754a8e74d32114f3a3b33a896b7643b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90JHoIu2Lvt7fjVbCn6J1kdD+lv1l3FLpSpMjjOj5D5r3SKtvS4rEZhFVyFSxnrdxQkZKSsnzEbSAEVgef6lCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:12:42.732343Z","bundle_sha256":"111e09ca42c8dcd348a7e21fee0efcdff2a05396145bc0f48fdf64bf416c20e2"}}