{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DA7AONECMQ7VUCZJLULLHDJY3V","short_pith_number":"pith:DA7AONEC","schema_version":"1.0","canonical_sha256":"183e073482643f5a0b295d16b38d38dd4fbeeecec0a3975be9a5d10bf1b2b86a","source":{"kind":"arxiv","id":"1706.02768","version":1},"attestation_state":"computed","paper":{"title":"Random projections for linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ky Vu, Leo Liberti, Pierre-Louis Poirion","submitted_at":"2017-06-08T20:56:32Z","abstract_excerpt":"Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known Johnson-Lindenstrauss lemma states that there are random ma- trices with surprisingly few rows that approximately preserve pairwise Euclidean distances among a set of points. This is commonly used to speed up algorithms based on Euclidean distances. We prove that these matrices also preserve other quantities, such as the distance to a cone. We exploit this result to "},"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":"1706.02768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-08T20:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"38c8f5f721e1a3383a413f736c1fd01567cfd2c209db976a49521f72f03875b1","abstract_canon_sha256":"873db9026e35b364e1f661571afcf01ae086549c3bf7a6f3d326c265aa39bf20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:41.018323Z","signature_b64":"bio1dzGizCdh+yXFrLYEzyHphKnBNSqISsxtu4HsqG01SIIpx7K7FZexO7FKwAlJWsnzVHJ7Tg1GIYf7MxiaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183e073482643f5a0b295d16b38d38dd4fbeeecec0a3975be9a5d10bf1b2b86a","last_reissued_at":"2026-05-18T00:42:41.017606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:41.017606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random projections for linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ky Vu, Leo Liberti, Pierre-Louis Poirion","submitted_at":"2017-06-08T20:56:32Z","abstract_excerpt":"Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known Johnson-Lindenstrauss lemma states that there are random ma- trices with surprisingly few rows that approximately preserve pairwise Euclidean distances among a set of points. This is commonly used to speed up algorithms based on Euclidean distances. We prove that these matrices also preserve other quantities, such as the distance to a cone. We exploit this result to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02768","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":"1706.02768","created_at":"2026-05-18T00:42:41.017706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02768v1","created_at":"2026-05-18T00:42:41.017706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02768","created_at":"2026-05-18T00:42:41.017706+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA7AONECMQ7V","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA7AONECMQ7VUCZJ","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA7AONEC","created_at":"2026-05-18T12:31:10.602751+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/DA7AONECMQ7VUCZJLULLHDJY3V","json":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V.json","graph_json":"https://pith.science/api/pith-number/DA7AONECMQ7VUCZJLULLHDJY3V/graph.json","events_json":"https://pith.science/api/pith-number/DA7AONECMQ7VUCZJLULLHDJY3V/events.json","paper":"https://pith.science/paper/DA7AONEC"},"agent_actions":{"view_html":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V","download_json":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V.json","view_paper":"https://pith.science/paper/DA7AONEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02768&json=true","fetch_graph":"https://pith.science/api/pith-number/DA7AONECMQ7VUCZJLULLHDJY3V/graph.json","fetch_events":"https://pith.science/api/pith-number/DA7AONECMQ7VUCZJLULLHDJY3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V/action/storage_attestation","attest_author":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V/action/author_attestation","sign_citation":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V/action/citation_signature","submit_replication":"https://pith.science/pith/DA7AONECMQ7VUCZJLULLHDJY3V/action/replication_record"}},"created_at":"2026-05-18T00:42:41.017706+00:00","updated_at":"2026-05-18T00:42:41.017706+00:00"}