{"as_of":"2026-08-08T15:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8df20c12387ea04d160f8d2c2ccd2c332be6e8b4673195467c8b83bb8d8c4f03","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-06T11:04:47.223422Z","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-10T11:37:03.257809Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.03212","last_updated":"2023-08-21T18:54:56Z","snapshot_observed_at":"2026-07-06T16:03:10.517945Z","submitted_at":"2023-08-06T21:23:22Z","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03212","snapshot_observed_at":"2026-08-06T11:04:47.223422Z","title":"Alon Talmor, Jonathan Herzig, Nicholas Lourie, and Jonathan Berant","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.23170","last_updated":"2025-08-02T05:05:26Z","snapshot_observed_at":"2026-08-08T14:01:33.627148Z","submitted_at":"2025-07-31T00:51:16Z","title":"BAR Conjecture: the Feasibility of Inference Budget-Constrained LLM Services with Authenticity and Reasoning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T11:04:47.223422Z"},"links":{"cited_paper":"/paper/2308.03212","citing_paper":"/paper/2507.23170"},"observation_digest":"sha256:49c55b87bfce07906d1edac983f5efb54d2c934d94ea541b557988a2ab2b867d","observation_id":"f125b8d1-327f-4444-a71b-e6f3b46b29a1","resolution":{"observed_at":"2026-08-06T11:04:47.223422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03212","last_updated":"2023-08-21T18:54:56Z","snapshot_observed_at":"2026-07-06T16:03:10.517945Z","submitted_at":"2023-08-06T21:23:22Z","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03212","snapshot_observed_at":"2026-07-13T21:49:42.006847Z","title":"Stein, K., Fiˇser, D., Hoffmann, J., and Koller, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.19954","last_updated":"2026-07-03T09:42:27Z","snapshot_observed_at":"2026-08-03T16:57:53.798449Z","submitted_at":"2026-03-20T13:55:29Z","title":"On the Ability of Transformers to Verify Plans","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T21:49:42.006847Z"},"links":{"cited_paper":"/paper/2308.03212","citing_paper":"/paper/2603.19954"},"observation_digest":"sha256:86cf9e7ec2768c08b2ca39c423c53cd6c3563b515c23a72c73d211a80375111a","observation_id":"b91be800-59b6-4fc9-8730-d150fc366dbe","resolution":{"observed_at":"2026-07-13T21:49:42.006847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03212","last_updated":"2023-08-21T18:54:56Z","snapshot_observed_at":"2026-07-06T16:03:10.517945Z","submitted_at":"2023-08-06T21:23:22Z","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","version":2},"cited_work":{"arxiv_id":"2308.03212","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.03212","snapshot_observed_at":"2026-07-10T11:37:03.257809Z","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits","venue":"cs.CL","work_id":"29fcce4c-d7aa-4500-94c6-89460bbcf330","year":2023},"citing_paper":{"arxiv_id":"2607.08196","last_updated":"2026-07-09T07:54:39Z","snapshot_observed_at":"2026-08-07T00:25:36.849231Z","submitted_at":"2026-07-09T07:54:39Z","title":"A First-Principles Theory of Slow Thinking and Active Perception","version":1},"reference_index":148,"source":"pdf_text","source_observed_at":"2026-07-10T11:32:24.374377Z"},"links":{"cited_paper":"/paper/2308.03212","citing_paper":"/paper/2607.08196"},"observation_digest":"sha256:2da37f960c186576d14523c523cf2ccfdc0354eb02c0bdbfb3c91483033c8621","observation_id":"1c6dacd6-29c8-4860-ad3e-ef6adafd1f0c","resolution":{"observed_at":"2026-07-10T11:37:03.259993Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2308.03212/citation-record","integrity":"/paper/2308.03212/integrity","json":"/paper/2308.03212/citation-record.json","paper":"/paper/2308.03212"},"outbound":[],"paper":{"arxiv_id":"2308.03212","last_updated":"2023-08-21T18:54:56Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T16:03:10.517945Z","submitted_at":"2023-08-06T21:23:22Z","title":"Average-Hard Attention Transformers are Constant-Depth Uniform Threshold Circuits"},"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:2308.03212."}