{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LB5UFZCIH5K52RLANVOAWJ5AU2","short_pith_number":"pith:LB5UFZCI","canonical_record":{"source":{"id":"1704.01992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T19:23:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8afe5d45db274e29c440457dd54c3277d2ceed3d2b3a169137338499e207df08","abstract_canon_sha256":"98d9f477b433df10d4541b0ecfc5d8f142c16a0a38a5f674982fdbaee010c8ac"},"schema_version":"1.0"},"canonical_sha256":"587b42e4483f55dd45606d5c0b27a0a6b9a9ae7643ed3b67276c12231913f45d","source":{"kind":"arxiv","id":"1704.01992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01992","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01992v1","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01992","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"LB5UFZCIH5K5","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LB5UFZCIH5K52RLA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LB5UFZCI","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LB5UFZCIH5K52RLANVOAWJ5AU2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T19:23:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8afe5d45db274e29c440457dd54c3277d2ceed3d2b3a169137338499e207df08","abstract_canon_sha256":"98d9f477b433df10d4541b0ecfc5d8f142c16a0a38a5f674982fdbaee010c8ac"},"schema_version":"1.0"},"canonical_sha256":"587b42e4483f55dd45606d5c0b27a0a6b9a9ae7643ed3b67276c12231913f45d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.079546Z","signature_b64":"yLAuMapAlKJmxvvjVZZXXci1v0Rh3k7FUkhi/bweoZRf5Fy2IQRayY2jLMo7XJax5abcfqpWpWAoktjFTAmqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"587b42e4483f55dd45606d5c0b27a0a6b9a9ae7643ed3b67276c12231913f45d","last_reissued_at":"2026-05-18T00:46:51.078807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.078807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01992","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-18T00:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXGlqs/cQgELLoEOqMxI0QaB+5CmSFPlqYcbQTSh9wDAlYN55rmCYO73Ogycw5F3OII3roQ0NMWK1S2gt4j4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:24:43.669090Z"},"content_sha256":"2dcfb557dd845d766671226f23ab00f2f3d4928b6dffe872ecdaddc4c138ada2","schema_version":"1.0","event_id":"sha256:2dcfb557dd845d766671226f23ab00f2f3d4928b6dffe872ecdaddc4c138ada2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LB5UFZCIH5K52RLANVOAWJ5AU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient algorithm for compression-based compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arian Maleki, Sajjad Beygi, Shirin Jalali, Urbashi Mitra","submitted_at":"2017-04-06T19:23:08Z","abstract_excerpt":"Modern image and video compression codes employ elaborate structures existing in such signals to encode them into few number of bits. Compressed sensing recovery algorithms on the other hand use such signals' structures to recover them from few linear observations. Despite the steady progress in the field of compressed sensing, structures that are often used for signal recovery are still much simpler than those employed by state-of-the-art compression codes. The main goal of this paper is to bridge this gap through answering the following question: Can one employ a given compression code to bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01992","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-18T00:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WueWJZcwrOFZ8XZKRRc0W35x+cR+BgUvNOechDy09g/VFQTk6JJerf6tQw4sm0KUcr6cPT4gsLLnx7P8tiSrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:24:43.669515Z"},"content_sha256":"eaef4aa1ae9788713e203736a5faa1c138be5aaf2a492e5ff86b325be07767e1","schema_version":"1.0","event_id":"sha256:eaef4aa1ae9788713e203736a5faa1c138be5aaf2a492e5ff86b325be07767e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LB5UFZCIH5K52RLANVOAWJ5AU2/bundle.json","state_url":"https://pith.science/pith/LB5UFZCIH5K52RLANVOAWJ5AU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LB5UFZCIH5K52RLANVOAWJ5AU2/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-01T03:24:43Z","links":{"resolver":"https://pith.science/pith/LB5UFZCIH5K52RLANVOAWJ5AU2","bundle":"https://pith.science/pith/LB5UFZCIH5K52RLANVOAWJ5AU2/bundle.json","state":"https://pith.science/pith/LB5UFZCIH5K52RLANVOAWJ5AU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LB5UFZCIH5K52RLANVOAWJ5AU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LB5UFZCIH5K52RLANVOAWJ5AU2","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":"98d9f477b433df10d4541b0ecfc5d8f142c16a0a38a5f674982fdbaee010c8ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T19:23:08Z","title_canon_sha256":"8afe5d45db274e29c440457dd54c3277d2ceed3d2b3a169137338499e207df08"},"schema_version":"1.0","source":{"id":"1704.01992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01992","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01992v1","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01992","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"LB5UFZCIH5K5","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LB5UFZCIH5K52RLA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LB5UFZCI","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:eaef4aa1ae9788713e203736a5faa1c138be5aaf2a492e5ff86b325be07767e1","target":"graph","created_at":"2026-05-18T00:46:51Z","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":"Modern image and video compression codes employ elaborate structures existing in such signals to encode them into few number of bits. Compressed sensing recovery algorithms on the other hand use such signals' structures to recover them from few linear observations. Despite the steady progress in the field of compressed sensing, structures that are often used for signal recovery are still much simpler than those employed by state-of-the-art compression codes. The main goal of this paper is to bridge this gap through answering the following question: Can one employ a given compression code to bu","authors_text":"Arian Maleki, Sajjad Beygi, Shirin Jalali, Urbashi Mitra","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T19:23:08Z","title":"An efficient algorithm for compression-based compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01992","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:2dcfb557dd845d766671226f23ab00f2f3d4928b6dffe872ecdaddc4c138ada2","target":"record","created_at":"2026-05-18T00:46:51Z","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":"98d9f477b433df10d4541b0ecfc5d8f142c16a0a38a5f674982fdbaee010c8ac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-06T19:23:08Z","title_canon_sha256":"8afe5d45db274e29c440457dd54c3277d2ceed3d2b3a169137338499e207df08"},"schema_version":"1.0","source":{"id":"1704.01992","kind":"arxiv","version":1}},"canonical_sha256":"587b42e4483f55dd45606d5c0b27a0a6b9a9ae7643ed3b67276c12231913f45d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"587b42e4483f55dd45606d5c0b27a0a6b9a9ae7643ed3b67276c12231913f45d","first_computed_at":"2026-05-18T00:46:51.078807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:51.078807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yLAuMapAlKJmxvvjVZZXXci1v0Rh3k7FUkhi/bweoZRf5Fy2IQRayY2jLMo7XJax5abcfqpWpWAoktjFTAmqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:51.079546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dcfb557dd845d766671226f23ab00f2f3d4928b6dffe872ecdaddc4c138ada2","sha256:eaef4aa1ae9788713e203736a5faa1c138be5aaf2a492e5ff86b325be07767e1"],"state_sha256":"ea640e07b6908c2c9c82d8805ab8786677d3c11ae09d0f486c81eaef3b929431"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB65JgIM35+/x3GwNpaIUgiIHno0jrZmvo1gRUwxsstFVqJs4+q9mEkE3QVs2rUS7uRP0WArGInZXjj9hirpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:24:43.671599Z","bundle_sha256":"6e991f043586465704b5186fadaf61ba0c71ac047234ed09877e764bfeafa555"}}