{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2IF52N7EFEWQURGT7LBHKUAIFK","short_pith_number":"pith:2IF52N7E","schema_version":"1.0","canonical_sha256":"d20bdd37e4292d0a44d3fac27550082a9d0e93f794f8d8a7a68b363b1e96923e","source":{"kind":"arxiv","id":"1202.4970","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.4970","created_at":"2026-05-18T02:20:20.220137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4970v2","created_at":"2026-05-18T02:20:20.220137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4970","created_at":"2026-05-18T02:20:20.220137+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IF52N7EFEWQ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IF52N7EFEWQURGT","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IF52N7E","created_at":"2026-05-18T12:26:50.516681+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/2IF52N7EFEWQURGT7LBHKUAIFK","json":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK.json","graph_json":"https://pith.science/api/pith-number/2IF52N7EFEWQURGT7LBHKUAIFK/graph.json","events_json":"https://pith.science/api/pith-number/2IF52N7EFEWQURGT7LBHKUAIFK/events.json","paper":"https://pith.science/paper/2IF52N7E"},"agent_actions":{"view_html":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK","download_json":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK.json","view_paper":"https://pith.science/paper/2IF52N7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4970&json=true","fetch_graph":"https://pith.science/api/pith-number/2IF52N7EFEWQURGT7LBHKUAIFK/graph.json","fetch_events":"https://pith.science/api/pith-number/2IF52N7EFEWQURGT7LBHKUAIFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/action/storage_attestation","attest_author":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/action/author_attestation","sign_citation":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/action/citation_signature","submit_replication":"https://pith.science/pith/2IF52N7EFEWQURGT7LBHKUAIFK/action/replication_record"}},"created_at":"2026-05-18T02:20:20.220137+00:00","updated_at":"2026-05-18T02:20:20.220137+00:00"}