{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QXGSVGMQA63YKUDXA6DEFWONRS","short_pith_number":"pith:QXGSVGMQ","canonical_record":{"source":{"id":"1507.00990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-03T19:30:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2ea1e31dafcacd6070b96bb466d93fd901d8e04ea9c75f7a3455e3230d7513c3","abstract_canon_sha256":"f76b76aebe225661dbf06ad3680bfb02d4afa4fb7dc32b222b7c6662c259eeb5"},"schema_version":"1.0"},"canonical_sha256":"85cd2a999007b7855077078642d9cd8c970e775f5b3541aee5a18e856cbf8eec","source":{"kind":"arxiv","id":"1507.00990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00990","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00990v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00990","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"QXGSVGMQA63Y","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXGSVGMQA63YKUDX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXGSVGMQ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QXGSVGMQA63YKUDXA6DEFWONRS","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-03T19:30:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2ea1e31dafcacd6070b96bb466d93fd901d8e04ea9c75f7a3455e3230d7513c3","abstract_canon_sha256":"f76b76aebe225661dbf06ad3680bfb02d4afa4fb7dc32b222b7c6662c259eeb5"},"schema_version":"1.0"},"canonical_sha256":"85cd2a999007b7855077078642d9cd8c970e775f5b3541aee5a18e856cbf8eec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:22.072688Z","signature_b64":"x1AVFLn+GllCdEabUEeLeC8oJPBXIhqON7Xw9i34FiDFu7RgJfmE0k48Jri+s59QcORhgHdAVjQfmy73wokqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85cd2a999007b7855077078642d9cd8c970e775f5b3541aee5a18e856cbf8eec","last_reissued_at":"2026-05-18T01:37:22.072005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:22.072005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00990","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YG2BkEK69Cu9sfN7gzSWKY/zeJK9Lv7+i1DGEhf8VczRRxyVeBtBj5UuCtXlqb4kRC0+U7RLBFxw2tJ8sHD2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:00:31.224276Z"},"content_sha256":"4ff591daed9978579d8fe13e4d90be7f00360bb618aae30c4eeb18d5b36519ef","schema_version":"1.0","event_id":"sha256:4ff591daed9978579d8fe13e4d90be7f00360bb618aae30c4eeb18d5b36519ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QXGSVGMQA63YKUDXA6DEFWONRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using the Johnson-Lindenstrauss lemma in linear and integer programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Ky Vu, Leo Liberti, Pierre-Louis Poirion","submitted_at":"2015-07-03T19:30:20Z","abstract_excerpt":"The Johnson-Lindenstrauss lemma allows dimension reduction on real vectors with low distortion on their pairwise Euclidean distances. This result is often used in algorithms such as $k$-means or $k$ nearest neighbours since they only use Euclidean distances, and has sometimes been used in optimization algorithms involving the minimization of Euclidean distances. In this paper we introduce a first attempt at using this lemma in the context of feasibility problems in linear and integer programming, which cannot be expressed only in function of Euclidean distances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00990","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MeWZ2FrPNmVx5vsFFQTCW+nQSfRRZaTj2pvfydMitwVo8Z+0N4eBtYTBSVm9w+TybFO7B0dUC+1fpeT935M+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:00:31.224885Z"},"content_sha256":"54394235411ac0fefd9f713c744f44116358834fc0f984393d40e734f06096b3","schema_version":"1.0","event_id":"sha256:54394235411ac0fefd9f713c744f44116358834fc0f984393d40e734f06096b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXGSVGMQA63YKUDXA6DEFWONRS/bundle.json","state_url":"https://pith.science/pith/QXGSVGMQA63YKUDXA6DEFWONRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXGSVGMQA63YKUDXA6DEFWONRS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T15:00:31Z","links":{"resolver":"https://pith.science/pith/QXGSVGMQA63YKUDXA6DEFWONRS","bundle":"https://pith.science/pith/QXGSVGMQA63YKUDXA6DEFWONRS/bundle.json","state":"https://pith.science/pith/QXGSVGMQA63YKUDXA6DEFWONRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXGSVGMQA63YKUDXA6DEFWONRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QXGSVGMQA63YKUDXA6DEFWONRS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f76b76aebe225661dbf06ad3680bfb02d4afa4fb7dc32b222b7c6662c259eeb5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-03T19:30:20Z","title_canon_sha256":"2ea1e31dafcacd6070b96bb466d93fd901d8e04ea9c75f7a3455e3230d7513c3"},"schema_version":"1.0","source":{"id":"1507.00990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00990","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00990v1","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00990","created_at":"2026-05-18T01:37:22Z"},{"alias_kind":"pith_short_12","alias_value":"QXGSVGMQA63Y","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXGSVGMQA63YKUDX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXGSVGMQ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:54394235411ac0fefd9f713c744f44116358834fc0f984393d40e734f06096b3","target":"graph","created_at":"2026-05-18T01:37:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Johnson-Lindenstrauss lemma allows dimension reduction on real vectors with low distortion on their pairwise Euclidean distances. This result is often used in algorithms such as $k$-means or $k$ nearest neighbours since they only use Euclidean distances, and has sometimes been used in optimization algorithms involving the minimization of Euclidean distances. In this paper we introduce a first attempt at using this lemma in the context of feasibility problems in linear and integer programming, which cannot be expressed only in function of Euclidean distances.","authors_text":"Ky Vu, Leo Liberti, Pierre-Louis Poirion","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-03T19:30:20Z","title":"Using the Johnson-Lindenstrauss lemma in linear and integer programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00990","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4ff591daed9978579d8fe13e4d90be7f00360bb618aae30c4eeb18d5b36519ef","target":"record","created_at":"2026-05-18T01:37:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f76b76aebe225661dbf06ad3680bfb02d4afa4fb7dc32b222b7c6662c259eeb5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-03T19:30:20Z","title_canon_sha256":"2ea1e31dafcacd6070b96bb466d93fd901d8e04ea9c75f7a3455e3230d7513c3"},"schema_version":"1.0","source":{"id":"1507.00990","kind":"arxiv","version":1}},"canonical_sha256":"85cd2a999007b7855077078642d9cd8c970e775f5b3541aee5a18e856cbf8eec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85cd2a999007b7855077078642d9cd8c970e775f5b3541aee5a18e856cbf8eec","first_computed_at":"2026-05-18T01:37:22.072005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:22.072005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x1AVFLn+GllCdEabUEeLeC8oJPBXIhqON7Xw9i34FiDFu7RgJfmE0k48Jri+s59QcORhgHdAVjQfmy73wokqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:22.072688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff591daed9978579d8fe13e4d90be7f00360bb618aae30c4eeb18d5b36519ef","sha256:54394235411ac0fefd9f713c744f44116358834fc0f984393d40e734f06096b3"],"state_sha256":"9b2b65b60ca128ae85cc248c7ea6491ec428d89d4cbde90eacf6e046d40b42db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUJXUqHNPWwW/RVQjEELKdHIgKBvjR7Vh0KqglBH7xEEA37FXGrN/HLqDrOtFqCE6GlxlyNrXdN12DsB+SeDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:00:31.227762Z","bundle_sha256":"d43bf563d14cfe9388cad0d86ea996813438b8ba7720526d888ef4f72e2842a4"}}