{"as_of":"2026-08-23T14:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e1ae74db441aeb1ebeffaa35222741f77374a73fe7f80b5010463cacaba3e72","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T16:36:19.729400Z","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-11T23:36:38.614593Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.12941","last_updated":"2021-04-13T12:25:49Z","snapshot_observed_at":"2026-08-18T20:11:40.968435Z","submitted_at":"2019-05-30T10:08:00Z","title":"Learning Compositional Neural Programs with Recursive Tree Search and Planning","version":2},"cited_work":{"arxiv_id":"1905.12941","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.12941","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3c216ca4-38f5-4fe0-b75b-41d403c26ec1","year":1905},"citing_paper":{"arxiv_id":"2604.25166","last_updated":"2026-04-28T03:15:44Z","snapshot_observed_at":"2026-07-06T23:11:02.043135Z","submitted_at":"2026-04-28T03:15:44Z","title":"Training Transformers as a Universal Computer","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-07T16:36:19.729400Z"},"links":{"cited_paper":"/paper/1905.12941","citing_paper":"/paper/2604.25166"},"observation_digest":"sha256:80cf7dc44688b42afbe7d33eb8b182b49e07affe5ccd61ab16474ce23b74c78f","observation_id":"4d42a1ed-b60f-403d-b7f7-cc40753de785","resolution":{"observed_at":"2026-05-11T23:36:38.617574Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1905.12941/citation-record","integrity":"/paper/1905.12941/integrity","json":"/paper/1905.12941/citation-record.json","paper":"/paper/1905.12941"},"outbound":[],"paper":{"arxiv_id":"1905.12941","last_updated":"2021-04-13T12:25:49Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-18T20:11:40.968435Z","submitted_at":"2019-05-30T10:08:00Z","title":"Learning Compositional Neural Programs with Recursive Tree Search and Planning"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1905.12941."}