{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7GKQWECZL6L37S7RSAISCH7K3E","short_pith_number":"pith:7GKQWECZ","canonical_record":{"source":{"id":"1205.4139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T11:33:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04ea2be2c52b7e9cedf4d01a2762c91bf7ada0b538633d83ab05c4c5e9d0edd7","abstract_canon_sha256":"19bdb80d7dd604e10b23fb04d72a89162c14b3a447214a11f656a3804b870fa6"},"schema_version":"1.0"},"canonical_sha256":"f9950b10595f97bfcbf19011211fead917598bdde8de813de6673e40264a0e0a","source":{"kind":"arxiv","id":"1205.4139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4139","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4139v1","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4139","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"7GKQWECZL6L3","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GKQWECZL6L37S7R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GKQWECZ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7GKQWECZL6L37S7RSAISCH7K3E","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T11:33:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04ea2be2c52b7e9cedf4d01a2762c91bf7ada0b538633d83ab05c4c5e9d0edd7","abstract_canon_sha256":"19bdb80d7dd604e10b23fb04d72a89162c14b3a447214a11f656a3804b870fa6"},"schema_version":"1.0"},"canonical_sha256":"f9950b10595f97bfcbf19011211fead917598bdde8de813de6673e40264a0e0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.641851Z","signature_b64":"mq7lTe4zOFj2fjsOdI2edB9WJncZ6CZvlxXtO66lOcAC80U30mV6jhz4HyFoYhoQUecdqNQfAcSbYM9icy4nDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9950b10595f97bfcbf19011211fead917598bdde8de813de6673e40264a0e0a","last_reissued_at":"2026-05-18T03:55:22.641302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.641302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4139","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-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDcUYp0Mx0vPEl4nfDumFuIALtEwVifgUYfIxN9pcik9viZlbBDNohnfvcWsk0/t625+OYkwoAtsIGSdQWboCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:46:42.274722Z"},"content_sha256":"da67684d12cbfd173b076c414def3d4ac78faee501221610d2ac8c2927fd71ad","schema_version":"1.0","event_id":"sha256:da67684d12cbfd173b076c414def3d4ac78faee501221610d2ac8c2927fd71ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7GKQWECZL6L37S7RSAISCH7K3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Correlation Computation Method for Matching Pursuit Algorithms in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Habong Chung, Hosung Park, Jong-Seon No, Kee-Hoon Kim, Seokbeom Hong","submitted_at":"2012-05-18T11:33:52Z","abstract_excerpt":"There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem a.k.a. compressed sensing (CS). In the MPAs, the correlation computation step has a dominant computational complexity. In this letter, we propose a new fast correlation computation method when we use some classes of partial unitary matrices as the sensing matrix. Those partial unitary matrices include partial Fourier matrices and partial Hadamard matrices which are popular sensing matrices. The proposed correlation computation method can be applied to almost all MPAs without causing any degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4139","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-18T03:55:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2y1ep8ZcO9TBZSLGPhdS+pEUTT2UUT1wPQLpt5UJGtTncW5DAjQNW/KDNO0JAePqq33e8pSXtloQXaJh/6J2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:46:42.275058Z"},"content_sha256":"13b5d8fa93d14d0d8f003785c81a8c1ed291fb1962232b6952e98387ad3f417b","schema_version":"1.0","event_id":"sha256:13b5d8fa93d14d0d8f003785c81a8c1ed291fb1962232b6952e98387ad3f417b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GKQWECZL6L37S7RSAISCH7K3E/bundle.json","state_url":"https://pith.science/pith/7GKQWECZL6L37S7RSAISCH7K3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GKQWECZL6L37S7RSAISCH7K3E/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-25T17:46:42Z","links":{"resolver":"https://pith.science/pith/7GKQWECZL6L37S7RSAISCH7K3E","bundle":"https://pith.science/pith/7GKQWECZL6L37S7RSAISCH7K3E/bundle.json","state":"https://pith.science/pith/7GKQWECZL6L37S7RSAISCH7K3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GKQWECZL6L37S7RSAISCH7K3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7GKQWECZL6L37S7RSAISCH7K3E","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":"19bdb80d7dd604e10b23fb04d72a89162c14b3a447214a11f656a3804b870fa6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T11:33:52Z","title_canon_sha256":"04ea2be2c52b7e9cedf4d01a2762c91bf7ada0b538633d83ab05c4c5e9d0edd7"},"schema_version":"1.0","source":{"id":"1205.4139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4139","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4139v1","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4139","created_at":"2026-05-18T03:55:22Z"},{"alias_kind":"pith_short_12","alias_value":"7GKQWECZL6L3","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GKQWECZL6L37S7R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GKQWECZ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:13b5d8fa93d14d0d8f003785c81a8c1ed291fb1962232b6952e98387ad3f417b","target":"graph","created_at":"2026-05-18T03:55:22Z","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":"There have been many matching pursuit algorithms (MPAs) which handle the sparse signal recovery problem a.k.a. compressed sensing (CS). In the MPAs, the correlation computation step has a dominant computational complexity. In this letter, we propose a new fast correlation computation method when we use some classes of partial unitary matrices as the sensing matrix. Those partial unitary matrices include partial Fourier matrices and partial Hadamard matrices which are popular sensing matrices. The proposed correlation computation method can be applied to almost all MPAs without causing any degr","authors_text":"Habong Chung, Hosung Park, Jong-Seon No, Kee-Hoon Kim, Seokbeom Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T11:33:52Z","title":"Fast Correlation Computation Method for Matching Pursuit Algorithms in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4139","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:da67684d12cbfd173b076c414def3d4ac78faee501221610d2ac8c2927fd71ad","target":"record","created_at":"2026-05-18T03:55:22Z","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":"19bdb80d7dd604e10b23fb04d72a89162c14b3a447214a11f656a3804b870fa6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T11:33:52Z","title_canon_sha256":"04ea2be2c52b7e9cedf4d01a2762c91bf7ada0b538633d83ab05c4c5e9d0edd7"},"schema_version":"1.0","source":{"id":"1205.4139","kind":"arxiv","version":1}},"canonical_sha256":"f9950b10595f97bfcbf19011211fead917598bdde8de813de6673e40264a0e0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9950b10595f97bfcbf19011211fead917598bdde8de813de6673e40264a0e0a","first_computed_at":"2026-05-18T03:55:22.641302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:22.641302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mq7lTe4zOFj2fjsOdI2edB9WJncZ6CZvlxXtO66lOcAC80U30mV6jhz4HyFoYhoQUecdqNQfAcSbYM9icy4nDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:22.641851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da67684d12cbfd173b076c414def3d4ac78faee501221610d2ac8c2927fd71ad","sha256:13b5d8fa93d14d0d8f003785c81a8c1ed291fb1962232b6952e98387ad3f417b"],"state_sha256":"98f4742b203e50e4b5afc308d6ad7c888186c8c4c4f70626f00f12aebb365037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/CP9JZ/fNYzjZFqLg+TVn0aG3O0fW02Fb6b5H9QsDM+D7wobngY7WcQ2LSabiUCuR/AR4UoI2exMSPUAtq2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:46:42.276957Z","bundle_sha256":"babc029740de90031b89424843aa98b7c16cfdd8675e6111b54f6c63369d97b7"}}