{"as_of":"2026-08-20T15:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f6f96405a2c2812ec7344a42da6689d3249c6d2523b9aff26e54f6b645317764","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:54:53.283304Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"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.16283/citation-record","integrity":"/paper/2506.16283/integrity","json":"/paper/2506.16283/citation-record.json","paper":"/paper/2506.16283"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"0907.3049","last_updated":"2009-08-25T14:18:13Z","snapshot_observed_at":"2026-08-15T19:22:31.328915Z","submitted_at":"2009-07-17T11:43:41Z","title":"Operator H\\\"older--Zygmund functions","version":2},"cited_work":{"arxiv_id":"0907.3049","doi":null,"metadata_source":"pith","pith_arxiv_id":"0907.3049","snapshot_observed_at":"2026-08-06T23:54:53.956416Z","title":"Operator H\\\"older--Zygmund functions","venue":"math.FA","work_id":"4abfc27a-2d67-4b57-84b9-f87354b20f55","year":2009},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:49.663650Z"},"links":{"cited_paper":"/paper/0907.3049","citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:e0f6ddd819e0703686a34265221d31da7aea509ac363614c2581dabce6f104af","observation_id":"e3e6dcdb-a602-4f06-96e3-f07b5e713670","resolution":{"observed_at":"2026-08-06T23:54:53.991549Z","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-06T23:54:57.619329Z","title":"Katyusha: The first direct acceleration of stochastic gradient methods","venue":null,"work_id":"c80fba38-3167-44bd-8e93-060549ff7cbb","year":2018},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:49.762221Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:240a24717f0cd811e8a8df7533171fc035b2558432eaf6c26964e41ec8255b86","observation_id":"4b09e387-f0ed-4963-9191-b79d5d78d918","resolution":{"observed_at":"2026-08-06T23:54:57.623777Z","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-06T23:54:57.604049Z","title":"Optimal rates for regularization of statistical inverse learning problems","venue":null,"work_id":"8b8c27be-f493-442c-b89d-4861f4193259","year":2017},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:49.869786Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:3bc26742b4b9bc6fbc4d57dc0c3b0b0cf56d0aeb367a749a5ec46c5c431993b9","observation_id":"1d62711a-0fc9-41d5-b210-76345a4e67f3","resolution":{"observed_at":"2026-08-06T23:54:57.608938Z","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-06T23:54:57.588277Z","title":"Caponnetto and Ernesto De Vito","venue":null,"work_id":"04ec5789-e080-4c36-bdaa-58abd81ea1ad","year":2007},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:49.963771Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:6b54d1ddc4a5c32bd46fec7bf00dcabd3073722f565295909361b0d6300f03af","observation_id":"6b0984db-e614-4070-b680-210f364dc1b3","resolution":{"observed_at":"2026-08-06T23:54:57.593315Z","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-06T23:54:57.571028Z","title":"Carmeli, E","venue":null,"work_id":"29995f4f-43fe-419b-8e55-c7455448597b","year":2008},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.065615Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:a1f29f5d08990f578ae822148ccea966cb6462da23465bd79c6b8ae1a93973a1","observation_id":"c2201b39-3953-4040-ab16-6b149be80ca1","resolution":{"observed_at":"2026-08-06T23:54:57.575823Z","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-06T23:54:57.553382Z","title":"Reproducing kernel hilbert spaces and mercer theorem, 2005","venue":null,"work_id":"44197a7a-be76-4ac5-8dd7-f2a9cc305986","year":2005},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.181519Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:e16d3d3dc811a19be2d1dcfe190572aec80734bc6e91c306bfd2ca61fcea7efe","observation_id":"e56761bc-8c6f-49a2-a8d1-80c7340330ab","resolution":{"observed_at":"2026-08-06T23:54:57.559430Z","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-06T23:54:57.536411Z","title":"Learning with sgd and random features, 2019","venue":null,"work_id":"725068e4-b9a5-4af5-985d-b3e9570835a3","year":2019},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.296688Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:8dc0c5d1273335a897e38cf6cd20ddd1bfd4c5e649abb133ffa0ed7997424bb9","observation_id":"7e370617-b24e-46ef-9f50-66e3f33d99e7","resolution":{"observed_at":"2026-08-06T23:54:57.541805Z","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-06T23:54:57.520085Z","title":"On the impact of kernel approximation on learning accuracy","venue":null,"work_id":"ed03d3e1-c179-4a14-b409-d6df1aff8945","year":2010},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.390284Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:9d4848d742b021bf453efe744197fe08722d155b8c82085c8ddc1e4b5e87b702","observation_id":"46d70a40-3447-467e-be31-3e1887ff072f","resolution":{"observed_at":"2026-08-06T23:54:57.525303Z","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-06T23:54:57.502488Z","title":"Every model learned by gradient descent is approximately a kernel machine, 2020","venue":null,"work_id":"95c1006c-f27f-4502-9c04-64e94b8e7ef6","year":2020},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.458302Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:395fc2badb0d3fcab0b9ed80fad6e269c8a7e1220a627f2770173d89700c978c","observation_id":"ba17f7da-1489-442d-9a36-6a5f19e6c405","resolution":{"observed_at":"2026-08-06T23:54:57.507668Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:54:50.544680Z","title":"On the nystr \\\"o m method for approximating a gram matrix for improved kernel-based learning","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.544680Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:2e64fc3591f9589cfe08ce22bf4345e6c2fe459e9003ec331726c4b34e9dcccb","observation_id":"72026914-43a9-472f-ba69-4f0f496bad01","resolution":{"observed_at":"2026-08-06T23:54:50.544680Z","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-06T23:54:50.610349Z","title":"Regularization of inverse problems, volume 375","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.610349Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:b40017f957657cd0ba0b5013974060429119449717f0fe4ec4799d60d53dca88","observation_id":"19c64a3f-9dfb-41c2-a562-5d3010634912","resolution":{"observed_at":"2026-08-06T23:54:50.610349Z","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-06T23:54:50.677400Z","title":"Stochastic heavy ball","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.677400Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:c3d9ab740e3431014ed3ef2f0bb40f5b0141b7ddafa2c24dc0c31fc008f04c3e","observation_id":"0735f457-f916-4885-9c0e-737fb20c8ff8","resolution":{"observed_at":"2026-08-06T23:54:50.677400Z","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-06T23:54:50.746340Z","title":"Lo Gerfo, L","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.746340Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:09063c3feb67cc7834b3f10b4afea8a3bc0c8d2062624badc6f80f10d503ca5e","observation_id":"25dbcacb-3237-4cdf-893b-1114b53792d9","resolution":{"observed_at":"2026-08-06T23:54:50.746340Z","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":"2015.73305","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:54:53.856418Z","title":"Global convergence of the heavy-ball method for convex optimization","venue":null,"work_id":"bbe602e3-f0fe-4065-87f0-85bfc11f6a9f","year":2015},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.815074Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:55a578c6a143f03b5b10e180cb0e3418faac1d4c89947e4557230cb6b645e218","observation_id":"b38ed649-3296-49db-960a-286cc76baaf0","resolution":{"observed_at":"2026-08-06T23:54:53.883769Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T23:54:57.462248Z","title":"Nelsen, and Margaret Trautner","venue":null,"work_id":"bb1f5488-f718-4ffe-9e9c-7e36e11e0efd","year":2024},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.907281Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:0345c83fdbbca14736ae10fa539871df3798c400a80010cfd31371ac7bba6470","observation_id":"532bed9a-30cb-45ed-a72e-e0d5469a51e2","resolution":{"observed_at":"2026-08-06T23:54:57.467454Z","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-06T23:54:57.446525Z","title":"Neural tangent kernel: Convergence and generalization in neural networks","venue":null,"work_id":"ebac516e-467e-4c5c-a597-eb843c7a0f71","year":2018},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:50.971288Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:7f008c2aa32a70653df5cb611de359bf4f1e51542a1d93b8466e070ae2f7984d","observation_id":"7f1e12d0-3f8e-4609-9ba1-3fa0a041f349","resolution":{"observed_at":"2026-08-06T23:54:57.451410Z","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-06T23:54:57.431361Z","title":"Kovachki, Zong-Yi Li, Burigede Liu, Kamyar Azizzadenesheli, Kaushik Bhattacharya, Andrew M","venue":null,"work_id":"1446d279-a5a1-4697-b074-d24c93dd12ed","year":2023},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.057849Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:5edd128303711ddc6ffd8530bf1e934a5a4309a20833dd02a801edfefa156595","observation_id":"d9b158bf-83d6-499f-8859-8ac9146c4c5b","resolution":{"observed_at":"2026-08-06T23:54:57.435962Z","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-06T23:54:57.415864Z","title":"Kovachki, Samuel Lanthaler, and Andrew M","venue":null,"work_id":"662a9b5f-2860-45bd-a6a6-646170215719","year":2024},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.117124Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:1a01d07207027c9c54d5f264737099122cc7524f177325a617494e6b30f0a718","observation_id":"9a8e1b58-7fc4-475c-a3a9-32abf2aff9b0","resolution":{"observed_at":"2026-08-06T23:54:57.420686Z","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-06T23:54:57.401739Z","title":null,"venue":null,"work_id":"18907663-6bfa-439b-8206-b3c20d79d9fb","year":2023},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.193883Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:19a79a8bdb585c9c5d93c5512bac89a61b42a4da76e41066f77cea6f414c2e14","observation_id":"442201f3-326e-486d-944c-cdac8d635843","resolution":{"observed_at":"2026-08-06T23:54:57.406069Z","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-06T23:54:57.386943Z","title":"Kwok, and Bao-Liang Lu","venue":null,"work_id":"c238f98c-b9da-4dee-80c9-e48ef217b842","year":2015},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.280321Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:4a5057b5793df574ea1c83c0f82ce2bcc51a98811ecf8331a6e8dc749f888927","observation_id":"b6ee967e-1beb-4714-970a-fdf65f421c42","resolution":{"observed_at":"2026-08-06T23:54:57.391299Z","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-06T23:54:57.371455Z","title":null,"venue":null,"work_id":"685fddbf-998a-4e86-bd84-fdd3a1ba4607","year":2021},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.341844Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:40e9997d0f6f087d066a07ab86544e2118862c10cf57c8f7196ae13deccd0109","observation_id":"3187c22e-0359-4a7b-af9e-fec30728a582","resolution":{"observed_at":"2026-08-06T23:54:57.375990Z","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-06T23:54:57.355472Z","title":"Towards a unified analysis of random fourier features, 2021 b","venue":null,"work_id":"ae9c3954-55e8-4a3f-8f89-ef959bedddd1","year":2021},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.403319Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:0339d02a3d7f6d7c7b74fee0dd5d6ced36ffe23c0082d179e44384e0f12de5aa","observation_id":"2b120602-b51b-4dac-ae0e-c24adfddbf12","resolution":{"observed_at":"2026-08-06T23:54:57.360947Z","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":"1801.07226","last_updated":"2018-11-05T15:21:59Z","snapshot_observed_at":"2026-08-14T19:53:04.635886Z","submitted_at":"2018-01-22T18:14:11Z","title":"Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms","version":2},"cited_work":{"arxiv_id":"1801.07226","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.07226","snapshot_observed_at":"2026-08-06T23:54:53.582108Z","title":"Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithms","venue":"stat.ML","work_id":"a8d25770-6ec3-4745-95e5-c284c849e26a","year":2018},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.484079Z"},"links":{"cited_paper":"/paper/1801.07226","citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:8e9a977ca1c7cb14da67695c6e3aabcf544a21a9e6e56e47e800605e546633dc","observation_id":"f02e02ff-e41b-44b7-bc69-6d0e923f829e","resolution":{"observed_at":"2026-08-06T23:54:53.647209Z","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-06T23:54:57.339073Z","title":"Optimal rates for spectral algorithms with least-squares regression over hilbert spaces","venue":null,"work_id":"274f4084-0517-4a72-bc29-d5c27fb7e79c","year":2020},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.569212Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:210d7d8ba55c78e6b854d22db501d69e45bee9b216355c1715fb3aa2ef043e04","observation_id":"9e90357e-9c5a-4815-85d6-f6acf1ea11f8","resolution":{"observed_at":"2026-08-06T23:54:57.344013Z","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-06T23:54:57.322744Z","title":"Woodruff","venue":null,"work_id":"7d3b9a88-f5dc-42c3-b3ab-8521273cbb6d","year":2022},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.656658Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:fffb8ef5174dbdef7a618e7a28a7bcb3563aabe37f7787525441b562d870763b","observation_id":"7593c6c4-9967-41e6-ae6d-af58ef9cacea","resolution":{"observed_at":"2026-08-06T23:54:57.327568Z","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-06T23:54:57.306176Z","title":"How many neurons do we need? a refined analysis for shallow networks trained with gradient descent, 2023","venue":null,"work_id":"0a694864-009f-4ff9-a237-4a3439ffa03d","year":2023},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.746602Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:ed4745d6fcdb1bcdd65c1d0fc7862f2f70d225f7a9f52d749f12daefe11f8c0f","observation_id":"c1798274-3487-4766-808e-ba9c432c0efe","resolution":{"observed_at":"2026-08-06T23:54:57.311335Z","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":"2412.17518","last_updated":"2024-12-23T12:31:38Z","snapshot_observed_at":"2026-08-15T19:21:47.179234Z","submitted_at":"2024-12-23T12:31:38Z","title":"Optimal Convergence Rates for Neural Operators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17518","snapshot_observed_at":"2026-08-06T23:54:51.823150Z","title":"Optimal convergence rates for neural operators, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.823150Z"},"links":{"cited_paper":"/paper/2412.17518","citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:b729884cee7b97f7a7421719fd46394e3b53528e38cfa1987a23af64d1e9c3aa","observation_id":"b523dbd8-eafc-4d2c-9a4c-ea3805806dab","resolution":{"observed_at":"2026-08-06T23:54:51.823150Z","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-06T23:54:57.289825Z","title":"Optimal rates for averaged stochastic gradient descent under neural tangent kernel regime","venue":null,"work_id":"b3854dbb-7aa8-44fa-a38d-fa99fe227141","year":2020},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.909834Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:48f5fe0e31898363bd4bcd1f84ac4215f2a310c9e514ee27306301d90d3efa0f","observation_id":"47ff3d25-7564-4dd8-b1cb-dacd437d53dd","resolution":{"observed_at":"2026-08-06T23:54:57.295127Z","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-06T23:54:57.272619Z","title":"Towards moderate overparameterization: global convergence guarantees for training shallow neural networks, 2019","venue":null,"work_id":"5e0ab725-7638-4e6f-a976-58aabd1c3dc7","year":2019},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:51.982000Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:2cbfdd17b5eaf8ebd03300a0cbe411f948614b8a459acc6a78e01ef0507745c1","observation_id":"7a8a98f1-7c87-41c7-9827-3f3312429b1b","resolution":{"observed_at":"2026-08-06T23:54:57.277517Z","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-06T23:54:57.256802Z","title":"Implicit regularization of accelerated methods in hilbert spaces","venue":null,"work_id":"fe9d7e61-71c6-41ab-8b45-bf87c3c8da5e","year":2019},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.054522Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:2d728c53c46d3655919ec4a76616f87c11fcf98a6092ee6f5a8c8a80c05468e5","observation_id":"69860332-dfc3-4ff6-958f-8541a0a79f50","resolution":{"observed_at":"2026-08-06T23:54:57.261847Z","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-06T23:54:56.989018Z","title":"Statistical optimality of stochastic gradient descent on hard learning problems through multiple passes, 2018","venue":null,"work_id":"2f35e579-1730-4df5-8c5b-2b3df49e9a47","year":2018},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.144913Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:bbc3fcba516d77cda5ffb448bfc1fa98bdb4f49abf3be13050bc1d23b609231f","observation_id":"e4b8d719-7251-4d4f-a560-2e8287918328","resolution":{"observed_at":"2026-08-06T23:54:57.099054Z","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-06T23:54:56.722521Z","title":"Random features for large-scale kernel machines","venue":null,"work_id":"4ea9a616-d66c-4541-8e23-a4065c2aa7ce","year":2007},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.223563Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:28dab1f8468b57757c00add57ac2cab4897359c349e660c3bcda37dbc390306a","observation_id":"75fe94a7-7aa7-4f34-b202-bebadea83258","resolution":{"observed_at":"2026-08-06T23:54:56.832668Z","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-06T23:54:56.478210Z","title":"Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning","venue":null,"work_id":"8b3dccbe-db03-4d43-95d9-8705b06e7329","year":2008},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.294220Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:992c6dd81ac37090513ede8a8e249fb37d44424f74ec3f98c1523ed6e59da884","observation_id":"6fabb395-e84d-466d-9f4d-10dcf8e333df","resolution":{"observed_at":"2026-08-06T23:54:56.577248Z","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-06T23:54:56.270367Z","title":"A stochastic gradient method with an exponential convergence \\_rate for finite training sets","venue":null,"work_id":"390fabae-d30c-4b28-8f39-aef89807d48c","year":2012},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.399407Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:53e6795fe7c3bd9c24a00bc2af534bdf051f8cf55dac1bc520a7b5f1ba31f83f","observation_id":"c728326a-56f4-473c-9bb6-59d64ba822fb","resolution":{"observed_at":"2026-08-06T23:54:56.343644Z","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-06T23:54:56.099183Z","title":"Generalization properties of learning with random features, 2016","venue":null,"work_id":"47d553c3-98c3-4862-a0a5-8eaca21ca365","year":2016},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.494183Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:1d41093b05d9206a3cd17013a5cbdadc93b749a11d864155dfae9d10c98f93dd","observation_id":"89f03f05-8dec-4ec1-9fce-656ea11f7cb6","resolution":{"observed_at":"2026-08-06T23:54:56.177208Z","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-06T23:54:55.871393Z","title":"Less is more: Nystroem computational regularization, 2016","venue":null,"work_id":"88e684ca-0a0b-4d18-ace8-d9f489291cc6","year":2016},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.576234Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:725dca075a327ed039b615d1075665b6ff723190c67cdf30b4b6a13ca7d5fb6e","observation_id":"e346fc1a-57e2-4e79-a509-a8bae3a1a649","resolution":{"observed_at":"2026-08-06T23:54:55.996525Z","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-06T23:54:55.666623Z","title":"Schoelkopf and A","venue":null,"work_id":"fef1fa89-9f26-4e16-a138-805805f18edf","year":2002},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.650257Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:6ef1f0f8aaf54a5c7c24ffa81b9a14ad15cf5ddd6fab5be38c0cbad0c6310fff","observation_id":"abfc4b50-cecb-4720-ba43-c092c4a225b1","resolution":{"observed_at":"2026-08-06T23:54:55.776203Z","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-06T23:54:55.402150Z","title":"Mathematical Statistics","venue":null,"work_id":"37380f11-2d73-4196-9b2f-a728569f1df1","year":2003},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.724920Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:3d5fae7efa452047da35d762f228da20db3535576412ecfaea4aecf63cbd29da","observation_id":"a9171bbd-27e0-49f4-8742-f72b3151df1f","resolution":{"observed_at":"2026-08-06T23:54:55.502436Z","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-06T23:54:55.162686Z","title":"Support vector machines","venue":null,"work_id":"dd0cdffa-2a79-43a1-8527-69df7fcf0f8e","year":2008},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.791584Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:5b5f7c2d9d58ea39d40ebb76566504385b9930a5b0508ea5c23345e9d40bcc44","observation_id":"25dbb9d3-2511-482c-b234-eab2e0865dbc","resolution":{"observed_at":"2026-08-06T23:54:55.238661Z","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-06T23:54:54.967567Z","title":"Support vector machines","venue":null,"work_id":"edf36d35-397e-4eb2-a8ee-0172c2ef4641","year":2008},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.856247Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:17358bab1c2e69c94dc6fbc2e97ea8bebad91061a04842aa59f162580119a3dc","observation_id":"6cc00641-7b63-44bb-b20c-9b61ad58807d","resolution":{"observed_at":"2026-08-06T23:54:55.032328Z","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-06T23:54:54.732164Z","title":"Sriperumbudur","venue":null,"work_id":"852ebb78-e9c1-4a2f-bf00-52475e9612fa","year":2022},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.910633Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:1a315a073b9e760ea8c762c664252d07fd98d4629c7a786337c0c1474d4c2166","observation_id":"ae1ecd15-6e7f-46a2-b296-e83c7d6bcf7d","resolution":{"observed_at":"2026-08-06T23:54:54.800527Z","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-06T23:54:54.596505Z","title":"Gain with no pain: Efficiency of kernel-pca by nyström sampling","venue":null,"work_id":"3d526fa9-0075-42f0-aefb-1e717426503e","year":2020},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:52.960698Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:ff258718f2255342d6f1b33354bb5502c18763987cc3d12e5a45899c74ef2bc5","observation_id":"a3996d98-a2d1-4bf1-8260-e33759668215","resolution":{"observed_at":"2026-08-06T23:54:54.664187Z","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-06T23:54:54.486732Z","title":null,"venue":null,"work_id":"d454329c-2640-40fa-8125-2f5d76b6f2f1","year":2011},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:53.026233Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:ecdc2ff6e22811c2da9ef7c5066e03a8264e86fa4f3ced0223093c0ff67b31e9","observation_id":"d24dcf7b-b8b5-4af7-b329-a5bd7a3b9a56","resolution":{"observed_at":"2026-08-06T23:54:54.531203Z","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-06T23:54:54.367608Z","title":"Using the nystr\\\" o m method to speed up kernel machines","venue":null,"work_id":"3a84f742-607d-4e44-afcc-caec2031ab7d","year":2000},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:53.110971Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:b63df6bac009592cf5efa7684cf196d35525736ce77340b3665136f88ee84b31","observation_id":"daa71454-09f5-40de-81df-c794477f4dc3","resolution":{"observed_at":"2026-08-06T23:54:54.460981Z","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":"10.1137/140961791","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A proximal stochastic gradient method with progressive variance reduction","venue":"SIAM Journal on Optimization","work_id":"c6710fc7-2ff2-46af-ac25-d1e3fc378fc6","year":2014},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:53.175395Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:d1c1918460d9092cdfe6ed5a121382f56fd131a6b77bd946a7bfd91331243b74","observation_id":"659c7e84-a1ba-4892-903a-347006bda284","resolution":{"observed_at":"2026-08-06T23:54:53.458849Z","resolver_source":"doi","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":{"arxiv_id":"2303.14942","last_updated":"2024-09-03T04:57:03Z","snapshot_observed_at":"2026-08-16T15:45:10.478002Z","submitted_at":"2023-03-27T06:50:31Z","title":"On the Optimality of Misspecified Spectral Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.14942","snapshot_observed_at":"2026-08-06T23:54:53.239350Z","title":"On the optimality of misspecified spectral algorithms, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:53.239350Z"},"links":{"cited_paper":"/paper/2303.14942","citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:1a2e9b3bdb7f648c7aa9018772059fca897c5f1199bdc012cc470a14bba70e70","observation_id":"69dc9f0c-2a97-499c-82f4-7ff28a76aa80","resolution":{"observed_at":"2026-08-06T23:54:53.239350Z","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-06T23:54:54.086271Z","title":"Learning to learn kernels with variational random features, 2020","venue":null,"work_id":"4a8f9b6e-dde7-40e3-a1ca-244908eaad4d","year":2020},"citing_paper":{"arxiv_id":"2506.16283","last_updated":"2025-06-19T13:00:17Z","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T23:54:53.283304Z"},"links":{"citing_paper":"/paper/2506.16283"},"observation_digest":"sha256:9cc1ea0eb982575c4ea3ecf710a0c48037b4939b0b5f6289888667384698b682","observation_id":"2f120cd7-047a-4983-bcdd-7f7786ce9300","resolution":{"observed_at":"2026-08-06T23:54:54.179333Z","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.16283","last_updated":"2025-06-19T13:00:17Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-15T19:22:27.266185Z","submitted_at":"2025-06-19T13:00:17Z","title":"Random feature approximation for general spectral methods"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":34},"total_outbound_references":47},"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 20 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2506.16283."}