{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5NUOWQ6HOCH5RU2TFJSY56SIZP","short_pith_number":"pith:5NUOWQ6H","canonical_record":{"source":{"id":"1311.5989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-23T11:29:06Z","cross_cats_sorted":["cs.DS","math.IT","stat.AP"],"title_canon_sha256":"a06d67833ae2910beef3618583a64d1fe627fd6fe7a5d62f8dbac0f74f2efc15","abstract_canon_sha256":"909c9b9cb1da080c755a9f79f8a99ba599542aa5007c58da373815d419ab59d4"},"schema_version":"1.0"},"canonical_sha256":"eb68eb43c7708fd8d3532a658efa48cbf0da95a318ebedc46966353650f54f14","source":{"kind":"arxiv","id":"1311.5989","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5989","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5989v2","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5989","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"5NUOWQ6HOCH5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5NUOWQ6HOCH5RU2T","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5NUOWQ6H","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5NUOWQ6HOCH5RU2TFJSY56SIZP","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-23T11:29:06Z","cross_cats_sorted":["cs.DS","math.IT","stat.AP"],"title_canon_sha256":"a06d67833ae2910beef3618583a64d1fe627fd6fe7a5d62f8dbac0f74f2efc15","abstract_canon_sha256":"909c9b9cb1da080c755a9f79f8a99ba599542aa5007c58da373815d419ab59d4"},"schema_version":"1.0"},"canonical_sha256":"eb68eb43c7708fd8d3532a658efa48cbf0da95a318ebedc46966353650f54f14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:47.490563Z","signature_b64":"SAFP80eGHGIY96RQDPFBM7U1kKTsbXAUpbnSmHqg8PR863LGaDjMyAZF3xXUBnatXB+8LBWhp10L6bJyb029Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb68eb43c7708fd8d3532a658efa48cbf0da95a318ebedc46966353650f54f14","last_reissued_at":"2026-05-18T02:59:47.489692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:47.489692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5989","source_version":2,"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-18T02:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/SOiKGmElHK4M4uz8stIrzghwou+v+3pT/Z1HJpv36b5jxvMfLHzPYpe7zq/xi10VTLX1rFadcXiB7G/UeVVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:38:25.004833Z"},"content_sha256":"c0f48785f81d8988f9bfadb57386d12a875ced2692f2714f4d80d238451f16a2","schema_version":"1.0","event_id":"sha256:c0f48785f81d8988f9bfadb57386d12a875ced2692f2714f4d80d238451f16a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5NUOWQ6HOCH5RU2TFJSY56SIZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Cosparse Greedy Signal Reconstruction for Compressive Sensing with Multiplicative and Additive Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Sabine Van Huffel, Yipeng Liu, Yurrit Avonds","submitted_at":"2013-11-23T11:29:06Z","abstract_excerpt":"Greedy algorithms are popular in compressive sensing for their high computational efficiency. But the performance of current greedy algorithms can be degenerated seriously by noise (both multiplicative noise and additive noise). A robust version of greedy cosparse greedy algorithm (greedy analysis pursuit) is presented in this paper. Comparing with previous methods, The proposed robust greedy analysis pursuit algorithm is based on an optimization model which allows both multiplicative noise and additive noise in the data fitting constraint. Besides, a new stopping criterion that is derived. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5989","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"},"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-18T02:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqqsOtHXnoEETCyG5WcXJiILd831anuZ/naMhE++uPrL69aMKVufyIDdLmLeX70EfygPkJ5iZXw5rJ4P4E1WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:38:25.005183Z"},"content_sha256":"c2f1572d7a95da9723ffcdcf1a182e983a25facaf6903761c1da64e25bddc1d1","schema_version":"1.0","event_id":"sha256:c2f1572d7a95da9723ffcdcf1a182e983a25facaf6903761c1da64e25bddc1d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP/bundle.json","state_url":"https://pith.science/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP/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-27T16:38:25Z","links":{"resolver":"https://pith.science/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP","bundle":"https://pith.science/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP/bundle.json","state":"https://pith.science/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NUOWQ6HOCH5RU2TFJSY56SIZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5NUOWQ6HOCH5RU2TFJSY56SIZP","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":"909c9b9cb1da080c755a9f79f8a99ba599542aa5007c58da373815d419ab59d4","cross_cats_sorted":["cs.DS","math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-23T11:29:06Z","title_canon_sha256":"a06d67833ae2910beef3618583a64d1fe627fd6fe7a5d62f8dbac0f74f2efc15"},"schema_version":"1.0","source":{"id":"1311.5989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5989","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5989v2","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5989","created_at":"2026-05-18T02:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"5NUOWQ6HOCH5","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5NUOWQ6HOCH5RU2T","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5NUOWQ6H","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:c2f1572d7a95da9723ffcdcf1a182e983a25facaf6903761c1da64e25bddc1d1","target":"graph","created_at":"2026-05-18T02:59:47Z","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":"Greedy algorithms are popular in compressive sensing for their high computational efficiency. But the performance of current greedy algorithms can be degenerated seriously by noise (both multiplicative noise and additive noise). A robust version of greedy cosparse greedy algorithm (greedy analysis pursuit) is presented in this paper. Comparing with previous methods, The proposed robust greedy analysis pursuit algorithm is based on an optimization model which allows both multiplicative noise and additive noise in the data fitting constraint. Besides, a new stopping criterion that is derived. Th","authors_text":"Sabine Van Huffel, Yipeng Liu, Yurrit Avonds","cross_cats":["cs.DS","math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-23T11:29:06Z","title":"Robust Cosparse Greedy Signal Reconstruction for Compressive Sensing with Multiplicative and Additive Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5989","kind":"arxiv","version":2},"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:c0f48785f81d8988f9bfadb57386d12a875ced2692f2714f4d80d238451f16a2","target":"record","created_at":"2026-05-18T02:59:47Z","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":"909c9b9cb1da080c755a9f79f8a99ba599542aa5007c58da373815d419ab59d4","cross_cats_sorted":["cs.DS","math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-23T11:29:06Z","title_canon_sha256":"a06d67833ae2910beef3618583a64d1fe627fd6fe7a5d62f8dbac0f74f2efc15"},"schema_version":"1.0","source":{"id":"1311.5989","kind":"arxiv","version":2}},"canonical_sha256":"eb68eb43c7708fd8d3532a658efa48cbf0da95a318ebedc46966353650f54f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb68eb43c7708fd8d3532a658efa48cbf0da95a318ebedc46966353650f54f14","first_computed_at":"2026-05-18T02:59:47.489692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:47.489692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SAFP80eGHGIY96RQDPFBM7U1kKTsbXAUpbnSmHqg8PR863LGaDjMyAZF3xXUBnatXB+8LBWhp10L6bJyb029Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:47.490563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0f48785f81d8988f9bfadb57386d12a875ced2692f2714f4d80d238451f16a2","sha256:c2f1572d7a95da9723ffcdcf1a182e983a25facaf6903761c1da64e25bddc1d1"],"state_sha256":"c79338a0b285ec8666e3d0b2ad5ea49d8c25adff124e037261ac837e9061a87a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EECZyD3Cb4J81kUdP2+J7n6EBUj27J8n6nuS6/IYLfas4NwiyHSIFeYAsBtqTxVNLSHdKduW7lTQS8KS8FrpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:38:25.007188Z","bundle_sha256":"577cfa67e1011f9d8dcafd98cd77f0998ea1e9387dbf7059f992cd9af39c3b00"}}