{"as_of":"2026-08-21T03:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e57cb4c25347ebc242fe8a72715318633ae139cdaa1d50f89ffa8d015732ff3d","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:46:22.933192Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2506.19104/citation-record","integrity":"/paper/2506.19104/integrity","json":"/paper/2506.19104/citation-record.json","paper":"/paper/2506.19104"},"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-15T18:46:23.290464Z","title":null,"venue":null,"work_id":"644d7494-c445-4f32-916a-dffcc3309d03","year":1968},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.820700Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:0775ac571418a4741da68438920e5934d08e54594a37346b207790c11cc79b3d","observation_id":"121e8c69-d18b-4db1-98a2-a557bf7cbbbb","resolution":{"observed_at":"2026-08-15T18:46:23.293984Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.279331Z","title":"Boull´ e, Y","venue":null,"work_id":"6148e6b5-0db4-4531-9de6-fdcff500b306","year":2020},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.825606Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:4d2728dae39e114c3223c848bdd2e925d09145b185c513d81b6073fbaef4ad5e","observation_id":"2caf1708-b5d9-4e2c-a187-0156922f9b14","resolution":{"observed_at":"2026-08-15T18:46:23.283176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.266286Z","title":null,"venue":null,"work_id":"1a554c19-7062-415b-9ff2-f11547a92a0a","year":1989},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.829620Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:d13a2354d97f8c59e61573ac0a8f726fe4c43306fca800f0298de2686e26f638","observation_id":"81b025af-b74c-4a2b-80f1-dfa848fc9936","resolution":{"observed_at":"2026-08-15T18:46:23.271071Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.253809Z","title":"Daubechies, R","venue":null,"work_id":"f790e64a-9091-40c2-8ff4-dc2de6bae151","year":2022},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.833434Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:0cb946bf635626b627c31dba9c168dd57375bbe18ea22b0103313f46f230aa51","observation_id":"69663392-ac25-4350-9a7a-95fa14482785","resolution":{"observed_at":"2026-08-15T18:46:23.258436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.242825Z","title":"Daubechies, R","venue":null,"work_id":"f3125763-1e59-4835-95cd-69dbcbec5e58","year":2022},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.837879Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:941602c36ab1df21c43335dd3f76bdd8e46495c148765a5817f9de8a88254dcb","observation_id":"724a5592-7b40-4a42-bc98-71b4b10b31e2","resolution":{"observed_at":"2026-08-15T18:46:23.246634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.09511","last_updated":"2024-12-16T21:06:21Z","snapshot_observed_at":"2026-08-16T16:44:45.106755Z","submitted_at":"2022-07-19T18:47:44Z","title":"Approximation Power of Deep Neural Networks: an explanatory mathematical survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.09511","snapshot_observed_at":"2026-08-15T18:46:22.842672Z","title":"Davis and M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.842672Z"},"links":{"cited_paper":"/paper/2207.09511","citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:944b482f7485a733a9e9a43dfb1133c820e668ad4f8f7b38b980a408ccaf021e","observation_id":"e24cfe74-01fc-4979-a8b7-4c2e9e93f2b7","resolution":{"observed_at":"2026-08-15T18:46:22.842672Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:46:22.847392Z","title":"DeVore, B","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.847392Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:929a19c54fe4dcd5bb29888ed9e3a8819d3ea0280fcf65f4b8eef43c8ba177b6","observation_id":"a8b8df4d-8341-4150-a462-7a6aa0bf0cd7","resolution":{"observed_at":"2026-08-15T18:46:22.847392Z","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-15T18:46:23.224308Z","title":"G¨ uhring, M","venue":null,"work_id":"e55eb65c-f481-4d6b-a888-28dc71174f3b","year":2022},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.852192Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:7b35cad25cb8b355c2e930c63cfe34881f550ecd9f2b9200a3458c4b72f05c8d","observation_id":"e524a6db-f9be-4a16-a548-5c8f7cc79cae","resolution":{"observed_at":"2026-08-15T18:46:23.228468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.211732Z","title":"Hornik, M","venue":null,"work_id":"ffa8e684-44d9-4b2e-9aa9-b7d4a1a7ee7c","year":1989},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.857338Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:ea2839f2c0e6216cd7449b472fb537a0fedd8200b72dd540cd2a46628b363a0b","observation_id":"b29604a6-cca1-40ea-b8cc-d2f5108b6922","resolution":{"observed_at":"2026-08-15T18:46:23.215682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.199275Z","title":null,"venue":null,"work_id":"fd37d9f7-180d-4557-97a3-0ef06827e625","year":1998},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.862045Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:1690613e570b07c4612df0d1359c4090e2b0484be06d4843f0b8fe455f7a98e8","observation_id":"c1d127b1-c06c-49ab-a87c-ddf3683aa1e4","resolution":{"observed_at":"2026-08-15T18:46:23.203020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.186658Z","title":"Marcati, J","venue":null,"work_id":"ce4dab69-d897-4222-b075-c7f25d401028","year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.867303Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:07200c2994b0791a84a302c6e35089a4749ecfcbf83341399077b01edef2ceea","observation_id":"d573bf1f-39c2-42af-a655-acdee9428327","resolution":{"observed_at":"2026-08-15T18:46:23.190702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.173132Z","title":"McCane and L","venue":null,"work_id":"186241d1-7427-4724-923d-f3c32101f397","year":2018},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.871607Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:ceefdb0de3cd0498aa3af5501116832f66b90fc588920be53ad5b75b3e617df0","observation_id":"4eba12d1-e7bd-4f2a-a5e8-7a2f81aae271","resolution":{"observed_at":"2026-08-15T18:46:23.177256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12687","last_updated":"2024-08-18T17:22:41Z","snapshot_observed_at":"2026-08-20T20:46:26.395067Z","submitted_at":"2024-02-20T03:27:53Z","title":"Learning on manifolds without manifold learning","version":2},"cited_work":{"arxiv_id":"2402.12687","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.12687","snapshot_observed_at":"2026-08-15T18:46:23.003125Z","title":"Learning on manifolds without manifold learning","venue":"cs.LG","work_id":"4489e054-a45e-4f2d-a8f2-52d8567ba329","year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.875769Z"},"links":{"cited_paper":"/paper/2402.12687","citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:16b720dcc5e266176943b827aa0dccd443b8c0af3b341f44fa85cf63c31499c1","observation_id":"dccc3092-b72e-4ea1-88e1-6af788b05fa5","resolution":{"observed_at":"2026-08-15T18:46:23.007862Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.160165Z","title":null,"venue":null,"work_id":"f51de83f-9f44-4472-a126-abad81c23f80","year":1993},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.880073Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:ef8d2b597c50c62d2efd164aa82e742d320febcad91e3836f9b33bac197570d7","observation_id":"1920b442-84c3-45b3-9ecf-19d53254bb0e","resolution":{"observed_at":"2026-08-15T18:46:23.164290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.148759Z","title":null,"venue":null,"work_id":"2a876366-58dd-4732-a1cb-ec6b361ea4a1","year":2020},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.884110Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:60d68f06d6caf4c4f0b34471949f0aae08c7f59c8ae39c54d354c951db4c5571","observation_id":"067a3220-5b97-4a78-98ff-dec1734d0421","resolution":{"observed_at":"2026-08-15T18:46:23.152606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.136738Z","title":null,"venue":null,"work_id":"fa6ae869-c6f1-415e-9325-62d10e2ae831","year":2019},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.887871Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:8bd221e47e81debd0a8e6f32e190280d2dfe71b8aa5842adebc41a924f4c85c7","observation_id":"6641c74a-931a-44ad-bd95-add133053dbf","resolution":{"observed_at":"2026-08-15T18:46:23.140795Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02035","last_updated":"2024-06-14T14:02:12Z","snapshot_observed_at":"2026-08-16T14:13:05.215325Z","submitted_at":"2024-03-04T13:39:22Z","title":"Exponential Expressivity of ReLU$^k$ Neural Networks on Gevrey Classes with Point Singularities","version":2},"cited_work":{"arxiv_id":"2403.02035","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.02035","snapshot_observed_at":"2026-08-15T18:46:22.982126Z","title":"Exponential Expressivity of ReLU$^k$ Neural Networks on Gevrey Classes with Point Singularities","venue":"math.NA","work_id":"467bb209-2ad1-44c6-b4b1-da5cf9fa5f76","year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.891762Z"},"links":{"cited_paper":"/paper/2403.02035","citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:2d1459a9b0b9996e32a223df9a852942b833287b4bf661581c627b0e799fb5ba","observation_id":"a467111f-b87b-450c-8140-2f77c7fba22f","resolution":{"observed_at":"2026-08-15T18:46:22.988792Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.124823Z","title":"Petersen, C","venue":null,"work_id":"d732d7d1-97b3-49f3-9f7d-31bede79aa66","year":null},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.896450Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:6e808e5222ad1e880856444d258ac3693d408f90acd8fc757d65f77e64f42885","observation_id":"23ea1da6-e6ed-4972-8e15-53e067dd6025","resolution":{"observed_at":"2026-08-15T18:46:23.128626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.112329Z","title":"Petersen and F","venue":null,"work_id":"17d073fe-6cce-4bda-934d-a58f812d1e4f","year":2018},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.901095Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:8d92d0b61f5b85865ae70de993cb3b8490e9cc962a11f25b628670e63f628aec","observation_id":"aa82c210-4998-4ccd-8935-84414b0f8f17","resolution":{"observed_at":"2026-08-15T18:46:23.116166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.098950Z","title":"Petersen and J","venue":null,"work_id":"e80c020b-c282-4b15-83fb-55f2dd96fc60","year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.905564Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:8a0a6e7d04be879a14725e715774972add8303b6263b88f75ff353ec2269c89e","observation_id":"6de2d5c8-dcea-4cf9-b9a3-78455ce1bb2b","resolution":{"observed_at":"2026-08-15T18:46:23.103274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.085181Z","title":"Schneider and J","venue":null,"work_id":"28f0c9b8-7f1d-461b-996c-dafbe3a8ee10","year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.910592Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:58bd55fee8abe7f5e3bc15813e4c9a79511996f5ab354da2d5ccd7f05b9d1a0a","observation_id":"979f6b43-c1d4-4df2-a4d7-6efc302417e8","resolution":{"observed_at":"2026-08-15T18:46:23.089193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.072674Z","title":null,"venue":null,"work_id":"725ee985-52a5-4f69-829d-e3f8c8b1ed45","year":1995},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.914925Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:10874a9a143c9d1ce51bfc5d8205ba9baa5955af094f284c0cd6a978083d27cd","observation_id":"c04a48ab-a1a5-48c9-9e6f-6aae4c712d99","resolution":{"observed_at":"2026-08-15T18:46:23.076691Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.08101","last_updated":"2015-09-29T13:44:37Z","snapshot_observed_at":"2026-08-14T22:30:40.043393Z","submitted_at":"2015-09-27T15:26:58Z","title":"Representation Benefits of Deep Feedforward Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.08101","snapshot_observed_at":"2026-08-15T18:46:22.919591Z","title":"Telgarsky","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.919591Z"},"links":{"cited_paper":"/paper/1509.08101","citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:4d33431543070390368d2e2407933f2105c07accf8d38630dbde347b767423e8","observation_id":"f2323a4c-a901-47f1-892c-6bbc021ac023","resolution":{"observed_at":"2026-08-15T18:46:22.919591Z","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-15T18:46:23.059325Z","title":"Telgarsky","venue":null,"work_id":"35660224-e117-4cbc-9e31-576b26741a42","year":2017},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.924494Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:37887a58b1b088587ec9308b25a69a11c9d6795efc2e8fff44e72339601f2310","observation_id":"3abf4eb8-d1bb-49c3-b240-17c6980d1a06","resolution":{"observed_at":"2026-08-15T18:46:23.063660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.045723Z","title":"Bitonic sorter — wikipedia, the free encyclopedia, 2024","venue":null,"work_id":"c079d8d4-14c2-4d55-853c-e8f9c79495e4","year":2024},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.928916Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:796260296022e0550e640728c828292ecc4ad16ed7811fdaeaa38baa872bd81c","observation_id":"5a75f73a-ab9d-4202-bf6a-e4c4f4620a68","resolution":{"observed_at":"2026-08-15T18:46:23.050378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:46:23.030853Z","title":"Yarotsky","venue":null,"work_id":"4148c796-db22-4c44-9b87-7480eb8fcd67","year":2017},"citing_paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T18:46:22.933192Z"},"links":{"citing_paper":"/paper/2506.19104"},"observation_digest":"sha256:fcd5a519935ad1e0155d189b38d9bfa99d6d79acc629dbf0c384d85e5112a6dc","observation_id":"0d52b45b-4387-4230-b91d-fe3c806c2818","resolution":{"observed_at":"2026-08-15T18:46:23.035662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19104","last_updated":"2025-06-23T20:35:52Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T20:53:17.335199Z","submitted_at":"2025-06-23T20:35:52Z","title":"On the algorithmic construction of deep ReLU networks"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":26},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2506.19104."}