{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FYPOODCDCFEGWGB55HKUHNC2TT","short_pith_number":"pith:FYPOODCD","canonical_record":{"source":{"id":"1006.0304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T06:11:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7b45726376aba3caaee88f9b0f90a7904d955d28fbdd5132d4eaa7e9e9a3c7a","abstract_canon_sha256":"ca385c67b48c29b66d4ddebde5a02a6672df5efb0f0d8b71f3c0d178219af824"},"schema_version":"1.0"},"canonical_sha256":"2e1ee70c4311486b183de9d543b45a9ce3e2144801e8b91c7363ce7574c8d7bd","source":{"kind":"arxiv","id":"1006.0304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0304","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0304v1","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0304","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"FYPOODCDCFEG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FYPOODCDCFEGWGB5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FYPOODCD","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FYPOODCDCFEGWGB55HKUHNC2TT","target":"record","payload":{"canonical_record":{"source":{"id":"1006.0304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T06:11:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7b45726376aba3caaee88f9b0f90a7904d955d28fbdd5132d4eaa7e9e9a3c7a","abstract_canon_sha256":"ca385c67b48c29b66d4ddebde5a02a6672df5efb0f0d8b71f3c0d178219af824"},"schema_version":"1.0"},"canonical_sha256":"2e1ee70c4311486b183de9d543b45a9ce3e2144801e8b91c7363ce7574c8d7bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:05.699572Z","signature_b64":"5WKr7ISYtSCZVrMAwRncE+ABWZOgrF4+Eq31ATrh+LVyczRPMrrrISIyylUnTmq1/Yn1os/0TBnODhGIGv47DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e1ee70c4311486b183de9d543b45a9ce3e2144801e8b91c7363ce7574c8d7bd","last_reissued_at":"2026-05-18T02:07:05.698846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:05.698846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.0304","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-18T02:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ji4fl1pMCQf/D6I7vX1SFkndneXJUSHc9NT0I4FK9CbsBRP0SbWR+Y7IcBXnSQvlWB4S0weRAyUasvmz/4BHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:46:10.221163Z"},"content_sha256":"8eb62ca17a0d1290cd53c4f39bdc340fa31ac4f16145313f7fcbc96f6b47c9c5","schema_version":"1.0","event_id":"sha256:8eb62ca17a0d1290cd53c4f39bdc340fa31ac4f16145313f7fcbc96f6b47c9c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FYPOODCDCFEGWGB55HKUHNC2TT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the stable recovery of the sparsest overcomplete representations in presence of noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Jutten, Massoud Babaie-Zadeh","submitted_at":"2010-06-02T06:11:16Z","abstract_excerpt":"Let x be a signal to be sparsely decomposed over a redundant dictionary A, i.e., a sparse coefficient vector s has to be found such that x=As. It is known that this problem is inherently unstable against noise, and to overcome this instability, the authors of [Stable Recovery; Donoho et.al., 2006] have proposed to use an \"approximate\" decomposition, that is, a decomposition satisfying ||x - A s|| < \\delta, rather than satisfying the exact equality x = As. Then, they have shown that if there is a decomposition with ||s||_0 < (1+M^{-1})/2, where M denotes the coherence of the dictionary, this de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0304","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-18T02:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qVNFYiqt2fmCQ5f18Rs+jKTXX83GT13BPlfl3pYHWssoEq7Tbu9frCErICqaPJ8O9YUMU+y2KsvcUcx5weKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:46:10.221981Z"},"content_sha256":"bab19a4dde38a40c940da17252c614b23631d546428d37b92638b94039715568","schema_version":"1.0","event_id":"sha256:bab19a4dde38a40c940da17252c614b23631d546428d37b92638b94039715568"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYPOODCDCFEGWGB55HKUHNC2TT/bundle.json","state_url":"https://pith.science/pith/FYPOODCDCFEGWGB55HKUHNC2TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYPOODCDCFEGWGB55HKUHNC2TT/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-11T06:46:10Z","links":{"resolver":"https://pith.science/pith/FYPOODCDCFEGWGB55HKUHNC2TT","bundle":"https://pith.science/pith/FYPOODCDCFEGWGB55HKUHNC2TT/bundle.json","state":"https://pith.science/pith/FYPOODCDCFEGWGB55HKUHNC2TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYPOODCDCFEGWGB55HKUHNC2TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FYPOODCDCFEGWGB55HKUHNC2TT","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":"ca385c67b48c29b66d4ddebde5a02a6672df5efb0f0d8b71f3c0d178219af824","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T06:11:16Z","title_canon_sha256":"a7b45726376aba3caaee88f9b0f90a7904d955d28fbdd5132d4eaa7e9e9a3c7a"},"schema_version":"1.0","source":{"id":"1006.0304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0304","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0304v1","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0304","created_at":"2026-05-18T02:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"FYPOODCDCFEG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FYPOODCDCFEGWGB5","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FYPOODCD","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:bab19a4dde38a40c940da17252c614b23631d546428d37b92638b94039715568","target":"graph","created_at":"2026-05-18T02:07:05Z","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":"Let x be a signal to be sparsely decomposed over a redundant dictionary A, i.e., a sparse coefficient vector s has to be found such that x=As. It is known that this problem is inherently unstable against noise, and to overcome this instability, the authors of [Stable Recovery; Donoho et.al., 2006] have proposed to use an \"approximate\" decomposition, that is, a decomposition satisfying ||x - A s|| < \\delta, rather than satisfying the exact equality x = As. Then, they have shown that if there is a decomposition with ||s||_0 < (1+M^{-1})/2, where M denotes the coherence of the dictionary, this de","authors_text":"Christian Jutten, Massoud Babaie-Zadeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T06:11:16Z","title":"On the stable recovery of the sparsest overcomplete representations in presence of noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0304","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:8eb62ca17a0d1290cd53c4f39bdc340fa31ac4f16145313f7fcbc96f6b47c9c5","target":"record","created_at":"2026-05-18T02:07:05Z","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":"ca385c67b48c29b66d4ddebde5a02a6672df5efb0f0d8b71f3c0d178219af824","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-02T06:11:16Z","title_canon_sha256":"a7b45726376aba3caaee88f9b0f90a7904d955d28fbdd5132d4eaa7e9e9a3c7a"},"schema_version":"1.0","source":{"id":"1006.0304","kind":"arxiv","version":1}},"canonical_sha256":"2e1ee70c4311486b183de9d543b45a9ce3e2144801e8b91c7363ce7574c8d7bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e1ee70c4311486b183de9d543b45a9ce3e2144801e8b91c7363ce7574c8d7bd","first_computed_at":"2026-05-18T02:07:05.698846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:05.698846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5WKr7ISYtSCZVrMAwRncE+ABWZOgrF4+Eq31ATrh+LVyczRPMrrrISIyylUnTmq1/Yn1os/0TBnODhGIGv47DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:05.699572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.0304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb62ca17a0d1290cd53c4f39bdc340fa31ac4f16145313f7fcbc96f6b47c9c5","sha256:bab19a4dde38a40c940da17252c614b23631d546428d37b92638b94039715568"],"state_sha256":"d50e7390a792c3dfba467413d90825d63630bccf093fa877f05cd844fd298614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34Qkff/DTGgZKEmlg1IO+Xj63IpvzVBnDhFJMtXwxL0DyTFp2sAKp35zmCKguMcEEkgfYma6n9EQfJc7CVRGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:46:10.225773Z","bundle_sha256":"fa3b4ea26616afffea00a5ebc40c2b93449807aa08d0d6512f485f4cb1a3bc01"}}