{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FBSC75MROO6UQYFH32FEQ5LX7C","short_pith_number":"pith:FBSC75MR","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"},"canonical_sha256":"28642ff59173bd4860a7de8a487577f8b42b7d2e506c90b0860c8ea5abcc1c9c","source":{"kind":"arxiv","id":"1903.01320","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01320","created_at":"2026-05-17T23:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01320v3","created_at":"2026-05-17T23:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01320","created_at":"2026-05-17T23:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"FBSC75MROO6U","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FBSC75MROO6UQYFH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FBSC75MR","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FBSC75MROO6UQYFH32FEQ5LX7C","target":"record","payload":{"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"},"canonical_sha256":"28642ff59173bd4860a7de8a487577f8b42b7d2e506c90b0860c8ea5abcc1c9c","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"},"source_kind":"arxiv","source_id":"1903.01320","source_version":3,"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-17T23:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBpglX4IyC0B2mKjYousCXFB/SsgYSwhS8E4h2FQ8/GgB/37A27EW8vGbGgU5wpN3T14ROnAt/JdGnkGsyKOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:52:14.240890Z"},"content_sha256":"8810d3572dd19df350cd6e4ee477cd3632b8ffb20f52652d4069622577c9e0c2","schema_version":"1.0","event_id":"sha256:8810d3572dd19df350cd6e4ee477cd3632b8ffb20f52652d4069622577c9e0c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FBSC75MROO6UQYFH32FEQ5LX7C","target":"graph","payload":{"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"},"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-17T23:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1+j0OcM0hrBoT2dDFpRLIMFXdLwXc8JdCmwq/JhEL/TiLl/zgUjWqei5X6db3XSXg2jsJxYqMYPbNw9UCD8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:52:14.241295Z"},"content_sha256":"c1478c2a733177e4579769da84a6874c45e56e0d279fb15ebf983573335a4a5f","schema_version":"1.0","event_id":"sha256:c1478c2a733177e4579769da84a6874c45e56e0d279fb15ebf983573335a4a5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/bundle.json","state_url":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBSC75MROO6UQYFH32FEQ5LX7C/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-28T16:52:14Z","links":{"resolver":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C","bundle":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/bundle.json","state":"https://pith.science/pith/FBSC75MROO6UQYFH32FEQ5LX7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBSC75MROO6UQYFH32FEQ5LX7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FBSC75MROO6UQYFH32FEQ5LX7C","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":"7e03e13f23c37fd2a8e39b385e62c300ec253dc9f6b0f50f039886c6f30ef56d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-04T16:06:27Z","title_canon_sha256":"e11dfe8225a8be01924d7ed71d65edbeadad231ea31ca2dd4d4a89e8e8c7aec3"},"schema_version":"1.0","source":{"id":"1903.01320","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01320","created_at":"2026-05-17T23:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01320v3","created_at":"2026-05-17T23:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01320","created_at":"2026-05-17T23:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"FBSC75MROO6U","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FBSC75MROO6UQYFH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FBSC75MR","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:c1478c2a733177e4579769da84a6874c45e56e0d279fb15ebf983573335a4a5f","target":"graph","created_at":"2026-05-17T23:43:36Z","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 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 ","authors_text":"Joachim Weickert, Leif Bergerhoff, Yehuda Dar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-04T16:06:27Z","title":"Algorithms for Piecewise Constant Signal Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01320","kind":"arxiv","version":3},"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:8810d3572dd19df350cd6e4ee477cd3632b8ffb20f52652d4069622577c9e0c2","target":"record","created_at":"2026-05-17T23:43:36Z","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":"7e03e13f23c37fd2a8e39b385e62c300ec253dc9f6b0f50f039886c6f30ef56d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-04T16:06:27Z","title_canon_sha256":"e11dfe8225a8be01924d7ed71d65edbeadad231ea31ca2dd4d4a89e8e8c7aec3"},"schema_version":"1.0","source":{"id":"1903.01320","kind":"arxiv","version":3}},"canonical_sha256":"28642ff59173bd4860a7de8a487577f8b42b7d2e506c90b0860c8ea5abcc1c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28642ff59173bd4860a7de8a487577f8b42b7d2e506c90b0860c8ea5abcc1c9c","first_computed_at":"2026-05-17T23:43:36.789470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:36.789470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GhewOOoR4QwqdbZp6RqGv0KPHv5J+phJNaHh0n8PJa7y8yAPTDZgvrc+1UohuWnbcIjJkiL2cPK117iqdHSxBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:36.789958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01320","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8810d3572dd19df350cd6e4ee477cd3632b8ffb20f52652d4069622577c9e0c2","sha256:c1478c2a733177e4579769da84a6874c45e56e0d279fb15ebf983573335a4a5f"],"state_sha256":"073d27bc2bfe8d651e6cf45ff2374ccc1beb7e3c4226302a856d81a71642ec65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvjrO/zKnH0dkLfF7tdmC5iG1DxiXYMlb0yMmU9F3m1wUuX9sGzjrT1WMOv7PDfctiHnE+U0CQq161sXFKK3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:52:14.244453Z","bundle_sha256":"7bf65c5d64d0c4ae353f5f38ed0d9f88476272be47561082e32f2da6272fe7ef"}}