{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CQRQE5PKYPKCJGRT4FWOPD3QOC","short_pith_number":"pith:CQRQE5PK","canonical_record":{"source":{"id":"1308.5000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T21:42:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9660f998d10d7a5872ea250c802d91fb73c5750cc361732b2724d0c56107e0cf","abstract_canon_sha256":"2ca2529004832101b566e29f675d92a3ddfd2f39c699b29443f1bf31710c3424"},"schema_version":"1.0"},"canonical_sha256":"14230275eac3d4249a33e16ce78f707088ae0250881386df5c3b3b899fec6790","source":{"kind":"arxiv","id":"1308.5000","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5000","created_at":"2026-05-18T01:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5000v2","created_at":"2026-05-18T01:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5000","created_at":"2026-05-18T01:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"CQRQE5PKYPKC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CQRQE5PKYPKCJGRT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CQRQE5PK","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CQRQE5PKYPKCJGRT4FWOPD3QOC","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T21:42:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9660f998d10d7a5872ea250c802d91fb73c5750cc361732b2724d0c56107e0cf","abstract_canon_sha256":"2ca2529004832101b566e29f675d92a3ddfd2f39c699b29443f1bf31710c3424"},"schema_version":"1.0"},"canonical_sha256":"14230275eac3d4249a33e16ce78f707088ae0250881386df5c3b3b899fec6790","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:59.398850Z","signature_b64":"s5yB1gbl1I1GTxze0c4M8H4Po5V/YxOhOJjqOBI3eK97dzFwOm1iN01QgzuSs2TceRod/ARnD2l4mucoOncwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14230275eac3d4249a33e16ce78f707088ae0250881386df5c3b3b899fec6790","last_reissued_at":"2026-05-18T01:47:59.398145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:59.398145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5000","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-18T01:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9cF0Lwt4HslNOlJf+GCBxBL5orX5FSJ7xXVrt6a7KeTw1skVz9cT1h4QgvRfm6OGd6kvTSmfymDw0a3kHJDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:13:01.101935Z"},"content_sha256":"0a04d91662e2eb5053509ea2c2173520905a012dd5c80c4801f97ca5bb473018","schema_version":"1.0","event_id":"sha256:0a04d91662e2eb5053509ea2c2173520905a012dd5c80c4801f97ca5bb473018"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CQRQE5PKYPKCJGRT4FWOPD3QOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothing and Decomposition for Analysis Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Amir Beck, Arye Nehorai, Yonina C. Eldar, Zhao Tan","submitted_at":"2013-08-22T21:42:08Z","abstract_excerpt":"We consider algorithms and recovery guarantees for the analysis sparse model in which the signal is sparse with respect to a highly coherent frame. We consider the use of a monotone version of the fast iterative shrinkage- thresholding algorithm (MFISTA) to solve the analysis sparse recovery problem. Since the proximal operator in MFISTA does not have a closed-form solution for the analysis model, it cannot be applied directly. Instead, we examine two alternatives based on smoothing and decomposition transformations that relax the original sparse recovery problem, and then implement MFISTA on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5000","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-18T01:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCfMlYgba5HyTwad7OXUDL3WY/3MljTZM/Cyqm2370PJ62Xn2m0kYdreRwi4cRjc4Cf1uWw1qeittP09ubKoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:13:01.102280Z"},"content_sha256":"7761ea0e91087f1831bf4762311c2b07b9a19391e6a342f6f3080e056fc31510","schema_version":"1.0","event_id":"sha256:7761ea0e91087f1831bf4762311c2b07b9a19391e6a342f6f3080e056fc31510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC/bundle.json","state_url":"https://pith.science/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC/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-03T20:13:01Z","links":{"resolver":"https://pith.science/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC","bundle":"https://pith.science/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC/bundle.json","state":"https://pith.science/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQRQE5PKYPKCJGRT4FWOPD3QOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CQRQE5PKYPKCJGRT4FWOPD3QOC","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":"2ca2529004832101b566e29f675d92a3ddfd2f39c699b29443f1bf31710c3424","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T21:42:08Z","title_canon_sha256":"9660f998d10d7a5872ea250c802d91fb73c5750cc361732b2724d0c56107e0cf"},"schema_version":"1.0","source":{"id":"1308.5000","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5000","created_at":"2026-05-18T01:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5000v2","created_at":"2026-05-18T01:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5000","created_at":"2026-05-18T01:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"CQRQE5PKYPKC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CQRQE5PKYPKCJGRT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CQRQE5PK","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:7761ea0e91087f1831bf4762311c2b07b9a19391e6a342f6f3080e056fc31510","target":"graph","created_at":"2026-05-18T01:47:59Z","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 algorithms and recovery guarantees for the analysis sparse model in which the signal is sparse with respect to a highly coherent frame. We consider the use of a monotone version of the fast iterative shrinkage- thresholding algorithm (MFISTA) to solve the analysis sparse recovery problem. Since the proximal operator in MFISTA does not have a closed-form solution for the analysis model, it cannot be applied directly. Instead, we examine two alternatives based on smoothing and decomposition transformations that relax the original sparse recovery problem, and then implement MFISTA on ","authors_text":"Amir Beck, Arye Nehorai, Yonina C. Eldar, Zhao Tan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T21:42:08Z","title":"Smoothing and Decomposition for Analysis Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5000","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:0a04d91662e2eb5053509ea2c2173520905a012dd5c80c4801f97ca5bb473018","target":"record","created_at":"2026-05-18T01:47:59Z","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":"2ca2529004832101b566e29f675d92a3ddfd2f39c699b29443f1bf31710c3424","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-22T21:42:08Z","title_canon_sha256":"9660f998d10d7a5872ea250c802d91fb73c5750cc361732b2724d0c56107e0cf"},"schema_version":"1.0","source":{"id":"1308.5000","kind":"arxiv","version":2}},"canonical_sha256":"14230275eac3d4249a33e16ce78f707088ae0250881386df5c3b3b899fec6790","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14230275eac3d4249a33e16ce78f707088ae0250881386df5c3b3b899fec6790","first_computed_at":"2026-05-18T01:47:59.398145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:47:59.398145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5yB1gbl1I1GTxze0c4M8H4Po5V/YxOhOJjqOBI3eK97dzFwOm1iN01QgzuSs2TceRod/ARnD2l4mucoOncwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:47:59.398850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5000","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a04d91662e2eb5053509ea2c2173520905a012dd5c80c4801f97ca5bb473018","sha256:7761ea0e91087f1831bf4762311c2b07b9a19391e6a342f6f3080e056fc31510"],"state_sha256":"df71d4a1dbf3910407e914bb4fecf89799176682505a2527261a80fa33e7564f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdxrKnLwldXBx9VaOfVQYxpYRblci8y4/C8qOFPeWntHzWMFmZBSAMc4EMllRTc+TDnEE8JfSPXGyusZ2/7IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:13:01.104227Z","bundle_sha256":"b200f4018d30faf17469b378cbd09e623a58546ecde7dac24bb9b2f08f60d88f"}}