{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:V4PPCMNZVAH7HQLZP3TJUHL7WI","short_pith_number":"pith:V4PPCMNZ","schema_version":"1.0","canonical_sha256":"af1ef131b9a80ff3c1797ee69a1d7fb2202d5c0627596e8b42913420b80a6dde","source":{"kind":"arxiv","id":"1207.4642","version":3},"attestation_state":"computed","paper":{"title":"The L1-Potts functional for robust jump-sparse reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Andreas Weinmann, Laurent Demaret, Martin Storath","submitted_at":"2012-07-19T12:39:11Z","abstract_excerpt":"We investigate the non-smooth and non-convex $L^1$-Potts functional in discrete and continuous time. We show $\\Gamma$-convergence of discrete $L^1$-Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete $L^1$-Potts problem, we introduce an $O(n^2)$ time and $O(n)$ space algorithm to compute an exact minimizer. We apply $L^1$-Potts minimization to the problem of recovering piecewise constant signals from noisy measurements $f.$ It turns out that the $L^1$-Potts functional has a"},"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":"1207.4642","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-19T12:39:11Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"ab3bbd5ec7f6e9b8f2dab2382e8e2b6ea3b2934773e5ebd1daa8a7b13ddb367e","abstract_canon_sha256":"dfea6f363262351bb67dcf5a1e849a460483bfa50173cb730c7a7234b4a85d78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.282612Z","signature_b64":"Tfxb6vIYeupsB2m9+Ec0r7rdL1SKdnIKdoNka2hOZzJ8HgT+y4gG6tdcVBut4boZn0LN0yVbFBPnHXOs0DGJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af1ef131b9a80ff3c1797ee69a1d7fb2202d5c0627596e8b42913420b80a6dde","last_reissued_at":"2026-05-18T02:26:01.282088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.282088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The L1-Potts functional for robust jump-sparse reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Andreas Weinmann, Laurent Demaret, Martin Storath","submitted_at":"2012-07-19T12:39:11Z","abstract_excerpt":"We investigate the non-smooth and non-convex $L^1$-Potts functional in discrete and continuous time. We show $\\Gamma$-convergence of discrete $L^1$-Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete $L^1$-Potts problem, we introduce an $O(n^2)$ time and $O(n)$ space algorithm to compute an exact minimizer. We apply $L^1$-Potts minimization to the problem of recovering piecewise constant signals from noisy measurements $f.$ It turns out that the $L^1$-Potts functional has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4642","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":"1207.4642","created_at":"2026-05-18T02:26:01.282166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4642v3","created_at":"2026-05-18T02:26:01.282166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4642","created_at":"2026-05-18T02:26:01.282166+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4PPCMNZVAH7","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4PPCMNZVAH7HQLZ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4PPCMNZ","created_at":"2026-05-18T12:27:25.539911+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/V4PPCMNZVAH7HQLZP3TJUHL7WI","json":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI.json","graph_json":"https://pith.science/api/pith-number/V4PPCMNZVAH7HQLZP3TJUHL7WI/graph.json","events_json":"https://pith.science/api/pith-number/V4PPCMNZVAH7HQLZP3TJUHL7WI/events.json","paper":"https://pith.science/paper/V4PPCMNZ"},"agent_actions":{"view_html":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI","download_json":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI.json","view_paper":"https://pith.science/paper/V4PPCMNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4642&json=true","fetch_graph":"https://pith.science/api/pith-number/V4PPCMNZVAH7HQLZP3TJUHL7WI/graph.json","fetch_events":"https://pith.science/api/pith-number/V4PPCMNZVAH7HQLZP3TJUHL7WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI/action/storage_attestation","attest_author":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI/action/author_attestation","sign_citation":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI/action/citation_signature","submit_replication":"https://pith.science/pith/V4PPCMNZVAH7HQLZP3TJUHL7WI/action/replication_record"}},"created_at":"2026-05-18T02:26:01.282166+00:00","updated_at":"2026-05-18T02:26:01.282166+00:00"}