{"as_of":"2026-08-10T14:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4538318fcf2f4c1c18b6b2753f696276473e8907cd9c49fea2868232ec562b0b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:51:43.153199Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T19:43:23.065000Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.07232","last_updated":"2020-06-12T14:38:15Z","snapshot_observed_at":"2026-08-10T02:17:35.092722Z","submitted_at":"2020-06-12T14:38:15Z","title":"A Practical Sparse Approximation for Real Time Recurrent Learning","version":1},"cited_work":{"arxiv_id":"2006.07232","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07232","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Menick, E","venue":null,"work_id":"ca2baf1c-5ceb-4f86-99b1-4f45be9194d3","year":2006},"citing_paper":{"arxiv_id":"2410.05882","last_updated":"2026-04-15T19:46:54Z","snapshot_observed_at":"2026-07-06T19:29:42.190813Z","submitted_at":"2024-10-08T10:21:43Z","title":"Frame forecasting in cine MRI using the PCA respiratory motion model: comparing recurrent neural networks trained online and transformers","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T19:42:45.987188Z"},"links":{"cited_paper":"/paper/2006.07232","citing_paper":"/paper/2410.05882"},"observation_digest":"sha256:feb3e55c0c5f5842bd9a7b3f84befce500f96274b17ae33fd83381e9f553365f","observation_id":"6692d611-ba6e-4166-9796-3ee6081b8dcb","resolution":{"observed_at":"2026-05-23T19:43:23.072853Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07232","last_updated":"2020-06-12T14:38:15Z","snapshot_observed_at":"2026-08-10T02:17:35.092722Z","submitted_at":"2020-06-12T14:38:15Z","title":"A Practical Sparse Approximation for Real Time Recurrent Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07232","snapshot_observed_at":"2026-08-07T05:51:43.153199Z","title":"A practical sparse approximation for real time recurrent learning.arXiv preprint arXiv:2006.07232,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.06904","last_updated":"2025-06-07T19:32:15Z","snapshot_observed_at":"2026-08-09T11:40:16.184839Z","submitted_at":"2025-06-07T19:32:15Z","title":"Can Biologically Plausible Temporal Credit Assignment Rules Match BPTT for Neural Similarity? E-prop as an Example","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:43.153199Z"},"links":{"cited_paper":"/paper/2006.07232","citing_paper":"/paper/2506.06904"},"observation_digest":"sha256:c5ae61260bbc8a1f4508d730d8df2b2da76e90adce950b54df5d41d4b69f5e8f","observation_id":"d531cbd2-95ec-4fd0-8c2c-91be2a47d0bc","resolution":{"observed_at":"2026-08-07T05:51:43.153199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07232","last_updated":"2020-06-12T14:38:15Z","snapshot_observed_at":"2026-08-10T02:17:35.092722Z","submitted_at":"2020-06-12T14:38:15Z","title":"A Practical Sparse Approximation for Real Time Recurrent Learning","version":1},"cited_work":{"arxiv_id":"2006.07232","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07232","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Menick, E","venue":null,"work_id":"ca2baf1c-5ceb-4f86-99b1-4f45be9194d3","year":2006},"citing_paper":{"arxiv_id":"2605.08746","last_updated":"2026-05-09T07:22:29Z","snapshot_observed_at":"2026-07-06T23:20:57.084438Z","submitted_at":"2026-05-09T07:22:29Z","title":"The Global Empirical NTK: Self-Referential Bias and Dimensionality of Gradient Descent Learning","version":1},"reference_index":104,"source":"arxiv_source","source_observed_at":"2026-05-12T02:57:57.097441Z"},"links":{"cited_paper":"/paper/2006.07232","citing_paper":"/paper/2605.08746"},"observation_digest":"sha256:738615021ea6056c733eb988aba93d889ffa5655973fb4c06510a87d8010475b","observation_id":"e72b4078-184d-4107-977e-11cda45fc4d3","resolution":{"observed_at":"2026-05-12T03:01:18.493006Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07232","last_updated":"2020-06-12T14:38:15Z","snapshot_observed_at":"2026-08-10T02:17:35.092722Z","submitted_at":"2020-06-12T14:38:15Z","title":"A Practical Sparse Approximation for Real Time Recurrent Learning","version":1},"cited_work":{"arxiv_id":"2006.07232","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07232","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Menick, E","venue":null,"work_id":"ca2baf1c-5ceb-4f86-99b1-4f45be9194d3","year":2006},"citing_paper":{"arxiv_id":"2605.12763","last_updated":"2026-05-12T21:20:27Z","snapshot_observed_at":"2026-07-06T23:24:23.402304Z","submitted_at":"2026-05-12T21:20:27Z","title":"State-Space NTK Collapse Near Bifurcations","version":1},"reference_index":104,"source":"arxiv_source","source_observed_at":"2026-05-14T21:03:49.445965Z"},"links":{"cited_paper":"/paper/2006.07232","citing_paper":"/paper/2605.12763"},"observation_digest":"sha256:72d9577d2e8e76760e5ba8f90607cddebf1aab561f1a96238d3a70e3e988ae7e","observation_id":"ef4d38fb-1b2c-416c-ba2c-5d245884fcd7","resolution":{"observed_at":"2026-05-14T21:19:28.965463Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07232","last_updated":"2020-06-12T14:38:15Z","snapshot_observed_at":"2026-08-10T02:17:35.092722Z","submitted_at":"2020-06-12T14:38:15Z","title":"A Practical Sparse Approximation for Real Time Recurrent Learning","version":1},"cited_work":{"arxiv_id":"2006.07232","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07232","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Menick, E","venue":null,"work_id":"ca2baf1c-5ceb-4f86-99b1-4f45be9194d3","year":2006},"citing_paper":{"arxiv_id":"2605.16318","last_updated":"2026-05-04T22:18:05Z","snapshot_observed_at":"2026-07-06T23:27:29.931962Z","submitted_at":"2026-05-04T22:18:05Z","title":"Investigating Action Encodings in Recurrent Neural Networks in Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T23:26:23.989545Z"},"links":{"cited_paper":"/paper/2006.07232","citing_paper":"/paper/2605.16318"},"observation_digest":"sha256:b8d19850a0c57654ebbff5a34d3fb5611efb0e7f73359b1660384e414955819b","observation_id":"72b82647-fe2e-41a6-a433-c989798fea99","resolution":{"observed_at":"2026-05-20T23:29:13.190992Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2006.07232/citation-record","integrity":"/paper/2006.07232/integrity","json":"/paper/2006.07232/citation-record.json","paper":"/paper/2006.07232"},"outbound":[],"paper":{"arxiv_id":"2006.07232","last_updated":"2020-06-12T14:38:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T02:17:35.092722Z","submitted_at":"2020-06-12T14:38:15Z","title":"A Practical Sparse Approximation for Real Time Recurrent Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2006.07232."}