{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NK57OQFOPWRZ7TXL23MTOYRYAH","short_pith_number":"pith:NK57OQFO","schema_version":"1.0","canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","source":{"kind":"arxiv","id":"2002.01697","version":3},"attestation_state":"computed","paper":{"title":"Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Avtansh Tiwari, Jonathan Scarlett, Selwyn Gomes, Zhaoqiang Liu","submitted_at":"2020-02-05T09:44:10Z","abstract_excerpt":"The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive sensing with generative models, where a generative modeling assumption replaces the usual sparsity assumption, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.~Gaussian measurements and a Lipschitz continuous generati"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2002.01697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T09:44:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"65cdd6b37022b9bd27c4cf1d6fe8ae12439091669cb629636002687161713140","abstract_canon_sha256":"b3129556d0c05e90a646311ca38beaca2c64db75fa565b81bf9a8c6631bd6012"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:45.020649Z","signature_b64":"yk2HUDcUOstxGaa8XEWhQ6fh8WaK4FzhPQeiB5J0y20XI/vT24CH5cDMPZD+AodpPFJh3zV/LriHRXeq0dU+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","last_reissued_at":"2026-07-05T01:11:45.020259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:45.020259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Avtansh Tiwari, Jonathan Scarlett, Selwyn Gomes, Zhaoqiang Liu","submitted_at":"2020-02-05T09:44:10Z","abstract_excerpt":"The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive sensing with generative models, where a generative modeling assumption replaces the usual sparsity assumption, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.~Gaussian measurements and a Lipschitz continuous generati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01697","kind":"arxiv","version":3},"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/2002.01697/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2002.01697","created_at":"2026-07-05T01:11:45.020312+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.01697v3","created_at":"2026-07-05T01:11:45.020312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01697","created_at":"2026-07-05T01:11:45.020312+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK57OQFOPWRZ","created_at":"2026-07-05T01:11:45.020312+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK57OQFOPWRZ7TXL","created_at":"2026-07-05T01:11:45.020312+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK57OQFO","created_at":"2026-07-05T01:11:45.020312+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH","json":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH.json","graph_json":"https://pith.science/api/pith-number/NK57OQFOPWRZ7TXL23MTOYRYAH/graph.json","events_json":"https://pith.science/api/pith-number/NK57OQFOPWRZ7TXL23MTOYRYAH/events.json","paper":"https://pith.science/paper/NK57OQFO"},"agent_actions":{"view_html":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH","download_json":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH.json","view_paper":"https://pith.science/paper/NK57OQFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.01697&json=true","fetch_graph":"https://pith.science/api/pith-number/NK57OQFOPWRZ7TXL23MTOYRYAH/graph.json","fetch_events":"https://pith.science/api/pith-number/NK57OQFOPWRZ7TXL23MTOYRYAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/action/storage_attestation","attest_author":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/action/author_attestation","sign_citation":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/action/citation_signature","submit_replication":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/action/replication_record"}},"created_at":"2026-07-05T01:11:45.020312+00:00","updated_at":"2026-07-05T01:11:45.020312+00:00"}