{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VCT3QMGN4DF3DY52A37OIBBTOZ","short_pith_number":"pith:VCT3QMGN","schema_version":"1.0","canonical_sha256":"a8a7b830cde0cbb1e3ba06fee404337645bc1a47c8a8d465c3dee1bc1f928dbf","source":{"kind":"arxiv","id":"2307.11241","version":1},"attestation_state":"computed","paper":{"title":"Discovering Active Subspaces for High-Dimensional Computer Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Devin Francom, Kellin N. Rumsey, Scott Vander Wiel","submitted_at":"2023-07-20T21:23:40Z","abstract_excerpt":"Dimension reduction techniques have long been an important topic in statistics, and active subspaces (AS) have received much attention this past decade in the computer experiments literature. The most common approach towards estimating the AS is to use Monte Carlo with numerical gradient evaluation. While sensible in some settings, this approach has obvious drawbacks. Recent research has demonstrated that active subspace calculations can be obtained in closed form, conditional on a Gaussian process (GP) surrogate, which can be limiting in high-dimensional settings for computational reasons. In"},"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":"2307.11241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ME","submitted_at":"2023-07-20T21:23:40Z","cross_cats_sorted":[],"title_canon_sha256":"eb5cdca18b4044889cdba472836b5efe31c1655b07850dd98eefe48368edff7a","abstract_canon_sha256":"15131ea9ce406e2cedd544a15c5be9072dfc35736795931b84ffe1536db02d9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:17.709707Z","signature_b64":"g49IHcurxGOLSE5oTF6q2z92gsRG/18aF2pvCmdVFNSbJXV0o6CozNIr7GIUm+S2o1mOFRwNv39WgsC0AwwnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a7b830cde0cbb1e3ba06fee404337645bc1a47c8a8d465c3dee1bc1f928dbf","last_reissued_at":"2026-07-05T08:46:17.709281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:17.709281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Active Subspaces for High-Dimensional Computer Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Devin Francom, Kellin N. Rumsey, Scott Vander Wiel","submitted_at":"2023-07-20T21:23:40Z","abstract_excerpt":"Dimension reduction techniques have long been an important topic in statistics, and active subspaces (AS) have received much attention this past decade in the computer experiments literature. The most common approach towards estimating the AS is to use Monte Carlo with numerical gradient evaluation. While sensible in some settings, this approach has obvious drawbacks. Recent research has demonstrated that active subspace calculations can be obtained in closed form, conditional on a Gaussian process (GP) surrogate, which can be limiting in high-dimensional settings for computational reasons. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.11241","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/2307.11241/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":"2307.11241","created_at":"2026-07-05T08:46:17.709346+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.11241v1","created_at":"2026-07-05T08:46:17.709346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.11241","created_at":"2026-07-05T08:46:17.709346+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCT3QMGN4DF3","created_at":"2026-07-05T08:46:17.709346+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCT3QMGN4DF3DY52","created_at":"2026-07-05T08:46:17.709346+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCT3QMGN","created_at":"2026-07-05T08:46:17.709346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.09060","citing_title":"All Emulators are Wrong, Many are Useful, and Some are More Useful Than Others: A Reproducible Comparison of Computer Model Surrogates","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ","json":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ.json","graph_json":"https://pith.science/api/pith-number/VCT3QMGN4DF3DY52A37OIBBTOZ/graph.json","events_json":"https://pith.science/api/pith-number/VCT3QMGN4DF3DY52A37OIBBTOZ/events.json","paper":"https://pith.science/paper/VCT3QMGN"},"agent_actions":{"view_html":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ","download_json":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ.json","view_paper":"https://pith.science/paper/VCT3QMGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.11241&json=true","fetch_graph":"https://pith.science/api/pith-number/VCT3QMGN4DF3DY52A37OIBBTOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VCT3QMGN4DF3DY52A37OIBBTOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ/action/storage_attestation","attest_author":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ/action/author_attestation","sign_citation":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ/action/citation_signature","submit_replication":"https://pith.science/pith/VCT3QMGN4DF3DY52A37OIBBTOZ/action/replication_record"}},"created_at":"2026-07-05T08:46:17.709346+00:00","updated_at":"2026-07-05T08:46:17.709346+00:00"}