{"as_of":"2026-08-08T09:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0229a037a856bdb4d4999568823ced32f8a22240f00dbf66b221566c4c5c27db","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:29:03.582703Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T03:19:31.213073Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.12340","last_updated":"2019-05-29T11:35:18Z","snapshot_observed_at":"2026-07-06T07:56:22.526754Z","submitted_at":"2019-05-29T11:35:18Z","title":"Rethinking Full Connectivity in Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":"1905.12340","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.12340","snapshot_observed_at":"2026-07-04T03:19:31.213073Z","title":"Rethinking full connectivity in recurrent neural networks","venue":"cs.LG","work_id":"f17056bf-9431-4e70-b2a0-ab7bbbc4271a","year":2019},"citing_paper":{"arxiv_id":"2301.04104","last_updated":"2024-04-17T17:41:20Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-01-10T18:12:16Z","title":"Mastering Diverse Domains through World Models","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-11T09:08:21.677362Z"},"links":{"cited_paper":"/paper/1905.12340","citing_paper":"/paper/2301.04104"},"observation_digest":"sha256:a122d38de3faa8c573e8b2a4ad732458f1f5d017ed0a5118984e9b17cd7a7766","observation_id":"002ba982-9c6a-47b3-a146-f35718f987b6","resolution":{"observed_at":"2026-05-11T09:08:22.461203Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12340","last_updated":"2019-05-29T11:35:18Z","snapshot_observed_at":"2026-07-06T07:56:22.526754Z","submitted_at":"2019-05-29T11:35:18Z","title":"Rethinking Full Connectivity in Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12340","snapshot_observed_at":"2026-08-07T05:29:03.582703Z","title":"Rethinking full connectivity in recurrent neural networks","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2506.07920","last_updated":"2025-06-09T16:33:29Z","snapshot_observed_at":"2026-08-07T09:21:43.318215Z","submitted_at":"2025-06-09T16:33:29Z","title":"W4S4: WaLRUS Meets S4 for Long-Range Sequence Modeling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:29:03.582703Z"},"links":{"cited_paper":"/paper/1905.12340","citing_paper":"/paper/2506.07920"},"observation_digest":"sha256:61f0a3676dae013f7a0b6cef7a8ee9cf6fc6420f86a23f6010cdfafd0d1d0f55","observation_id":"af28f762-865a-4859-b634-71276eabe8a3","resolution":{"observed_at":"2026-08-07T05:29:03.582703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12340","last_updated":"2019-05-29T11:35:18Z","snapshot_observed_at":"2026-07-06T07:56:22.526754Z","submitted_at":"2019-05-29T11:35:18Z","title":"Rethinking Full Connectivity in Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":"1905.12340","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.12340","snapshot_observed_at":"2026-07-04T03:19:31.213073Z","title":"Rethinking full connectivity in recurrent neural networks","venue":"cs.LG","work_id":"f17056bf-9431-4e70-b2a0-ab7bbbc4271a","year":2019},"citing_paper":{"arxiv_id":"2606.20411","last_updated":"2026-06-18T15:58:48Z","snapshot_observed_at":"2026-08-02T04:44:49.376109Z","submitted_at":"2026-06-18T15:58:48Z","title":"Direct Advantage Estimation for Scalable and Sample-efficient Deep Reinforcement Learning","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-06-26T18:12:00.111067Z"},"links":{"cited_paper":"/paper/1905.12340","citing_paper":"/paper/2606.20411"},"observation_digest":"sha256:38718bb4900159126861dda97a1f174eea1ce7982f20a5a4f8a3833b615a5621","observation_id":"8f702c91-fd87-4a71-9c3f-649f9ecaf390","resolution":{"observed_at":"2026-07-04T03:19:31.214761Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1905.12340/citation-record","integrity":"/paper/1905.12340/integrity","json":"/paper/1905.12340/citation-record.json","paper":"/paper/1905.12340"},"outbound":[],"paper":{"arxiv_id":"1905.12340","last_updated":"2019-05-29T11:35:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:56:22.526754Z","submitted_at":"2019-05-29T11:35:18Z","title":"Rethinking Full Connectivity in Recurrent Neural Networks"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1905.12340."}