{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V4VSNTL2NZWSH4VIMRW2ICD2Y6","short_pith_number":"pith:V4VSNTL2","canonical_record":{"source":{"id":"1501.03208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-13T23:44:56Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"8631df900781a25418a14a2d4dd954592ae3c5d54a86f9198d82f6dbd499d173","abstract_canon_sha256":"716d8568c58df23bc25b9bc30665662c2b46b8f7ab8253ece9c27542f2d9ca87"},"schema_version":"1.0"},"canonical_sha256":"af2b26cd7a6e6d23f2a8646da4087ac784ee1a8b31ba26b44e65e4e6bc6f9099","source":{"kind":"arxiv","id":"1501.03208","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03208","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03208v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03208","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"V4VSNTL2NZWS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4VSNTL2NZWSH4VI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4VSNTL2","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V4VSNTL2NZWSH4VIMRW2ICD2Y6","target":"record","payload":{"canonical_record":{"source":{"id":"1501.03208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-13T23:44:56Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"8631df900781a25418a14a2d4dd954592ae3c5d54a86f9198d82f6dbd499d173","abstract_canon_sha256":"716d8568c58df23bc25b9bc30665662c2b46b8f7ab8253ece9c27542f2d9ca87"},"schema_version":"1.0"},"canonical_sha256":"af2b26cd7a6e6d23f2a8646da4087ac784ee1a8b31ba26b44e65e4e6bc6f9099","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.804938Z","signature_b64":"IpzwbMXZ3G8dogbvRSvVkx/9bUTiwidYyKxiavFKJuqbQ9UTcrgLCbLM81AE5yxs6rtisGKxmHH5jNdnSaywCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af2b26cd7a6e6d23f2a8646da4087ac784ee1a8b31ba26b44e65e4e6bc6f9099","last_reissued_at":"2026-05-18T01:55:52.804574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.804574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.03208","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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/F71XL5KCxZ+gn5jp4VvINZVed7eUObrslEtkuIceOGpZvmiMG4bVnbRnJ6COy0HKPE5RIw7WyvnmE5PM5eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:38:52.500522Z"},"content_sha256":"7bd39fae7f9fe85cc7dbae564e11768cfcc34debd3798f1c080735efdda94ccf","schema_version":"1.0","event_id":"sha256:7bd39fae7f9fe85cc7dbae564e11768cfcc34debd3798f1c080735efdda94ccf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V4VSNTL2NZWSH4VIMRW2ICD2Y6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Sensing with Redundant Dictionaries and Structured Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Deanna Needell, Felix Krahmer, Rachel Ward","submitted_at":"2015-01-13T23:44:56Z","abstract_excerpt":"Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and efficiently solvable under suitable assumptions on the measurements and dictionary, if the number of measurements scales roughly with the sparsity level. One sufficient condition for such is the $D$-restricted isometry property ($D$-RIP), which asks that the sampling matrix approximately preserve the norm of all signals which are sufficiently sparse in $D$. While ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03208","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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bYi0h693yEkHWVBWJXU+OSyPcLtSmFDHHnbDVa/5+E9atlNBfg2idmQa+6/C6IV8xObTwzy/ELfYeZNJVzYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:38:52.500867Z"},"content_sha256":"1261aa13e90ea4594eb0eee82af5963359845f700b75bc7cf66c98a4484d69ed","schema_version":"1.0","event_id":"sha256:1261aa13e90ea4594eb0eee82af5963359845f700b75bc7cf66c98a4484d69ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6/bundle.json","state_url":"https://pith.science/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6/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-05-30T04:38:52Z","links":{"resolver":"https://pith.science/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6","bundle":"https://pith.science/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6/bundle.json","state":"https://pith.science/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4VSNTL2NZWSH4VIMRW2ICD2Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V4VSNTL2NZWSH4VIMRW2ICD2Y6","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":"716d8568c58df23bc25b9bc30665662c2b46b8f7ab8253ece9c27542f2d9ca87","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-13T23:44:56Z","title_canon_sha256":"8631df900781a25418a14a2d4dd954592ae3c5d54a86f9198d82f6dbd499d173"},"schema_version":"1.0","source":{"id":"1501.03208","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03208","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03208v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03208","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"V4VSNTL2NZWS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V4VSNTL2NZWSH4VI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V4VSNTL2","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:1261aa13e90ea4594eb0eee82af5963359845f700b75bc7cf66c98a4484d69ed","target":"graph","created_at":"2026-05-18T01:55:52Z","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":"Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and efficiently solvable under suitable assumptions on the measurements and dictionary, if the number of measurements scales roughly with the sparsity level. One sufficient condition for such is the $D$-restricted isometry property ($D$-RIP), which asks that the sampling matrix approximately preserve the norm of all signals which are sufficiently sparse in $D$. While ma","authors_text":"Deanna Needell, Felix Krahmer, Rachel Ward","cross_cats":["math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-13T23:44:56Z","title":"Compressive Sensing with Redundant Dictionaries and Structured Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03208","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:7bd39fae7f9fe85cc7dbae564e11768cfcc34debd3798f1c080735efdda94ccf","target":"record","created_at":"2026-05-18T01:55:52Z","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":"716d8568c58df23bc25b9bc30665662c2b46b8f7ab8253ece9c27542f2d9ca87","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-13T23:44:56Z","title_canon_sha256":"8631df900781a25418a14a2d4dd954592ae3c5d54a86f9198d82f6dbd499d173"},"schema_version":"1.0","source":{"id":"1501.03208","kind":"arxiv","version":2}},"canonical_sha256":"af2b26cd7a6e6d23f2a8646da4087ac784ee1a8b31ba26b44e65e4e6bc6f9099","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af2b26cd7a6e6d23f2a8646da4087ac784ee1a8b31ba26b44e65e4e6bc6f9099","first_computed_at":"2026-05-18T01:55:52.804574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.804574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IpzwbMXZ3G8dogbvRSvVkx/9bUTiwidYyKxiavFKJuqbQ9UTcrgLCbLM81AE5yxs6rtisGKxmHH5jNdnSaywCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.804938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03208","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bd39fae7f9fe85cc7dbae564e11768cfcc34debd3798f1c080735efdda94ccf","sha256:1261aa13e90ea4594eb0eee82af5963359845f700b75bc7cf66c98a4484d69ed"],"state_sha256":"c48f1c9becf03ca3170614addc1376f2e199a5e2c8c4e77980e73f0fd2b8631c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCK1Y3ktt4J/VyrAjHCAU+YYGTpf3mwQaOGsQr88f27HPGxbdcxw1n/ZdINCAqtnLM+Wf22bOOj8zpBxUYoiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:38:52.502962Z","bundle_sha256":"7199fe1f5595921fdaa86bf90dd306fddac4e2a6c050fe3b277158c5f5096656"}}