{"as_of":"2026-08-21T10:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d250b7b5fe577a3032df4f722cbde5de208ac592a095d92e2b1a03b977064ddb","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-21T06:32:19.484+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-07-14T03:23:31.727605Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.09728","last_updated":"2024-03-12T21:54:34Z","snapshot_observed_at":"2026-08-16T14:10:24.807696Z","submitted_at":"2024-03-12T21:54:34Z","title":"Simulating Weighted Automata over Sequences and Trees with Transformers","version":1},"cited_work":{"arxiv_id":"2403.09728","doi":"10.48550/arxiv.2403.09728","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.09728","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simulating","venue":"arXiv (Cornell University)","work_id":"e344f317-afda-4b91-870d-290119a7a93c","year":2024},"citing_paper":{"arxiv_id":"2604.02709","last_updated":"2026-04-15T09:12:39Z","snapshot_observed_at":"2026-08-11T06:13:28.183495Z","submitted_at":"2026-04-03T04:06:39Z","title":"Evaluating the Formal Reasoning Capabilities of Large Language Models through Chomsky Hierarchy","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-13T19:51:08.304741Z"},"links":{"cited_paper":"/paper/2403.09728","citing_paper":"/paper/2604.02709"},"observation_digest":"sha256:f61651ded60a5dd8d7c31c34a6c5e1d62668b4ebbc89f6a28f26e4550d0ce1eb","observation_id":"c6d404b7-c048-4a99-8141-710780aaff8f","resolution":{"observed_at":"2026-05-13T19:53:11.780117Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09728","last_updated":"2024-03-12T21:54:34Z","snapshot_observed_at":"2026-08-16T14:10:24.807696Z","submitted_at":"2024-03-12T21:54:34Z","title":"Simulating Weighted Automata over Sequences and Trees with Transformers","version":1},"cited_work":{"arxiv_id":"2403.09728","doi":"10.48550/arxiv.2403.09728","metadata_source":"arxiv_reference","pith_arxiv_id":"2403.09728","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simulating","venue":"arXiv (Cornell University)","work_id":"e344f317-afda-4b91-870d-290119a7a93c","year":2024},"citing_paper":{"arxiv_id":"2606.27206","last_updated":"2026-06-25T16:02:14Z","snapshot_observed_at":"2026-08-12T13:06:59.794611Z","submitted_at":"2026-06-25T16:02:14Z","title":"Syntactic Belief Update as the Driver of Garden Path Processing Difficulty","version":1},"reference_index":214,"source":"arxiv_source","source_observed_at":"2026-06-26T04:38:01.183423Z"},"links":{"cited_paper":"/paper/2403.09728","citing_paper":"/paper/2606.27206"},"observation_digest":"sha256:955439e7c574e2d84bc284ac982ed3398929a33d09091ff9c33db96920f1d52c","observation_id":"ceb354c3-6768-45db-ab53-725788505630","resolution":{"observed_at":"2026-06-26T04:38:58.474811Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09728","last_updated":"2024-03-12T21:54:34Z","snapshot_observed_at":"2026-08-16T14:10:24.807696Z","submitted_at":"2024-03-12T21:54:34Z","title":"Simulating Weighted Automata over Sequences and Trees with Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09728","snapshot_observed_at":"2026-07-14T03:23:31.727605Z","title":"Simulating weighted automata over sequences and trees with transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11760","last_updated":"2026-07-13T16:22:36Z","snapshot_observed_at":"2026-08-20T12:39:56.068057Z","submitted_at":"2026-07-13T16:22:36Z","title":"From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-14T03:23:31.727605Z"},"links":{"cited_paper":"/paper/2403.09728","citing_paper":"/paper/2607.11760"},"observation_digest":"sha256:e46e7125991adf664d2987b6e25dad7d532b71671f072825f43f15328b67038f","observation_id":"2895447b-d6ff-43e3-a17c-d9568c666b2e","resolution":{"observed_at":"2026-07-14T03:23:31.727605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.09728/citation-record","integrity":"/paper/2403.09728/integrity","json":"/paper/2403.09728/citation-record.json","paper":"/paper/2403.09728"},"outbound":[],"paper":{"arxiv_id":"2403.09728","last_updated":"2024-03-12T21:54:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T14:10:24.807696Z","submitted_at":"2024-03-12T21:54:34Z","title":"Simulating Weighted Automata over Sequences and Trees with Transformers"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2403.09728."}