{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y5UAGXOPGJIF4YWLA2MRHKC7ZL","short_pith_number":"pith:Y5UAGXOP","schema_version":"1.0","canonical_sha256":"c768035dcf32505e62cb069913a85fcaef42c0a313137c9f6494f8f20daa90d2","source":{"kind":"arxiv","id":"1908.01976","version":1},"attestation_state":"computed","paper":{"title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jing Zhang, Jin Xu, Kai Jia, Yimin Yin, Zhengming Wang","submitted_at":"2019-08-06T06:25:59Z","abstract_excerpt":"Sliced Latin hypercube designs (SLHDs) are widely used in computer experiments with both quantitative and qualitative factors and in batches. Optimal SLHDs achieve better space-filling property on the whole experimental region. However, most existing methods for constructing optimal SLHDs have restriction on the run sizes. In this paper, we propose a new method for constructing SLHDs with arbitrary run sizes, and a new combined space-filling measurement describing the space-filling property for both the whole design and its slices. Furthermore, we develop general algorithms to search the optim"},"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":"1908.01976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-06T06:25:59Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"25d874db40351e9b2951b8e2e1f636dbf68fadec8ce13ea1bf4d851df11ab727","abstract_canon_sha256":"db86baff52afba538df135550eb80f257a38399fbad2ec0d5dc94dc456cc8272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:49.945623Z","signature_b64":"/byShJTK+6PkCFzGGvy/+8gQUtxnM7xF0edJKVPA3EYheb4cmWx+q3TI/L49jxYRMCWNppOVxSI2gVP3Ej/wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c768035dcf32505e62cb069913a85fcaef42c0a313137c9f6494f8f20daa90d2","last_reissued_at":"2026-07-04T23:51:49.945276Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:49.945276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jing Zhang, Jin Xu, Kai Jia, Yimin Yin, Zhengming Wang","submitted_at":"2019-08-06T06:25:59Z","abstract_excerpt":"Sliced Latin hypercube designs (SLHDs) are widely used in computer experiments with both quantitative and qualitative factors and in batches. Optimal SLHDs achieve better space-filling property on the whole experimental region. However, most existing methods for constructing optimal SLHDs have restriction on the run sizes. In this paper, we propose a new method for constructing SLHDs with arbitrary run sizes, and a new combined space-filling measurement describing the space-filling property for both the whole design and its slices. Furthermore, we develop general algorithms to search the optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01976","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/1908.01976/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":"1908.01976","created_at":"2026-07-04T23:51:49.945342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01976v1","created_at":"2026-07-04T23:51:49.945342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01976","created_at":"2026-07-04T23:51:49.945342+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5UAGXOPGJIF","created_at":"2026-07-04T23:51:49.945342+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5UAGXOPGJIF4YWL","created_at":"2026-07-04T23:51:49.945342+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5UAGXOP","created_at":"2026-07-04T23:51:49.945342+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/Y5UAGXOPGJIF4YWLA2MRHKC7ZL","json":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL.json","graph_json":"https://pith.science/api/pith-number/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/graph.json","events_json":"https://pith.science/api/pith-number/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/events.json","paper":"https://pith.science/paper/Y5UAGXOP"},"agent_actions":{"view_html":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL","download_json":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL.json","view_paper":"https://pith.science/paper/Y5UAGXOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01976&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/action/storage_attestation","attest_author":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/action/author_attestation","sign_citation":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/action/citation_signature","submit_replication":"https://pith.science/pith/Y5UAGXOPGJIF4YWLA2MRHKC7ZL/action/replication_record"}},"created_at":"2026-07-04T23:51:49.945342+00:00","updated_at":"2026-07-04T23:51:49.945342+00:00"}