{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JI3P3ZZZVRB434MGFYX3F64KCD","short_pith_number":"pith:JI3P3ZZZ","schema_version":"1.0","canonical_sha256":"4a36fde739ac43cdf1862e2fb2fb8a10e1387d86b6908d7345ff1b03eb559ce5","source":{"kind":"arxiv","id":"1711.01206","version":1},"attestation_state":"computed","paper":{"title":"Robust Decoding from 1-Bit Compressive Sampling with Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.NA","authors_text":"Jian Huang, Liping Zhu, Xiliang Lu, Yuling Jiao","submitted_at":"2017-11-03T15:22:23Z","abstract_excerpt":"In 1-bit compressive sensing (1-bit CS) where target signal is coded into a binary measurement, one goal is to recover the signal from noisy and quantized samples. Mathematically, the 1-bit CS model reads: $y = \\eta \\odot\\textrm{sign} (\\Psi x^* + \\epsilon)$, where $x^{*}\\in \\mathcal{R}^{n}, y\\in \\mathcal{R}^{m}$, $\\Psi \\in \\mathcal{R}^{m\\times n}$, and $\\epsilon$ is the random error before quantization and $\\eta\\in \\mathcal{R}^{n}$ is a random vector modeling the sign flips. Due to the presence of nonlinearity, noise and sign flips, it is quite challenging to decode from the 1-bit CS. In this "},"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":"1711.01206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-03T15:22:23Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"395e20a352b8a736b7ad5dd8fbd8896876df1faa60caaba479a854f9d0f4ff3d","abstract_canon_sha256":"424988810a72ee844dc3532c5ec702316101cd032cf624b307810152239c4082"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.166863Z","signature_b64":"FEe9ScWYbXOM2TXOAP1sj9zCkBGiAhvQWjPyk2Of8SC67M5d1mKYYTovhd3V1BWg8w4nvxiU9is6oLNTTOtbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a36fde739ac43cdf1862e2fb2fb8a10e1387d86b6908d7345ff1b03eb559ce5","last_reissued_at":"2026-05-18T00:31:23.166242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.166242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Decoding from 1-Bit Compressive Sampling with Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.NA","authors_text":"Jian Huang, Liping Zhu, Xiliang Lu, Yuling Jiao","submitted_at":"2017-11-03T15:22:23Z","abstract_excerpt":"In 1-bit compressive sensing (1-bit CS) where target signal is coded into a binary measurement, one goal is to recover the signal from noisy and quantized samples. Mathematically, the 1-bit CS model reads: $y = \\eta \\odot\\textrm{sign} (\\Psi x^* + \\epsilon)$, where $x^{*}\\in \\mathcal{R}^{n}, y\\in \\mathcal{R}^{m}$, $\\Psi \\in \\mathcal{R}^{m\\times n}$, and $\\epsilon$ is the random error before quantization and $\\eta\\in \\mathcal{R}^{n}$ is a random vector modeling the sign flips. Due to the presence of nonlinearity, noise and sign flips, it is quite challenging to decode from the 1-bit CS. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01206","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01206","created_at":"2026-05-18T00:31:23.166328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01206v1","created_at":"2026-05-18T00:31:23.166328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01206","created_at":"2026-05-18T00:31:23.166328+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI3P3ZZZVRB4","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI3P3ZZZVRB434MG","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI3P3ZZZ","created_at":"2026-05-18T12:31:24.725408+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/JI3P3ZZZVRB434MGFYX3F64KCD","json":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD.json","graph_json":"https://pith.science/api/pith-number/JI3P3ZZZVRB434MGFYX3F64KCD/graph.json","events_json":"https://pith.science/api/pith-number/JI3P3ZZZVRB434MGFYX3F64KCD/events.json","paper":"https://pith.science/paper/JI3P3ZZZ"},"agent_actions":{"view_html":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD","download_json":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD.json","view_paper":"https://pith.science/paper/JI3P3ZZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01206&json=true","fetch_graph":"https://pith.science/api/pith-number/JI3P3ZZZVRB434MGFYX3F64KCD/graph.json","fetch_events":"https://pith.science/api/pith-number/JI3P3ZZZVRB434MGFYX3F64KCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD/action/storage_attestation","attest_author":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD/action/author_attestation","sign_citation":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD/action/citation_signature","submit_replication":"https://pith.science/pith/JI3P3ZZZVRB434MGFYX3F64KCD/action/replication_record"}},"created_at":"2026-05-18T00:31:23.166328+00:00","updated_at":"2026-05-18T00:31:23.166328+00:00"}