{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PCTYEQVHGPQSYULEFCIXHSKBFU","short_pith_number":"pith:PCTYEQVH","schema_version":"1.0","canonical_sha256":"78a78242a733e12c5164289173c9412d36e31b4f784dc3597861e3d4ae245d97","source":{"kind":"arxiv","id":"1512.04433","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.FA"],"primary_cat":"cs.LG","authors_text":"Ben Recht, Samet Oymak","submitted_at":"2015-12-14T17:57:41Z","abstract_excerpt":"We study embedding a subset $K$ of the unit sphere to the Hamming cube $\\{-1,+1\\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\\omega(K)$ of the set. For subspaces and several structured sets we show that Gaussian maps provide the optimal tradeoff $m\\sim \\delta^{-2}\\omega^2(K)$, in particular for $\\delta$ distortion one needs $m\\approx\\delta^{-2}{d}$ where $d$ is the subspace dimension. For general sets, we provide sharp characterizations which reduces to $m\\approx{\\delta^{-4}}{\\omega^2(K)}$ after simplification. We provide impro"},"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":"1512.04433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-14T17:57:41Z","cross_cats_sorted":["cs.DS","math.FA"],"title_canon_sha256":"242023bf76874051505682e6c6c566471b56765398c2484200688b75e48f3acb","abstract_canon_sha256":"b0ba00e41119279f1e6d907f999909633d2941edb37410aca4d505372a2da6b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:22.262083Z","signature_b64":"BHn/juZ6P8e3Gn/lx7uGkLmM+6xnPw5iNFK3Z4JIcr+EVVUd9UeqS4dpvmf2zUaz1VceuBrdnwoJwyyeH/zcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a78242a733e12c5164289173c9412d36e31b4f784dc3597861e3d4ae245d97","last_reissued_at":"2026-05-18T01:24:22.261479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:22.261479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.FA"],"primary_cat":"cs.LG","authors_text":"Ben Recht, Samet Oymak","submitted_at":"2015-12-14T17:57:41Z","abstract_excerpt":"We study embedding a subset $K$ of the unit sphere to the Hamming cube $\\{-1,+1\\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\\omega(K)$ of the set. For subspaces and several structured sets we show that Gaussian maps provide the optimal tradeoff $m\\sim \\delta^{-2}\\omega^2(K)$, in particular for $\\delta$ distortion one needs $m\\approx\\delta^{-2}{d}$ where $d$ is the subspace dimension. For general sets, we provide sharp characterizations which reduces to $m\\approx{\\delta^{-4}}{\\omega^2(K)}$ after simplification. We provide impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04433","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":"1512.04433","created_at":"2026-05-18T01:24:22.261558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04433v1","created_at":"2026-05-18T01:24:22.261558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04433","created_at":"2026-05-18T01:24:22.261558+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCTYEQVHGPQS","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCTYEQVHGPQSYULE","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCTYEQVH","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.06750","citing_title":"Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2408.06275","citing_title":"Robust Instance Optimal Phase-Only Compressed Sensing","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20075","citing_title":"Robust Uniform Recovery of Structured Signals from Nonlinear Observations","ref_index":223,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU","json":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU.json","graph_json":"https://pith.science/api/pith-number/PCTYEQVHGPQSYULEFCIXHSKBFU/graph.json","events_json":"https://pith.science/api/pith-number/PCTYEQVHGPQSYULEFCIXHSKBFU/events.json","paper":"https://pith.science/paper/PCTYEQVH"},"agent_actions":{"view_html":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU","download_json":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU.json","view_paper":"https://pith.science/paper/PCTYEQVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04433&json=true","fetch_graph":"https://pith.science/api/pith-number/PCTYEQVHGPQSYULEFCIXHSKBFU/graph.json","fetch_events":"https://pith.science/api/pith-number/PCTYEQVHGPQSYULEFCIXHSKBFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU/action/storage_attestation","attest_author":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU/action/author_attestation","sign_citation":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU/action/citation_signature","submit_replication":"https://pith.science/pith/PCTYEQVHGPQSYULEFCIXHSKBFU/action/replication_record"}},"created_at":"2026-05-18T01:24:22.261558+00:00","updated_at":"2026-05-18T01:24:22.261558+00:00"}