{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J5WAHI7S5TLT7QK25QA67FSBPC","short_pith_number":"pith:J5WAHI7S","schema_version":"1.0","canonical_sha256":"4f6c03a3f2ecd73fc15aec01ef964178aca44f7e4c6803a29a9ea5e383a0814c","source":{"kind":"arxiv","id":"1504.00499","version":2},"attestation_state":"computed","paper":{"title":"Exact algorithms for $L^1$-TV regularization of real-valued or circle-valued signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Andreas Weinmann, Martin Storath, Michael Unser","submitted_at":"2015-04-02T10:02:47Z","abstract_excerpt":"We consider $L^1$-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is non-convex for circle-valued data. In this paper, we derive exact algorithms for both data spaces. A key ingredient is the reduction of the infinite search spaces to a finite set of configurations, which can be scanned by the Viterbi algorithm. To reduce the computational complexity of the involved tabulations, we extend the technique of distance transforms to non-uniform grids and to the circular data spa"},"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":"1504.00499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-04-02T10:02:47Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"69e19f1c32a0dbe1ddb465b2baad94d5298768ac25bb794066beb2875e75671c","abstract_canon_sha256":"d47712f0d360515d7cb331f50af2e805801d71f104dfb22ef53850249cf55416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.371026Z","signature_b64":"qs/g8BLloYiQQVSqbzJ+rVtWM2I+2W2y/iBLuudUTlOcSAwJyPb0NBvkVQBEFpD2H0HyqH/Sm3V1/YZynOjMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f6c03a3f2ecd73fc15aec01ef964178aca44f7e4c6803a29a9ea5e383a0814c","last_reissued_at":"2026-05-18T00:44:37.370468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.370468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact algorithms for $L^1$-TV regularization of real-valued or circle-valued signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Andreas Weinmann, Martin Storath, Michael Unser","submitted_at":"2015-04-02T10:02:47Z","abstract_excerpt":"We consider $L^1$-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is non-convex for circle-valued data. In this paper, we derive exact algorithms for both data spaces. A key ingredient is the reduction of the infinite search spaces to a finite set of configurations, which can be scanned by the Viterbi algorithm. To reduce the computational complexity of the involved tabulations, we extend the technique of distance transforms to non-uniform grids and to the circular data spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00499","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":"1504.00499","created_at":"2026-05-18T00:44:37.370539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00499v2","created_at":"2026-05-18T00:44:37.370539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00499","created_at":"2026-05-18T00:44:37.370539+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5WAHI7S5TLT","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5WAHI7S5TLT7QK2","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5WAHI7S","created_at":"2026-05-18T12:29:27.538025+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/J5WAHI7S5TLT7QK25QA67FSBPC","json":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC.json","graph_json":"https://pith.science/api/pith-number/J5WAHI7S5TLT7QK25QA67FSBPC/graph.json","events_json":"https://pith.science/api/pith-number/J5WAHI7S5TLT7QK25QA67FSBPC/events.json","paper":"https://pith.science/paper/J5WAHI7S"},"agent_actions":{"view_html":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC","download_json":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC.json","view_paper":"https://pith.science/paper/J5WAHI7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00499&json=true","fetch_graph":"https://pith.science/api/pith-number/J5WAHI7S5TLT7QK25QA67FSBPC/graph.json","fetch_events":"https://pith.science/api/pith-number/J5WAHI7S5TLT7QK25QA67FSBPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC/action/storage_attestation","attest_author":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC/action/author_attestation","sign_citation":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC/action/citation_signature","submit_replication":"https://pith.science/pith/J5WAHI7S5TLT7QK25QA67FSBPC/action/replication_record"}},"created_at":"2026-05-18T00:44:37.370539+00:00","updated_at":"2026-05-18T00:44:37.370539+00:00"}