{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NLML74W2YRK5TLDG3YCJ7VUW2J","short_pith_number":"pith:NLML74W2","schema_version":"1.0","canonical_sha256":"6ad8bff2dac455d9ac66de049fd696d256872bd788bac29b9b1440ac12b768ba","source":{"kind":"arxiv","id":"1812.06719","version":1},"attestation_state":"computed","paper":{"title":"Robust one-bit compressed sensing with partial circulant matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Shahar Mendelson, Sjoerd Dirksen","submitted_at":"2018-12-17T11:54:35Z","abstract_excerpt":"We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly sub-sampled circulant matrix) and is robust to analog pre-quantization noise as well as to adversarial bit corruptions in the quantization process. Our results imply that quantization is not a statistically expensive procedure in the presence of nontrivial analog noise: recovery requires the same sample size one would have needed had the measurement matrix been Gaussian and the noisy analog measurements been given as data."},"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":"1812.06719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T11:54:35Z","cross_cats_sorted":["eess.SP","math.IT","math.PR"],"title_canon_sha256":"8c9ffe18897e8432aa1a0f51e932b7b7527f9c2fdc81e694276f61e49682dabe","abstract_canon_sha256":"20705f027758f3ea28db187ee18d323a441dfba8d291884350b51c6cdb0d06f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.484550Z","signature_b64":"f+pKQ4HY7KvJ5lExPVEX8A/j1qmghB0vddeo8RkdCe85VmSg8R6VZ4qOdnCH1ff4gfLDY6brDNZMphJnk0fQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad8bff2dac455d9ac66de049fd696d256872bd788bac29b9b1440ac12b768ba","last_reissued_at":"2026-05-17T23:58:09.483971Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.483971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust one-bit compressed sensing with partial circulant matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Shahar Mendelson, Sjoerd Dirksen","submitted_at":"2018-12-17T11:54:35Z","abstract_excerpt":"We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly sub-sampled circulant matrix) and is robust to analog pre-quantization noise as well as to adversarial bit corruptions in the quantization process. Our results imply that quantization is not a statistically expensive procedure in the presence of nontrivial analog noise: recovery requires the same sample size one would have needed had the measurement matrix been Gaussian and the noisy analog measurements been given as data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06719","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":"1812.06719","created_at":"2026-05-17T23:58:09.484046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06719v1","created_at":"2026-05-17T23:58:09.484046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06719","created_at":"2026-05-17T23:58:09.484046+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLML74W2YRK5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLML74W2YRK5TLDG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLML74W2","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05368","citing_title":"Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J","json":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J.json","graph_json":"https://pith.science/api/pith-number/NLML74W2YRK5TLDG3YCJ7VUW2J/graph.json","events_json":"https://pith.science/api/pith-number/NLML74W2YRK5TLDG3YCJ7VUW2J/events.json","paper":"https://pith.science/paper/NLML74W2"},"agent_actions":{"view_html":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J","download_json":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J.json","view_paper":"https://pith.science/paper/NLML74W2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06719&json=true","fetch_graph":"https://pith.science/api/pith-number/NLML74W2YRK5TLDG3YCJ7VUW2J/graph.json","fetch_events":"https://pith.science/api/pith-number/NLML74W2YRK5TLDG3YCJ7VUW2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J/action/storage_attestation","attest_author":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J/action/author_attestation","sign_citation":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J/action/citation_signature","submit_replication":"https://pith.science/pith/NLML74W2YRK5TLDG3YCJ7VUW2J/action/replication_record"}},"created_at":"2026-05-17T23:58:09.484046+00:00","updated_at":"2026-05-17T23:58:09.484046+00:00"}