{"as_of":"2026-08-16T13:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:036358810ef8b8ce743500652a25b0e439710349e8e50953d83b4a7b19673d5c","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:57:17.654832Z","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-01T14:05:46.379510Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-08-12T20:23:11.232422Z","title":"Listops: A diagnostic dataset for latent tree learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.09827","last_updated":"2024-11-14T22:24:59Z","snapshot_observed_at":"2026-08-16T03:34:04.121174Z","submitted_at":"2024-11-14T22:24:59Z","title":"The Good, The Efficient and the Inductive Biases: Exploring Efficiency in Deep Learning Through the Use of Inductive Biases","version":1},"reference_index":269,"source":"pdf_text","source_observed_at":"2026-08-12T20:23:11.232422Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2411.09827"},"observation_digest":"sha256:f1415266fb2f9775117ae85c2b6b7ed2263c6835150d2c8d0397e771e5f3647c","observation_id":"8b4713d8-f853-4a5d-a5c0-72a8bc350723","resolution":{"observed_at":"2026-08-12T20:23:11.232422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-08-11T05:18:28.961592Z","title":"Listops: A diagnostic dataset for latent tree learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.17810","last_updated":"2024-12-23T18:59:21Z","snapshot_observed_at":"2026-08-14T14:42:28.014041Z","submitted_at":"2024-12-23T18:59:21Z","title":"Token Statistics Transformer: Linear-Time Attention via Variational Rate Reduction","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T05:18:28.961592Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2412.17810"},"observation_digest":"sha256:2f241264c3b0f6ef2d117d24933ccfd43d4c8bd405987eecebe3a0935342e4c9","observation_id":"23721247-848d-4962-b704-2f8d25f48ff0","resolution":{"observed_at":"2026-08-11T05:18:28.961592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-08-10T16:49:47.126947Z","title":"and Bowman, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12896","last_updated":"2025-01-22T14:17:57Z","snapshot_observed_at":"2026-08-15T04:44:03.237681Z","submitted_at":"2025-01-22T14:17:57Z","title":"Irrational Complex Rotations Empower Low-bit Optimizers","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T16:49:47.126947Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2501.12896"},"observation_digest":"sha256:35285998d6e9b7c309e29f4181f9e811f97a6dded98bf8e71b98d97b969b1833","observation_id":"e45d53c5-99e0-48f3-a384-05033de4f70d","resolution":{"observed_at":"2026-08-10T16:49:47.126947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-08-15T21:57:17.654832Z","title":"Listops: A diagnostic dataset for latent tree learning.arXiv preprint arXiv:1804.06028,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.08516","last_updated":"2025-05-13T12:48:04Z","snapshot_observed_at":"2026-08-16T07:35:22.957707Z","submitted_at":"2025-05-13T12:48:04Z","title":"Learning Advanced Self-Attention for Linear Transformers in the Singular Value Domain","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-15T21:57:17.654832Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2505.08516"},"observation_digest":"sha256:639ad53d9eab4771f9321e1166fef474c192456b86ee939cb3f6d981a0d58c5a","observation_id":"94e0fe1b-b746-4fa5-b1a1-0ce2f0cff237","resolution":{"observed_at":"2026-08-15T21:57:17.654832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":"1804.06028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-07-01T14:05:46.379510Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","venue":"cs.CL","work_id":"31fd58a3-f777-413a-a3e3-91c4923147b9","year":2018},"citing_paper":{"arxiv_id":"2605.15216","last_updated":"2026-05-26T08:47:08Z","snapshot_observed_at":"2026-08-14T15:09:16.541903Z","submitted_at":"2026-05-12T09:44:32Z","title":"Hardware-Software Co-Design of Scalable, Energy-Efficient Analog Recurrent Computations","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-05-20T22:07:34.292536Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2605.15216"},"observation_digest":"sha256:c5efca70b2eab2c6e50832296f5b9a92624dfa08c83960df498bab42b8ce2fb1","observation_id":"e98dc78b-1873-4a4a-964b-623cc0186407","resolution":{"observed_at":"2026-05-20T22:09:07.224335Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":"1804.06028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-07-01T14:05:46.379510Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","venue":"cs.CL","work_id":"31fd58a3-f777-413a-a3e3-91c4923147b9","year":2018},"citing_paper":{"arxiv_id":"2605.15216","last_updated":"2026-05-26T08:47:08Z","snapshot_observed_at":"2026-08-14T15:09:16.541903Z","submitted_at":"2026-05-12T09:44:32Z","title":"Hardware-Software Co-Design of Scalable, Energy-Efficient Analog Recurrent Computations","version":3},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-06-30T22:21:16.608148Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2605.15216"},"observation_digest":"sha256:3946c18961fe0aaf4e1ce46282fe415dbcdc6221e8da13b4754470e34ba67853","observation_id":"2c33e206-5078-4268-9613-9810256df8a2","resolution":{"observed_at":"2026-07-01T14:05:46.382723Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","version":1},"cited_work":{"arxiv_id":"1804.06028","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.06028","snapshot_observed_at":"2026-07-01T14:05:46.379510Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","venue":"cs.CL","work_id":"31fd58a3-f777-413a-a3e3-91c4923147b9","year":2018},"citing_paper":{"arxiv_id":"2605.21070","last_updated":"2026-05-20T11:56:15Z","snapshot_observed_at":"2026-08-15T23:56:17.773250Z","submitted_at":"2026-05-20T11:56:15Z","title":"Towards Understanding Self-Pretraining for Sequence Classification","version":1},"reference_index":141,"source":"arxiv_source","source_observed_at":"2026-05-21T05:29:58.809024Z"},"links":{"cited_paper":"/paper/1804.06028","citing_paper":"/paper/2605.21070"},"observation_digest":"sha256:0d53d227746c2f405612d8ba95557f5907479854df0f983fc64b170c2fc64f3d","observation_id":"63bf1683-48b1-4c47-9435-98e0a23fdf13","resolution":{"observed_at":"2026-05-21T05:33:58.894117Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1804.06028/citation-record","integrity":"/paper/1804.06028/integrity","json":"/paper/1804.06028/citation-record.json","paper":"/paper/1804.06028"},"outbound":[],"paper":{"arxiv_id":"1804.06028","last_updated":"2018-04-17T03:26:28Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T19:25:16.289226Z","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree 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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:1804.06028."}