{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WN3A6CJ43QZZSYWDBV63IJC6YN","short_pith_number":"pith:WN3A6CJ4","canonical_record":{"source":{"id":"1511.09433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-30T19:14:23Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2cd5daae5a2d4b15cfb7b79f56adf1000a983cdd0ee2ba7f7e646fdf7d36f6f8","abstract_canon_sha256":"e321435b836e05a9523d0b71d0dd07416e9391d5720ed1d879b703e8c6e3cde1"},"schema_version":"1.0"},"canonical_sha256":"b3760f093cdc339962c30d7db4245ec37dce77bf56f75d739fe053db16964c42","source":{"kind":"arxiv","id":"1511.09433","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09433","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09433v3","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09433","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"WN3A6CJ43QZZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WN3A6CJ43QZZSYWD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WN3A6CJ4","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WN3A6CJ43QZZSYWDBV63IJC6YN","target":"record","payload":{"canonical_record":{"source":{"id":"1511.09433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-30T19:14:23Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2cd5daae5a2d4b15cfb7b79f56adf1000a983cdd0ee2ba7f7e646fdf7d36f6f8","abstract_canon_sha256":"e321435b836e05a9523d0b71d0dd07416e9391d5720ed1d879b703e8c6e3cde1"},"schema_version":"1.0"},"canonical_sha256":"b3760f093cdc339962c30d7db4245ec37dce77bf56f75d739fe053db16964c42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:05.584054Z","signature_b64":"4GVFjoN2NEAqy5Tl+OW77CMS84MAqrspkWw+G0dS9cHiXg8skMaKbNp9cMwavnUW/yWy2Y38P5iahPPrqlydDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3760f093cdc339962c30d7db4245ec37dce77bf56f75d739fe053db16964c42","last_reissued_at":"2026-05-18T00:35:05.583395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:05.583395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.09433","source_version":3,"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-18T00:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsxgLjTkG/gFc81sRcJxC4F2cgPMoftpbj62wCLX0PKJ2GomRsVtyB2mje75j8DlxdtbFB9PAzcMDbdurp2GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:58:56.083385Z"},"content_sha256":"c4a75f2f964e4b569345025979e484d37f248500008161501041ca2a36f767ec","schema_version":"1.0","event_id":"sha256:c4a75f2f964e4b569345025979e484d37f248500008161501041ca2a36f767ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WN3A6CJ43QZZSYWDBV63IJC6YN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universality laws for randomized dimension reduction, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"math.PR","authors_text":"Joel A. Tropp, Samet Oymak","submitted_at":"2015-11-30T19:14:23Z","abstract_excerpt":"Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to the data. This dimension reduction procedure succeeds when it preserves certain geometric features of the set.\n  The question is how large the embedding dimension must be to ensure that randomized dimension reduction succeeds with high probability.\n  This paper studies a natural family of randomized dimension reduction maps and a large class of data sets. It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09433","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"},"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-18T00:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+jyu03ekJBM96GPgG+5KzVIEYnPFpd2MyRzjTfqrSLT5hvirMKykk4IV8PwiEmGSMTpPeEBzwe+dIIuoYjCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:58:56.084021Z"},"content_sha256":"f8ed50e61660db64e54f43450855c1b3448e0726f9ec30a6c2b3da18b813198e","schema_version":"1.0","event_id":"sha256:f8ed50e61660db64e54f43450855c1b3448e0726f9ec30a6c2b3da18b813198e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WN3A6CJ43QZZSYWDBV63IJC6YN/bundle.json","state_url":"https://pith.science/pith/WN3A6CJ43QZZSYWDBV63IJC6YN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WN3A6CJ43QZZSYWDBV63IJC6YN/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-09T04:58:56Z","links":{"resolver":"https://pith.science/pith/WN3A6CJ43QZZSYWDBV63IJC6YN","bundle":"https://pith.science/pith/WN3A6CJ43QZZSYWDBV63IJC6YN/bundle.json","state":"https://pith.science/pith/WN3A6CJ43QZZSYWDBV63IJC6YN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WN3A6CJ43QZZSYWDBV63IJC6YN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WN3A6CJ43QZZSYWDBV63IJC6YN","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":"e321435b836e05a9523d0b71d0dd07416e9391d5720ed1d879b703e8c6e3cde1","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-30T19:14:23Z","title_canon_sha256":"2cd5daae5a2d4b15cfb7b79f56adf1000a983cdd0ee2ba7f7e646fdf7d36f6f8"},"schema_version":"1.0","source":{"id":"1511.09433","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09433","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09433v3","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09433","created_at":"2026-05-18T00:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"WN3A6CJ43QZZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WN3A6CJ43QZZSYWD","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WN3A6CJ4","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:f8ed50e61660db64e54f43450855c1b3448e0726f9ec30a6c2b3da18b813198e","target":"graph","created_at":"2026-05-18T00:35:05Z","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":"Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to the data. This dimension reduction procedure succeeds when it preserves certain geometric features of the set.\n  The question is how large the embedding dimension must be to ensure that randomized dimension reduction succeeds with high probability.\n  This paper studies a natural family of randomized dimension reduction maps and a large class of data sets. It","authors_text":"Joel A. Tropp, Samet Oymak","cross_cats":["cs.DS","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-30T19:14:23Z","title":"Universality laws for randomized dimension reduction, with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09433","kind":"arxiv","version":3},"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:c4a75f2f964e4b569345025979e484d37f248500008161501041ca2a36f767ec","target":"record","created_at":"2026-05-18T00:35:05Z","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":"e321435b836e05a9523d0b71d0dd07416e9391d5720ed1d879b703e8c6e3cde1","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-30T19:14:23Z","title_canon_sha256":"2cd5daae5a2d4b15cfb7b79f56adf1000a983cdd0ee2ba7f7e646fdf7d36f6f8"},"schema_version":"1.0","source":{"id":"1511.09433","kind":"arxiv","version":3}},"canonical_sha256":"b3760f093cdc339962c30d7db4245ec37dce77bf56f75d739fe053db16964c42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3760f093cdc339962c30d7db4245ec37dce77bf56f75d739fe053db16964c42","first_computed_at":"2026-05-18T00:35:05.583395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:05.583395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GVFjoN2NEAqy5Tl+OW77CMS84MAqrspkWw+G0dS9cHiXg8skMaKbNp9cMwavnUW/yWy2Y38P5iahPPrqlydDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:05.584054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.09433","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a75f2f964e4b569345025979e484d37f248500008161501041ca2a36f767ec","sha256:f8ed50e61660db64e54f43450855c1b3448e0726f9ec30a6c2b3da18b813198e"],"state_sha256":"1acad54950dafc403db07d733ece20b8c01366f368becf6362806dfae89b28cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwlbv1kcMEw3euLlVjt6BZ+wxBXF7guh5pTFv/FmT3cTkXKwJoWZRVspeVS6ADzZj73ulZAbbvApEQ4c8uQYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:58:56.087283Z","bundle_sha256":"3ea425bdf246c30d94b7f005e41957071740cc67383ec424251ce8e782220f91"}}