{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D2XDVL32XKMCB7ZEY47H24DOBG","short_pith_number":"pith:D2XDVL32","schema_version":"1.0","canonical_sha256":"1eae3aaf7aba9820ff24c73e7d706e09b3558ef44d677bf203ea8f19f1ba5f1d","source":{"kind":"arxiv","id":"1408.1789","version":3},"attestation_state":"computed","paper":{"title":"Dimension reduction techniques for $\\ell_p$, $1 \\le p \\le 2$, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lee-Ad Gottlieb, Yair Bartal","submitted_at":"2014-08-08T09:08:48Z","abstract_excerpt":"For Euclidean space ($\\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\\ell_p$ spaces $1 \\le p \\le 2$. Although strong lower bounds are known for dimension reduction in $\\ell_1$, Ostrovsky and Rabani successfully circumvented these by presenting an $\\ell_1$ embedding that maintains fidelity in only a bounded distance range, with applications to clustering and nearest neighbor search. However, their embedding techniques are specific to $\\ell_1$ and do n"},"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":"1408.1789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-08T09:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"6ebd4ed27f5f9c85b7a00c168251848ffb88abb7a6e78d6b0fc7b07c1250bfd5","abstract_canon_sha256":"f722207e9ddeefae74867cafd0b29338250d5867891cfcfc349c6ad52e1a73b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:16.179188Z","signature_b64":"saJr57RTdbV8+hgP8p8fy0404n8dU3XdbxvT1XqpTiv3rTXrXvMvUHG+JV3FkA6ASxRAFKqqTs6DQIEEEQjJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eae3aaf7aba9820ff24c73e7d706e09b3558ef44d677bf203ea8f19f1ba5f1d","last_reissued_at":"2026-05-18T01:25:16.178662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:16.178662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dimension reduction techniques for $\\ell_p$, $1 \\le p \\le 2$, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lee-Ad Gottlieb, Yair Bartal","submitted_at":"2014-08-08T09:08:48Z","abstract_excerpt":"For Euclidean space ($\\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\\ell_p$ spaces $1 \\le p \\le 2$. Although strong lower bounds are known for dimension reduction in $\\ell_1$, Ostrovsky and Rabani successfully circumvented these by presenting an $\\ell_1$ embedding that maintains fidelity in only a bounded distance range, with applications to clustering and nearest neighbor search. However, their embedding techniques are specific to $\\ell_1$ and do n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1789","kind":"arxiv","version":3},"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":"1408.1789","created_at":"2026-05-18T01:25:16.178745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1789v3","created_at":"2026-05-18T01:25:16.178745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1789","created_at":"2026-05-18T01:25:16.178745+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2XDVL32XKMC","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2XDVL32XKMCB7ZE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2XDVL32","created_at":"2026-05-18T12:28:25.294606+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/D2XDVL32XKMCB7ZEY47H24DOBG","json":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG.json","graph_json":"https://pith.science/api/pith-number/D2XDVL32XKMCB7ZEY47H24DOBG/graph.json","events_json":"https://pith.science/api/pith-number/D2XDVL32XKMCB7ZEY47H24DOBG/events.json","paper":"https://pith.science/paper/D2XDVL32"},"agent_actions":{"view_html":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG","download_json":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG.json","view_paper":"https://pith.science/paper/D2XDVL32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1789&json=true","fetch_graph":"https://pith.science/api/pith-number/D2XDVL32XKMCB7ZEY47H24DOBG/graph.json","fetch_events":"https://pith.science/api/pith-number/D2XDVL32XKMCB7ZEY47H24DOBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG/action/storage_attestation","attest_author":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG/action/author_attestation","sign_citation":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG/action/citation_signature","submit_replication":"https://pith.science/pith/D2XDVL32XKMCB7ZEY47H24DOBG/action/replication_record"}},"created_at":"2026-05-18T01:25:16.178745+00:00","updated_at":"2026-05-18T01:25:16.178745+00:00"}