{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3Q4E6DJD74ISQGADPG57WFHV4L","short_pith_number":"pith:3Q4E6DJD","canonical_record":{"source":{"id":"1812.04176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T01:25:04Z","cross_cats_sorted":[],"title_canon_sha256":"a9d17ef1828fdb2358dfcf5f527308d5d648dca93b5450f03e3acf0f2a73d3b2","abstract_canon_sha256":"b84ee39ae8d64899fc19659119fdf46521a1f4c7b9b675f29d6b39f963592ff8"},"schema_version":"1.0"},"canonical_sha256":"dc384f0d23ff1128180379bbfb14f5e2c852e57f287f87799b3666ec363c8238","source":{"kind":"arxiv","id":"1812.04176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04176","created_at":"2026-05-17T23:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04176v1","created_at":"2026-05-17T23:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04176","created_at":"2026-05-17T23:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"3Q4E6DJD74IS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3Q4E6DJD74ISQGAD","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3Q4E6DJD","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3Q4E6DJD74ISQGADPG57WFHV4L","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T01:25:04Z","cross_cats_sorted":[],"title_canon_sha256":"a9d17ef1828fdb2358dfcf5f527308d5d648dca93b5450f03e3acf0f2a73d3b2","abstract_canon_sha256":"b84ee39ae8d64899fc19659119fdf46521a1f4c7b9b675f29d6b39f963592ff8"},"schema_version":"1.0"},"canonical_sha256":"dc384f0d23ff1128180379bbfb14f5e2c852e57f287f87799b3666ec363c8238","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:35.332194Z","signature_b64":"VZ5IRWhBGzMS/AWzs3XBnRMunS7LO0nGlhrQbk7Lz03LSm5wAkwGk2dfcNEPOfelf+hYmkm2V9OzUcowLtXbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc384f0d23ff1128180379bbfb14f5e2c852e57f287f87799b3666ec363c8238","last_reissued_at":"2026-05-17T23:58:35.331534Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:35.331534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04176","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-17T23:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6nh43JrfpOPZ1OJMTPt3QX3Ej+KxUlt5diKfdWrxcmYEL4a6lc9Mk0Br+C8zNy3lkEThsdppj7b6ZsJYk6YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:53:30.727063Z"},"content_sha256":"abb2a229df0006ea5dab867c0b0f1f44646790d1f6fd8d6d851f18204bf62f76","schema_version":"1.0","event_id":"sha256:abb2a229df0006ea5dab867c0b0f1f44646790d1f6fd8d6d851f18204bf62f76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3Q4E6DJD74ISQGADPG57WFHV4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Provably Convergent Scheme for Compressive Sensing under Random Generative Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Paul Hand, Reinhard Heckel, Vladislav Voroninski, Wen Huang","submitted_at":"2018-12-11T01:25:04Z","abstract_excerpt":"Deep generative modeling has led to new and state of the art approaches for enforcing structural priors in a variety of inverse problems. In contrast to priors given by sparsity, deep models can provide direct low-dimensional parameterizations of the manifold of images or signals belonging to a particular natural class, allowing for recovery algorithms to be posed in a low-dimensional space. This dimensionality may even be lower than the sparsity level of the same signals when viewed in a fixed basis. What is not known about these methods is whether there are computationally efficient algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04176","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-17T23:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbyqKNSqf3u4OZ5P4lU+gprtzOXXXJA5rSpH4qA7jGRd8bbmsULFqIu9QI0+pM1Yx+LNdJ6M+6ZYTJDVBvs2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:53:30.727426Z"},"content_sha256":"b7f67baca87b04dbecb0562a0e56b5283278f9948d12b3ce00106df88286c1f6","schema_version":"1.0","event_id":"sha256:b7f67baca87b04dbecb0562a0e56b5283278f9948d12b3ce00106df88286c1f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Q4E6DJD74ISQGADPG57WFHV4L/bundle.json","state_url":"https://pith.science/pith/3Q4E6DJD74ISQGADPG57WFHV4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Q4E6DJD74ISQGADPG57WFHV4L/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-01T11:53:30Z","links":{"resolver":"https://pith.science/pith/3Q4E6DJD74ISQGADPG57WFHV4L","bundle":"https://pith.science/pith/3Q4E6DJD74ISQGADPG57WFHV4L/bundle.json","state":"https://pith.science/pith/3Q4E6DJD74ISQGADPG57WFHV4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Q4E6DJD74ISQGADPG57WFHV4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3Q4E6DJD74ISQGADPG57WFHV4L","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":"b84ee39ae8d64899fc19659119fdf46521a1f4c7b9b675f29d6b39f963592ff8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T01:25:04Z","title_canon_sha256":"a9d17ef1828fdb2358dfcf5f527308d5d648dca93b5450f03e3acf0f2a73d3b2"},"schema_version":"1.0","source":{"id":"1812.04176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04176","created_at":"2026-05-17T23:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04176v1","created_at":"2026-05-17T23:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04176","created_at":"2026-05-17T23:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"3Q4E6DJD74IS","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3Q4E6DJD74ISQGAD","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3Q4E6DJD","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:b7f67baca87b04dbecb0562a0e56b5283278f9948d12b3ce00106df88286c1f6","target":"graph","created_at":"2026-05-17T23:58:35Z","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":"Deep generative modeling has led to new and state of the art approaches for enforcing structural priors in a variety of inverse problems. In contrast to priors given by sparsity, deep models can provide direct low-dimensional parameterizations of the manifold of images or signals belonging to a particular natural class, allowing for recovery algorithms to be posed in a low-dimensional space. This dimensionality may even be lower than the sparsity level of the same signals when viewed in a fixed basis. What is not known about these methods is whether there are computationally efficient algorith","authors_text":"Paul Hand, Reinhard Heckel, Vladislav Voroninski, Wen Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T01:25:04Z","title":"A Provably Convergent Scheme for Compressive Sensing under Random Generative Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04176","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:abb2a229df0006ea5dab867c0b0f1f44646790d1f6fd8d6d851f18204bf62f76","target":"record","created_at":"2026-05-17T23:58:35Z","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":"b84ee39ae8d64899fc19659119fdf46521a1f4c7b9b675f29d6b39f963592ff8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-11T01:25:04Z","title_canon_sha256":"a9d17ef1828fdb2358dfcf5f527308d5d648dca93b5450f03e3acf0f2a73d3b2"},"schema_version":"1.0","source":{"id":"1812.04176","kind":"arxiv","version":1}},"canonical_sha256":"dc384f0d23ff1128180379bbfb14f5e2c852e57f287f87799b3666ec363c8238","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc384f0d23ff1128180379bbfb14f5e2c852e57f287f87799b3666ec363c8238","first_computed_at":"2026-05-17T23:58:35.331534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:35.331534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZ5IRWhBGzMS/AWzs3XBnRMunS7LO0nGlhrQbk7Lz03LSm5wAkwGk2dfcNEPOfelf+hYmkm2V9OzUcowLtXbAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:35.332194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb2a229df0006ea5dab867c0b0f1f44646790d1f6fd8d6d851f18204bf62f76","sha256:b7f67baca87b04dbecb0562a0e56b5283278f9948d12b3ce00106df88286c1f6"],"state_sha256":"319f63827e7b1602a00601e6e15f02020048823f4603cb25af0e12d9866c3808"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhIQ+nSqALjTJQU4Zi4cClATG0o4XCvBVhveBBef2WgJTqPY/pxh5DNm4Do6Jnm9VYuWTYe1jH00tfGTgXNMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:53:30.729522Z","bundle_sha256":"c5c3bd5e5af388b7d5589490c42d64c4de4702c8c332fe018d645c5746ca8cc0"}}