{"as_of":"2026-08-09T20:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e085638ef8b639427280615ab41752c63e1e57cc3d13b42ecaf6e65cd88f05a","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:52:59.025422Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2009.07799","last_updated":"2024-08-30T14:12:30Z","snapshot_observed_at":"2026-08-09T19:48:49.715566Z","submitted_at":"2020-09-16T16:48:28Z","title":"On the Curse of Memory in Recurrent Neural Networks: Approximation and Optimization Analysis","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07799","snapshot_observed_at":"2026-08-04T04:52:59.025422Z","title":"On the curse of memory in recurrent neural networks: Approximation and optimization analysis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02553","last_updated":"2026-08-03T17:37:38Z","snapshot_observed_at":"2026-08-06T23:39:10.317481Z","submitted_at":"2026-08-03T17:37:38Z","title":"A Taxonomy of Cognitive Capability Gaps in Generative and Agentic AI","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T04:52:59.025422Z"},"links":{"cited_paper":"/paper/2009.07799","citing_paper":"/paper/2608.02553"},"observation_digest":"sha256:9329647f905ef2b35a77ae13762a1de6bcb8bd9a118d82f97297aa525751654d","observation_id":"b10b7a7c-6629-4081-ad3b-c91749215b62","resolution":{"observed_at":"2026-08-04T04:52:59.025422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.07799/citation-record","integrity":"/paper/2009.07799/integrity","json":"/paper/2009.07799/citation-record.json","paper":"/paper/2009.07799"},"outbound":[],"paper":{"arxiv_id":"2009.07799","last_updated":"2024-08-30T14:12:30Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T19:48:49.715566Z","submitted_at":"2020-09-16T16:48:28Z","title":"On the Curse of Memory in Recurrent Neural Networks: Approximation and Optimization Analysis"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2009.07799."}