{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FBSC75MROO6UQYFH32FEQ5LX7C","short_pith_number":"pith:FBSC75MR","schema_version":"1.0","canonical_sha256":"28642ff59173bd4860a7de8a487577f8b42b7d2e506c90b0860c8ea5abcc1c9c","source":{"kind":"arxiv","id":"1903.01320","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for Piecewise Constant Signal Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Joachim Weickert, Leif Bergerhoff, Yehuda Dar","submitted_at":"2019-03-04T16:06:27Z","abstract_excerpt":"We consider the problem of finding optimal piecewise constant approximations of one-dimensional signals. These approximations should consist of a specified number of segments (samples) and minimise the mean squared error to the original signal. We formalise this goal as a discrete nonconvex optimisation problem, for which we study two algorithms. First we reformulate a recent adaptive sampling method by Dar and Bruckstein in a compact and transparent way. This allows us to analyse its limitations when it comes to violations of its three key assumptions: signal smoothness, local linearity, and "},"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":"1903.01320","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-04T16:06:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e11dfe8225a8be01924d7ed71d65edbeadad231ea31ca2dd4d4a89e8e8c7aec3","abstract_canon_sha256":"7e03e13f23c37fd2a8e39b385e62c300ec253dc9f6b0f50f039886c6f30ef56d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:36.789958Z","signature_b64":"GhewOOoR4QwqdbZp6RqGv0KPHv5J+phJNaHh0n8PJa7y8yAPTDZgvrc+1UohuWnbcIjJkiL2cPK117iqdHSxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28642ff59173bd4860a7de8a487577f8b42b7d2e506c90b0860c8ea5abcc1c9c","last_reissued_at":"2026-05-17T23:43:36.789470Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:36.789470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Piecewise Constant Signal Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Joachim Weickert, Leif Bergerhoff, Yehuda Dar","submitted_at":"2019-03-04T16:06:27Z","abstract_excerpt":"We consider the problem of finding optimal piecewise constant approximations of one-dimensional signals. These approximations should consist of a specified number of segments (samples) and minimise the mean squared error to the original signal. We formalise this goal as a discrete nonconvex optimisation problem, for which we study two algorithms. First we reformulate a recent adaptive sampling method by Dar and Bruckstein in a compact and transparent way. This allows us to analyse its limitations when it comes to violations of its three key assumptions: signal smoothness, local linearity, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01320","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":"1903.01320","created_at":"2026-05-17T23:43:36.789555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01320v3","created_at":"2026-05-17T23:43:36.789555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01320","created_at":"2026-05-17T23:43:36.789555+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBSC75MROO6U","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBSC75MROO6UQYFH","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBSC75MR","created_at":"2026-05-18T12:33:15.570797+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/FBSC75MROO6UQYFH32FEQ5LX7C","json":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C.json","graph_json":"https://pith.science/api/pith-number/FBSC75MROO6UQYFH32FEQ5LX7C/graph.json","events_json":"https://pith.science/api/pith-number/FBSC75MROO6UQYFH32FEQ5LX7C/events.json","paper":"https://pith.science/paper/FBSC75MR"},"agent_actions":{"view_html":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C","download_json":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C.json","view_paper":"https://pith.science/paper/FBSC75MR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01320&json=true","fetch_graph":"https://pith.science/api/pith-number/FBSC75MROO6UQYFH32FEQ5LX7C/graph.json","fetch_events":"https://pith.science/api/pith-number/FBSC75MROO6UQYFH32FEQ5LX7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/action/storage_attestation","attest_author":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/action/author_attestation","sign_citation":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/action/citation_signature","submit_replication":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/action/replication_record"}},"created_at":"2026-05-17T23:43:36.789555+00:00","updated_at":"2026-05-17T23:43:36.789555+00:00"}