{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MLVATJBT6OERI4YFZARKTTIOOI","short_pith_number":"pith:MLVATJBT","schema_version":"1.0","canonical_sha256":"62ea09a433f389147305c822a9cd0e7217d0e795e095df910423fcf792a37a29","source":{"kind":"arxiv","id":"1805.09409","version":2},"attestation_state":"computed","paper":{"title":"Non-Gaussian Hyperplane Tessellations and Robust One-Bit Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Shahar Mendelson, Sjoerd Dirksen","submitted_at":"2018-05-23T20:03:23Z","abstract_excerpt":"We show that a tessellation generated by a small number of random affine hyperplanes can be used to approximate Euclidean distances between any two points in an arbitrary bounded set $T$, where the random hyperplanes are generated by subgaussian or heavy-tailed normal vectors and uniformly distributed shifts. We derive quantitative bounds on the number of hyperplanes needed for constructing such tessellations in terms of natural metric complexity measures of $T$ and the desired approximation error. Our work extends significantly prior results in this direction, which were restricted to Gaussia"},"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":"1805.09409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-23T20:03:23Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"c319711f9baf9d2ff4ff7fd949860dd78dc2fff4920a2e5ebfd099edd9769965","abstract_canon_sha256":"dbdcfb1c6e3ad9b6ac2f7edad78c26ad3ef9aa6cb0618191257993c224004b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:20.650531Z","signature_b64":"mUZd1H0QthSyp3gB60ceLo8j2KIqoG9o/wJWI2oVFIviSu//YndxRa3pgr+jnHz01zZwWJ63EgX6y0lnRYasBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ea09a433f389147305c822a9cd0e7217d0e795e095df910423fcf792a37a29","last_reissued_at":"2026-05-18T00:08:20.649909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:20.649909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Gaussian Hyperplane Tessellations and Robust One-Bit Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Shahar Mendelson, Sjoerd Dirksen","submitted_at":"2018-05-23T20:03:23Z","abstract_excerpt":"We show that a tessellation generated by a small number of random affine hyperplanes can be used to approximate Euclidean distances between any two points in an arbitrary bounded set $T$, where the random hyperplanes are generated by subgaussian or heavy-tailed normal vectors and uniformly distributed shifts. We derive quantitative bounds on the number of hyperplanes needed for constructing such tessellations in terms of natural metric complexity measures of $T$ and the desired approximation error. Our work extends significantly prior results in this direction, which were restricted to Gaussia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09409","kind":"arxiv","version":2},"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":"1805.09409","created_at":"2026-05-18T00:08:20.650003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09409v2","created_at":"2026-05-18T00:08:20.650003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09409","created_at":"2026-05-18T00:08:20.650003+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLVATJBT6OER","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLVATJBT6OERI4YF","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLVATJBT","created_at":"2026-05-18T12:32:37.024351+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":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI","json":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI.json","graph_json":"https://pith.science/api/pith-number/MLVATJBT6OERI4YFZARKTTIOOI/graph.json","events_json":"https://pith.science/api/pith-number/MLVATJBT6OERI4YFZARKTTIOOI/events.json","paper":"https://pith.science/paper/MLVATJBT"},"agent_actions":{"view_html":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI","download_json":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI.json","view_paper":"https://pith.science/paper/MLVATJBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09409&json=true","fetch_graph":"https://pith.science/api/pith-number/MLVATJBT6OERI4YFZARKTTIOOI/graph.json","fetch_events":"https://pith.science/api/pith-number/MLVATJBT6OERI4YFZARKTTIOOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI/action/storage_attestation","attest_author":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI/action/author_attestation","sign_citation":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI/action/citation_signature","submit_replication":"https://pith.science/pith/MLVATJBT6OERI4YFZARKTTIOOI/action/replication_record"}},"created_at":"2026-05-18T00:08:20.650003+00:00","updated_at":"2026-05-18T00:08:20.650003+00:00"}