{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OCF7PYXZOIUZW7TN52DTWFW2PL","short_pith_number":"pith:OCF7PYXZ","schema_version":"1.0","canonical_sha256":"708bf7e2f972299b7e6dee873b16da7ad2353f4d764a16f7c2b7c783a87b6b38","source":{"kind":"arxiv","id":"1908.05368","version":3},"attestation_state":"computed","paper":{"title":"Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Shuang Qiu, Xiaohan Wei, Zhuoran Yang","submitted_at":"2019-08-14T22:56:34Z","abstract_excerpt":"We study the robust one-bit compressed sensing problem whose goal is to design an algorithm that faithfully recovers any sparse target vector $\\theta_0\\in\\mathbb{R}^d$ \\textit{uniformly} via $m$ quantized noisy measurements. Specifically, we consider a new framework for this problem where the sparsity is implicitly enforced via mapping a low dimensional representation $x_0 \\in \\mathbb{R}^k$ through a known $n$-layer ReLU generative network $G:\\mathbb{R}^k\\rightarrow\\mathbb{R}^d$ such that $\\theta_0 = G(x_0)$. Such a framework poses low-dimensional priors on $\\theta_0$ without a known sparsity "},"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":"1908.05368","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-14T22:56:34Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"6c693e70e861421395c166e2f970c4a005dee22595399c1280871366aa28d7a4","abstract_canon_sha256":"abee5dfb90bdd143c6f07dc6a59a72e365a0f81bdebdc8ebc69ad3b909dbfc70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:29:00.559182Z","signature_b64":"9+K9s02oXJCfWC5Et1JANWysEWDuWiiEjr37pTnKcwpjxroN24Rc5bZrFe2ZWHYPBBDxugH+yWrZG+z3eF9BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"708bf7e2f972299b7e6dee873b16da7ad2353f4d764a16f7c2b7c783a87b6b38","last_reissued_at":"2026-07-05T01:29:00.558731Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:29:00.558731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Shuang Qiu, Xiaohan Wei, Zhuoran Yang","submitted_at":"2019-08-14T22:56:34Z","abstract_excerpt":"We study the robust one-bit compressed sensing problem whose goal is to design an algorithm that faithfully recovers any sparse target vector $\\theta_0\\in\\mathbb{R}^d$ \\textit{uniformly} via $m$ quantized noisy measurements. Specifically, we consider a new framework for this problem where the sparsity is implicitly enforced via mapping a low dimensional representation $x_0 \\in \\mathbb{R}^k$ through a known $n$-layer ReLU generative network $G:\\mathbb{R}^k\\rightarrow\\mathbb{R}^d$ such that $\\theta_0 = G(x_0)$. Such a framework poses low-dimensional priors on $\\theta_0$ without a known sparsity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05368","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/1908.05368/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":"1908.05368","created_at":"2026-07-05T01:29:00.558792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05368v3","created_at":"2026-07-05T01:29:00.558792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05368","created_at":"2026-07-05T01:29:00.558792+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCF7PYXZOIUZ","created_at":"2026-07-05T01:29:00.558792+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCF7PYXZOIUZW7TN","created_at":"2026-07-05T01:29:00.558792+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCF7PYXZ","created_at":"2026-07-05T01:29:00.558792+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/OCF7PYXZOIUZW7TN52DTWFW2PL","json":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL.json","graph_json":"https://pith.science/api/pith-number/OCF7PYXZOIUZW7TN52DTWFW2PL/graph.json","events_json":"https://pith.science/api/pith-number/OCF7PYXZOIUZW7TN52DTWFW2PL/events.json","paper":"https://pith.science/paper/OCF7PYXZ"},"agent_actions":{"view_html":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL","download_json":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL.json","view_paper":"https://pith.science/paper/OCF7PYXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05368&json=true","fetch_graph":"https://pith.science/api/pith-number/OCF7PYXZOIUZW7TN52DTWFW2PL/graph.json","fetch_events":"https://pith.science/api/pith-number/OCF7PYXZOIUZW7TN52DTWFW2PL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/action/storage_attestation","attest_author":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/action/author_attestation","sign_citation":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/action/citation_signature","submit_replication":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/action/replication_record"}},"created_at":"2026-07-05T01:29:00.558792+00:00","updated_at":"2026-07-05T01:29:00.558792+00:00"}