{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OCF7PYXZOIUZW7TN52DTWFW2PL","short_pith_number":"pith:OCF7PYXZ","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"},"canonical_sha256":"708bf7e2f972299b7e6dee873b16da7ad2353f4d764a16f7c2b7c783a87b6b38","source":{"kind":"arxiv","id":"1908.05368","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05368","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05368v3","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05368","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"OCF7PYXZOIUZ","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"pith_short_16","alias_value":"OCF7PYXZOIUZW7TN","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"pith_short_8","alias_value":"OCF7PYXZ","created_at":"2026-07-05T01:29:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OCF7PYXZOIUZW7TN52DTWFW2PL","target":"record","payload":{"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"},"canonical_sha256":"708bf7e2f972299b7e6dee873b16da7ad2353f4d764a16f7c2b7c783a87b6b38","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"},"source_kind":"arxiv","source_id":"1908.05368","source_version":3,"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-05T01:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFwfy2XF/SLipwYRBxFCyiScCHKGeKWHHv80E31AqYzJvBGCxNVCY4wLPRpDD/dXAgywpxkTGoRK2wqEOPc8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:46:30.983955Z"},"content_sha256":"ff7163fd33ec1d5d8d67b3bc34f78cab6ba29c3baae363719799d75b10e7f540","schema_version":"1.0","event_id":"sha256:ff7163fd33ec1d5d8d67b3bc34f78cab6ba29c3baae363719799d75b10e7f540"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OCF7PYXZOIUZW7TN52DTWFW2PL","target":"graph","payload":{"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"},"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-05T01:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1NjmajEROgbYSzUoGxVl1Q/ZOlT4V6LAmyOhudVFCHhYdwcMNZBD7URx2OppLLA96a/K2PyotC12jJZrMM9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:46:30.984461Z"},"content_sha256":"0af6fe4fc6b32a55ce93e58f418bf50524d19ee46262014bc8fe849d155636c6","schema_version":"1.0","event_id":"sha256:0af6fe4fc6b32a55ce93e58f418bf50524d19ee46262014bc8fe849d155636c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/bundle.json","state_url":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/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-16T04:46:30Z","links":{"resolver":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL","bundle":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/bundle.json","state":"https://pith.science/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCF7PYXZOIUZW7TN52DTWFW2PL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OCF7PYXZOIUZW7TN52DTWFW2PL","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":"abee5dfb90bdd143c6f07dc6a59a72e365a0f81bdebdc8ebc69ad3b909dbfc70","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-14T22:56:34Z","title_canon_sha256":"6c693e70e861421395c166e2f970c4a005dee22595399c1280871366aa28d7a4"},"schema_version":"1.0","source":{"id":"1908.05368","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05368","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05368v3","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05368","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"OCF7PYXZOIUZ","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"pith_short_16","alias_value":"OCF7PYXZOIUZW7TN","created_at":"2026-07-05T01:29:00Z"},{"alias_kind":"pith_short_8","alias_value":"OCF7PYXZ","created_at":"2026-07-05T01:29:00Z"}],"graph_snapshots":[{"event_id":"sha256:0af6fe4fc6b32a55ce93e58f418bf50524d19ee46262014bc8fe849d155636c6","target":"graph","created_at":"2026-07-05T01:29:00Z","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/1908.05368/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Shuang Qiu, Xiaohan Wei, Zhuoran Yang","cross_cats":["cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-14T22:56:34Z","title":"Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05368","kind":"arxiv","version":3},"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:ff7163fd33ec1d5d8d67b3bc34f78cab6ba29c3baae363719799d75b10e7f540","target":"record","created_at":"2026-07-05T01:29:00Z","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":"abee5dfb90bdd143c6f07dc6a59a72e365a0f81bdebdc8ebc69ad3b909dbfc70","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-14T22:56:34Z","title_canon_sha256":"6c693e70e861421395c166e2f970c4a005dee22595399c1280871366aa28d7a4"},"schema_version":"1.0","source":{"id":"1908.05368","kind":"arxiv","version":3}},"canonical_sha256":"708bf7e2f972299b7e6dee873b16da7ad2353f4d764a16f7c2b7c783a87b6b38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"708bf7e2f972299b7e6dee873b16da7ad2353f4d764a16f7c2b7c783a87b6b38","first_computed_at":"2026-07-05T01:29:00.558731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:29:00.558731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9+K9s02oXJCfWC5Et1JANWysEWDuWiiEjr37pTnKcwpjxroN24Rc5bZrFe2ZWHYPBBDxugH+yWrZG+z3eF9BBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:29:00.559182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05368","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff7163fd33ec1d5d8d67b3bc34f78cab6ba29c3baae363719799d75b10e7f540","sha256:0af6fe4fc6b32a55ce93e58f418bf50524d19ee46262014bc8fe849d155636c6"],"state_sha256":"7b6738dd17ad6aeb12b270cc4093f7e66183c534f4023ac527580ddaf9f8545e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lkBiagWJXQ039H13bc+skAu9ZlvL6A9X1fu8qNdQ6U1mCPLgF1z1MTa/6LcPtJKU/tGn6J9UxMOI/2EajpDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:46:30.988364Z","bundle_sha256":"3b96e50c2255b96be9d76ddbfb2dead74887758df696a121bccd8721580d541b"}}