{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KIG6Y6WRJ2KZVZFCIZRWPGHNIJ","short_pith_number":"pith:KIG6Y6WR","canonical_record":{"source":{"id":"1806.08296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-21T15:39:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0a67720aa3ecd3901a8d0cf00520268b664c8f9c5e0fc5af3cbdd8383d77228b","abstract_canon_sha256":"0cacdf48c9d03065a6cb9cd9c01ff0b7cf5116439bcd4df4b172b9bd169031d4"},"schema_version":"1.0"},"canonical_sha256":"520dec7ad14e959ae4a246636798ed4240750de5d7d766d4b44bc35e2212199a","source":{"kind":"arxiv","id":"1806.08296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08296","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08296v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08296","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"KIG6Y6WRJ2KZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KIG6Y6WRJ2KZVZFC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KIG6Y6WR","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KIG6Y6WRJ2KZVZFCIZRWPGHNIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-21T15:39:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0a67720aa3ecd3901a8d0cf00520268b664c8f9c5e0fc5af3cbdd8383d77228b","abstract_canon_sha256":"0cacdf48c9d03065a6cb9cd9c01ff0b7cf5116439bcd4df4b172b9bd169031d4"},"schema_version":"1.0"},"canonical_sha256":"520dec7ad14e959ae4a246636798ed4240750de5d7d766d4b44bc35e2212199a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.468516Z","signature_b64":"Rkki+iJUfysKdXo81sXzBjsg2ur1FBDNiMQ2cXu0gWPbM54mmvZo1B2o6SnO8T1om4shKxrudQWFJzGBMpcVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"520dec7ad14e959ae4a246636798ed4240750de5d7d766d4b44bc35e2212199a","last_reissued_at":"2026-05-18T00:12:41.467506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.467506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08296","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XyrHCy2AYHn4UoJ41y8T+dhaSldA3CEG6QXol6qDycHMxU//0V3g0xfqksxjr6Cpey6H9iI87F1rgiAVz4I0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:42:22.317178Z"},"content_sha256":"cd521d5076549f95c0a0ab7c4053c94b5f3e6c150dd984024213f871a1618f88","schema_version":"1.0","event_id":"sha256:cd521d5076549f95c0a0ab7c4053c94b5f3e6c150dd984024213f871a1618f88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KIG6Y6WRJ2KZVZFCIZRWPGHNIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Are good local minima wide in sparse recovery?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Felix Krahmer, Juergen Gall, Michael Moeller, Otmar Loffeld","submitted_at":"2018-06-21T15:39:22Z","abstract_excerpt":"The idea of compressed sensing is to exploit representations in suitable (overcomplete) dictionaries that allow to recover signals far beyond the Nyquist rate provided that they admit a sparse representation in the respective dictionary. The latter gives rise to the sparse recovery problem of finding the best sparse linear approximation of given data in a given generating system. In this paper we analyze the iterative hard thresholding (IHT) algorithm as one of the most popular greedy methods for solving the sparse recovery problem, and demonstrate that systematically perturbing the IHT algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08296","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CytpcKQPX/G/6xf84K7v9c8BseU2oGaNChpRxMM2ei9RkfzhaM/rMweLi6umPIQF7i8u99TOWAo5Tzl37fHmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:42:22.317866Z"},"content_sha256":"f8be80f031ed4e8bc6ca226723fc9235361720332fa3662ca20ca28c14cbd6b5","schema_version":"1.0","event_id":"sha256:f8be80f031ed4e8bc6ca226723fc9235361720332fa3662ca20ca28c14cbd6b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ/bundle.json","state_url":"https://pith.science/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ/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-31T10:42:22Z","links":{"resolver":"https://pith.science/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ","bundle":"https://pith.science/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ/bundle.json","state":"https://pith.science/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIG6Y6WRJ2KZVZFCIZRWPGHNIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KIG6Y6WRJ2KZVZFCIZRWPGHNIJ","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":"0cacdf48c9d03065a6cb9cd9c01ff0b7cf5116439bcd4df4b172b9bd169031d4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-21T15:39:22Z","title_canon_sha256":"0a67720aa3ecd3901a8d0cf00520268b664c8f9c5e0fc5af3cbdd8383d77228b"},"schema_version":"1.0","source":{"id":"1806.08296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08296","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08296v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08296","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"KIG6Y6WRJ2KZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KIG6Y6WRJ2KZVZFC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KIG6Y6WR","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:f8be80f031ed4e8bc6ca226723fc9235361720332fa3662ca20ca28c14cbd6b5","target":"graph","created_at":"2026-05-18T00:12:41Z","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":"The idea of compressed sensing is to exploit representations in suitable (overcomplete) dictionaries that allow to recover signals far beyond the Nyquist rate provided that they admit a sparse representation in the respective dictionary. The latter gives rise to the sparse recovery problem of finding the best sparse linear approximation of given data in a given generating system. In this paper we analyze the iterative hard thresholding (IHT) algorithm as one of the most popular greedy methods for solving the sparse recovery problem, and demonstrate that systematically perturbing the IHT algori","authors_text":"Felix Krahmer, Juergen Gall, Michael Moeller, Otmar Loffeld","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-21T15:39:22Z","title":"Are good local minima wide in sparse recovery?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08296","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:cd521d5076549f95c0a0ab7c4053c94b5f3e6c150dd984024213f871a1618f88","target":"record","created_at":"2026-05-18T00:12:41Z","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":"0cacdf48c9d03065a6cb9cd9c01ff0b7cf5116439bcd4df4b172b9bd169031d4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-21T15:39:22Z","title_canon_sha256":"0a67720aa3ecd3901a8d0cf00520268b664c8f9c5e0fc5af3cbdd8383d77228b"},"schema_version":"1.0","source":{"id":"1806.08296","kind":"arxiv","version":1}},"canonical_sha256":"520dec7ad14e959ae4a246636798ed4240750de5d7d766d4b44bc35e2212199a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"520dec7ad14e959ae4a246636798ed4240750de5d7d766d4b44bc35e2212199a","first_computed_at":"2026-05-18T00:12:41.467506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.467506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rkki+iJUfysKdXo81sXzBjsg2ur1FBDNiMQ2cXu0gWPbM54mmvZo1B2o6SnO8T1om4shKxrudQWFJzGBMpcVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.468516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd521d5076549f95c0a0ab7c4053c94b5f3e6c150dd984024213f871a1618f88","sha256:f8be80f031ed4e8bc6ca226723fc9235361720332fa3662ca20ca28c14cbd6b5"],"state_sha256":"d8df2efb7b8288f1cdedb70ad51d647ff62727bc476e16ff2df53c252c3cd596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3PgJJYO/V+oUbLUFu8RlmmoIkAfS6I16ToKM0ZBwljHjNAX98kc/WFfhyib/XeErO8g6CcxxkUjEiFUK/pGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:42:22.321698Z","bundle_sha256":"d9c567e0229d44c7cf3721b99d1e1abccd81c0049e0b6a433f9a77ba3e6504af"}}