{"as_of":"2026-08-17T15:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eface3b3074e9e1f0cf1b08e34c7264a092f84e65debf46b1c55a68fdc352b1f","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-17T06:30:58.91139+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-08-04T17:24:37.123163Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.13643","last_updated":"2022-01-31T19:47:53Z","snapshot_observed_at":"2026-08-17T14:50:49.852223Z","submitted_at":"2021-08-31T07:03:06Z","title":"Learning to Synthesize Programs as Interpretable and Generalizable Policies","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.13643","snapshot_observed_at":"2026-08-04T17:24:37.123163Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10973","last_updated":"2025-09-13T20:22:43Z","snapshot_observed_at":"2026-08-16T19:37:30.628433Z","submitted_at":"2025-09-13T20:22:43Z","title":"Decoupling Search and Learning in Neural Net Training","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T17:24:37.123163Z"},"links":{"cited_paper":"/paper/2108.13643","citing_paper":"/paper/2509.10973"},"observation_digest":"sha256:074ce2a9bcd82315b4a407444449980da2bef194fc387ab3d8c9267b65425dbd","observation_id":"0b5ea806-585c-4b27-b2f9-509ae80c0109","resolution":{"observed_at":"2026-08-04T17:24:37.123163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2108.13643/citation-record","integrity":"/paper/2108.13643/integrity","json":"/paper/2108.13643/citation-record.json","paper":"/paper/2108.13643"},"outbound":[],"paper":{"arxiv_id":"2108.13643","last_updated":"2022-01-31T19:47:53Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T14:50:49.852223Z","submitted_at":"2021-08-31T07:03:06Z","title":"Learning to Synthesize Programs as Interpretable and Generalizable Policies"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2108.13643."}