{"as_of":"2026-08-14T12:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e72ce17e35df247980a17c515dfda262d3e3bf14ecc8cef3bef0ff4b0beedcfa","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:44:51.513666Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:04:41.631811Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T23:04:42.227534Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"cited_work":{"arxiv_id":"2411.19164","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.19164","snapshot_observed_at":"2026-08-10T23:04:42.227534Z","title":"A simple universal algorithm for high-dimensional integration","venue":"math.NA","work_id":"362168f4-7c0e-4fea-b85d-51e395d38af0","year":2024},"citing_paper":{"arxiv_id":"2501.00150","last_updated":"2025-07-15T01:20:28Z","snapshot_observed_at":"2026-08-14T06:52:57.045319Z","submitted_at":"2024-12-30T21:51:18Z","title":"Error estimation for quasi-Monte Carlo","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:41.631811Z"},"links":{"cited_paper":"/paper/2411.19164","citing_paper":"/paper/2501.00150"},"observation_digest":"sha256:51c6d997be687cb81fc07637570bcff09f736c7ee09743bceb48f22a2324ff7c","observation_id":"a2a691d4-64bf-48ac-a624-cbecd0686056","resolution":{"observed_at":"2026-08-10T23:04:42.233022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.19164/citation-record","integrity":"/paper/2411.19164/integrity","json":"/paper/2411.19164/citation-record.json","paper":"/paper/2411.19164"},"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-12T10:44:52.080153Z","title":null,"venue":null,"work_id":"a2a79c1b-6a9a-47a3-8037-98b2bd2cc801","year":1961},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.407691Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:0c6c77b2ce8e58a9da908b22957edfc86a626dc46f0360decda45d880c646e4e","observation_id":"5c1ba12f-69d4-4dcd-a340-be3991c4ec7f","resolution":{"observed_at":"2026-08-12T10:44:52.084065Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2406.16627","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:44:51.771632Z","title":null,"venue":null,"work_id":"ee9fe0cc-9f59-41aa-b0ce-44ef09a09f2b","year":2024},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.412506Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:53a04f119dcf8c5a092febc77021796321e77a702bd1143edfe43580397e72f9","observation_id":"ae5242bf-af64-46c1-8e8a-988bccbb7a4b","resolution":{"observed_at":"2026-08-12T10:44:51.778415Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:52.068012Z","title":"Dick and T","venue":null,"work_id":"2e061138-8cad-45e6-ab8d-669783e342f9","year":2021},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.417556Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:2140834fa8573c2da03bba9db1bef60d76fffc3c58331956b023544efc5f897e","observation_id":"0a6dd197-1e91-4f19-bf2b-b1813606ce6f","resolution":{"observed_at":"2026-08-12T10:44:52.072006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:52.057417Z","title":null,"venue":null,"work_id":"0c00ba48-a326-4370-a7fd-ff76f620d524","year":2022},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.421451Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:9aa75945245defa60a853a67302b659117643ca911384d7c05afd98f54d4b191","observation_id":"28a747b7-5d74-467a-b311-0f5e2fb0f5e7","resolution":{"observed_at":"2026-08-12T10:44:52.061004Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:52.046010Z","title":null,"venue":null,"work_id":"10b0fd64-b6bb-416f-bad0-412462e41f92","year":2015},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.425890Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:934cbb2d157d479c478fc7b6518f8d7febe046ed2de5adcf55dd86bce473051b","observation_id":"518adabd-426f-4916-ad92-25dce51da56d","resolution":{"observed_at":"2026-08-12T10:44:52.050346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:52.033012Z","title":null,"venue":null,"work_id":"3c9254cd-bda9-400d-bc86-1da464e42f1f","year":2022},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.429905Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:0528ec10c95eb8d8da2ca2844fb62ceaa0a0317a1e93d3722416d8a8030c3ec7","observation_id":"f60e3df9-8843-41dc-9cb0-ff02e26332c8","resolution":{"observed_at":"2026-08-12T10:44:52.037291Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:52.020508Z","title":null,"venue":null,"work_id":"40e53f41-d01b-4e08-8c9f-1e6f3c1c55f7","year":2014},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.434042Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:83fa654ae5153049463815e63a0c0c28e127307e315486ad9df19e18ff27ba67","observation_id":"d083e47c-940b-4865-a2c6-e20986c7d45a","resolution":{"observed_at":"2026-08-12T10:44:52.024699Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:52.008595Z","title":null,"venue":null,"work_id":"1ad40aae-beac-4edb-a49a-525524351918","year":2006},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.437880Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:45a1a8af314334f4e868c491cb27c37a9ed590cb199c5c4060a20fb56865023a","observation_id":"f3f6c852-511d-4525-8a71-1dc82a27a558","resolution":{"observed_at":"2026-08-12T10:44:52.012501Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.996096Z","title":"Ebert, P","venue":null,"work_id":"19ca670b-8e6a-4e72-ae4e-db80433e9a50","year":2021},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.441463Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:a32e1db81e6eb914023448322002b82cc0774bbc02532963b6d230acf906395a","observation_id":"a454f5b5-c77e-4283-80a8-0df6473b3d7e","resolution":{"observed_at":"2026-08-12T10:44:52.000073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2409.12879","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:44:51.681043Z","title":"Gnewuch, J","venue":null,"work_id":"cb1b1b55-6e42-41bb-a7c7-05e136f84bae","year":2024},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.445643Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:72db303ab70587985d39ffcff3272981984d006368cce5d4cdeaec3f22e407e6","observation_id":"bbee0e48-efa8-46d3-a167-44a96bc0d7dd","resolution":{"observed_at":"2026-08-12T10:44:51.689881Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02660","last_updated":"2024-11-17T23:26:27Z","snapshot_observed_at":"2026-08-13T04:03:24.289381Z","submitted_at":"2024-03-05T05:10:58Z","title":"A randomized lattice rule without component-by-component construction","version":3},"cited_work":{"arxiv_id":"2403.02660","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02660","snapshot_observed_at":"2026-08-12T10:44:51.556560Z","title":"A randomized lattice rule without component-by-component construction","venue":"math.NA","work_id":"1fc45858-1a7d-4463-a08e-ec2dcee44424","year":2024},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.449549Z"},"links":{"cited_paper":"/paper/2403.02660","citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:9355eee9fb237fedfa2c8cf7c9a9d61c0b2f8e318d61e27a5652d1d56294eaef","observation_id":"c8685e13-67ea-420f-8bdc-a8781ab9a272","resolution":{"observed_at":"2026-08-12T10:44:51.562721Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.984771Z","title":"Goda and P","venue":null,"work_id":"15cb9e79-6993-4682-b555-f310b4aeef0f","year":2022},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.454048Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:ccbdd5653cd50dfd57a5f4e3c9a0148bce74ecbcf6f1b8ff9848d1e6791a8e9c","observation_id":"e01f9d1a-164b-4e9a-b3b8-275b36296bbf","resolution":{"observed_at":"2026-08-12T10:44:51.988790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.972584Z","title":null,"venue":null,"work_id":"e4bb50e2-9db7-477b-9cfe-354a632b5102","year":2024},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.458043Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:43aa18aeb54aeaee81782fadaebb4102d853aa59587a4beb59a3002a1163c579","observation_id":"4f5b89f5-3bcb-4581-8d56-c6b50595bb56","resolution":{"observed_at":"2026-08-12T10:44:51.977373Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.961191Z","title":"Hofstadler and D","venue":null,"work_id":"d48d6aa3-ee97-4fed-acdf-284d57f139ca","year":2023},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.461805Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:77606d570e5489bd5de1398b183702028f0b12ceae332f6db7f68156560bd118","observation_id":"6718e24e-c56b-4c1e-8eb1-4426e3bfda96","resolution":{"observed_at":"2026-08-12T10:44:51.965075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.949792Z","title":"Krieg and E","venue":null,"work_id":"206a4e31-d247-4b77-9d60-57d24bb50893","year":2017},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.465188Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:1dc7e18c7d4d0e1fe35c39f1ac0ae42b41ddcd0367f6df3236e65e41a8aa9a74","observation_id":"85dddf52-7a16-46dd-8466-1092171f2fc7","resolution":{"observed_at":"2026-08-12T10:44:51.953567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.938128Z","title":"Kritzer, F","venue":null,"work_id":"0fb6b835-4cc5-41ea-a7e6-4ab6365b23ee","year":2019},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.469761Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:adb4a3800e44cd25ebb246c795b067c12d280a800f4856b0099ca3e50aacf46a","observation_id":"a473b0e6-e76c-48bb-bf7e-ff9da5b3ee0a","resolution":{"observed_at":"2026-08-12T10:44:51.942190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.927022Z","title":null,"venue":null,"work_id":"f337c6a4-9785-48b0-b3b4-651e3a9fa159","year":2019},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.474252Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:60909cde6981dad3b500bcded4734b11cc2014fbdb832162f19eeac96b733d3d","observation_id":"48226c46-3d52-429e-85d1-c50c34d2800c","resolution":{"observed_at":"2026-08-12T10:44:51.930765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.914237Z","title":null,"venue":null,"work_id":"83eb9d96-bcda-4e42-b268-3a5042f7080a","year":2019},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.478043Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:8610242867d90c7c5090205e89b035f726550b48763ebe9f651c8fe6bfc25d10","observation_id":"e5c0903e-cf40-48da-8609-5aa115c0497a","resolution":{"observed_at":"2026-08-12T10:44:51.918727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.899584Z","title":null,"venue":null,"work_id":"1826040e-ac97-4756-a3f9-dc2824163050","year":2003},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.481544Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:614e553514bac65d4cb9e8ae0ebfa6865ae8d47da5659211eea5a76dcd36f169","observation_id":"5912ada9-9508-46d1-97a7-d27b9c4453f0","resolution":{"observed_at":"2026-08-12T10:44:51.903686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.886954Z","title":null,"venue":null,"work_id":"f5678c2b-ccda-4ccd-8289-621e21d12775","year":2023},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.485587Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:1287ba03f1a611df9b6b9aec4110651feb6612966b555c5130039193b59e4d93","observation_id":"30b09146-b83b-4dea-b2ed-30ea5b3c2c7e","resolution":{"observed_at":"2026-08-12T10:44:51.891455Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.872532Z","title":null,"venue":null,"work_id":"3cc43cfd-1749-416d-b00b-ce4ca97cae6a","year":2007},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.489171Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:c73edf42093e94433d455ee636daf26899a5f58042a7637944219f25d9ac05e9","observation_id":"51a3dccc-8607-4ecf-b8ca-7bccfd19deec","resolution":{"observed_at":"2026-08-12T10:44:51.878564Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.859453Z","title":null,"venue":null,"work_id":"e62a616a-3019-4fda-861c-bd987241996e","year":2017},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.492722Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:20b40c0cc1fa5c49a8dc11641262af4c3c6582099442326b0eaa52de0b6acdfe","observation_id":"7d634c82-16df-4bb8-883f-e55e647d1240","resolution":{"observed_at":"2026-08-12T10:44:51.864900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.845048Z","title":"Nuyens and R","venue":null,"work_id":"c8aac364-a087-4b42-9179-ef10265f1740","year":2006},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.496212Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:65b5292c9a666bd04e2c98cc487bad6abae7f315220f668156d959f01e79a5b8","observation_id":"c7758e72-51e1-4e5f-a7d1-228276cc8c96","resolution":{"observed_at":"2026-08-12T10:44:51.849529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01397","last_updated":"2025-02-20T15:36:36Z","snapshot_observed_at":"2026-08-14T09:17:17.087317Z","submitted_at":"2024-11-03T01:27:11Z","title":"Automatic optimal-rate convergence of randomized nets using median-of-means","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01397","snapshot_observed_at":"2026-08-12T10:44:51.499519Z","title":"Pan, Automatic optimal-rate convergence of randomized nets using median- of-means, arXiv preprint arXiv:2411.01397 (2024), 34 pp","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.499519Z"},"links":{"cited_paper":"/paper/2411.01397","citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:66772d1f7a5b728123198d2ac21d1063048ee5e04ce5e50fd20bd0c6996b8e64","observation_id":"ee8e5925-7cdb-4d4b-8718-830ac8d859a2","resolution":{"observed_at":"2026-08-12T10:44:51.499519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:44:51.832213Z","title":"Pan and A","venue":null,"work_id":"cf91d02c-e5f8-4aba-b12d-5c48140ecf4c","year":2023},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.503160Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:58ca5c90532304851ebc05d46bf9048b8b2fb5a2260faba9b3af24b54cc1e501","observation_id":"19282d75-3e12-4759-bab4-6440464ff16b","resolution":{"observed_at":"2026-08-12T10:44:51.836719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.815865Z","title":null,"venue":null,"work_id":"a7620a08-15ff-4527-8db2-1fa814a97c91","year":2024},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.506610Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:79aaaf49c3bc126c2fdda7a8372c78dce162549223d871f0796bccbeb22f7c2c","observation_id":"74f72fa7-8657-43d3-966e-d9f8cdcf2305","resolution":{"observed_at":"2026-08-12T10:44:51.820765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.801772Z","title":null,"venue":null,"work_id":"6265a5ca-13ac-4818-ba34-e26e743dcb2e","year":2002},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.510144Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:e9d26c74cb4a142e02b3efb3592eddf382e616b2a48e7285894c994ebf81bca6","observation_id":"10a67fe9-ef20-422d-9880-56678ed5a56c","resolution":{"observed_at":"2026-08-12T10:44:51.807315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T10:44:51.787733Z","title":"Ullrich, A Monte Carlo method for integration of multivariate smooth func- tions, SIAM J","venue":null,"work_id":"f9855cf2-4766-4b85-b3e8-fafe1999dbc9","year":2017},"citing_paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T10:44:51.513666Z"},"links":{"citing_paper":"/paper/2411.19164"},"observation_digest":"sha256:8e2b5871cacc103690ced16fe680fe36ecc1e3de0b661fb3daea1d687f87cc36","observation_id":"41e91d12-b34a-47b3-abe2-958426d13c31","resolution":{"observed_at":"2026-08-12T10:44:51.792395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.19164","last_updated":"2024-11-28T14:06:42Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-13T17:34:26.444169Z","submitted_at":"2024-11-28T14:06:42Z","title":"A simple universal algorithm for high-dimensional integration"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":9},"total_outbound_references":28},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2411.19164."}