{"as_of":"2026-08-11T20:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3c7318c970fe5eaae2522d9dca30bbbf90a76b03ec6cd84c1007b87034ce9b42","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-11T06:34:44.6726+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-11T05:18:28.961592Z","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-10T08:50:13.244541Z","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-11T05:06:17.928807Z","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:6b71b0eeffc1a48412add28167cc54c885c4ab9d56c7c2b6c29e4147be5ec538","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-10T08:50:13.244541Z","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-11T12:43:02.825020Z","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:3910c0463f8e98d03d6b8a9f07a2760f557b622152432116b116fb24970a7721","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-10T08:50:13.244541Z","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-08T06:19:18.473672Z","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:6302c07815cd62d2d285e2276a5b0b929e97a732084cd00caa2c02d1d740b789","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T08:50:13.244541Z","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-08T06:19:18.473672Z","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:8bd98ae0c1bb1d7098f4a42cd2fef9a96f47bc1f02ad4e59630cf8e0f2dbe61b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T08:50:13.244541Z","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-07-06T23:31:32.577242Z","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:f8c5db3a9fc89b667a9355c1724da59b7697a6b50668dd25ee2feac80b182f2b","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-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T08:50:13.244541Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1804.06028."}