{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5QE735NFLJSEAFTV3RX4P3DYVI","short_pith_number":"pith:5QE735NF","schema_version":"1.0","canonical_sha256":"ec09fdf5a55a64401675dc6fc7ec78aa19ae9573eb26b8e7543a3929b1909946","source":{"kind":"arxiv","id":"1309.7365","version":1},"attestation_state":"computed","paper":{"title":"Rare-event Simulation and Efficient Discretization for the Supremum of Gaussian Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jingchen Liu, Xiaoou Li","submitted_at":"2013-09-27T20:32:02Z","abstract_excerpt":"In this paper, we consider a classic problem concerning the high excursion probabilities of a Gaussian random field $f$ living on a compact set $T$. We develop efficient computational methods for the tail probabilities $P(\\sup_T f(t) > b)$ and the conditional expectations $E(\\Gamma(f) | \\sup_T f(t) > b)$ as $b\\rightarrow \\infty$. For each $\\varepsilon$ positive, we present Monte Carlo algorithms that run in \\emph{constant} time and compute the interesting quantities with $\\varepsilon$ relative error for arbitrarily large $b$. The efficiency results are applicable to a large class of H\\\"older c"},"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":"1309.7365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-27T20:32:02Z","cross_cats_sorted":[],"title_canon_sha256":"fa79a66eb659f5bba61df49a35c8191b865fdf6f60927395ce6f7ea7d39506dc","abstract_canon_sha256":"29d322ba5a3dd8ea21a4aa8cdf1254023cf2bcdd5cd6f75fc649b85bd760aecf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:58.935989Z","signature_b64":"fhOkd0e8d345C+gUsy4+a7RYF9lZAeoArnxG5MKsO+ZY4yo90xATIEizCWvBG3XRhFC+BVEWVOnhm8tWIODCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec09fdf5a55a64401675dc6fc7ec78aa19ae9573eb26b8e7543a3929b1909946","last_reissued_at":"2026-05-18T03:11:58.935217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:58.935217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rare-event Simulation and Efficient Discretization for the Supremum of Gaussian Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jingchen Liu, Xiaoou Li","submitted_at":"2013-09-27T20:32:02Z","abstract_excerpt":"In this paper, we consider a classic problem concerning the high excursion probabilities of a Gaussian random field $f$ living on a compact set $T$. We develop efficient computational methods for the tail probabilities $P(\\sup_T f(t) > b)$ and the conditional expectations $E(\\Gamma(f) | \\sup_T f(t) > b)$ as $b\\rightarrow \\infty$. For each $\\varepsilon$ positive, we present Monte Carlo algorithms that run in \\emph{constant} time and compute the interesting quantities with $\\varepsilon$ relative error for arbitrarily large $b$. The efficiency results are applicable to a large class of H\\\"older c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7365","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":"1309.7365","created_at":"2026-05-18T03:11:58.935345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7365v1","created_at":"2026-05-18T03:11:58.935345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7365","created_at":"2026-05-18T03:11:58.935345+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QE735NFLJSE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QE735NFLJSEAFTV","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QE735NF","created_at":"2026-05-18T12:27:34.582898+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/5QE735NFLJSEAFTV3RX4P3DYVI","json":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI.json","graph_json":"https://pith.science/api/pith-number/5QE735NFLJSEAFTV3RX4P3DYVI/graph.json","events_json":"https://pith.science/api/pith-number/5QE735NFLJSEAFTV3RX4P3DYVI/events.json","paper":"https://pith.science/paper/5QE735NF"},"agent_actions":{"view_html":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI","download_json":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI.json","view_paper":"https://pith.science/paper/5QE735NF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7365&json=true","fetch_graph":"https://pith.science/api/pith-number/5QE735NFLJSEAFTV3RX4P3DYVI/graph.json","fetch_events":"https://pith.science/api/pith-number/5QE735NFLJSEAFTV3RX4P3DYVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI/action/storage_attestation","attest_author":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI/action/author_attestation","sign_citation":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI/action/citation_signature","submit_replication":"https://pith.science/pith/5QE735NFLJSEAFTV3RX4P3DYVI/action/replication_record"}},"created_at":"2026-05-18T03:11:58.935345+00:00","updated_at":"2026-05-18T03:11:58.935345+00:00"}