{"as_of":"2026-08-07T22:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:920fa645dd35443be09ca43a270d15e70516e20b01c13dfec65466383db008e7","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-07T06:34:17.273281+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-06T15:12:51.991294Z","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-06-29T17:53:47.526294Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.05294","last_updated":"2024-05-08T10:03:50Z","snapshot_observed_at":"2026-08-07T10:59:44.065141Z","submitted_at":"2024-05-08T10:03:50Z","title":"Harmonizing Program Induction with Rate-Distortion Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05294","snapshot_observed_at":"2026-08-06T15:12:51.991294Z","title":"Nagy, and Charley M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.16511","last_updated":"2025-07-22T12:16:45Z","snapshot_observed_at":"2026-08-07T03:24:55.164525Z","submitted_at":"2025-07-22T12:16:45Z","title":"Analogy making as amortised model construction","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T15:12:51.991294Z"},"links":{"cited_paper":"/paper/2405.05294","citing_paper":"/paper/2507.16511"},"observation_digest":"sha256:f7bde301979f366531c30b3ac96ebfbd280a901e4f861019aae2eabe350bf473","observation_id":"05c10836-002f-4774-adec-ab507923faa8","resolution":{"observed_at":"2026-08-06T15:12:51.991294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05294","last_updated":"2024-05-08T10:03:50Z","snapshot_observed_at":"2026-08-07T10:59:44.065141Z","submitted_at":"2024-05-08T10:03:50Z","title":"Harmonizing Program Induction with Rate-Distortion Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05294","snapshot_observed_at":"2026-08-06T11:58:03.858544Z","title":"Hanqi Zhou, David G Nagy, and Charley M Wu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22255","last_updated":"2025-07-29T22:09:35Z","snapshot_observed_at":"2026-08-06T11:58:02.920060Z","submitted_at":"2025-07-29T22:09:35Z","title":"Agent-centric learning: from external reward maximization to internal knowledge curation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:58:03.858544Z"},"links":{"cited_paper":"/paper/2405.05294","citing_paper":"/paper/2507.22255"},"observation_digest":"sha256:e62e9b35ec4f8988ff086c748905ab89c63363b8a6cfa5c9d2b7b711f65bd9e2","observation_id":"011ca0c2-068e-4a00-9553-374bde89f386","resolution":{"observed_at":"2026-08-06T11:58:03.858544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05294","last_updated":"2024-05-08T10:03:50Z","snapshot_observed_at":"2026-08-07T10:59:44.065141Z","submitted_at":"2024-05-08T10:03:50Z","title":"Harmonizing Program Induction with Rate-Distortion Theory","version":1},"cited_work":{"arxiv_id":"2405.05294","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.05294","snapshot_observed_at":"2026-06-29T17:53:47.526294Z","title":null,"venue":null,"work_id":"3ab60e39-df1d-4242-bc37-59115351feba","year":2024},"citing_paper":{"arxiv_id":"2606.20623","last_updated":"2026-05-26T14:03:00Z","snapshot_observed_at":"2026-07-06T23:55:43.830896Z","submitted_at":"2026-05-26T14:03:00Z","title":"Path-dependent program induction under resource constraints explains human sequence learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T17:45:11.337464Z"},"links":{"cited_paper":"/paper/2405.05294","citing_paper":"/paper/2606.20623"},"observation_digest":"sha256:be76520ef6ccff8741ea11d476327b60c16f9a2171b90d33185c148461794df9","observation_id":"1a9e75f2-cef8-41a7-aa99-8339705408a3","resolution":{"observed_at":"2026-06-29T17:53:47.527728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.05294/citation-record","integrity":"/paper/2405.05294/integrity","json":"/paper/2405.05294/citation-record.json","paper":"/paper/2405.05294"},"outbound":[],"paper":{"arxiv_id":"2405.05294","last_updated":"2024-05-08T10:03:50Z","latest_version":1,"primary_category":"cs.HC","snapshot_observed_at":"2026-08-07T10:59:44.065141Z","submitted_at":"2024-05-08T10:03:50Z","title":"Harmonizing Program Induction with Rate-Distortion Theory"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2405.05294."}