{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PD73GQUSRZLEXF5CKJUEMGJJPM","short_pith_number":"pith:PD73GQUS","canonical_record":{"source":{"id":"1703.03208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-09T10:11:03Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6e80106378b46a7bd7693c84f1819f51d9cd5fcb26792ac58160ae68e93f5a20","abstract_canon_sha256":"2b805d36ab80f5480e81e934bf8203de28db3b87d408669e38177403e5d4e2f0"},"schema_version":"1.0"},"canonical_sha256":"78ffb342928e564b97a252684619297b1c66522a47d17222b5e9e6465410b2d3","source":{"kind":"arxiv","id":"1703.03208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03208","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03208v1","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03208","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"PD73GQUSRZLE","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PD73GQUSRZLEXF5C","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PD73GQUS","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PD73GQUSRZLEXF5CKJUEMGJJPM","target":"record","payload":{"canonical_record":{"source":{"id":"1703.03208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-09T10:11:03Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6e80106378b46a7bd7693c84f1819f51d9cd5fcb26792ac58160ae68e93f5a20","abstract_canon_sha256":"2b805d36ab80f5480e81e934bf8203de28db3b87d408669e38177403e5d4e2f0"},"schema_version":"1.0"},"canonical_sha256":"78ffb342928e564b97a252684619297b1c66522a47d17222b5e9e6465410b2d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:01.103619Z","signature_b64":"LK4vZEDiSQNjhJRKp8CuT+MY9EMMqeWOe3l5zCaCoKBpclZsYjJ5qahC8evLObTRm2GQt3dhSxVpNie/91GKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78ffb342928e564b97a252684619297b1c66522a47d17222b5e9e6465410b2d3","last_reissued_at":"2026-05-18T00:49:01.102790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:01.102790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.03208","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:49:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJgAxXMg97S2wJvKGBeJvaGtaXLY9eUknFzCQp8I8mG606tH+eLL0i+mDtu2tVHrPxLn1VFBWB+kUvQm2KB4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:38:25.538626Z"},"content_sha256":"c99a779c4c1d81a86d082eb256312e8d706e0e4fad216283ef788312d6a122b4","schema_version":"1.0","event_id":"sha256:c99a779c4c1d81a86d082eb256312e8d706e0e4fad216283ef788312d6a122b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PD73GQUSRZLEXF5CKJUEMGJJPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Sensing using Generative Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Ajil Jalal, Alexandros G. Dimakis, Ashish Bora, Eric Price","submitted_at":"2017-03-09T10:11:03Z","abstract_excerpt":"The goal of compressed sensing is to estimate a vector from an underdetermined system of noisy linear measurements, by making use of prior knowledge on the structure of vectors in the relevant domain. For almost all results in this literature, the structure is represented by sparsity in a well-chosen basis. We show how to achieve guarantees similar to standard compressed sensing but without employing sparsity at all. Instead, we suppose that vectors lie near the range of a generative model $G: \\mathbb{R}^k \\to \\mathbb{R}^n$. Our main theorem is that, if $G$ is $L$-Lipschitz, then roughly $O(k "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03208","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:49:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukiPbqQe1sZX0ELNtgBtT3dUiUXBhKDE4MzCZZSugFECIdVYR541j1HbubQ7GKzvvyfkTF/r2nn+GD8pQv5mCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:38:25.539186Z"},"content_sha256":"53a990e3cd11d5710ff82a0eb4610044e379fff043f21805c5297888db7a8222","schema_version":"1.0","event_id":"sha256:53a990e3cd11d5710ff82a0eb4610044e379fff043f21805c5297888db7a8222"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PD73GQUSRZLEXF5CKJUEMGJJPM/bundle.json","state_url":"https://pith.science/pith/PD73GQUSRZLEXF5CKJUEMGJJPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PD73GQUSRZLEXF5CKJUEMGJJPM/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-05T01:38:25Z","links":{"resolver":"https://pith.science/pith/PD73GQUSRZLEXF5CKJUEMGJJPM","bundle":"https://pith.science/pith/PD73GQUSRZLEXF5CKJUEMGJJPM/bundle.json","state":"https://pith.science/pith/PD73GQUSRZLEXF5CKJUEMGJJPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PD73GQUSRZLEXF5CKJUEMGJJPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PD73GQUSRZLEXF5CKJUEMGJJPM","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":"2b805d36ab80f5480e81e934bf8203de28db3b87d408669e38177403e5d4e2f0","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-09T10:11:03Z","title_canon_sha256":"6e80106378b46a7bd7693c84f1819f51d9cd5fcb26792ac58160ae68e93f5a20"},"schema_version":"1.0","source":{"id":"1703.03208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03208","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03208v1","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03208","created_at":"2026-05-18T00:49:01Z"},{"alias_kind":"pith_short_12","alias_value":"PD73GQUSRZLE","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PD73GQUSRZLEXF5C","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PD73GQUS","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:53a990e3cd11d5710ff82a0eb4610044e379fff043f21805c5297888db7a8222","target":"graph","created_at":"2026-05-18T00:49:01Z","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 goal of compressed sensing is to estimate a vector from an underdetermined system of noisy linear measurements, by making use of prior knowledge on the structure of vectors in the relevant domain. For almost all results in this literature, the structure is represented by sparsity in a well-chosen basis. We show how to achieve guarantees similar to standard compressed sensing but without employing sparsity at all. Instead, we suppose that vectors lie near the range of a generative model $G: \\mathbb{R}^k \\to \\mathbb{R}^n$. Our main theorem is that, if $G$ is $L$-Lipschitz, then roughly $O(k ","authors_text":"Ajil Jalal, Alexandros G. Dimakis, Ashish Bora, Eric Price","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-09T10:11:03Z","title":"Compressed Sensing using Generative Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03208","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:c99a779c4c1d81a86d082eb256312e8d706e0e4fad216283ef788312d6a122b4","target":"record","created_at":"2026-05-18T00:49:01Z","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":"2b805d36ab80f5480e81e934bf8203de28db3b87d408669e38177403e5d4e2f0","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-09T10:11:03Z","title_canon_sha256":"6e80106378b46a7bd7693c84f1819f51d9cd5fcb26792ac58160ae68e93f5a20"},"schema_version":"1.0","source":{"id":"1703.03208","kind":"arxiv","version":1}},"canonical_sha256":"78ffb342928e564b97a252684619297b1c66522a47d17222b5e9e6465410b2d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78ffb342928e564b97a252684619297b1c66522a47d17222b5e9e6465410b2d3","first_computed_at":"2026-05-18T00:49:01.102790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:01.102790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LK4vZEDiSQNjhJRKp8CuT+MY9EMMqeWOe3l5zCaCoKBpclZsYjJ5qahC8evLObTRm2GQt3dhSxVpNie/91GKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:01.103619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c99a779c4c1d81a86d082eb256312e8d706e0e4fad216283ef788312d6a122b4","sha256:53a990e3cd11d5710ff82a0eb4610044e379fff043f21805c5297888db7a8222"],"state_sha256":"5be9944b99f6fd2248c875225d34832edcbd789ee02f2074aeb44dade1a86c11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"icIUN8q0zLH8YXlxzibRgzwTRk2X6+if6A/nGvIuOXIswA2cTf9yjYJo7T1IaZBi7J0lthMj5FlqVS+ydzq0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:38:25.541953Z","bundle_sha256":"117be385e64a0d2ab427e913ef0161dec7b6576202100bde8e4ae1d03e907e2d"}}