Pith. sign in

Paper Citation Record · LEDGER

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.01976 v1

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T15:08:27.644421Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

36 of 36 outbound references displayed

  • verified exact1
  • verified fuzzy35
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation eb28fd61-913e-428b-944b-efbdc3d33b38 · outbound

This paper cites A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.673593Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.605034Z digest=sha256:02456257d09b4a05d87e0385668c8a1b874250d1828abcc12e1e577c48c51685

Observation d57f0e0f-f753-4859-bb37-55ebd26efd42 · outbound

This paper cites Sliced Latin Hypercube Designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Sliced Latin Hypercube Designs

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.652653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.611180Z digest=sha256:f43ac290321fa3c02839dbe84090740f9f9011ed7da41506578adec110244aa9

Observation 0c26ecd4-24cd-4bfa-b589-b6aa2ca1601d · outbound

This paper cites A central limit theorem for nested or sliced Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes A central limit theorem for nested or sliced Latin hypercube designs

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.543690Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.617075Z digest=sha256:f535958e9e66f100e82edca5e61bc975393e3079015d69be2972ca20238cbca3

Observation ef931140-085b-42de-98b8-d1917f5c9de0 · outbound

This paper cites Gaussian Process Models for Computer Experiments with Qualitative and Quantitative Factors.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Gaussian Process Models for Computer Experiments with Qualitative and Quantitative Factors

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.500247Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.686548Z digest=sha256:e90467fb65b41fd6b63ba0f509b7517578ddd9755cbaad24cedebeff61c9d551

Observation 54628474-ea10-4fd0-ac2a-884fb1304b88 · outbound

This paper cites Prediction for Computer Experiments Having Quantitative and Qualitative Input Variables.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Prediction for Computer Experiments Having Quantitative and Qualitative Input Variables

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.368720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.700392Z digest=sha256:772b23397a8aafbe183af747f74e0a1750b9c41fcfd2622718c46fd4d9b9353a

Observation 611df43a-7fd9-4932-954f-6044e5c0abcf · outbound

This paper cites Additive Gaussian Process for Computer Models With Qualitative and Quantitative Factors.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Additive Gaussian Process for Computer Models With Qualitative and Quantitative Factors

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.252463Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.707765Z digest=sha256:c5aa8e7df002a8cf39527df9d61ecb795e2753f7c7deacb9e2db085cafc5d7aa

Observation e8eb624a-59fe-4e00-8b8b-970d333d8d08 · outbound

This paper cites Sliced orthogonal array-based Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Sliced orthogonal array-based Latin hypercube designs

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.219917Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.754428Z digest=sha256:6498c001a8c5d032c18e4ace2ebf99f09a2e6cf7a3a4749de2d1823267d60d6c

Observation 4d37d352-2993-4821-8a4c-3cabe671d47e · outbound

This paper cites Sliced Latin hypercube designs via orthogonal arrays.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Sliced Latin hypercube designs via orthogonal arrays

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.130959Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.804784Z digest=sha256:d23e94cc4c6885dfc4b73e9183d757e5abd8737af0e6e83baa6f5d767500f560

Observation 291fe389-4932-44c0-b7e1-74b8e7c6e16c · outbound

This paper cites General sliced Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes General sliced Latin hypercube designs

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:30.016737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.812014Z digest=sha256:e8edfa61adcaf567a9ed5512c142cd4a57b6fa7eb1d40c77290e90f27182e742

Observation 0d314b29-f91a-4eb1-889e-37627716d0c1 · outbound

This paper cites Construction of sliced maximin-orthogonal Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Construction of sliced maximin-orthogonal Latin hypercube designs

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.975273Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.818163Z digest=sha256:d5ab18a12f91ae8eb2c02c083d04395100500768ba7187026171da15c8efa16f

Observation 8590be55-cfc2-47e6-a514-0c37899e4be0 · outbound

This paper cites Computer Experiments With Both Qualitative and Quantitative Variables.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Computer Experiments With Both Qualitative and Quantitative Variables

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.839368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.869009Z digest=sha256:4721883e84ff2f215025c19f0f5455c3de705fcbcc04967e3b09763652870906

Observation 35853ce2-5d5f-4b99-86ff-4d30c476fe80 · outbound

This paper cites Predicting the Output from a Complex Computer Code When Fast Approximations Are Available.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Predicting the Output from a Complex Computer Code When Fast Approximations Are Available

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.813022Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.920457Z digest=sha256:e1df7bfcabca9fb8b557e7df2b580562be1d8213967b9b139fb4701aff1f00cb

Observation af3fe40d-781b-4853-8d7a-15727937ea65 · outbound

This paper cites Building surrogate models based on detailed and approximate simulations.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Building surrogate models based on detailed and approximate simulations

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.711086Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.927920Z digest=sha256:74839e5d67e488746efaaee775859b6d811732e30c35ab438805e54577e8142c

Observation 6aec6d73-9f1e-4dcd-b706-9127842c6a85 · outbound

This paper cites Optimal Sliced Latin Hypercube Designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Optimal Sliced Latin Hypercube Designs

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.679430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.935933Z digest=sha256:9fc822e3f32f6db8b6c411ee19c9b55daa5e379b70081a78007b0441c2466b9e

Observation b71d376d-a631-4024-8e11-1241bd493ccd · outbound

This paper cites Uniform sliced Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Uniform sliced Latin hypercube designs

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.585676Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.944745Z digest=sha256:a54d672f5fee0ef8ae3dcef72649c812f7577c3597614e4fd28d0b8ad84da93f

Observation 74cdb14d-75c9-4442-9653-120802774324 · outbound

This paper cites Flexible sliced designs for computer experiments.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Flexible sliced designs for computer experiments

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.560687Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.968801Z digest=sha256:7d42931cd6151c02cd7c36996314aa117f38d1056576c3dbc579c5f9415ce7f5

Observation c524531f-b388-4051-bb1b-d52d483f08fb · outbound

This paper cites Sliced Latin Hypercube Designs for Computer Experiments With Unequal Batch Sizes.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Sliced Latin Hypercube Designs for Computer Experiments With Unequal Batch Sizes

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.497905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.974974Z digest=sha256:57fcf1eed972b04d99a2e6a0315fc0b0d5a4ec44d8a6f0e65c04499c3fc86f3f

Observation 73c55f35-f320-4cbb-9dc4-7681e0d57b1d · outbound

This paper cites Sliced Latin hypercube designs with arbitrary run sizes.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Sliced Latin hypercube designs with arbitrary run sizes

Reference 18

Resolution
verified exact
local_arxiv, observed 2026-08-14T15:08:27.803049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.981422Z digest=sha256:b785842526a43739d09aba99eb8f9a69b1e6aa09fb947b8c9748b3b1c5bb4879

Observation a37b40ca-5ae5-48d2-a2e4-167c8b7222f3 · outbound

This paper cites Minimax and maximin distance designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Minimax and maximin distance designs

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.411798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.987572Z digest=sha256:1c6edde3f5159912f3dc205d1edd4da804bed71b5d516ee832b4c41e87924801

Observation a12b4ba4-cfa4-449a-87f4-cee6e0983632 · outbound

This paper cites Finding maximin latin hypercube designs by Iterated Local Search heuristics.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Finding maximin latin hypercube designs by Iterated Local Search heuristics

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.312747Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:26.993152Z digest=sha256:86d8aa5e68edbb74238095675dd8f8cae5fe3e4795f79b1b5e2a3dcdfb804346

Observation e1aa920e-456f-4ca2-9541-dadfd8c18076 · outbound

This paper cites Maximin Latin Hypercube Designs in Two Dimensions.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Maximin Latin Hypercube Designs in Two Dimensions

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.232317Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.057271Z digest=sha256:ef622d53bd09a30ea8f19dd2b2baf1b4cfd0c6547c4fe801512264dc4d18977a

Observation d26ec316-546b-4a1d-8070-0277a6be5694 · outbound

This paper cites Bounds for Maximin Latin Hypercube Designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Bounds for Maximin Latin Hypercube Designs

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.186893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.124754Z digest=sha256:eae298b13f293dd26ec0a31a86f37106552b5c3d827bb73f3a129f53148132f3

Observation ad20af49-069f-4e67-abad-ab96da448164 · outbound

This paper cites An efficient algorithm for constructing optimal design of computer experiments.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes An efficient algorithm for constructing optimal design of computer experiments

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.110466Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.196223Z digest=sha256:8b62841051a423b791509661b684e58b0907d0e6b6611db3753e4726e8312c3a

Observation f029cda6-e2e2-4fa2-87c9-50d17726fe5a · outbound

This paper cites Exploratory designs for computational experiments.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Exploratory designs for computational experiments

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:29.023997Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.271291Z digest=sha256:5ad6ba58c1b37da43ff0fe686895c4a705ca34d35450ea9d2b1db5e6bd0ceeed

Observation 9b425ecf-c3fa-4474-8a59-2239c479cc93 · outbound

This paper cites Algorithmic construction of optimal symmetric Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Algorithmic construction of optimal symmetric Latin hypercube designs

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.982129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.329084Z digest=sha256:b8a935087cd1daae27f3edf7a1e08090eb3cd48229022f9df740dda69deeafa7

Observation c32e7607-386b-4374-955c-475e5f33d83f · outbound

This paper cites An algorithm for fast optimal Latin hypercube design of experiments.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes An algorithm for fast optimal Latin hypercube design of experiments

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.874028Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.434040Z digest=sha256:4ee8c79025c95f98aaef6bd99b602f7b816d8c6cfdded1b72e4ce0da01c964b0

Observation 8d07f83a-06e1-46a6-ba01-729597a34a15 · outbound

This paper cites A generalized discrepancy and quadrature error bound.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes A generalized discrepancy and quadrature error bound

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.804911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.441772Z digest=sha256:be7fd5d4c82bbe74a4537489f17b77d76b7adb66701d0285761b8527f17e74d6

Observation 1ae6f186-88c3-42b2-aa37-2f9f3ee39567 · outbound

This paper cites Centered L2-Discrepancy of Random Sampling and Latin Hypercube Design, and Construction of Uniform Designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Centered L2-Discrepancy of Random Sampling and Latin Hypercube Design, and Construction of Uniform Designs

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.737926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.447998Z digest=sha256:95bdb18fd8479a32a6bf1a7a7effad539c70f43f1d4f202710c85b81d738d4fd

Observation 3beef18a-1838-4393-8ba1-bb570f0fe26c · outbound

This paper cites Optimizing Latin hypercube designs by particle swarm.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Optimizing Latin hypercube designs by particle swarm

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.717877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.455930Z digest=sha256:8fc9e6a4602a0e0090994a932a23b1a43937d54afc0c7c5f968e7107352f43a7

Observation 61c59b23-a22f-4bdf-98ec-7c8db4d6f069 · outbound

This paper cites Particle swarm optimization.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Particle swarm optimization

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.654617Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.521439Z digest=sha256:b14600bcb4251e00c930e05c7947217b8e16690bd612586fa5a7e2468e6c200a

Observation d2d50c37-e709-44d5-9806-41a14f448993 · outbound

This paper cites A study on algorithms for optimization of Latin hypercubes.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes A study on algorithms for optimization of Latin hypercubes

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.620056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.557161Z digest=sha256:7f7d7e35ad820a8c56542463ee7637c46da9d12ac3542c41634cb603b33250ee

Observation 1f88eab4-5eac-43b9-a2be-9f8806e3a496 · outbound

This paper cites Formulation of the optimal Latin hypercube design of experiments using a permutation genetic algorithm.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Formulation of the optimal Latin hypercube design of experiments using a permutation genetic algorithm

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.467975Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.565062Z digest=sha256:49ae73b960cc53f04e5d970ad49a8d62e615f891271b8bb83601adb091232225

Observation 64332e35-c36f-411d-abf4-94bd83547198 · outbound

This paper cites Flexible Nested Latin Hypercube Designs for Computer Experiments.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Flexible Nested Latin Hypercube Designs for Computer Experiments

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.399250Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.570694Z digest=sha256:4b525cfcfa3a5225e1817980e50ee4825dbb472dc86c39c4bdaf71a6fb81def4

Observation bba0f613-ab08-4f5f-a835-7bd06ef2d758 · outbound

This paper cites Construction of sliced orthogonal Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Construction of sliced orthogonal Latin hypercube designs

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:28.177583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.577590Z digest=sha256:dd25aa17b3009b56e926aab367d432cbc44d34f8bef13cfe4caeac33d27c60a2

Observation dc4e16e8-65dd-4421-bdfd-2857e6618f79 · outbound

This paper cites Construction of sliced (nearly) orthogonal Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Construction of sliced (nearly) orthogonal Latin hypercube designs

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:27.931708Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.637182Z digest=sha256:2f9805cdc05ba1b56d36e30981ed26f8f885f4aa01b1bf6a1ef972bf5e7a8b9e

Observation a32c1930-4a56-4eb1-ae75-d7c8ce3050d3 · outbound

This paper cites Construction of second-order orthogonal sliced Latin hypercube designs.

Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes Construction of second-order orthogonal sliced Latin hypercube designs

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T15:08:27.847723Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-14T15:08:27.644421Z digest=sha256:d9dc34f083ad88305e84d863f88fec1ea99639fec92cc04d427996059b9844df

Pith citing papers

No inbound Pith citation observations are available.