{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WKKZ53EH6KGXZGF26MFPENS7DO","short_pith_number":"pith:WKKZ53EH","canonical_record":{"source":{"id":"1204.4065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T12:16:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c013c6fbcdf74e614f6db5a47a03000bac2bd5fe1fd3f100c467f1e983e3b2f5","abstract_canon_sha256":"e5a52c92ae463b31f3053eeae5063d609eaa02670fe005e6e4709d649ec417d0"},"schema_version":"1.0"},"canonical_sha256":"b2959eec87f28d7c98baf30af2365f1b84506033b3e97eda9386a4b34c6c3153","source":{"kind":"arxiv","id":"1204.4065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4065","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4065v2","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4065","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"WKKZ53EH6KGX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WKKZ53EH6KGXZGF2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WKKZ53EH","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WKKZ53EH6KGXZGF26MFPENS7DO","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T12:16:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c013c6fbcdf74e614f6db5a47a03000bac2bd5fe1fd3f100c467f1e983e3b2f5","abstract_canon_sha256":"e5a52c92ae463b31f3053eeae5063d609eaa02670fe005e6e4709d649ec417d0"},"schema_version":"1.0"},"canonical_sha256":"b2959eec87f28d7c98baf30af2365f1b84506033b3e97eda9386a4b34c6c3153","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:16.305142Z","signature_b64":"bHnPV+ablhbWcZ8FwAUhDZmdDWchapPajTn4cOYSjOYCbG92rXdNyFP18X6Qz2qwJxe1qW6VhdT31m+C9V0RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2959eec87f28d7c98baf30af2365f1b84506033b3e97eda9386a4b34c6c3153","last_reissued_at":"2026-05-18T03:25:16.304578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:16.304578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4065","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-18T03:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYlBlO4Z+Nkp0crD1hzJbj5mo6alTsjs3jCVyzbIAZPfG8lWhr7Mg38+fpvB1dJdVjSgFbkobaiEA70cjEn6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:18:53.246802Z"},"content_sha256":"1d140a931675ba8b537b17ee79d376008c6e74d8fb1aa7fbfdff642f1beb22bb","schema_version":"1.0","event_id":"sha256:1d140a931675ba8b537b17ee79d376008c6e74d8fb1aa7fbfdff642f1beb22bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WKKZ53EH6KGXZGF26MFPENS7DO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik Aurell, Lars Rasmussen, Mikael Skoglund, Mikko Vehkaper\\\"a, Saikat Chatterjee, Yoshiyuki Kabashima","submitted_at":"2012-04-18T12:16:55Z","abstract_excerpt":"The sparse representation problem of recovering an N dimensional sparse vector x from M < N linear observations y = Dx given dictionary D is considered. The standard approach is to let the elements of the dictionary be independent and identically distributed (IID) zero-mean Gaussian and minimize the l1-norm of x under the constraint y = Dx. In this paper, the performance of l1-reconstruction is analyzed, when the dictionary is bi-orthogonal D = [O1 O2], where O1,O2 are independent and drawn uniformly according to the Haar measure on the group of orthogonal M x M matrices. By an application of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4065","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-18T03:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLoH8FjAztAPAsm++vO8VVkI3d0cz38LirlHICglmZH71Xs/HqFjIZf9oabAqF8lXp0hpZtt+N2+0BceOBtLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:18:53.247156Z"},"content_sha256":"5a8d694896a49fb9a9e7a3863ebbe014df7c0dcbf72e09ba161a02602f0c658c","schema_version":"1.0","event_id":"sha256:5a8d694896a49fb9a9e7a3863ebbe014df7c0dcbf72e09ba161a02602f0c658c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKKZ53EH6KGXZGF26MFPENS7DO/bundle.json","state_url":"https://pith.science/pith/WKKZ53EH6KGXZGF26MFPENS7DO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKKZ53EH6KGXZGF26MFPENS7DO/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-03T12:18:53Z","links":{"resolver":"https://pith.science/pith/WKKZ53EH6KGXZGF26MFPENS7DO","bundle":"https://pith.science/pith/WKKZ53EH6KGXZGF26MFPENS7DO/bundle.json","state":"https://pith.science/pith/WKKZ53EH6KGXZGF26MFPENS7DO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKKZ53EH6KGXZGF26MFPENS7DO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WKKZ53EH6KGXZGF26MFPENS7DO","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":"e5a52c92ae463b31f3053eeae5063d609eaa02670fe005e6e4709d649ec417d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T12:16:55Z","title_canon_sha256":"c013c6fbcdf74e614f6db5a47a03000bac2bd5fe1fd3f100c467f1e983e3b2f5"},"schema_version":"1.0","source":{"id":"1204.4065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4065","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4065v2","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4065","created_at":"2026-05-18T03:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"WKKZ53EH6KGX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WKKZ53EH6KGXZGF2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WKKZ53EH","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:5a8d694896a49fb9a9e7a3863ebbe014df7c0dcbf72e09ba161a02602f0c658c","target":"graph","created_at":"2026-05-18T03:25:16Z","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 sparse representation problem of recovering an N dimensional sparse vector x from M < N linear observations y = Dx given dictionary D is considered. The standard approach is to let the elements of the dictionary be independent and identically distributed (IID) zero-mean Gaussian and minimize the l1-norm of x under the constraint y = Dx. In this paper, the performance of l1-reconstruction is analyzed, when the dictionary is bi-orthogonal D = [O1 O2], where O1,O2 are independent and drawn uniformly according to the Haar measure on the group of orthogonal M x M matrices. By an application of ","authors_text":"Erik Aurell, Lars Rasmussen, Mikael Skoglund, Mikko Vehkaper\\\"a, Saikat Chatterjee, Yoshiyuki Kabashima","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T12:16:55Z","title":"Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4065","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:1d140a931675ba8b537b17ee79d376008c6e74d8fb1aa7fbfdff642f1beb22bb","target":"record","created_at":"2026-05-18T03:25:16Z","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":"e5a52c92ae463b31f3053eeae5063d609eaa02670fe005e6e4709d649ec417d0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-18T12:16:55Z","title_canon_sha256":"c013c6fbcdf74e614f6db5a47a03000bac2bd5fe1fd3f100c467f1e983e3b2f5"},"schema_version":"1.0","source":{"id":"1204.4065","kind":"arxiv","version":2}},"canonical_sha256":"b2959eec87f28d7c98baf30af2365f1b84506033b3e97eda9386a4b34c6c3153","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2959eec87f28d7c98baf30af2365f1b84506033b3e97eda9386a4b34c6c3153","first_computed_at":"2026-05-18T03:25:16.304578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:16.304578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHnPV+ablhbWcZ8FwAUhDZmdDWchapPajTn4cOYSjOYCbG92rXdNyFP18X6Qz2qwJxe1qW6VhdT31m+C9V0RAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:16.305142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d140a931675ba8b537b17ee79d376008c6e74d8fb1aa7fbfdff642f1beb22bb","sha256:5a8d694896a49fb9a9e7a3863ebbe014df7c0dcbf72e09ba161a02602f0c658c"],"state_sha256":"a37d374d078a4aac87a0db1a822884dbe6749395fa5f2fabacf431a6fdfa1a32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfJZ4la1x36GFal4Y/KKiyowIM7Ee2atNh5/tGgOKboS0aZhR+Kakaw6O7n7vZ6hNANRcpUw/J4GU1uDIyC5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:18:53.249086Z","bundle_sha256":"ad1ab8af5c92ef257837902b0d47a38cca84cfe0437bae76724e0602019c6d51"}}