{"as_of":"2026-08-09T14:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d071eb8277202010ea2290387cfcb4472eae5cb2127d2123b70e4512033a2f8","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:57:15.382362Z","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-12T08:46:25.041167Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11338","last_updated":"2020-05-26T13:59:48Z","snapshot_observed_at":"2026-08-09T08:48:32.552731Z","submitted_at":"2020-02-26T07:51:38Z","title":"Refined Gate: A Simple and Effective Gating Mechanism for Recurrent Units","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11338","snapshot_observed_at":"2026-08-07T21:57:15.382362Z","title":"Refined gate: A simple and effective gating mechanism for recurrent units,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.09318","last_updated":"2025-02-13T13:33:35Z","snapshot_observed_at":"2026-08-09T10:31:33.766515Z","submitted_at":"2025-02-13T13:33:35Z","title":"SigGate: Enhancing Recurrent Neural Networks with Signature-Based Gating Mechanisms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T21:57:15.382362Z"},"links":{"cited_paper":"/paper/2002.11338","citing_paper":"/paper/2502.09318"},"observation_digest":"sha256:784c5685409ce679af5ecce71bf184b3e1ae288d1af1ce57ca8f00aac29012d6","observation_id":"ad306ab5-2e71-4043-9f86-3fc5eb869bcb","resolution":{"observed_at":"2026-08-07T21:57:15.382362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11338","last_updated":"2020-05-26T13:59:48Z","snapshot_observed_at":"2026-08-09T08:48:32.552731Z","submitted_at":"2020-02-26T07:51:38Z","title":"Refined Gate: A Simple and Effective Gating Mechanism for Recurrent Units","version":2},"cited_work":{"arxiv_id":"2002.11338","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11338","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2002.11338 (2020)","venue":null,"work_id":"62ded77f-d2a4-4d52-809c-41c051d1e9f2","year":2002},"citing_paper":{"arxiv_id":"2604.26353","last_updated":"2026-04-29T07:04:29Z","snapshot_observed_at":"2026-08-01T22:51:49.213610Z","submitted_at":"2026-04-29T07:04:29Z","title":"GateMOT: Q-Gated Attention for Dense Object Tracking","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-07T13:57:52.724423Z"},"links":{"cited_paper":"/paper/2002.11338","citing_paper":"/paper/2604.26353"},"observation_digest":"sha256:281da310b2f7ebb57d7339dba38d8384c776ff8c6db9d892169419ab52d63c54","observation_id":"902af8ac-c7cb-4afc-b93b-a9385ca1f08d","resolution":{"observed_at":"2026-05-12T08:46:25.043936Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.11338/citation-record","integrity":"/paper/2002.11338/integrity","json":"/paper/2002.11338/citation-record.json","paper":"/paper/2002.11338"},"outbound":[],"paper":{"arxiv_id":"2002.11338","last_updated":"2020-05-26T13:59:48Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-09T08:48:32.552731Z","submitted_at":"2020-02-26T07:51:38Z","title":"Refined Gate: A Simple and Effective Gating Mechanism for Recurrent Units"},"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 2 inbound Pith citation observations for arXiv:2002.11338."}