{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XO5HINRZD24TSMH4KHQYOFJHL7","short_pith_number":"pith:XO5HINRZ","schema_version":"1.0","canonical_sha256":"bbba7436391eb93930fc51e18715275fe245a6da3dff274061c1cf60bd1e535b","source":{"kind":"arxiv","id":"1409.6495","version":1},"attestation_state":"computed","paper":{"title":"A central limit theorem for general orthogonal array based space-filling designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Peter Z. G. Qian, Xu He","submitted_at":"2014-09-23T11:32:48Z","abstract_excerpt":"Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439-452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392-1397]) have become popular in computer experiments, numerical integration, stochastic optimization and uncertainty quantification. As improvements of ordinary Latin hypercube designs, these designs achieve stratification in multi-dimensions. If the underlying orthogonal array has strength $t$, such designs achieve uniformity up to $t$ dimensions. Existing central limit theorems are limited to these designs with only two-dimensional stratification based on streng"},"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":"1409.6495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-09-23T11:32:48Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"63d03429e1425668da3499b3b32f78d6d83e7ebfbe709a7c08a726910c26db8a","abstract_canon_sha256":"e875138d63d47c597be78cb2cab1ad2edcccabffea67efaf429d0d587fc8d05c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:07.043168Z","signature_b64":"E7r4kkzFHC9sDC5kK7Q8mG++inIinsAqPKE7pbihZayzCcCL7i73dBaTX3i/DM5MY0YRqZx18511ekZSiCYBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbba7436391eb93930fc51e18715275fe245a6da3dff274061c1cf60bd1e535b","last_reissued_at":"2026-05-18T02:42:07.042774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:07.042774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A central limit theorem for general orthogonal array based space-filling designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Peter Z. G. Qian, Xu He","submitted_at":"2014-09-23T11:32:48Z","abstract_excerpt":"Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439-452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392-1397]) have become popular in computer experiments, numerical integration, stochastic optimization and uncertainty quantification. As improvements of ordinary Latin hypercube designs, these designs achieve stratification in multi-dimensions. If the underlying orthogonal array has strength $t$, such designs achieve uniformity up to $t$ dimensions. Existing central limit theorems are limited to these designs with only two-dimensional stratification based on streng"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6495","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":"1409.6495","created_at":"2026-05-18T02:42:07.042826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6495v1","created_at":"2026-05-18T02:42:07.042826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6495","created_at":"2026-05-18T02:42:07.042826+00:00"},{"alias_kind":"pith_short_12","alias_value":"XO5HINRZD24T","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XO5HINRZD24TSMH4","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XO5HINRZ","created_at":"2026-05-18T12:28:57.508820+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/XO5HINRZD24TSMH4KHQYOFJHL7","json":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7.json","graph_json":"https://pith.science/api/pith-number/XO5HINRZD24TSMH4KHQYOFJHL7/graph.json","events_json":"https://pith.science/api/pith-number/XO5HINRZD24TSMH4KHQYOFJHL7/events.json","paper":"https://pith.science/paper/XO5HINRZ"},"agent_actions":{"view_html":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7","download_json":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7.json","view_paper":"https://pith.science/paper/XO5HINRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6495&json=true","fetch_graph":"https://pith.science/api/pith-number/XO5HINRZD24TSMH4KHQYOFJHL7/graph.json","fetch_events":"https://pith.science/api/pith-number/XO5HINRZD24TSMH4KHQYOFJHL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7/action/storage_attestation","attest_author":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7/action/author_attestation","sign_citation":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7/action/citation_signature","submit_replication":"https://pith.science/pith/XO5HINRZD24TSMH4KHQYOFJHL7/action/replication_record"}},"created_at":"2026-05-18T02:42:07.042826+00:00","updated_at":"2026-05-18T02:42:07.042826+00:00"}