{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EULD2PXEFIASWFM6SRAGPJDKAO","short_pith_number":"pith:EULD2PXE","schema_version":"1.0","canonical_sha256":"25163d3ee42a012b159e944067a46a038eb742f2c7130493586f4a079ab7bd23","source":{"kind":"arxiv","id":"1802.04383","version":2},"attestation_state":"computed","paper":{"title":"Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hugo Raguet, Lo\\\"ic Landrieu","submitted_at":"2018-02-12T22:54:40Z","abstract_excerpt":"We present an extension of the cut-pursuit algorithm, introduced by Landrieu and Obozinski (2017), to the graph total-variation regularization of functions with a separable nondifferentiable part. We propose a modified algorithmic scheme as well as adapted proofs of convergence. We also present a heuristic approach for handling the cases in which the values associated to each vertex of the graph are multidimensional. The performance of our algorithm, which we demonstrate on difficult, ill-conditioned large-scale inverse and learning problems, is such that it may in practice extend the scope of"},"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":"1802.04383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-12T22:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"f59bc7757b66c06cfe2a4f3de1afef2cf9918473521b92f005b3449322c6f9ee","abstract_canon_sha256":"7a3947e145111c394d989be094fbc4cca743175d835ce370fe0581adf40ed2c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:36.654225Z","signature_b64":"6Gx4QHxKjT+U32oM9lGXbwUtqiXMvKWN3zxH7S/cxgZXqR7dn6fUMuqX/UinXQ97fp8CCEDYPmbB4QIZM8+UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25163d3ee42a012b159e944067a46a038eb742f2c7130493586f4a079ab7bd23","last_reissued_at":"2026-05-18T00:15:36.653541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:36.653541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hugo Raguet, Lo\\\"ic Landrieu","submitted_at":"2018-02-12T22:54:40Z","abstract_excerpt":"We present an extension of the cut-pursuit algorithm, introduced by Landrieu and Obozinski (2017), to the graph total-variation regularization of functions with a separable nondifferentiable part. We propose a modified algorithmic scheme as well as adapted proofs of convergence. We also present a heuristic approach for handling the cases in which the values associated to each vertex of the graph are multidimensional. The performance of our algorithm, which we demonstrate on difficult, ill-conditioned large-scale inverse and learning problems, is such that it may in practice extend the scope of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04383","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.04383","created_at":"2026-05-18T00:15:36.653645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04383v2","created_at":"2026-05-18T00:15:36.653645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04383","created_at":"2026-05-18T00:15:36.653645+00:00"},{"alias_kind":"pith_short_12","alias_value":"EULD2PXEFIAS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EULD2PXEFIASWFM6","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EULD2PXE","created_at":"2026-05-18T12:32:22.470017+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/EULD2PXEFIASWFM6SRAGPJDKAO","json":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO.json","graph_json":"https://pith.science/api/pith-number/EULD2PXEFIASWFM6SRAGPJDKAO/graph.json","events_json":"https://pith.science/api/pith-number/EULD2PXEFIASWFM6SRAGPJDKAO/events.json","paper":"https://pith.science/paper/EULD2PXE"},"agent_actions":{"view_html":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO","download_json":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO.json","view_paper":"https://pith.science/paper/EULD2PXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04383&json=true","fetch_graph":"https://pith.science/api/pith-number/EULD2PXEFIASWFM6SRAGPJDKAO/graph.json","fetch_events":"https://pith.science/api/pith-number/EULD2PXEFIASWFM6SRAGPJDKAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO/action/storage_attestation","attest_author":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO/action/author_attestation","sign_citation":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO/action/citation_signature","submit_replication":"https://pith.science/pith/EULD2PXEFIASWFM6SRAGPJDKAO/action/replication_record"}},"created_at":"2026-05-18T00:15:36.653645+00:00","updated_at":"2026-05-18T00:15:36.653645+00:00"}