Paper Citation Record · LEDGER

Sparse grids vs. random points for high-dimensional polynomial approximation

As of 17 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2506.24054.

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

pith.paper-citation-record.v1
2506.24054 v1

Coverage vector

measured 53 of 53 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T21:32:18.917792Z

measured 53 of 53 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

53 of 53 outbound references displayed

verified exact25
verified fuzzy7
unresolved16
parse uncertain0
malformed identifier3
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 25014864-2fe7-415a-82aa-a3d87df2925a · outbound

This paper cites Anderson, Z.

Sparse grids vs. random points for high-dimensional polynomial approximation Anderson, Z

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:14.072026Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 582e565f-e228-4dfb-85c6-9681ed618105 · outbound

This paper cites Bartel, M.

Sparse grids vs. random points for high-dimensional polynomial approximation Bartel, M

Reference 2

Resolution: verified exact; doi, observed 2026-08-06T21:32:22.817655Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 3a438f9f-6c76-438f-8911-071bf64ab124 · outbound

This paper cites Barthelmann, E.

Sparse grids vs. random points for high-dimensional polynomial approximation Barthelmann, E

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:14.245236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a33d9442-cd5a-4e7e-b134-67d79a0fa7f7 · outbound

This paper cites Bos, J.P.

Sparse grids vs. random points for high-dimensional polynomial approximation Bos, J.P

Reference 4

Resolution: malformed identifier; no resolver link, observed 2026-08-06T21:32:14.383122Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec9abca3-2f4f-4d34-8bd0-5fe867ed373f · outbound

This paper cites Bos, Fekete points as norming sets , Dolomites Research Notes on Approxi- mation, 11(4), 26-–34, 2018, doi: 10.14658/PUPJ-DRNA-2018-4-3.

Sparse grids vs. random points for high-dimensional polynomial approximation Bos, Fekete points as norming sets , Dolomites Research Notes on Approxi- mation, 11(4), 26-–34, 2018, doi: 10.14658/PUPJ-DRNA-2018-4-3

Reference 5

Resolution: verified exact; doi, observed 2026-08-06T21:32:22.778601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 6e05b91d-3c03-459e-820e-45ecef55b881 · outbound

This paper cites Bos, On optimal designs for a d-cube , Dolomites Research Notes on Ap- proximation, 15(4), 20–34, 2018, doi: 10.14658/PUPJ-DRNA-2022-4-3.

Sparse grids vs. random points for high-dimensional polynomial approximation Bos, On optimal designs for a d-cube , Dolomites Research Notes on Ap- proximation, 15(4), 20–34, 2018, doi: 10.14658/PUPJ-DRNA-2022-4-3

Reference 6

Resolution: verified exact; doi, observed 2026-08-06T21:32:22.758142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c2cb0810-68b8-437c-a6a6-f7eca6f0ac97 · outbound

This paper cites an unresolved cited work.

Sparse grids vs. random points for high-dimensional polynomial approximation Unresolved cited work

Reference 7

Resolution: verified exact; raw_fallback, observed 2026-08-06T21:32:23.884533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 6f361cf6-9058-4789-aeae-cf6752e2ee93 · outbound

This paper cites Bungartz and M.

Sparse grids vs. random points for high-dimensional polynomial approximation Bungartz and M

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:14.854458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90eb6fff-110c-4117-bcc0-cb9a8be6880d · outbound

This paper cites Becker, O.

Sparse grids vs. random points for high-dimensional polynomial approximation Becker, O

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:14.940623Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a14858c9-3dd7-4a06-8e97-d962b2ff7798 · outbound

This paper cites Calvi and N.

Sparse grids vs. random points for high-dimensional polynomial approximation Calvi and N

Reference 10

Resolution: verified exact; doi, observed 2026-08-06T21:32:22.591646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 318040fb-2215-41de-9ac1-ed2e85c81421 · outbound

This paper cites Chkifa, A.

Sparse grids vs. random points for high-dimensional polynomial approximation Chkifa, A

Reference 11

Resolution: verified exact; raw_fallback, observed 2026-08-06T21:32:23.794526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 781f75c2-2122-4bed-838a-0716175720fb · outbound

This paper cites Chkifa and M.

Sparse grids vs. random points for high-dimensional polynomial approximation Chkifa and M

Reference 12

Resolution: verified exact; doi, observed 2026-08-06T21:32:22.309268Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 0b488c9e-76cd-40d7-b8f7-33d9aad6e31b · outbound

This paper cites Cohen, M.A.

Sparse grids vs. random points for high-dimensional polynomial approximation Cohen, M.A

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:15.272450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dbc56ae-d696-45bb-a910-a555974076f0 · outbound

This paper cites Cohen, G.

Sparse grids vs. random points for high-dimensional polynomial approximation Cohen, G

Reference 14

Resolution: verified exact; doi, observed 2026-08-06T21:32:22.083581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c33cc2bb-7912-46c2-afc0-65fe564f303f · outbound

This paper cites Coleman and S.

Sparse grids vs. random points for high-dimensional polynomial approximation Coleman and S

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:24.011469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation d400a516-6b27-4d74-9862-7d6a8f8f8200 · outbound

This paper cites Dolbeault and A.

Sparse grids vs. random points for high-dimensional polynomial approximation Dolbeault and A

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:15.502069Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82bd3881-c34f-4518-b320-bbe576e79879 · outbound

This paper cites Dolbeault, D.

Sparse grids vs. random points for high-dimensional polynomial approximation Dolbeault, D

Reference 17

Resolution: verified exact; doi, observed 2026-08-06T21:32:21.759410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 445fbd96-76fc-4ce7-a326-ae4498ffaf1b · outbound

This paper cites Dai and A.

Sparse grids vs. random points for high-dimensional polynomial approximation Dai and A

Reference 18

Resolution: verified exact; doi, observed 2026-08-06T21:32:21.525647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c84b04d3-7be2-436a-8cc4-30996bf6c93d · outbound

This paper cites D˜ ung, V.

Sparse grids vs. random points for high-dimensional polynomial approximation D˜ ung, V

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:15.745005Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 435bc0eb-82e0-4e67-9719-93c89267d6bf · outbound

This paper cites Ehlich and K.

Sparse grids vs. random points for high-dimensional polynomial approximation Ehlich and K

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:15.839946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e875f42a-f685-4df8-b6d5-adf4a064bf00 · outbound

This paper cites Genz, Testing multidimensional integration routines, Proc.

Sparse grids vs. random points for high-dimensional polynomial approximation Genz, Testing multidimensional integration routines, Proc

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:23.991941Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation e8b9a008-8212-4b75-9e83-954ba6ed3073 · outbound

This paper cites an unresolved cited work.

Sparse grids vs. random points for high-dimensional polynomial approximation Unresolved cited work

Reference 22

Resolution: verified exact; doi, observed 2026-08-06T21:32:21.237549Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 190ed6b3-9deb-4202-bdf1-dd9c55295c5a · outbound

This paper cites Kernel interpolation on generalized sparse grids.

Sparse grids vs. random points for high-dimensional polynomial approximation Kernel interpolation on generalized sparse grids

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-08-06T21:32:23.593129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 81582036-7a2e-438e-9c76-18eaccb91844 · outbound

This paper cites Gr¨ ochenig, Sampling, Marcinkiewicz-Zygmund inequalities, approxima- tion, and quadrature rules , J.

Sparse grids vs. random points for high-dimensional polynomial approximation Gr¨ ochenig, Sampling, Marcinkiewicz-Zygmund inequalities, approxima- tion, and quadrature rules , J

Reference 24

Resolution: metadata mismatch; raw_fallback, observed 2026-08-06T21:32:23.569146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation d8094c6a-377b-4164-a113-8899cdc57c5b · outbound

This paper cites an unresolved cited work.

Sparse grids vs. random points for high-dimensional polynomial approximation Unresolved cited work

Reference 25

Resolution: verified exact; doi, observed 2026-08-06T21:32:21.044726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation b233809f-cbb7-45a3-b6eb-4e3e1812db6f · outbound

This paper cites Harris, K.J.Millman and S.

Sparse grids vs. random points for high-dimensional polynomial approximation Harris, K.J.Millman and S

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:16.381969Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5601399-5fe8-48f2-8755-b343409ef9d3 · outbound

This paper cites Johnson, Why, when, and how biochemists should use least squares , Ana- lytical biochemistry, 206(2), 215-225, 1992, doi: 10.1016/0003-2697(92)90356-c.

Sparse grids vs. random points for high-dimensional polynomial approximation Johnson, Why, when, and how biochemists should use least squares , Ana- lytical biochemistry, 206(2), 215-225, 1992, doi: 10.1016/0003-2697(92)90356-c

Reference 27

Resolution: verified exact; doi, observed 2026-08-06T21:32:20.856333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 5baeb6fc-5198-466e-9b11-17d8601157da · outbound

This paper cites an unresolved cited work.

Sparse grids vs. random points for high-dimensional polynomial approximation Unresolved cited work

Reference 28

Resolution: verified exact; doi, observed 2026-08-06T21:32:20.643597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 830ff12e-9ab6-4ce3-8901-8f8cd869d482 · outbound

This paper cites Kashin, S.

Sparse grids vs. random points for high-dimensional polynomial approximation Kashin, S

Reference 29

Resolution: malformed identifier; doi_truncated, observed 2026-08-06T21:32:20.438352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 3d5c12a3-2ed0-4d9a-b0ec-64a87fd0fa46 · outbound

This paper cites Kashin, E.

Sparse grids vs. random points for high-dimensional polynomial approximation Kashin, E

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:23.972067Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 8a402286-796d-4070-9d3c-33c6befbf0a2 · outbound

This paper cites Kro´ o,On optimal polynomial meshes, J.

Sparse grids vs. random points for high-dimensional polynomial approximation Kro´ o,On optimal polynomial meshes, J

Reference 31

Resolution: verified exact; doi, observed 2026-08-06T21:32:20.275116Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 600eadfb-0aae-421d-84b7-eea204eedb91 · outbound

This paper cites Krieg, K.

Sparse grids vs. random points for high-dimensional polynomial approximation Krieg, K

Reference 32

Resolution: verified exact; raw_fallback, observed 2026-08-06T21:32:23.488322Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation e36515c6-442d-47c5-82a7-79c7a27312ba · outbound

This paper cites Krieg, K.

Sparse grids vs. random points for high-dimensional polynomial approximation Krieg, K

Reference 33

Resolution: verified exact; raw_fallback, observed 2026-08-06T21:32:23.392626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c3d2aea2-ade3-471b-b67a-135de32d6f0c · outbound

This paper cites Krieg, P.

Sparse grids vs. random points for high-dimensional polynomial approximation Krieg, P

Reference 34

Resolution: verified exact; doi, observed 2026-08-06T21:32:20.094081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation b5c2a88b-c1c7-46b8-ab5a-570d5d4eae2c · outbound

This paper cites Krieg and M.

Sparse grids vs. random points for high-dimensional polynomial approximation Krieg and M

Reference 35

Resolution: malformed identifier; no resolver link, observed 2026-08-06T21:32:17.155400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6f79af7-b60d-430a-a71a-e167800ff657 · outbound

This paper cites Krieg and M.

Sparse grids vs. random points for high-dimensional polynomial approximation Krieg and M

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:17.247504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59842125-a01c-4ab5-99e1-d85f0104e2b7 · outbound

This paper cites Lines and S.

Sparse grids vs. random points for high-dimensional polynomial approximation Lines and S

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:23.954859Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation a73ea38e-189b-43d0-b4f3-e93327172af9 · outbound

This paper cites Migliorati, F.

Sparse grids vs. random points for high-dimensional polynomial approximation Migliorati, F

Reference 38

Resolution: verified exact; doi, observed 2026-08-06T21:32:19.932438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 98a4ef90-06a7-4ed3-82a1-22868c7fd841 · outbound

This paper cites A Christoffel function weighted least squares algorithm for collocation approximations.

Sparse grids vs. random points for high-dimensional polynomial approximation A Christoffel function weighted least squares algorithm for collocation approximations

Reference 39

Resolution: verified exact; local_arxiv, observed 2026-08-06T21:32:23.228849Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation e06c4d53-7156-45c9-8294-149af9d1de72 · outbound

This paper cites Novak and K.

Sparse grids vs. random points for high-dimensional polynomial approximation Novak and K

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:17.762149Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8382b0b7-0e11-4bc0-a1c4-749c0ebef1d0 · outbound

This paper cites Novak and K.

Sparse grids vs. random points for high-dimensional polynomial approximation Novak and K

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:17.869858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b021624-a027-4819-acd7-e2ffe59e6337 · outbound

This paper cites Narayan and Y.

Sparse grids vs. random points for high-dimensional polynomial approximation Narayan and Y

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:17.968675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb195b3d-9c6c-4a4c-baf1-5f983f1abbcc · outbound

This paper cites Reichel On polynomial approximation in the uniform norm by the discrete least squares method , BIT, 26(3), 349–368, 1986, doi: 10.1007/BF01933715.

Sparse grids vs. random points for high-dimensional polynomial approximation Reichel On polynomial approximation in the uniform norm by the discrete least squares method , BIT, 26(3), 349–368, 1986, doi: 10.1007/BF01933715

Reference 43

Resolution: verified exact; doi, observed 2026-08-06T21:32:19.750617Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation ab0bd6cb-9307-4b7b-b0d5-dbc34bc45898 · outbound

This paper cites Smolyak, Quadrature and interpolation formulas for tensor products of certain classes of functions , Dokl.

Sparse grids vs. random points for high-dimensional polynomial approximation Smolyak, Quadrature and interpolation formulas for tensor products of certain classes of functions , Dokl

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:23.936044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 9da39065-d5a3-4dcf-aeb7-02f52e61e3ca · outbound

This paper cites Sonnleitner, M.

Sparse grids vs. random points for high-dimensional polynomial approximation Sonnleitner, M

Reference 45

Resolution: verified exact; doi, observed 2026-08-06T21:32:19.542153Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 5a5e59b8-c48d-4262-834a-44a2d044f623 · outbound

This paper cites Stoyanov, User manual: TASMANIAN sparse grids , ORNL/TM- 2015/596, 2015.

Sparse grids vs. random points for high-dimensional polynomial approximation Stoyanov, User manual: TASMANIAN sparse grids , ORNL/TM- 2015/596, 2015

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:23.919287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 4d5405f4-c0db-4c22-859b-e8f23be3cd6d · outbound

This paper cites Stoyanov, D.

Sparse grids vs. random points for high-dimensional polynomial approximation Stoyanov, D

Reference 47

Resolution: verified exact; doi, observed 2026-08-06T21:32:19.350057Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 4d9f34ce-aeb3-409e-a508-a728248eadfd · outbound

This paper cites Surjanovic and D.

Sparse grids vs. random points for high-dimensional polynomial approximation Surjanovic and D

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T21:32:23.902315Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 600a6334-b585-4141-bcfe-98959baadba2 · outbound

This paper cites an unresolved cited work.

Sparse grids vs. random points for high-dimensional polynomial approximation Unresolved cited work

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:18.558785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55ca56da-9e4e-42cc-9eb7-3b103357ce20 · outbound

This paper cites Temlyakov, Approximation of periodic functions of several variables by trigonometric polynomials, and widths of some classes of functions , Math.

Sparse grids vs. random points for high-dimensional polynomial approximation Temlyakov, Approximation of periodic functions of several variables by trigonometric polynomials, and widths of some classes of functions , Math

Reference 50

Resolution: verified exact; doi, observed 2026-08-06T21:32:19.177002Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 7f04541a-8b98-4725-b19b-2dcdb922b93e · outbound

This paper cites Ullrich, On the worst-case error of least squares algorithms for L2- approximation with high probability , J.

Sparse grids vs. random points for high-dimensional polynomial approximation Ullrich, On the worst-case error of least squares algorithms for L2- approximation with high probability , J

Reference 51

Resolution: metadata mismatch; raw_fallback, observed 2026-08-06T21:32:23.031250Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 21594010-7237-4172-9851-6cc50b48ff88 · outbound

This paper cites Virtanen, R.

Sparse grids vs. random points for high-dimensional polynomial approximation Virtanen, R

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:18.819626Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3cdf8f70-9f48-4394-ad43-5ab4b576fd03 · outbound

This paper cites Wasilkowski and H.

Sparse grids vs. random points for high-dimensional polynomial approximation Wasilkowski and H

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-06T21:32:18.917792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.