{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2IF52N7EFEWQURGT7LBHKUAIFK","short_pith_number":"pith:2IF52N7E","canonical_record":{"source":{"id":"1202.4970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-22T16:52:16Z","cross_cats_sorted":["math.FA","math.PR"],"title_canon_sha256":"826188d65c9876750abbbca521fb2b97b2e46835e88f282adffb335511534199","abstract_canon_sha256":"783f363ba72e88f3daf4a5005e210a70b8a005ab76dd3a3b300be56f790a6dcb"},"schema_version":"1.0"},"canonical_sha256":"d20bdd37e4292d0a44d3fac27550082a9d0e93f794f8d8a7a68b363b1e96923e","source":{"kind":"arxiv","id":"1202.4970","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4970","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4970v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4970","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"2IF52N7EFEWQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2IF52N7EFEWQURGT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2IF52N7E","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2IF52N7EFEWQURGT7LBHKUAIFK","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-22T16:52:16Z","cross_cats_sorted":["math.FA","math.PR"],"title_canon_sha256":"826188d65c9876750abbbca521fb2b97b2e46835e88f282adffb335511534199","abstract_canon_sha256":"783f363ba72e88f3daf4a5005e210a70b8a005ab76dd3a3b300be56f790a6dcb"},"schema_version":"1.0"},"canonical_sha256":"d20bdd37e4292d0a44d3fac27550082a9d0e93f794f8d8a7a68b363b1e96923e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:20.220695Z","signature_b64":"ALCEuidZnYZGs+ygFx5H77a5Rcu+YY9p4KLfeLVJDA3Awtc5Z8miJnOvC6TOmwhBVC66NXrbzKfPrBjtivZuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20bdd37e4292d0a44d3fac27550082a9d0e93f794f8d8a7a68b363b1e96923e","last_reissued_at":"2026-05-18T02:20:20.220065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:20.220065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4970","source_version":2,"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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePUR/fwe0nCmuTl5LblBPF3giSfkKz/FaFziuAT3j6An9zaqNOQ5yUE0kYtv+xXD2qNY3jddof3X5ATvVZ+4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:14:16.069630Z"},"content_sha256":"68dd21c95646552887d6d82af458af32eac08c6cf354359ae501083c4f3d02ad","schema_version":"1.0","event_id":"sha256:68dd21c95646552887d6d82af458af32eac08c6cf354359ae501083c4f3d02ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2IF52N7EFEWQURGT7LBHKUAIFK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A polynomial time approximation scheme for computing the supremum of Gaussian processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.PR"],"primary_cat":"cs.DS","authors_text":"Raghu Meka","submitted_at":"2012-02-22T16:52:16Z","abstract_excerpt":"We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\\subseteq\\mathbb{R}^d$, we compute a $(1+\\varepsilon)$-factor approximation to $\\mathop {\\mathbb{E}}_{X\\leftarrow\\mathcal{N}^d}[\\sup_{v\\in V}|\\langle v,X\\rangle|]$ deterministically in time $\\operatorname {poly}(d)\\cdot|V|^{O_{\\varepsilon}(1)}$. Previously, only a constant factor deterministic polynomial time approximation algorithm was known due to the work of Ding, Lee and Peres [Ann. of Math. (2) 175 (2012) 1409-1471]. This answers an open question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4970","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"},"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-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFT4PS5YgmC4OG83Jq9TMTTkfMe6i8NhLu0k0o/3Khtq0M9qR/R2ZGscL6x5Pau02WsUCvBBL3ELVlrqEVRTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:14:16.069971Z"},"content_sha256":"2ab962c107e11e6723784960d58e8726224eee382bc07565615cc4c6839f92ea","schema_version":"1.0","event_id":"sha256:2ab962c107e11e6723784960d58e8726224eee382bc07565615cc4c6839f92ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/bundle.json","state_url":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IF52N7EFEWQURGT7LBHKUAIFK/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-05-28T12:14:16Z","links":{"resolver":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK","bundle":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/bundle.json","state":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IF52N7EFEWQURGT7LBHKUAIFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2IF52N7EFEWQURGT7LBHKUAIFK","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":"783f363ba72e88f3daf4a5005e210a70b8a005ab76dd3a3b300be56f790a6dcb","cross_cats_sorted":["math.FA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-22T16:52:16Z","title_canon_sha256":"826188d65c9876750abbbca521fb2b97b2e46835e88f282adffb335511534199"},"schema_version":"1.0","source":{"id":"1202.4970","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4970","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4970v2","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4970","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"2IF52N7EFEWQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2IF52N7EFEWQURGT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2IF52N7E","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:2ab962c107e11e6723784960d58e8726224eee382bc07565615cc4c6839f92ea","target":"graph","created_at":"2026-05-18T02:20:20Z","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":"We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\\subseteq\\mathbb{R}^d$, we compute a $(1+\\varepsilon)$-factor approximation to $\\mathop {\\mathbb{E}}_{X\\leftarrow\\mathcal{N}^d}[\\sup_{v\\in V}|\\langle v,X\\rangle|]$ deterministically in time $\\operatorname {poly}(d)\\cdot|V|^{O_{\\varepsilon}(1)}$. Previously, only a constant factor deterministic polynomial time approximation algorithm was known due to the work of Ding, Lee and Peres [Ann. of Math. (2) 175 (2012) 1409-1471]. This answers an open question","authors_text":"Raghu Meka","cross_cats":["math.FA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-22T16:52:16Z","title":"A polynomial time approximation scheme for computing the supremum of Gaussian processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4970","kind":"arxiv","version":2},"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:68dd21c95646552887d6d82af458af32eac08c6cf354359ae501083c4f3d02ad","target":"record","created_at":"2026-05-18T02:20:20Z","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":"783f363ba72e88f3daf4a5005e210a70b8a005ab76dd3a3b300be56f790a6dcb","cross_cats_sorted":["math.FA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-22T16:52:16Z","title_canon_sha256":"826188d65c9876750abbbca521fb2b97b2e46835e88f282adffb335511534199"},"schema_version":"1.0","source":{"id":"1202.4970","kind":"arxiv","version":2}},"canonical_sha256":"d20bdd37e4292d0a44d3fac27550082a9d0e93f794f8d8a7a68b363b1e96923e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d20bdd37e4292d0a44d3fac27550082a9d0e93f794f8d8a7a68b363b1e96923e","first_computed_at":"2026-05-18T02:20:20.220065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:20.220065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ALCEuidZnYZGs+ygFx5H77a5Rcu+YY9p4KLfeLVJDA3Awtc5Z8miJnOvC6TOmwhBVC66NXrbzKfPrBjtivZuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:20.220695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4970","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68dd21c95646552887d6d82af458af32eac08c6cf354359ae501083c4f3d02ad","sha256:2ab962c107e11e6723784960d58e8726224eee382bc07565615cc4c6839f92ea"],"state_sha256":"c31913c75e3b492a4f62b2fe45169813f65e1b23f3d8bef440c759436e4f2ae2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZYxt8MI2tur23wu8W2MZ+21YVwCR0y0pmBtn3/zVIx79SnV8m2oLwCnGUSY54EZEeZoqzSC4IZR59PSAS3aBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:14:16.071963Z","bundle_sha256":"9b5fb4d5fab452ac2c35f785cfdf2cd47f6bdeb23ada7b62831656d93716783b"}}