{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZUEWIOXFUNC45CJVJXNDRARSIK","short_pith_number":"pith:ZUEWIOXF","canonical_record":{"source":{"id":"1705.06879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T07:38:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ecb404a8317b92ac450f07639db8b0393e4cbae42ecf65aa490882101da22220","abstract_canon_sha256":"5b3e9933c908455cc5a41a225347a624df1f0e27106dcbf6bb0c0f5646e71312"},"schema_version":"1.0"},"canonical_sha256":"cd09643ae5a345ce89354dda388232429764a8e4bc5d21ea7031e85109075bb1","source":{"kind":"arxiv","id":"1705.06879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06879","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06879v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06879","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZUEWIOXFUNC4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUEWIOXFUNC45CJV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUEWIOXF","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZUEWIOXFUNC45CJVJXNDRARSIK","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T07:38:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ecb404a8317b92ac450f07639db8b0393e4cbae42ecf65aa490882101da22220","abstract_canon_sha256":"5b3e9933c908455cc5a41a225347a624df1f0e27106dcbf6bb0c0f5646e71312"},"schema_version":"1.0"},"canonical_sha256":"cd09643ae5a345ce89354dda388232429764a8e4bc5d21ea7031e85109075bb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.078613Z","signature_b64":"HhsqWd/b4j893U8DXjXyxRSC4eOuIL5Xpnru/5GHiEjD4CcmjKJae8Ahvj5LwLAzlRyVlAiBhLoVk/VJnAlhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd09643ae5a345ce89354dda388232429764a8e4bc5d21ea7031e85109075bb1","last_reissued_at":"2026-05-18T00:44:11.078178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.078178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06879","source_version":1,"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-18T00:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81Yq+x/v1vu6349cdK3PkjiGFe35qVvO5U/06Vc+FEDHFMHUmuVdNotEbhV9ojPJDcjRavg3WjWF0oN+OCT+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:31:55.404174Z"},"content_sha256":"1fecf86a44998ddf9c8ac880b393a3c3462692098277828a50b6a84a70ca9f4a","schema_version":"1.0","event_id":"sha256:1fecf86a44998ddf9c8ac880b393a3c3462692098277828a50b6a84a70ca9f4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZUEWIOXFUNC45CJVJXNDRARSIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Iterative Algorithms for (Discrete) Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Robert F.H. Fischer, Susanne Sparrer","submitted_at":"2017-05-19T07:38:13Z","abstract_excerpt":"We consider iterative (`turbo') algorithms for compressed sensing. First, a unified exposition of the different approaches available in the literature is given, thereby enlightening the general principles and main differences. In particular we discuss i) the estimation step (matched filter vs. optimum MMSE estimator), ii) the unbiasing operation (implicitly or explicitly done and equivalent to the calculation of extrinsic information), and iii) thresholding vs. the calculation of soft values. Based on these insights we propose a low-complexity but well-performing variant utilizing a Krylov spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06879","kind":"arxiv","version":1},"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-18T00:44:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nx/vgQ5UvjU2nUzgBrkPinAKIO1uAXB/37bGr3xg2Q/mZcEoj5KIax4KvJRw4R6mnX0HE2TBCgowXygUrX/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:31:55.404783Z"},"content_sha256":"8524ea21d3eed0da058dfd1b3ddbc73fe6d8d3be04050ac9f74a49e2369278a2","schema_version":"1.0","event_id":"sha256:8524ea21d3eed0da058dfd1b3ddbc73fe6d8d3be04050ac9f74a49e2369278a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUEWIOXFUNC45CJVJXNDRARSIK/bundle.json","state_url":"https://pith.science/pith/ZUEWIOXFUNC45CJVJXNDRARSIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUEWIOXFUNC45CJVJXNDRARSIK/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-06-04T19:31:55Z","links":{"resolver":"https://pith.science/pith/ZUEWIOXFUNC45CJVJXNDRARSIK","bundle":"https://pith.science/pith/ZUEWIOXFUNC45CJVJXNDRARSIK/bundle.json","state":"https://pith.science/pith/ZUEWIOXFUNC45CJVJXNDRARSIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUEWIOXFUNC45CJVJXNDRARSIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZUEWIOXFUNC45CJVJXNDRARSIK","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":"5b3e9933c908455cc5a41a225347a624df1f0e27106dcbf6bb0c0f5646e71312","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T07:38:13Z","title_canon_sha256":"ecb404a8317b92ac450f07639db8b0393e4cbae42ecf65aa490882101da22220"},"schema_version":"1.0","source":{"id":"1705.06879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06879","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06879v1","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06879","created_at":"2026-05-18T00:44:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZUEWIOXFUNC4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUEWIOXFUNC45CJV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUEWIOXF","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:8524ea21d3eed0da058dfd1b3ddbc73fe6d8d3be04050ac9f74a49e2369278a2","target":"graph","created_at":"2026-05-18T00:44:11Z","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 iterative (`turbo') algorithms for compressed sensing. First, a unified exposition of the different approaches available in the literature is given, thereby enlightening the general principles and main differences. In particular we discuss i) the estimation step (matched filter vs. optimum MMSE estimator), ii) the unbiasing operation (implicitly or explicitly done and equivalent to the calculation of extrinsic information), and iii) thresholding vs. the calculation of soft values. Based on these insights we propose a low-complexity but well-performing variant utilizing a Krylov spa","authors_text":"Robert F.H. Fischer, Susanne Sparrer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T07:38:13Z","title":"Low-Complexity Iterative Algorithms for (Discrete) Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06879","kind":"arxiv","version":1},"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:1fecf86a44998ddf9c8ac880b393a3c3462692098277828a50b6a84a70ca9f4a","target":"record","created_at":"2026-05-18T00:44:11Z","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":"5b3e9933c908455cc5a41a225347a624df1f0e27106dcbf6bb0c0f5646e71312","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T07:38:13Z","title_canon_sha256":"ecb404a8317b92ac450f07639db8b0393e4cbae42ecf65aa490882101da22220"},"schema_version":"1.0","source":{"id":"1705.06879","kind":"arxiv","version":1}},"canonical_sha256":"cd09643ae5a345ce89354dda388232429764a8e4bc5d21ea7031e85109075bb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd09643ae5a345ce89354dda388232429764a8e4bc5d21ea7031e85109075bb1","first_computed_at":"2026-05-18T00:44:11.078178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:11.078178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HhsqWd/b4j893U8DXjXyxRSC4eOuIL5Xpnru/5GHiEjD4CcmjKJae8Ahvj5LwLAzlRyVlAiBhLoVk/VJnAlhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:11.078613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fecf86a44998ddf9c8ac880b393a3c3462692098277828a50b6a84a70ca9f4a","sha256:8524ea21d3eed0da058dfd1b3ddbc73fe6d8d3be04050ac9f74a49e2369278a2"],"state_sha256":"c005e5e8d8a9de6859380b5d976029566070682bea150c59bdd8ae55f03048e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtA9o+1D+2+PdqWmDJSghUzkhD9UPPObRhJcrOY4+2PNOsF2wLCvWYC5PbzB3jRkDI7KEJEdXxj6n4/D4tS4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:31:55.407893Z","bundle_sha256":"691d334551ea6bee53daf91b3d150fe8f4e3471aed43a2a73937f63458ec6af2"}}