{"as_of":"2026-08-12T04:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17cc4cd51a73bba38da01aa33d2c412b2f64b018d4e1e18f718a02c21eb206e8","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:18:55.730733Z","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":19,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.03629","last_updated":"2020-07-08T09:19:58Z","snapshot_observed_at":"2026-08-11T12:22:30.783779Z","submitted_at":"2020-07-07T17:03:02Z","title":"Strong Generalization and Efficiency in Neural Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03629","snapshot_observed_at":"2026-08-10T23:18:55.730733Z","title":"Strong generalization and efficiency in neural programs","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.00072","last_updated":"2024-12-30T02:14:58Z","snapshot_observed_at":"2026-08-11T07:19:58.717524Z","submitted_at":"2024-12-30T02:14:58Z","title":"Open-Book Neural Algorithmic Reasoning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T23:18:55.730733Z"},"links":{"cited_paper":"/paper/2007.03629","citing_paper":"/paper/2501.00072"},"observation_digest":"sha256:61d74cb9a0678555ac1a62ea91608d121f38fac1fd170a1c1969677b7b51f47c","observation_id":"5c63439b-8448-4d00-ae3c-87a137eb372b","resolution":{"observed_at":"2026-08-10T23:18:55.730733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03629","last_updated":"2020-07-08T09:19:58Z","snapshot_observed_at":"2026-08-11T12:22:30.783779Z","submitted_at":"2020-07-07T17:03:02Z","title":"Strong Generalization and Efficiency in Neural Programs","version":2},"cited_work":{"arxiv_id":"2007.03629","doi":"10.48550/arxiv.2007.03629","metadata_source":"arxiv_reference","pith_arxiv_id":"2007.03629","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"9752701c-b839-4d1f-a30c-797d461ed171","year":2020},"citing_paper":{"arxiv_id":"2502.05171","last_updated":"2025-02-17T17:14:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-07T18:55:02Z","title":"Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-05-12T15:39:40.845703Z"},"links":{"cited_paper":"/paper/2007.03629","citing_paper":"/paper/2502.05171"},"observation_digest":"sha256:8bb2bd9c413f420cab1e48fe5be1733cd8f3ae822f1e81ca15365feb09308176","observation_id":"15d38dad-54d9-4985-a056-78781d4550c2","resolution":{"observed_at":"2026-05-12T15:39:41.062461Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2007.03629/citation-record","integrity":"/paper/2007.03629/integrity","json":"/paper/2007.03629/citation-record.json","paper":"/paper/2007.03629"},"outbound":[],"paper":{"arxiv_id":"2007.03629","last_updated":"2020-07-08T09:19:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T12:22:30.783779Z","submitted_at":"2020-07-07T17:03:02Z","title":"Strong Generalization and Efficiency in Neural Programs"},"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 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2007.03629."}