{"as_of":"2026-08-16T06:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11bfccafae377b305ac9b410908ed5f8fb0e6ba22c68e953d78532874117b8e7","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:08:27.644421Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.01976/citation-record","integrity":"/paper/1908.01976/integrity","json":"/paper/1908.01976/citation-record.json","paper":"/paper/1908.01976"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.667729Z","title":"A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code","venue":null,"work_id":"e53628fc-bdcf-4855-8f03-6fcd8d2b19c3","year":1979},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.605034Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:e3d83101f09298216fda23f28ffad3a38839e188e67ce26d7001aedfb4a2c627","observation_id":"eb28fd61-913e-428b-944b-efbdc3d33b38","resolution":{"observed_at":"2026-08-14T15:08:30.673593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.554753Z","title":"Sliced Latin Hypercube Designs","venue":null,"work_id":"6b29d775-3481-4e8d-b6ef-c2453676d90f","year":2012},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.611180Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:a8b5e9e8a335f601fa5266600c0971b1554a6e079f1dbe5db7d07ac10dcb99f1","observation_id":"d57f0e0f-f753-4859-bb37-55ebd26efd42","resolution":{"observed_at":"2026-08-14T15:08:30.652653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.536854Z","title":"A central limit theorem for nested or sliced Latin hypercube designs","venue":null,"work_id":"5c6ccea0-6c34-43ae-9b69-ecef126a0736","year":2016},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.617075Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:2c711638f41dc8d5b6095b26d8dcf21eb7540988567627a59d57d75b7f2a83a2","observation_id":"0c26ecd4-24cd-4bfa-b589-b6aa2ca1601d","resolution":{"observed_at":"2026-08-14T15:08:30.543690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.384250Z","title":"Gaussian Process Models for Computer Experiments with Qualitative and Quantitative Factors","venue":null,"work_id":"043605a7-6bc4-48dd-beb2-eba2c70deafb","year":2008},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.686548Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:e86cdff87a1eacf05abe8cbfb6f6eb43531c5e1951bc22cc22c33b034e8fb90b","observation_id":"ef931140-085b-42de-98b8-d1917f5c9de0","resolution":{"observed_at":"2026-08-14T15:08:30.500247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.362834Z","title":"Prediction for Computer Experiments Having Quantitative and Qualitative Input Variables","venue":null,"work_id":"cb4fb01a-a4dc-4faa-8227-0c238664bec7","year":2009},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.700392Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:60f0a38589e3b9c5c114601ac869f0b65a78132a272b1509368e0f28e4997488","observation_id":"54628474-ea10-4fd0-ac2a-884fb1304b88","resolution":{"observed_at":"2026-08-14T15:08:30.368720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.245746Z","title":"Additive Gaussian Process for Computer Models With Qualitative and Quantitative Factors","venue":null,"work_id":"1081f932-00f0-42ef-98bd-c835d6a63cb4","year":2017},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.707765Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:e46a5e33e481eaeb04d38c9e4e00720edbf884c97cd90021f776a901e61b3fda","observation_id":"611df43a-7fd9-4932-954f-6044e5c0abcf","resolution":{"observed_at":"2026-08-14T15:08:30.252463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.147911Z","title":"Sliced orthogonal array-based Latin hypercube designs","venue":null,"work_id":"b8688915-afaf-47f5-b7ab-3bf348a880e4","year":2016},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.754428Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:202a4dc2af62093909d609855ee8e7196a3557d009a981f33c132719266ba6cc","observation_id":"e8eb624a-59fe-4e00-8b8b-970d333d8d08","resolution":{"observed_at":"2026-08-14T15:08:30.219917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:30.123543Z","title":"Sliced Latin hypercube designs via orthogonal arrays","venue":null,"work_id":"63c8b007-606d-4663-b4d4-cf6991d4f814","year":2014},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.804784Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:8161c44b25bacace339f3de61d4bccc524a8b7017282c35db292d9702e0c8b50","observation_id":"4d37d352-2993-4821-8a4c-3cabe671d47e","resolution":{"observed_at":"2026-08-14T15:08:30.130959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.994807Z","title":"General sliced Latin hypercube designs","venue":null,"work_id":"b8fedf89-93f7-4901-94c1-be1802c359bb","year":2014},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.812014Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:66abb17bbef80f36118be9aee8c0fbf824001fdc48e47d5849983314462a1693","observation_id":"291fe389-4932-44c0-b7e1-74b8e7c6e16c","resolution":{"observed_at":"2026-08-14T15:08:30.016737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.925713Z","title":"Construction of sliced maximin-orthogonal Latin hypercube designs","venue":null,"work_id":"3d57a5e7-046d-40c6-858e-9a478cb33721","year":2016},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.818163Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:9ef06bafdafad4693ca137e5147c408b5eea8721f82b244ee88cf03e5f9a2d4a","observation_id":"0d314b29-f91a-4eb1-889e-37627716d0c1","resolution":{"observed_at":"2026-08-14T15:08:29.975273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.830638Z","title":"Computer Experiments With Both Qualitative and Quantitative Variables","venue":null,"work_id":"7d39d9da-c326-4293-993d-ae1dc6b0d776","year":2015},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.869009Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:cca9ddf00827ea77a2a229fa9434a4fe7382f9a278c6e62aef31a05ab9fcc7b5","observation_id":"8590be55-cfc2-47e6-a514-0c37899e4be0","resolution":{"observed_at":"2026-08-14T15:08:29.839368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.802385Z","title":"Predicting the Output from a Complex Computer Code When Fast Approximations Are Available","venue":null,"work_id":"18237387-8152-4cda-b2fe-fbae2f9ed13a","year":2000},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.920457Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:a3de73b91146ac6adb2c68e776e1c33d2da839a824c6866871e9796bb277497f","observation_id":"35853ce2-5d5f-4b99-86ff-4d30c476fe80","resolution":{"observed_at":"2026-08-14T15:08:29.813022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.700528Z","title":"Building surrogate models based on detailed and approximate simulations","venue":null,"work_id":"f7cc0a06-00a6-4141-888d-d1f36f44e084","year":2006},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.927920Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:63d40ae1ffb9a019c4cf3325681a79afd6c1ad63070a20e3ab42284bab81d958","observation_id":"af3fe40d-781b-4853-8d7a-15727937ea65","resolution":{"observed_at":"2026-08-14T15:08:29.711086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.652155Z","title":"Optimal Sliced Latin Hypercube Designs","venue":null,"work_id":"692856a4-7f08-4f4a-8b80-97643d9e6051","year":2015},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.935933Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:cf553fcd048d3d27706d138fac53cfb706e530bf98e87297a2326ffed1fc623f","observation_id":"6aec6d73-9f1e-4dcd-b706-9127842c6a85","resolution":{"observed_at":"2026-08-14T15:08:29.679430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.576499Z","title":"Uniform sliced Latin hypercube designs","venue":null,"work_id":"016a587b-13cb-46d2-9e4b-5e8f579d1d81","year":2016},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.944745Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:b9d5afa76c30fb08b5707db6d44667cc66cb1b39ecd45d0ada0a823795ce9d54","observation_id":"b71d376d-a631-4024-8e11-1241bd493ccd","resolution":{"observed_at":"2026-08-14T15:08:29.585676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.540105Z","title":"Flexible sliced designs for computer experiments","venue":null,"work_id":"8d38d648-ca53-4ed0-abd7-a8fb64107fee","year":2018},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.968801Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:de8dc810504ae739cf11c946ef631d781c21eb04b3bc789fcc268b814514b6a6","observation_id":"74cdb14d-75c9-4442-9653-120802774324","resolution":{"observed_at":"2026-08-14T15:08:29.560687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.491770Z","title":"Sliced Latin Hypercube Designs for Computer Experiments With Unequal Batch Sizes","venue":null,"work_id":"49418062-f39e-4926-96a3-5c1304fdbdad","year":2018},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.974974Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:09e00502c24c73654d0899a2eef2f23ad140a61a6c74174e3710441ddbf710e9","observation_id":"c524531f-b388-4051-bb1b-d52d483f08fb","resolution":{"observed_at":"2026-08-14T15:08:29.497905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.02721","last_updated":"2019-05-07T16:05:48Z","snapshot_observed_at":"2026-08-15T00:33:43.700416Z","submitted_at":"2019-05-07T16:05:48Z","title":"Sliced Latin hypercube designs with arbitrary run sizes","version":1},"cited_work":{"arxiv_id":"1905.02721","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.02721","snapshot_observed_at":"2026-08-14T15:08:27.696115Z","title":"Sliced Latin hypercube designs with arbitrary run sizes","venue":"math.ST","work_id":"756acd77-567f-43df-adbb-789a46bf16f0","year":2019},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.981422Z"},"links":{"cited_paper":"/paper/1905.02721","citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:2340201e450b7c6a520d2a6091a846c0c0887179811657fa53e9b2ecd53d4128","observation_id":"73c55f35-f320-4cbb-9dc4-7681e0d57b1d","resolution":{"observed_at":"2026-08-14T15:08:27.803049Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.329294Z","title":"Minimax and maximin distance designs","venue":null,"work_id":"1038e1d5-c8fb-43df-8ac5-64f97c4aeb37","year":1990},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.987572Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:f4b2327ba086a7be9e8970d639b91a74b6af176c7fca9b8b610cac36d31aab38","observation_id":"a37b40ca-5ae5-48d2-a2e4-167c8b7222f3","resolution":{"observed_at":"2026-08-14T15:08:29.411798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.303945Z","title":"Finding maximin latin hypercube designs by Iterated Local Search heuristics","venue":null,"work_id":"489c6ab2-6669-4597-82d8-ed02ce42d664","year":2009},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:26.993152Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:5ad1d4d4e43bb34e42d3f16aa3c942bf7f7b23ac2882cda473a7f00cb3820768","observation_id":"a12b4ba4-cfa4-449a-87f4-cee6e0983632","resolution":{"observed_at":"2026-08-14T15:08:29.312747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.205979Z","title":"Maximin Latin Hypercube Designs in Two Dimensions","venue":null,"work_id":"797dfa75-8ae9-412e-a898-971e40d47471","year":2007},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.057271Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:734195bacb9230efd23db3ce691562d7b9267ff7afdb33e4786f1ad8674848c3","observation_id":"e1aa920e-456f-4ca2-9541-dadfd8c18076","resolution":{"observed_at":"2026-08-14T15:08:29.232317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.166990Z","title":"Bounds for Maximin Latin Hypercube Designs","venue":null,"work_id":"08f75416-e1da-4305-afe9-adc7047ea867","year":2009},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.124754Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:beace06479056c17ad80c8c32c441f4c80d45c92e90820530f8b1b86f48d5663","observation_id":"d26ec316-546b-4a1d-8070-0277a6be5694","resolution":{"observed_at":"2026-08-14T15:08:29.186893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.100457Z","title":"An efficient algorithm for constructing optimal design of computer experiments","venue":null,"work_id":"6d2f0ca0-8cd1-4c13-86c3-b18420aaff34","year":2016},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.196223Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:26edfeb5544fb28b1d62c71d0e1dac8f5d197403daa5c8dd72f2cfa49a007c75","observation_id":"ad20af49-069f-4e67-abad-ab96da448164","resolution":{"observed_at":"2026-08-14T15:08:29.110466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:29.009252Z","title":"Exploratory designs for computational experiments","venue":null,"work_id":"58c608f5-e57c-4966-bbc0-db47d0fbc119","year":1995},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.271291Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:a3a173a2e0e179d6b883eefc9e0d3297d12603153c1e2fa6b32e2b8a8ca74a6f","observation_id":"f029cda6-e2e2-4fa2-87c9-50d17726fe5a","resolution":{"observed_at":"2026-08-14T15:08:29.023997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.958806Z","title":"Algorithmic construction of optimal symmetric Latin hypercube designs","venue":null,"work_id":"e77f95a2-2ab4-4908-a475-8cde2ac8f7ae","year":2000},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.329084Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:71184bf90477f33f6f0d190b5fa29c0b0cfa5cac05dd1bd2866fbb9e40096d96","observation_id":"9b425ecf-c3fa-4474-8a59-2239c479cc93","resolution":{"observed_at":"2026-08-14T15:08:28.982129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.866783Z","title":"An algorithm for fast optimal Latin hypercube design of experiments","venue":null,"work_id":"9b03efde-61c9-46df-9f6e-cca8ae3596c9","year":2010},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.434040Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:76682eb87cde53c15aff4a207cfa5d6f076c0b2e66e051ad2339bb7aaaac3c03","observation_id":"c32e7607-386b-4374-955c-475e5f33d83f","resolution":{"observed_at":"2026-08-14T15:08:28.874028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.755694Z","title":"A generalized discrepancy and quadrature error bound","venue":null,"work_id":"cbf238f0-efd2-414a-8422-ff29df9d684a","year":1998},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.441772Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:60ff7b30fd1e3df8f62f8e20577243d65d794bdffccb73cac11d4f615d2f842d","observation_id":"8d07f83a-06e1-46a6-ba01-729597a34a15","resolution":{"observed_at":"2026-08-14T15:08:28.804911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.731029Z","title":"Centered L2-Discrepancy of Random Sampling and Latin Hypercube Design, and Construction of Uniform Designs","venue":null,"work_id":"48905c3d-978e-4cd2-b9b8-f005539052ad","year":2002},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.447998Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:d8ea7c7b5709af17f837369acc26bc63202ec91f7cf004232756abfc3a4d182d","observation_id":"1ae6f186-88c3-42b2-aa37-2f9f3ee39567","resolution":{"observed_at":"2026-08-14T15:08:28.737926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.711406Z","title":"Optimizing Latin hypercube designs by particle swarm","venue":null,"work_id":"a6856d3f-161c-4c77-88fe-12295c7f3417","year":2013},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.455930Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:69f1556bdbcabc41ce75bbdb0c20a84cee84eac21c9ede08f648479606c9973a","observation_id":"3beef18a-1838-4393-8ba1-bb570f0fe26c","resolution":{"observed_at":"2026-08-14T15:08:28.717877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.644308Z","title":"Particle swarm optimization","venue":null,"work_id":"bd598564-d69a-46bd-a3d8-69b93d6f02f3","year":1995},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.521439Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:c48a58b1642544fa8e559b01d334bd9fc49a059b6ea1cb345350d2b1297ab7ff","observation_id":"61c59b23-a22f-4bdf-98ec-7c8db4d6f069","resolution":{"observed_at":"2026-08-14T15:08:28.654617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.551263Z","title":"A study on algorithms for optimization of Latin hypercubes","venue":null,"work_id":"a267772a-e0d8-4ed9-83bf-4d11571fda0a","year":2006},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.557161Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:2b58f133342dd9c0e542a218b52562eeffd2c881d55fa128bc14d9d486b37156","observation_id":"d2d50c37-e709-44d5-9806-41a14f448993","resolution":{"observed_at":"2026-08-14T15:08:28.620056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.459440Z","title":"Formulation of the optimal Latin hypercube design of experiments using a permutation genetic algorithm","venue":null,"work_id":"9bf08508-1feb-475d-8e0a-56e6054fb5dd","year":2004},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.565062Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:9ca7e31c3b4c88dca7a73d66fba0a586f1ce254b817ee9f10fd94832a9e9616d","observation_id":"1f88eab4-5eac-43b9-a2be-9f8806e3a496","resolution":{"observed_at":"2026-08-14T15:08:28.467975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.309699Z","title":"Flexible Nested Latin Hypercube Designs for Computer Experiments","venue":null,"work_id":"a70df648-bfa0-4e3a-8b12-2e82184f3497","year":2017},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.570694Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:23467b1018ae40a404237e5f2f538d1c75db2b335c827e482c22207b10c4b3ad","observation_id":"64332e35-c36f-411d-abf4-94bd83547198","resolution":{"observed_at":"2026-08-14T15:08:28.399250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:28.090663Z","title":"Construction of sliced orthogonal Latin hypercube designs","venue":null,"work_id":"d507b011-eb1e-4473-8fa2-5fba4cd69a2a","year":2013},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.577590Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:36388e872bc5be723ccc8548879db46b087416d8d301d830a57a7a2bf9c6123b","observation_id":"bba0f613-ab08-4f5f-a835-7bd06ef2d758","resolution":{"observed_at":"2026-08-14T15:08:28.177583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:27.921548Z","title":"Construction of sliced (nearly) orthogonal Latin hypercube designs","venue":null,"work_id":"808acc21-9615-4698-9b41-ef9402f3cf36","year":2014},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.637182Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:d54060b1466ec2c278136ae444d63db4f63f56765955a3d233bf98580125fcee","observation_id":"dc4e16e8-65dd-4421-bdfd-2857e6618f79","resolution":{"observed_at":"2026-08-14T15:08:27.931708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:08:27.841106Z","title":"Construction of second-order orthogonal sliced Latin hypercube designs","venue":null,"work_id":"6f3f46fc-5d94-4467-a4b1-445594e588a9","year":2015},"citing_paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T15:08:27.644421Z"},"links":{"citing_paper":"/paper/1908.01976"},"observation_digest":"sha256:c0adc2ab2d7a5bd4b4d45a1c36ea522a876b69c80ebf9efd1eee5a97b65ac40d","observation_id":"a32c1930-4a56-4eb1-ae75-d7c8ce3050d3","resolution":{"observed_at":"2026-08-14T15:08:27.847723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01976","last_updated":"2019-08-06T06:25:59Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-14T14:55:34.415233Z","submitted_at":"2019-08-06T06:25:59Z","title":"Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":35},"total_outbound_references":36},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.01976."}