{"as_of":"2026-08-16T09:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df455722a9a7e2f9717cac89160fe4f8afd6589803faa640dfcbb068a9472267","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:18:04.836865Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"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.05943/citation-record","integrity":"/paper/1908.05943/integrity","json":"/paper/1908.05943/citation-record.json","paper":"/paper/1908.05943"},"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-14T13:18:05.502567Z","title":null,"venue":null,"work_id":"0b6a7f3f-91f3-4073-91a2-6ae8492abe39","year":2010},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.636845Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:0c5ed9c2fea714468267085c2aba940b691c57dae30b6ab40139449ba9abe842","observation_id":"9621267e-9539-4f33-b6ac-bdcfd2ee69e0","resolution":{"observed_at":"2026-08-14T13:18:05.506722Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.486953Z","title":"Barthelmann, E","venue":null,"work_id":"41a20a30-2e2d-4c29-87bd-4758cd166c70","year":2000},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.641494Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:16bdd7ecf2a30c28532e9e47e4840a0f082097d1256b19e59162e8cbda93c0e0","observation_id":"d1e57a6f-aa28-4e52-ac6b-a637c92855f3","resolution":{"observed_at":"2026-08-14T13:18:05.492346Z","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-14T13:18:05.471566Z","title":"non-smooth","venue":null,"work_id":"ad4127b2-6b13-4adb-b149-9f9f8d521f1b","year":1970},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.645545Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:5fcb4c3dc0438d622fc0490640377377ad44fdaf030596ab68124d6db9000632","observation_id":"0cc6f0cd-6614-4607-8b27-29c35059e8dc","resolution":{"observed_at":"2026-08-14T13:18:05.475586Z","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-14T13:18:05.456832Z","title":null,"venue":null,"work_id":"f616d3ee-5942-4249-bfbe-a8ac9a17e325","year":1979},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.649081Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:d48e45500c595408ece2568485df0763140eb4e76b88c94210caed46695b1b21","observation_id":"861be4f6-14de-4754-9a59-47fc12b2c282","resolution":{"observed_at":"2026-08-14T13:18:05.462036Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.443834Z","title":null,"venue":null,"work_id":"7e8dbb63-baa6-416d-911d-5d4920b6c47f","year":1980},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.653820Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:a1ecdf08084826b4f09d06e7091400469578808f32e35b7f3f7eefc3fcfbe5f4","observation_id":"bbd294d1-7423-43cb-b04d-e47fcd97a2e9","resolution":{"observed_at":"2026-08-14T13:18:05.447873Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.427556Z","title":null,"venue":null,"work_id":"2bb88ed1-6bce-4267-bd9c-4468bf364c20","year":1995},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.657721Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:f1f2b7569c4edbcae473a479c6dcda8afd02bb1cd332bf4ddc64928800fd5e00","observation_id":"9b048fd4-35a2-492e-99d7-3b627da3926c","resolution":{"observed_at":"2026-08-14T13:18:05.431981Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.413489Z","title":"Cobos, T","venue":null,"work_id":"247dcc5d-d101-47dc-84e3-6aa8fc703ce7","year":2016},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.661800Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:b7c319434d9361caca5173ad4cd9447e1118cac029b95e6a293d7962e3c3a0d1","observation_id":"6b388050-70ad-4aea-85a5-b2f4b7417c19","resolution":{"observed_at":"2026-08-14T13:18:05.417789Z","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-14T13:18:05.401403Z","title":"Dahlke, E","venue":null,"work_id":"dd2e4a37-14ec-4268-88f9-59b408b0e240","year":2006},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.665013Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:e56eeccdfa2158fc7bca9da3bd0a694c59ff01e466d1e6730f4b88951effc1fb","observation_id":"ea8f9bc0-74dc-428d-af98-6ac9872c2805","resolution":{"observed_at":"2026-08-14T13:18:05.405913Z","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-14T13:18:05.389031Z","title":"Fejes T´ oth, Packing and covering, in: Handbook of Discrete and Com- putational Geometry, J","venue":null,"work_id":"461e99f3-310d-4f29-a8ed-3820c4b7d5d4","year":2018},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.668796Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:c736dd72af1c939ee2cbe24e77b312d1cd400743e733314ff18527f0c7fc7aff","observation_id":"b2d50e64-0eba-48a9-9c8f-3f132a5a895f","resolution":{"observed_at":"2026-08-14T13:18:05.392950Z","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-14T13:18:05.374217Z","title":null,"venue":null,"work_id":"f9587780-42c2-45c3-82a2-f49040b12d0e","year":2004},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.672629Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:9475f287c71436a89ab65b1d77dfbc9f23e41abdeb6b5cc51554479426cd53d2","observation_id":"07af3075-2ead-4341-95cd-bfee66d6b6fd","resolution":{"observed_at":"2026-08-14T13:18:05.379574Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.361192Z","title":"Heinrich, Randomized approximation of Sobolev embeddings II , J","venue":null,"work_id":"8543f8c5-ffb2-4f86-a172-7f94f742708e","year":2009},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.675981Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:a6fe880a4278c55d61af8a21b8350ffb797224226de6a50ae0057ae997e79bce","observation_id":"e031044b-408f-4e0b-b9cb-e26434343d96","resolution":{"observed_at":"2026-08-14T13:18:05.365936Z","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-14T13:18:05.347882Z","title":"Heinrich, Randomized approximation of Sobolev embeddings II I, J","venue":null,"work_id":"7647f07d-3212-45ac-b2b0-5f324e9efbf1","year":2009},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.679473Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:bb4642d254a464beb421338a6ddfeb97f5a255475865e19fefc3d46dcae43f8c","observation_id":"53f2a893-cfd9-487a-8d7f-1fd91925bb69","resolution":{"observed_at":"2026-08-14T13:18:05.352882Z","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-14T13:18:05.333740Z","title":"Heinrich, On the complexity of computing the Lq norm, J","venue":null,"work_id":"2c4699f8-d9e3-42b0-861d-273c2d7a86d5","year":2018},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.683616Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:ce60519452f7432ec0ab08c54187044d765c6aff2d4cedd13a973e47d91ab339","observation_id":"905631a2-bfd6-4b91-93eb-2f465877d6c3","resolution":{"observed_at":"2026-08-14T13:18:05.339033Z","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-14T13:18:05.314432Z","title":"Hinrichs, E","venue":null,"work_id":"5f1ae25b-ef45-41d0-bce1-233871077055","year":2014},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.687251Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:2249bcd04086eb45c57e5bcb54aa0d233d40f0c529eea6a44ea40334e14f8d89","observation_id":"da299c38-d309-4495-b63a-bfa178f9a570","resolution":{"observed_at":"2026-08-14T13:18:05.320513Z","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-14T13:18:05.301269Z","title":"Hinrichs, E","venue":null,"work_id":"671a64b4-6309-46d5-9a5e-1c5a1289befa","year":2014},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.691045Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:1cab6804dca56d40cd9909501417dcb3c458534838bc878c3854d85ba59e6064","observation_id":"ec76c63a-5f03-42b7-907b-b3677272ea30","resolution":{"observed_at":"2026-08-14T13:18:05.305207Z","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-14T13:18:05.288683Z","title":"Hinrichs, E","venue":null,"work_id":"e87bd6f2-5140-47da-a81a-2849ffb1196c","year":2014},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.695066Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:72233d0081ec3f7c3144452785e698cb297c47337ecd06e6df64aecc67e2b574","observation_id":"f6c056f2-8686-4ae1-9f37-a9b19f09caf8","resolution":{"observed_at":"2026-08-14T13:18:05.293136Z","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-14T13:18:05.273784Z","title":"Hinrichs, E","venue":null,"work_id":"370df3c6-ac88-424f-9afd-a9c6da3adb16","year":2017},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.699974Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:0e0da2f929e1657b63a3d30f29da311a90247ff41d2e9b7a53fc0255f580e74d","observation_id":"fa768604-ab5c-45b2-9181-9ba6e78d53e9","resolution":{"observed_at":"2026-08-14T13:18:05.277812Z","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-14T13:18:05.260416Z","title":"Hinrichs, J","venue":null,"work_id":"82330c3a-67d6-4a20-a7eb-d13f8d53188f","year":2019},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.704779Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:c15eb95865c98a3cdb01dcfcb9f9c9a31f9bc85829bbcf98af2fd3f142d26fa9","observation_id":"528da853-dad1-4336-8144-83b1c96dbb0e","resolution":{"observed_at":"2026-08-14T13:18:05.264211Z","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-14T13:18:05.248910Z","title":"Hlawka, Ausf¨ ullung und ¨Uberdeckung konvexer K¨ orper durch konvexe K¨ orper, Monatsh","venue":null,"work_id":"e9bcb801-2303-4c31-ba39-8d8224bacf9a","year":1949},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.708570Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:263064f68c414ed3beb09566c78bc391e2167921717a3d9c384b70e316ddf177","observation_id":"e7eeb5e3-10ca-4bbf-8528-d2bcf7c310c1","resolution":{"observed_at":"2026-08-14T13:18:05.253184Z","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-14T13:18:05.238267Z","title":null,"venue":null,"work_id":"350b475a-328b-4c1b-913e-a471453c8606","year":1959},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.712600Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:1ad9d1909dca205af8eb3016623c0240826a4b598ed1f29aed8aab5e13a7f9e1","observation_id":"66545a51-cd50-42fb-9cdf-8f0ebddddfa3","resolution":{"observed_at":"2026-08-14T13:18:05.241699Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.225381Z","title":"Krieg, Tensor power sequences and the approximation of te nsor product operators, J","venue":null,"work_id":"51143752-87de-4950-8cee-935748f37b0a","year":2018},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.718023Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:c6f9fa040c2b282e9ef56f0aa18dee51709d76d073d0a9a15e5a45a62774b02e","observation_id":"93353d29-e2aa-4b51-8c3a-0128bb97a5b5","resolution":{"observed_at":"2026-08-14T13:18:05.229406Z","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-14T13:18:05.213273Z","title":"Krieg, Uniform recovery of high-dimensional C r-functions, J","venue":null,"work_id":"512dd95b-400f-42df-8afe-563d5643068b","year":2019},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.722786Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:0be3f81f0450d950f6c38f64b7e2e7971dc2024114693142022b722efebbb14d","observation_id":"9e13d1b2-90d1-47ab-9e91-7ab70e325c91","resolution":{"observed_at":"2026-08-14T13:18:05.217056Z","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-14T13:18:05.200107Z","title":"Kr¨ oger, Upper bounds for the Neumann eigenvalues on a bounded domain in Euclidean space, J","venue":null,"work_id":"621ab4a1-7dcf-4005-8e7c-ec9658fc0f85","year":1992},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.727222Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:9ee576c94f7e5494c9cebc64f6f49bc44b4746b2f0124a2759e0299d001e1b43","observation_id":"b2c888ee-4318-4470-95c0-aca650d2f1b7","resolution":{"observed_at":"2026-08-14T13:18:05.205120Z","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-14T13:18:05.188409Z","title":"K¨ uhn, W","venue":null,"work_id":"907663d1-4d30-461f-9adc-b6609fa90da5","year":null},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.731339Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:436e0280df1ffb73e00de17ef6c9f7aa8efcac48da9ea1c1219ab1178e187389","observation_id":"40057ec8-78a3-4a82-8f53-41f94cc37394","resolution":{"observed_at":"2026-08-14T13:18:05.192626Z","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-14T13:18:05.176246Z","title":"K¨ uhn, W","venue":null,"work_id":"2bb2e604-53be-4b09-adc3-a9ee08c2a0e7","year":2015},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.736957Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:3e28ee473d5de3dd3d1b3a50dbccd6acbbe48ff7cf10ec862391f73b8ea91ac2","observation_id":"6083e885-7970-4f1d-98e3-03abb1252bea","resolution":{"observed_at":"2026-08-14T13:18:05.180646Z","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-14T13:18:05.164300Z","title":"Li and S.-T","venue":null,"work_id":"5c5a3580-f10c-4f50-beaa-e789b23971f6","year":1983},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.740761Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:d20d132877b83887a88a0ab7fddbd406041ffcb75277871e781b0aba2aaffe8f","observation_id":"18cac2b7-b3e4-4387-8980-08b52b307e73","resolution":{"observed_at":"2026-08-14T13:18:05.168254Z","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-14T13:18:05.152245Z","title":"Mieth, Sharp estimates for approximation numbers of non-p eriodic Sobolev embeddings, J","venue":null,"work_id":"f92b76f2-4fd0-490d-a28f-d8b20e222981","year":null},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.744703Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:36d9ee9c1d2e10b955ccb822943a6e8fbe323a2c7e60a98db69462c108a469db","observation_id":"4d4f428e-b721-4522-b0df-81c487b272a6","resolution":{"observed_at":"2026-08-14T13:18:05.156408Z","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-14T13:18:05.140892Z","title":null,"venue":null,"work_id":"db01cc68-84d9-4ce2-8f01-13ce7e77497e","year":2004},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.748944Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:65c61ea53952206b5720fc423842d78fa3fb64585ae598f9e62c39249a97bf28","observation_id":"0ab96f8c-d3e1-4e4b-b8a8-8bde2b8ddc55","resolution":{"observed_at":"2026-08-14T13:18:05.144584Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.129572Z","title":"Novak, Deterministic and Stochastic Error Bounds in Numerical Ana ly- sis, LNiM 1349, Springer Verlag, Berlin, 1988","venue":null,"work_id":"1ddd09b8-4854-4e04-97ae-c9b92f568eee","year":1988},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.753403Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:24e39f95bfaf4e9a5aa09abbfac36f2ecfbffe7cfa16915cf6a5e9fa5f0d1ee2","observation_id":"3b3e8f20-0b8a-4f2e-be16-6aa27673f8df","resolution":{"observed_at":"2026-08-14T13:18:05.133561Z","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-14T13:18:05.114830Z","title":"Novak and H","venue":null,"work_id":"c2cd15dc-73f3-44d5-8f1f-841949e04c1d","year":2006},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.757477Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:a3cc0000b1c2b00530d5d6502d608d93b1e55d08e714dd6b8f3ea11cf36d2ed4","observation_id":"9ee54e24-e875-467a-b0f7-73be66c005b1","resolution":{"observed_at":"2026-08-14T13:18:05.121446Z","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-14T13:18:05.099705Z","title":"Novak and H","venue":null,"work_id":"4633caaf-a94f-489d-982c-436b4980f2f3","year":2008},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.761216Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:b249ec360d80222b7d25c95ca089b42ec12dfceb51e7ad4941917f0ead8eeb97","observation_id":"b61b99aa-7a1a-4651-848a-090477efc57f","resolution":{"observed_at":"2026-08-14T13:18:05.103824Z","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-14T13:18:05.086377Z","title":"Novak and H","venue":null,"work_id":"fe08d72f-7860-4a6f-ab11-6e17ea19009d","year":2010},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.765172Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:24d2b939a5d79c6264c63f8dbf0fad50178757c901c10544477f0502a281f5a7","observation_id":"2739c283-4843-4286-9a4d-167aede7a786","resolution":{"observed_at":"2026-08-14T13:18:05.090636Z","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-14T13:18:05.072104Z","title":"Novak and H","venue":null,"work_id":"712fbd71-3526-4133-b828-fab6c52d6a70","year":2009},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.769197Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:f47436859ef0e29a4c8ec439d2dc179c6ebc08deddd28b3f80adcc84ed8b92dc","observation_id":"a6688463-ec30-4c22-9f68-5553405c2fc9","resolution":{"observed_at":"2026-08-14T13:18:05.076230Z","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-14T13:18:05.058929Z","title":"Novak and H","venue":null,"work_id":"ba84f759-4c40-4b93-81cb-6b1eed76d168","year":2012},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.773306Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:99e751523a52277b4de44cf405442411e714f57154b17f5ae800a5ef3b2f5304","observation_id":"15ffae5c-bdd7-4b49-9f09-2468d4f5462f","resolution":{"observed_at":"2026-08-14T13:18:05.063234Z","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-14T13:18:05.047371Z","title":null,"venue":null,"work_id":"911e2942-ed0e-4d6d-8d83-7f2d223c537e","year":1957},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.777323Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:5aacbc959c73fc4fd51b3dddcb1b682872ba33ba6e8ada02db4bcaa89416f2ea","observation_id":"6d04cb2e-db63-41f0-86e6-c42240ce4975","resolution":{"observed_at":"2026-08-14T13:18:05.051598Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.035910Z","title":null,"venue":null,"work_id":"34402f67-6024-4807-9c3a-a388ce9c14d6","year":2006},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.781756Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:c40920be9576b9ac68363d49226a198c85b0c448dcc3dfe6f2adf225b743496d","observation_id":"c5a3b523-f7ba-488e-a2a4-4f94c037cf47","resolution":{"observed_at":"2026-08-14T13:18:05.039621Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.023643Z","title":null,"venue":null,"work_id":"f913627d-e548-4086-96ec-84d8c0fe3d67","year":2008},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.790515Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:6fc77333a7d5f4e8e8b7426bb0d973a3fb12838205b6913d65b208440a84c5eb","observation_id":"4aacb655-99bd-4a1b-8401-a1ffba38462f","resolution":{"observed_at":"2026-08-14T13:18:05.027585Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:05.009626Z","title":null,"venue":null,"work_id":"056ad500-cd1e-4cf2-85f9-dc70dd8e38f3","year":1978},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.794047Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:ed3b77cf2ed7388078e9859f8047812ce26d638d29b9abaf300f6864f4042841","observation_id":"b3b3e350-6ca7-4293-9d0b-d4d723087312","resolution":{"observed_at":"2026-08-14T13:18:05.013510Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:04.996023Z","title":null,"venue":null,"work_id":"52b31b8c-177d-44f6-9515-5b58381744f6","year":1979},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.797941Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:60ff801822effecc1ed6ede625d63d0c0b691c7cb4fc02710d874ececa8333ab","observation_id":"536f0571-0f84-43e2-9801-ec824aa11603","resolution":{"observed_at":"2026-08-14T13:18:05.001445Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:18:04.984204Z","title":"Triebel, Wavelet para-bases and sampling numbers in function spaces on domains, J","venue":null,"work_id":"8df15578-71da-4fcc-9d2c-66ece0db7da4","year":2007},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.801119Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:0ddef586459a5d67cffac53ce022b32db7b33a1b3504f0b2eaee8c30fae4b73d","observation_id":"9c7def5a-5778-4833-a96e-14a64c635163","resolution":{"observed_at":"2026-08-14T13:18:04.988352Z","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-14T13:18:04.970371Z","title":"Triebel, Function Spaces and Wavelets on Domains , European Mathe- matical Society (EMS), Z¨ urich, 2008","venue":null,"work_id":"8919b8c0-ffda-4ddb-ae70-21e8b307a2b3","year":2008},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.805255Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:78cef557cdb36ec344da367afcd250e8a0a00c94cf07c7e6fca9a2a9043327ae","observation_id":"f06cf0a2-e113-41fe-84cd-13aafeb6e6a2","resolution":{"observed_at":"2026-08-14T13:18:04.974446Z","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-14T13:18:04.958200Z","title":"Triebel, Bases in Function Spaces, Sampling, Discrepancy, Numerica l Integration, European Mathematical Society (EMS), Z¨ urich, 2010","venue":null,"work_id":"dceb215e-1b1c-40b0-86c6-3fcd28804812","year":2010},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.808793Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:636fea3017100a24643daac74afdd32ee496b644402cc35d93c556a102d61351","observation_id":"879218e5-ebad-4d9a-bdb3-ceea00113f4e","resolution":{"observed_at":"2026-08-14T13:18:04.962427Z","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-14T13:18:04.945792Z","title":"Tulovsky, Distribution of eigenvalues for differential equatio ns with con- stant coefficients, Functional Anal","venue":null,"work_id":"61fc66b7-231a-41dc-98bb-69655b6842e1","year":1972},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.812514Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:84b2ed80105173bdb857c948498e643635cdeef68b849b1cf31bb2d3b963a51c","observation_id":"c42cb36a-571f-42c0-b547-e093b4b65128","resolution":{"observed_at":"2026-08-14T13:18:04.949921Z","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-14T13:18:04.932611Z","title":"Vyb ´ ıral, Sampling numbers and function spaces, J","venue":null,"work_id":"2b885101-bc05-4c46-8d37-5903c991aba8","year":2007},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.816335Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:0cc9652f9b90f3165a8743fe7d93944d1c2e849b4525b2336a2a1f2097f1441c","observation_id":"f2ea94f7-49bc-4b2b-adc1-44019cbc51c0","resolution":{"observed_at":"2026-08-14T13:18:04.937599Z","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-14T13:18:04.920560Z","title":"Vyb ´ ıral, Widths of embeddings in function spaces, J","venue":null,"work_id":"57d64cb1-b6aa-412c-9e3b-9fded59a36c2","year":2008},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.821429Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:f8c96b4213b29dbbe5d40e52070c1569f298cd9bce0ca23aed93a15108712526","observation_id":"be19340d-04ce-412c-84cd-ac4d804144ea","resolution":{"observed_at":"2026-08-14T13:18:04.923963Z","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-14T13:18:04.908558Z","title":"Vyb ´ ıral, Weak and quasi-polynomial tractability of approximation of in- finitely differentiable functions, J","venue":null,"work_id":"a52d5851-ed58-43d1-a84b-caf8e9afe489","year":2014},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.825212Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:2c6c9c447f40f3b15a61d303e2a2d89316e46302aae3f6d140121f394027a5b5","observation_id":"bc0b7ebc-f916-45b3-9d03-e655562e0de9","resolution":{"observed_at":"2026-08-14T13:18:04.912931Z","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-14T13:18:04.895517Z","title":"Weimar, Tractability results for weighted Banach spaces of s mooth func- tions","venue":null,"work_id":"8c7e28d5-5b9f-429d-85ee-ce3a0ca3b62b","year":2012},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.828801Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:5f4b9de44d6606ab77dea741fdb2ff82d3ecf30de51f7080eb39652e6197ad62","observation_id":"ef86fe7f-26af-4dc5-9106-32625689f56c","resolution":{"observed_at":"2026-08-14T13:18:04.899614Z","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-14T13:18:04.881663Z","title":"Weyl, Das asymptotische Verteilungsgesetz der Eigenwerte linearer par- tieller Differentialgleichungen, Math","venue":null,"work_id":"d1bc4f6f-9e60-492d-9bc3-cbac5254ea38","year":1912},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.832801Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:9da1aa6d3e7fb3c59900fabd41efca5a64d0af4e5d60c4a2a46a32f3916364ad","observation_id":"492c6543-79c2-4cc7-84e4-1d223044b804","resolution":{"observed_at":"2026-08-14T13:18:04.886953Z","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-14T13:18:04.866157Z","title":null,"venue":null,"work_id":"7ff95f83-be38-4ee3-a2e8-19c5366bcb27","year":2015},"citing_paper":{"arxiv_id":"1908.05943","last_updated":"2020-01-13T20:22:26Z","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T13:18:04.836865Z"},"links":{"citing_paper":"/paper/1908.05943"},"observation_digest":"sha256:1683cbd51a8963506454274c93ae90cd4f53c9267f7d7246afefb0070db536a8","observation_id":"2626ed04-cd1a-4cd6-ab4f-9a9e8d9229ed","resolution":{"observed_at":"2026-08-14T13:18:04.872460Z","resolver_source":"raw_fallback","status":"unresolved"},"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.05943","last_updated":"2020-01-13T20:22:26Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-16T02:22:58.887710Z","submitted_at":"2019-08-16T12:07:35Z","title":"Algorithms and Complexity for Functions on General Domains"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":49},"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 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:1908.05943."}