{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:P24SLUHW7OOUJC7GWTGXQPVLNV","short_pith_number":"pith:P24SLUHW","schema_version":"1.0","canonical_sha256":"7eb925d0f6fb9d448be6b4cd783eab6d4fc636564b6fa6a496c236ae1b329797","source":{"kind":"arxiv","id":"math/0611273","version":1},"attestation_state":"computed","paper":{"title":"Estimation of the volume of an excursion set of a Gaussian process using intrinsic Kriging","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Emmanuel Vazquez, Miguel Piera Martinez","submitted_at":"2006-11-09T13:32:45Z","abstract_excerpt":"Assume that a Gaussian process $\\xi$ is predicted from $n$ pointwise observations by intrinsic Kriging and that the volume of the excursion set of $\\xi$ above a given threshold $u$ is approximated by the volume of the predictor. The first part of this paper gives a bound on the convergence rate of the approximated volume. The second part describes an algorithm that constructs a sequence of points to yield a fast convergence of the approximation. The estimation of the volume of an excursion set is a highly relevant problem for the industrial world since it corresponds to the estimation of the f"},"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":"math/0611273","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.ST","submitted_at":"2006-11-09T13:32:45Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ab7bbedcc3139822287bf980aa9fb69d9696209d977cbb7250862acb6409fa86","abstract_canon_sha256":"928611aaacc44c982e7d1fa70693533a0418306a5950fdd01d0a5ccf3b76bb56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:05.171355Z","signature_b64":"GzSFDb67NaKX0ue/DDiIPlG8LYrBhVYw07iWIZFUiFOdcGd8kr+jWCs/a+Yep6xA9gqHvK4pEPnnhRwiSlj7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eb925d0f6fb9d448be6b4cd783eab6d4fc636564b6fa6a496c236ae1b329797","last_reissued_at":"2026-07-04T15:02:05.170931Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:05.170931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation of the volume of an excursion set of a Gaussian process using intrinsic Kriging","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Emmanuel Vazquez, Miguel Piera Martinez","submitted_at":"2006-11-09T13:32:45Z","abstract_excerpt":"Assume that a Gaussian process $\\xi$ is predicted from $n$ pointwise observations by intrinsic Kriging and that the volume of the excursion set of $\\xi$ above a given threshold $u$ is approximated by the volume of the predictor. The first part of this paper gives a bound on the convergence rate of the approximated volume. The second part describes an algorithm that constructs a sequence of points to yield a fast convergence of the approximation. The estimation of the volume of an excursion set is a highly relevant problem for the industrial world since it corresponds to the estimation of the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611273","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0611273/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0611273","created_at":"2026-07-04T15:02:05.170993+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0611273v1","created_at":"2026-07-04T15:02:05.170993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611273","created_at":"2026-07-04T15:02:05.170993+00:00"},{"alias_kind":"pith_short_12","alias_value":"P24SLUHW7OOU","created_at":"2026-07-04T15:02:05.170993+00:00"},{"alias_kind":"pith_short_16","alias_value":"P24SLUHW7OOUJC7G","created_at":"2026-07-04T15:02:05.170993+00:00"},{"alias_kind":"pith_short_8","alias_value":"P24SLUHW","created_at":"2026-07-04T15:02:05.170993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01587","citing_title":"The Label Defines the Timescale: Trait-State Limits of Temporal-Aggregate Learning","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV","json":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV.json","graph_json":"https://pith.science/api/pith-number/P24SLUHW7OOUJC7GWTGXQPVLNV/graph.json","events_json":"https://pith.science/api/pith-number/P24SLUHW7OOUJC7GWTGXQPVLNV/events.json","paper":"https://pith.science/paper/P24SLUHW"},"agent_actions":{"view_html":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV","download_json":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV.json","view_paper":"https://pith.science/paper/P24SLUHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0611273&json=true","fetch_graph":"https://pith.science/api/pith-number/P24SLUHW7OOUJC7GWTGXQPVLNV/graph.json","fetch_events":"https://pith.science/api/pith-number/P24SLUHW7OOUJC7GWTGXQPVLNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV/action/storage_attestation","attest_author":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV/action/author_attestation","sign_citation":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV/action/citation_signature","submit_replication":"https://pith.science/pith/P24SLUHW7OOUJC7GWTGXQPVLNV/action/replication_record"}},"created_at":"2026-07-04T15:02:05.170993+00:00","updated_at":"2026-07-04T15:02:05.170993+00:00"}