{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z2JH7ACGSN7ZNVTVF6XXGIJOYS","short_pith_number":"pith:Z2JH7ACG","canonical_record":{"source":{"id":"1203.2769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-13T11:18:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dfaa9a27f0ab0006f6b6a5be93c827594b9d214710f328e6046375040e95166a","abstract_canon_sha256":"5e7e1bad372ad0d106323ef3506070a345bde7078f30cd33b3eb4118b230993c"},"schema_version":"1.0"},"canonical_sha256":"ce927f8046937f96d6752faf73212ec4bad04b28904551bdb6206764ff9910fe","source":{"kind":"arxiv","id":"1203.2769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2769","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2769v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2769","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"Z2JH7ACGSN7Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z2JH7ACGSN7ZNVTV","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z2JH7ACG","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z2JH7ACGSN7ZNVTVF6XXGIJOYS","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-13T11:18:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dfaa9a27f0ab0006f6b6a5be93c827594b9d214710f328e6046375040e95166a","abstract_canon_sha256":"5e7e1bad372ad0d106323ef3506070a345bde7078f30cd33b3eb4118b230993c"},"schema_version":"1.0"},"canonical_sha256":"ce927f8046937f96d6752faf73212ec4bad04b28904551bdb6206764ff9910fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.656302Z","signature_b64":"4/Vprri64uomCYR7zUNt9I2/bXHzN2G7Fckl0rXTSXqTlXzonFgtl+d3qxfy/r3aYfOnGKWjZsOymq5andzeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce927f8046937f96d6752faf73212ec4bad04b28904551bdb6206764ff9910fe","last_reissued_at":"2026-05-18T04:00:14.655575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.655575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2769","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlxDSrdVWr8VVi6GEeqySUbEd7LHX0AWZh+k6mpf5S+m0b+wxYNrRo/9FfWnP9H23ip7Hcgtalsb51JfXxPwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:25:36.544637Z"},"content_sha256":"324fa04052b935419672571e3995649387aa9508566f4874d2151fd8bd9b0ade","schema_version":"1.0","event_id":"sha256:324fa04052b935419672571e3995649387aa9508566f4874d2151fd8bd9b0ade"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z2JH7ACGSN7ZNVTVF6XXGIJOYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Guarantees of the Thresholding Algorithm for the Co-Sparse Analysis Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael Elad, Tomer Peleg","submitted_at":"2012-03-13T11:18:28Z","abstract_excerpt":"The co-sparse analysis model for signals assumes that the signal of interest can be multiplied by an analysis dictionary \\Omega, leading to a sparse outcome. This model stands as an interesting alternative to the more classical synthesis based sparse representation model. In this work we propose a theoretical study of the performance guarantee of the thresholding algorithm for the pursuit problem in the presence of noise. Our analysis reveals two significant properties of \\Omega, which govern the pursuit performance: The first is the degree of linear dependencies between sets of rows in \\Omega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2769","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/HPohXpM47E2UQbAf0VdVvYewiLrwdvRRaZPaoWHjW3xd5GiW2mYxwB9N6FbZxYfUpqdiscOe94smv/AaJnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:25:36.545304Z"},"content_sha256":"e45657c8627d18d6b4ae70a7f030243bf3db390619927fa7c741fa5b5506a839","schema_version":"1.0","event_id":"sha256:e45657c8627d18d6b4ae70a7f030243bf3db390619927fa7c741fa5b5506a839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS/bundle.json","state_url":"https://pith.science/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS/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-27T09:25:36Z","links":{"resolver":"https://pith.science/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS","bundle":"https://pith.science/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS/bundle.json","state":"https://pith.science/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2JH7ACGSN7ZNVTVF6XXGIJOYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z2JH7ACGSN7ZNVTVF6XXGIJOYS","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":"5e7e1bad372ad0d106323ef3506070a345bde7078f30cd33b3eb4118b230993c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-13T11:18:28Z","title_canon_sha256":"dfaa9a27f0ab0006f6b6a5be93c827594b9d214710f328e6046375040e95166a"},"schema_version":"1.0","source":{"id":"1203.2769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2769","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2769v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2769","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"Z2JH7ACGSN7Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z2JH7ACGSN7ZNVTV","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z2JH7ACG","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:e45657c8627d18d6b4ae70a7f030243bf3db390619927fa7c741fa5b5506a839","target":"graph","created_at":"2026-05-18T04:00:14Z","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 co-sparse analysis model for signals assumes that the signal of interest can be multiplied by an analysis dictionary \\Omega, leading to a sparse outcome. This model stands as an interesting alternative to the more classical synthesis based sparse representation model. In this work we propose a theoretical study of the performance guarantee of the thresholding algorithm for the pursuit problem in the presence of noise. Our analysis reveals two significant properties of \\Omega, which govern the pursuit performance: The first is the degree of linear dependencies between sets of rows in \\Omega","authors_text":"Michael Elad, Tomer Peleg","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-13T11:18:28Z","title":"Performance Guarantees of the Thresholding Algorithm for the Co-Sparse Analysis Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2769","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:324fa04052b935419672571e3995649387aa9508566f4874d2151fd8bd9b0ade","target":"record","created_at":"2026-05-18T04:00:14Z","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":"5e7e1bad372ad0d106323ef3506070a345bde7078f30cd33b3eb4118b230993c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-13T11:18:28Z","title_canon_sha256":"dfaa9a27f0ab0006f6b6a5be93c827594b9d214710f328e6046375040e95166a"},"schema_version":"1.0","source":{"id":"1203.2769","kind":"arxiv","version":1}},"canonical_sha256":"ce927f8046937f96d6752faf73212ec4bad04b28904551bdb6206764ff9910fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce927f8046937f96d6752faf73212ec4bad04b28904551bdb6206764ff9910fe","first_computed_at":"2026-05-18T04:00:14.655575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.655575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/Vprri64uomCYR7zUNt9I2/bXHzN2G7Fckl0rXTSXqTlXzonFgtl+d3qxfy/r3aYfOnGKWjZsOymq5andzeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.656302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:324fa04052b935419672571e3995649387aa9508566f4874d2151fd8bd9b0ade","sha256:e45657c8627d18d6b4ae70a7f030243bf3db390619927fa7c741fa5b5506a839"],"state_sha256":"7472515532c4e37ff367f693fc3c548b4a7216d4d4798fca788fa92c0cd589c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXdb4K3jElvSKNCiaDoPHjEGKE8RcqHuXukP7drJ/9WkvP0bF3fTA6NPIJyt7pfXQKMUVPFPG/akRcgK8YOYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:25:36.549011Z","bundle_sha256":"20e2b1c58b80e1359d5414548f883e89da0050369b5c5b36a290be2fd096ff28"}}