{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WFX3M73BH2XXC5U6FM33G52U5L","short_pith_number":"pith:WFX3M73B","canonical_record":{"source":{"id":"1912.02938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-06T00:51:51Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a205892509e3d892454fa926462771ef27c4717e787ba204af4a4963cac4daf5","abstract_canon_sha256":"395a7b5c1307e79f23f6f56ea20ddbd72d8f0e3207bc2f9054f6c2e4308a5219"},"schema_version":"1.0"},"canonical_sha256":"b16fb67f613eaf71769e2b37b37754eaf7bf93d9939721a57d3ae9aa9b1c5173","source":{"kind":"arxiv","id":"1912.02938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.02938","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"arxiv_version","alias_value":"1912.02938v1","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02938","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"pith_short_12","alias_value":"WFX3M73BH2XX","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"pith_short_16","alias_value":"WFX3M73BH2XXC5U6","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"pith_short_8","alias_value":"WFX3M73B","created_at":"2026-07-05T00:24:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WFX3M73BH2XXC5U6FM33G52U5L","target":"record","payload":{"canonical_record":{"source":{"id":"1912.02938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-06T00:51:51Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a205892509e3d892454fa926462771ef27c4717e787ba204af4a4963cac4daf5","abstract_canon_sha256":"395a7b5c1307e79f23f6f56ea20ddbd72d8f0e3207bc2f9054f6c2e4308a5219"},"schema_version":"1.0"},"canonical_sha256":"b16fb67f613eaf71769e2b37b37754eaf7bf93d9939721a57d3ae9aa9b1c5173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:19.731288Z","signature_b64":"dzzHiJFDjwy+QvnvLCrw54o18NAhjJXL1IkmV8pC2vmunE1VxtGG5ii3A3qr4gc1C14UCQAJgNHRKPXCxVp/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b16fb67f613eaf71769e2b37b37754eaf7bf93d9939721a57d3ae9aa9b1c5173","last_reissued_at":"2026-07-05T00:24:19.730945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:19.730945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.02938","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-07-05T00:24:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/1pDTf7rKW+kfBgiet+q8I1QNwi1MzvcNd2SXAakDTDbdklF+gQRSEWaPf0/uuewCt93w8v8dbzaM/JWX0dsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:30:38.447405Z"},"content_sha256":"659f2c1bf1bda54def0a0263d1c45a3defb6b5289ff2be14016c64feae9cac23","schema_version":"1.0","event_id":"sha256:659f2c1bf1bda54def0a0263d1c45a3defb6b5289ff2be14016c64feae9cac23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WFX3M73BH2XXC5U6FM33G52U5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Compressed Sensing with Generative Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Akshay Kamath, Eric Price, Sushrut Karmalkar","submitted_at":"2019-12-06T00:51:51Z","abstract_excerpt":"The goal of compressed sensing is to learn a structured signal $x$ from a limited number of noisy linear measurements $y \\approx Ax$. In traditional compressed sensing, \"structure\" is represented by sparsity in some known basis. Inspired by the success of deep learning in modeling images, recent work starting with~\\cite{BJPD17} has instead considered structure to come from a generative model $G: \\mathbb{R}^k \\to \\mathbb{R}^n$. We present two results establishing the difficulty of this latter task, showing that existing bounds are tight. First, we provide a lower bound matching the~\\cite{BJPD17"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02938","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.02938/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:24:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hxmv7fgXXyBaKlaHRj+jsdVDRnJqPvBox1G2wT+YRPUY7+nEc1ywb796rJEZENIJP8/rlKLmWMoG0i3iiESsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:30:38.448164Z"},"content_sha256":"f77a23efb917921f2e20916d9bbe0b65e4a96ba87ea148f43e99c9238ea99772","schema_version":"1.0","event_id":"sha256:f77a23efb917921f2e20916d9bbe0b65e4a96ba87ea148f43e99c9238ea99772"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFX3M73BH2XXC5U6FM33G52U5L/bundle.json","state_url":"https://pith.science/pith/WFX3M73BH2XXC5U6FM33G52U5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFX3M73BH2XXC5U6FM33G52U5L/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-08-14T02:30:38Z","links":{"resolver":"https://pith.science/pith/WFX3M73BH2XXC5U6FM33G52U5L","bundle":"https://pith.science/pith/WFX3M73BH2XXC5U6FM33G52U5L/bundle.json","state":"https://pith.science/pith/WFX3M73BH2XXC5U6FM33G52U5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFX3M73BH2XXC5U6FM33G52U5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WFX3M73BH2XXC5U6FM33G52U5L","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":"395a7b5c1307e79f23f6f56ea20ddbd72d8f0e3207bc2f9054f6c2e4308a5219","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-06T00:51:51Z","title_canon_sha256":"a205892509e3d892454fa926462771ef27c4717e787ba204af4a4963cac4daf5"},"schema_version":"1.0","source":{"id":"1912.02938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.02938","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"arxiv_version","alias_value":"1912.02938v1","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.02938","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"pith_short_12","alias_value":"WFX3M73BH2XX","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"pith_short_16","alias_value":"WFX3M73BH2XXC5U6","created_at":"2026-07-05T00:24:19Z"},{"alias_kind":"pith_short_8","alias_value":"WFX3M73B","created_at":"2026-07-05T00:24:19Z"}],"graph_snapshots":[{"event_id":"sha256:f77a23efb917921f2e20916d9bbe0b65e4a96ba87ea148f43e99c9238ea99772","target":"graph","created_at":"2026-07-05T00:24:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.02938/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of compressed sensing is to learn a structured signal $x$ from a limited number of noisy linear measurements $y \\approx Ax$. In traditional compressed sensing, \"structure\" is represented by sparsity in some known basis. Inspired by the success of deep learning in modeling images, recent work starting with~\\cite{BJPD17} has instead considered structure to come from a generative model $G: \\mathbb{R}^k \\to \\mathbb{R}^n$. We present two results establishing the difficulty of this latter task, showing that existing bounds are tight. First, we provide a lower bound matching the~\\cite{BJPD17","authors_text":"Akshay Kamath, Eric Price, Sushrut Karmalkar","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-06T00:51:51Z","title":"Lower Bounds for Compressed Sensing with Generative Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.02938","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:659f2c1bf1bda54def0a0263d1c45a3defb6b5289ff2be14016c64feae9cac23","target":"record","created_at":"2026-07-05T00:24:19Z","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":"395a7b5c1307e79f23f6f56ea20ddbd72d8f0e3207bc2f9054f6c2e4308a5219","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-12-06T00:51:51Z","title_canon_sha256":"a205892509e3d892454fa926462771ef27c4717e787ba204af4a4963cac4daf5"},"schema_version":"1.0","source":{"id":"1912.02938","kind":"arxiv","version":1}},"canonical_sha256":"b16fb67f613eaf71769e2b37b37754eaf7bf93d9939721a57d3ae9aa9b1c5173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b16fb67f613eaf71769e2b37b37754eaf7bf93d9939721a57d3ae9aa9b1c5173","first_computed_at":"2026-07-05T00:24:19.730945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:24:19.730945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dzzHiJFDjwy+QvnvLCrw54o18NAhjJXL1IkmV8pC2vmunE1VxtGG5ii3A3qr4gc1C14UCQAJgNHRKPXCxVp/Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:24:19.731288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.02938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:659f2c1bf1bda54def0a0263d1c45a3defb6b5289ff2be14016c64feae9cac23","sha256:f77a23efb917921f2e20916d9bbe0b65e4a96ba87ea148f43e99c9238ea99772"],"state_sha256":"765ce271be2348d9290c8eec6a287d261391fb7fa32d7db64fb62ac10deeea42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt/ZTLFBTpeTLPgeGt21I6xnFSEzzxSeP5xg7QpRfCCbbba8uVkX32Jbue/O7PFkSYUIrDkPqv/ZS+8vk5a9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:30:38.453740Z","bundle_sha256":"17443b6753c4684d8dc05b0fbdaed67b94e1b462ecceab83744147d87973aa0c"}}