{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DSHL2KYBET43A5LVIAY32XGZ3K","short_pith_number":"pith:DSHL2KYB","schema_version":"1.0","canonical_sha256":"1c8ebd2b0124f9b075754031bd5cd9daa5ed2549693844fd8862879d35f24b15","source":{"kind":"arxiv","id":"1801.04414","version":2},"attestation_state":"computed","paper":{"title":"Tight Bounds for $\\ell_p$ Oblivious Subspace Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Ruosong Wang","submitted_at":"2018-01-13T10:40:05Z","abstract_excerpt":"An $\\ell_p$ oblivious subspace embedding is a distribution over $r \\times n$ matrices $\\Pi$ such that for any fixed $n \\times d$ matrix $A$, $$\\Pr_{\\Pi}[\\textrm{for all }x, \\ \\|Ax\\|_p \\leq \\|\\Pi Ax\\|_p \\leq \\kappa \\|Ax\\|_p] \\geq 9/10,$$ where $r$ is the dimension of the embedding, $\\kappa$ is the distortion of the embedding, and for an $n$-dimensional vector $y$, $\\|y\\|_p$ is the $\\ell_p$-norm. Another important property is the sparsity of $\\Pi$, that is, the maximum number of non-zero entries per column, as this determines the running time of computing $\\Pi \\cdot A$. While for $p = 2$ there a"},"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":"1801.04414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-13T10:40:05Z","cross_cats_sorted":[],"title_canon_sha256":"8bee539e0e59e69089ad1f67009caa7855b80f2642eb3f1b73eab6c7f3034b9c","abstract_canon_sha256":"fdf99ec534a36ffb551a45c61d9201df0725444595f26933d9096bc95ca5f41c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:02.636552Z","signature_b64":"rEKCGQqDDGYOqBFh6Ft+L3KlURPAnrOi0jjneOzF0AAa+rUIN/jZk+fQPWlNMMq9hJuTJayaHZ3rZjaqv0PXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8ebd2b0124f9b075754031bd5cd9daa5ed2549693844fd8862879d35f24b15","last_reissued_at":"2026-05-18T00:19:02.635832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:02.635832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for $\\ell_p$ Oblivious Subspace Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Ruosong Wang","submitted_at":"2018-01-13T10:40:05Z","abstract_excerpt":"An $\\ell_p$ oblivious subspace embedding is a distribution over $r \\times n$ matrices $\\Pi$ such that for any fixed $n \\times d$ matrix $A$, $$\\Pr_{\\Pi}[\\textrm{for all }x, \\ \\|Ax\\|_p \\leq \\|\\Pi Ax\\|_p \\leq \\kappa \\|Ax\\|_p] \\geq 9/10,$$ where $r$ is the dimension of the embedding, $\\kappa$ is the distortion of the embedding, and for an $n$-dimensional vector $y$, $\\|y\\|_p$ is the $\\ell_p$-norm. Another important property is the sparsity of $\\Pi$, that is, the maximum number of non-zero entries per column, as this determines the running time of computing $\\Pi \\cdot A$. While for $p = 2$ there a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04414","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":"1801.04414","created_at":"2026-05-18T00:19:02.635967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04414v2","created_at":"2026-05-18T00:19:02.635967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04414","created_at":"2026-05-18T00:19:02.635967+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSHL2KYBET43","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSHL2KYBET43A5LV","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSHL2KYB","created_at":"2026-05-18T12:32:19.392346+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/DSHL2KYBET43A5LVIAY32XGZ3K","json":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K.json","graph_json":"https://pith.science/api/pith-number/DSHL2KYBET43A5LVIAY32XGZ3K/graph.json","events_json":"https://pith.science/api/pith-number/DSHL2KYBET43A5LVIAY32XGZ3K/events.json","paper":"https://pith.science/paper/DSHL2KYB"},"agent_actions":{"view_html":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K","download_json":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K.json","view_paper":"https://pith.science/paper/DSHL2KYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04414&json=true","fetch_graph":"https://pith.science/api/pith-number/DSHL2KYBET43A5LVIAY32XGZ3K/graph.json","fetch_events":"https://pith.science/api/pith-number/DSHL2KYBET43A5LVIAY32XGZ3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K/action/storage_attestation","attest_author":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K/action/author_attestation","sign_citation":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K/action/citation_signature","submit_replication":"https://pith.science/pith/DSHL2KYBET43A5LVIAY32XGZ3K/action/replication_record"}},"created_at":"2026-05-18T00:19:02.635967+00:00","updated_at":"2026-05-18T00:19:02.635967+00:00"}