{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AHV3UASFFBUZ5F6DL3UWCCZMXE","short_pith_number":"pith:AHV3UASF","canonical_record":{"source":{"id":"1104.0654","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T19:14:03Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"95874f31446eea220122f099476fa490a7ae37197d2bb874873f26d3320d559a","abstract_canon_sha256":"5964175a7411c53e827610bf569ba1b757b5d6ad3ef9ec79d935ab287d8a4f11"},"schema_version":"1.0"},"canonical_sha256":"01ebba024528699e97c35ee9610b2cb928653405fc7527bacbddb28addf8baee","source":{"kind":"arxiv","id":"1104.0654","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0654","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0654v3","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0654","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"AHV3UASFFBUZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHV3UASFFBUZ5F6D","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHV3UASF","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AHV3UASFFBUZ5F6DL3UWCCZMXE","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0654","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T19:14:03Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"95874f31446eea220122f099476fa490a7ae37197d2bb874873f26d3320d559a","abstract_canon_sha256":"5964175a7411c53e827610bf569ba1b757b5d6ad3ef9ec79d935ab287d8a4f11"},"schema_version":"1.0"},"canonical_sha256":"01ebba024528699e97c35ee9610b2cb928653405fc7527bacbddb28addf8baee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:38.285342Z","signature_b64":"FsVolgz3N78qvUicPC6Fhb+szQixKm089UzOBLdqphb95txS1eCDfzybm8Pz8fONTw1n7udIY15+se7roSS7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ebba024528699e97c35ee9610b2cb928653405fc7527bacbddb28addf8baee","last_reissued_at":"2026-05-18T02:02:38.284654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:38.284654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0654","source_version":3,"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:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFVRr6+MmkA/4FbwtdZZycb1Td7q0X6uxcJ8q2lHX8SLsC3wXN8fONzkNhMbmEUOHFV3MhNyGyRfAz3bljyJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T17:29:33.270033Z"},"content_sha256":"91498bdeb47e7183b9f9b94c34c5665861bcd275016caa0c6701707d98057494","schema_version":"1.0","event_id":"sha256:91498bdeb47e7183b9f9b94c34c5665861bcd275016caa0c6701707d98057494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AHV3UASFFBUZ5F6DL3UWCCZMXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block-Sparse Recovery via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Ehsan Elhamifar, Rene Vidal","submitted_at":"2011-04-04T19:14:03Z","abstract_excerpt":"Given a dictionary that consists of multiple blocks and a signal that lives in the range space of only a few blocks, we study the problem of finding a block-sparse representation of the signal, i.e., a representation that uses the minimum number of blocks. Motivated by signal/image processing and computer vision applications, such as face recognition, we consider the block-sparse recovery problem in the case where the number of atoms in each block is arbitrary, possibly much larger than the dimension of the underlying subspace. To find a block-sparse representation of a signal, we propose two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0654","kind":"arxiv","version":3},"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:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBJeoX0SVoEPwclUwPiOtGZx4tp0BDAz6dCVDkWsrsUY3HRBrxHvDeR/9T0lRqiiGPv5dot5WF9awYYJabGyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T17:29:33.270401Z"},"content_sha256":"fddac013f2421a7868d1ec0099551423cc3ba3963288ebd0d31af8a33cb76944","schema_version":"1.0","event_id":"sha256:fddac013f2421a7868d1ec0099551423cc3ba3963288ebd0d31af8a33cb76944"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE/bundle.json","state_url":"https://pith.science/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE/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-07-04T17:29:33Z","links":{"resolver":"https://pith.science/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE","bundle":"https://pith.science/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE/bundle.json","state":"https://pith.science/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHV3UASFFBUZ5F6DL3UWCCZMXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AHV3UASFFBUZ5F6DL3UWCCZMXE","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":"5964175a7411c53e827610bf569ba1b757b5d6ad3ef9ec79d935ab287d8a4f11","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T19:14:03Z","title_canon_sha256":"95874f31446eea220122f099476fa490a7ae37197d2bb874873f26d3320d559a"},"schema_version":"1.0","source":{"id":"1104.0654","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0654","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0654v3","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0654","created_at":"2026-05-18T02:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"AHV3UASFFBUZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHV3UASFFBUZ5F6D","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHV3UASF","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:fddac013f2421a7868d1ec0099551423cc3ba3963288ebd0d31af8a33cb76944","target":"graph","created_at":"2026-05-18T02:02:38Z","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":"Given a dictionary that consists of multiple blocks and a signal that lives in the range space of only a few blocks, we study the problem of finding a block-sparse representation of the signal, i.e., a representation that uses the minimum number of blocks. Motivated by signal/image processing and computer vision applications, such as face recognition, we consider the block-sparse recovery problem in the case where the number of atoms in each block is arbitrary, possibly much larger than the dimension of the underlying subspace. To find a block-sparse representation of a signal, we propose two ","authors_text":"Ehsan Elhamifar, Rene Vidal","cross_cats":["cs.CV","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T19:14:03Z","title":"Block-Sparse Recovery via Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0654","kind":"arxiv","version":3},"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:91498bdeb47e7183b9f9b94c34c5665861bcd275016caa0c6701707d98057494","target":"record","created_at":"2026-05-18T02:02:38Z","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":"5964175a7411c53e827610bf569ba1b757b5d6ad3ef9ec79d935ab287d8a4f11","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-04T19:14:03Z","title_canon_sha256":"95874f31446eea220122f099476fa490a7ae37197d2bb874873f26d3320d559a"},"schema_version":"1.0","source":{"id":"1104.0654","kind":"arxiv","version":3}},"canonical_sha256":"01ebba024528699e97c35ee9610b2cb928653405fc7527bacbddb28addf8baee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01ebba024528699e97c35ee9610b2cb928653405fc7527bacbddb28addf8baee","first_computed_at":"2026-05-18T02:02:38.284654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:38.284654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FsVolgz3N78qvUicPC6Fhb+szQixKm089UzOBLdqphb95txS1eCDfzybm8Pz8fONTw1n7udIY15+se7roSS7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:38.285342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0654","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91498bdeb47e7183b9f9b94c34c5665861bcd275016caa0c6701707d98057494","sha256:fddac013f2421a7868d1ec0099551423cc3ba3963288ebd0d31af8a33cb76944"],"state_sha256":"b124e58f47156ab1e261bacea2bcf93b687212cde6b152c145cb1fa28d9fa977"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSFWUdpcnbNERzScUoZ/0ozOn/J8Cy6xuemx0FhNObl1JUeuvOdmqa9QD7mjQFaF5wCXh/G4P48uBViEKdc2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T17:29:33.272326Z","bundle_sha256":"c782e529028c6c7fb2961de1920cea2bbf2723ce1939ce9bb61f990616ca6747"}}