{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KZZK4D5A5O25ZHY6LT23CC2RPU","short_pith_number":"pith:KZZK4D5A","canonical_record":{"source":{"id":"1412.0680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-01T21:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"b8717a6c60e747e60aa376e7cb9af6c36eafb33788880176b21b0554aeb551f9","abstract_canon_sha256":"b99366156073874db1c81565daae87e634e9a957430b9d185385f13e95849df1"},"schema_version":"1.0"},"canonical_sha256":"5672ae0fa0ebb5dc9f1e5cf5b10b517d0d4445394b6cb22cb4aa7dfe90416726","source":{"kind":"arxiv","id":"1412.0680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0680","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0680v1","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0680","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"KZZK4D5A5O25","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KZZK4D5A5O25ZHY6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KZZK4D5A","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KZZK4D5A5O25ZHY6LT23CC2RPU","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-01T21:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"b8717a6c60e747e60aa376e7cb9af6c36eafb33788880176b21b0554aeb551f9","abstract_canon_sha256":"b99366156073874db1c81565daae87e634e9a957430b9d185385f13e95849df1"},"schema_version":"1.0"},"canonical_sha256":"5672ae0fa0ebb5dc9f1e5cf5b10b517d0d4445394b6cb22cb4aa7dfe90416726","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:21.419432Z","signature_b64":"jTfh4I2HBvJaQJIscAix3YDVgkZ6LyuoUgxZEnR1K+VQmnxIEbpSgabkT7g8zas5L0gZ7dlZe5xjrTqG8zMTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5672ae0fa0ebb5dc9f1e5cf5b10b517d0d4445394b6cb22cb4aa7dfe90416726","last_reissued_at":"2026-05-18T02:32:21.419034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:21.419034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0680","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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlGT0XvSmuPd8zWrLfT6kOYHnOefSoGkOdy73WbZRcQTruKVd3PiQfjJIvnTgQ1BUst2gblNbqCdrUiool0nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:04:42.327035Z"},"content_sha256":"5699b7a52e6f2097d7371d9ae2b08572eece8c0c38d61ee58c90d1a0b1a82f78","schema_version":"1.0","event_id":"sha256:5699b7a52e6f2097d7371d9ae2b08572eece8c0c38d61ee58c90d1a0b1a82f78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KZZK4D5A5O25ZHY6LT23CC2RPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Sublinear Sparse Representation using Shallow Tree Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Ayremlou, Ashok Veeraraghavan, Richard Baraniuk, Thomas Goldstein","submitted_at":"2014-12-01T21:08:37Z","abstract_excerpt":"Sparse approximations using highly over-complete dictionaries is a state-of-the-art tool for many imaging applications including denoising, super-resolution, compressive sensing, light-field analysis, and object recognition. Unfortunately, the applicability of such methods is severely hampered by the computational burden of sparse approximation: these algorithms are linear or super-linear in both the data dimensionality and size of the dictionary. We propose a framework for learning the hierarchical structure of over-complete dictionaries that enables fast computation of sparse representations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0680","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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRxCOs7ATfsA+Oi3PoEKojihw0KCjLRHbmhH9CpYTgqw8ekhe7wSfp6VxWhDKdcQzj/TfOEmH0qFVtxQeMNvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:04:42.327392Z"},"content_sha256":"9f69e488eda88ed8de4acd27a5f0f9728acf92bbb8270a1fed3cc461b6aeacb7","schema_version":"1.0","event_id":"sha256:9f69e488eda88ed8de4acd27a5f0f9728acf92bbb8270a1fed3cc461b6aeacb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZZK4D5A5O25ZHY6LT23CC2RPU/bundle.json","state_url":"https://pith.science/pith/KZZK4D5A5O25ZHY6LT23CC2RPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZZK4D5A5O25ZHY6LT23CC2RPU/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-05T16:04:42Z","links":{"resolver":"https://pith.science/pith/KZZK4D5A5O25ZHY6LT23CC2RPU","bundle":"https://pith.science/pith/KZZK4D5A5O25ZHY6LT23CC2RPU/bundle.json","state":"https://pith.science/pith/KZZK4D5A5O25ZHY6LT23CC2RPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZZK4D5A5O25ZHY6LT23CC2RPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KZZK4D5A5O25ZHY6LT23CC2RPU","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":"b99366156073874db1c81565daae87e634e9a957430b9d185385f13e95849df1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-01T21:08:37Z","title_canon_sha256":"b8717a6c60e747e60aa376e7cb9af6c36eafb33788880176b21b0554aeb551f9"},"schema_version":"1.0","source":{"id":"1412.0680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0680","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0680v1","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0680","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"KZZK4D5A5O25","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KZZK4D5A5O25ZHY6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KZZK4D5A","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:9f69e488eda88ed8de4acd27a5f0f9728acf92bbb8270a1fed3cc461b6aeacb7","target":"graph","created_at":"2026-05-18T02:32:21Z","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":"Sparse approximations using highly over-complete dictionaries is a state-of-the-art tool for many imaging applications including denoising, super-resolution, compressive sensing, light-field analysis, and object recognition. Unfortunately, the applicability of such methods is severely hampered by the computational burden of sparse approximation: these algorithms are linear or super-linear in both the data dimensionality and size of the dictionary. We propose a framework for learning the hierarchical structure of over-complete dictionaries that enables fast computation of sparse representations","authors_text":"Ali Ayremlou, Ashok Veeraraghavan, Richard Baraniuk, Thomas Goldstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-01T21:08:37Z","title":"Fast Sublinear Sparse Representation using Shallow Tree Matching Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0680","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:5699b7a52e6f2097d7371d9ae2b08572eece8c0c38d61ee58c90d1a0b1a82f78","target":"record","created_at":"2026-05-18T02:32:21Z","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":"b99366156073874db1c81565daae87e634e9a957430b9d185385f13e95849df1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-01T21:08:37Z","title_canon_sha256":"b8717a6c60e747e60aa376e7cb9af6c36eafb33788880176b21b0554aeb551f9"},"schema_version":"1.0","source":{"id":"1412.0680","kind":"arxiv","version":1}},"canonical_sha256":"5672ae0fa0ebb5dc9f1e5cf5b10b517d0d4445394b6cb22cb4aa7dfe90416726","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5672ae0fa0ebb5dc9f1e5cf5b10b517d0d4445394b6cb22cb4aa7dfe90416726","first_computed_at":"2026-05-18T02:32:21.419034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:21.419034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jTfh4I2HBvJaQJIscAix3YDVgkZ6LyuoUgxZEnR1K+VQmnxIEbpSgabkT7g8zas5L0gZ7dlZe5xjrTqG8zMTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:21.419432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5699b7a52e6f2097d7371d9ae2b08572eece8c0c38d61ee58c90d1a0b1a82f78","sha256:9f69e488eda88ed8de4acd27a5f0f9728acf92bbb8270a1fed3cc461b6aeacb7"],"state_sha256":"0556836aef37effced7a6978c4dc04da98cb13b9acabbad799db8eebedd3a1d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xLMuVYsOeY+Acfxq5wox/V+nIFjw75BkZ6/kLMSFfj2zm+55/prwX2pExFm+7eCEn5hpcTsNDx7lPR12jg4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:04:42.329332Z","bundle_sha256":"bbad32a502bd97fbe57b672ec7e53448ce43b1ac56d679ea173c55fa8d0dc18e"}}