{"as_of":"2026-08-13T02:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e29635e88729e986e88d6bb13508c0e21d6f78149ba804357dbc870eb2adf590","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T20:26:30.298615Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.04278/citation-record","integrity":"/paper/2607.04278/integrity","json":"/paper/2607.04278/citation-record.json","paper":"/paper/2607.04278"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:26:30.298615Z","title":"M., Xu, Z","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04278","last_updated":"2026-07-05T12:43:03Z","snapshot_observed_at":"2026-08-10T01:58:47.481364Z","submitted_at":"2026-07-05T12:43:03Z","title":"Deep Learning for Dynamic Programming with Recursive Utility","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T20:26:30.298615Z"},"links":{"citing_paper":"/paper/2607.04278"},"observation_digest":"sha256:4eb5447eb594d10a51f1d18428ec30464815909df31e9dbdab680cb32bfab631","observation_id":"ff686ddb-eba7-4901-ae6b-95bd7ed90934","resolution":{"observed_at":"2026-07-11T20:26:30.298615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14802","last_updated":"2023-03-26T19:42:16Z","snapshot_observed_at":"2026-08-12T12:42:43.559752Z","submitted_at":"2023-03-26T19:42:16Z","title":"Economics-Inspired Neural Networks with Stabilizing Homotopies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.14802","snapshot_observed_at":"2026-07-11T20:26:30.298615Z","title":"and Scheidegger, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04278","last_updated":"2026-07-05T12:43:03Z","snapshot_observed_at":"2026-08-10T01:58:47.481364Z","submitted_at":"2026-07-05T12:43:03Z","title":"Deep Learning for Dynamic Programming with Recursive Utility","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T20:26:30.298615Z"},"links":{"cited_paper":"/paper/2303.14802","citing_paper":"/paper/2607.04278"},"observation_digest":"sha256:f15fb1cbbf83278133e48ba6ef25a20fb8e075ab7ff198355a357b0d62605bf0","observation_id":"1c7b1c24-d897-470f-84dc-84b0b9628109","resolution":{"observed_at":"2026-07-11T20:26:30.298615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.09032","last_updated":"2023-05-24T04:44:24Z","snapshot_observed_at":"2026-08-07T16:39:08.462934Z","submitted_at":"2021-11-17T10:55:15Z","title":"Optimal consumption and portfolio selection with Epstein-Zin utility under general constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.09032","snapshot_observed_at":"2026-07-11T20:26:30.298615Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.04278","last_updated":"2026-07-05T12:43:03Z","snapshot_observed_at":"2026-08-10T01:58:47.481364Z","submitted_at":"2026-07-05T12:43:03Z","title":"Deep Learning for Dynamic Programming with Recursive Utility","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T20:26:30.298615Z"},"links":{"cited_paper":"/paper/2111.09032","citing_paper":"/paper/2607.04278"},"observation_digest":"sha256:38afedf05877ee83d3b514142c0d7cc1bfdb40dc9afd0f0df60b742dee6679bf","observation_id":"b35e115d-a29e-4663-9585-19dd2f240d24","resolution":{"observed_at":"2026-07-11T20:26:30.298615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.14493","last_updated":"2026-05-14T07:33:36Z","snapshot_observed_at":"2026-08-11T15:36:23.431435Z","submitted_at":"2026-05-14T07:33:36Z","title":"Deep Learning for Solving and Estimating Dynamic Models in Economics and Finance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.14493","snapshot_observed_at":"2026-07-11T20:26:30.298615Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.04278","last_updated":"2026-07-05T12:43:03Z","snapshot_observed_at":"2026-08-10T01:58:47.481364Z","submitted_at":"2026-07-05T12:43:03Z","title":"Deep Learning for Dynamic Programming with Recursive Utility","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T20:26:30.298615Z"},"links":{"cited_paper":"/paper/2605.14493","citing_paper":"/paper/2607.04278"},"observation_digest":"sha256:ddb39879104f09d9c4d3040ce1b41200ce08868a43cfbfd79432b4babb1be517","observation_id":"5c175c11-5cce-4d0a-a4c7-306a68ba4ff9","resolution":{"observed_at":"2026-07-11T20:26:30.298615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04278","last_updated":"2026-07-05T12:43:03Z","latest_version":1,"primary_category":"q-fin.CP","snapshot_observed_at":"2026-08-10T01:58:47.481364Z","submitted_at":"2026-07-05T12:43:03Z","title":"Deep Learning for Dynamic Programming with Recursive Utility"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":4},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 0 inbound Pith citation observations for arXiv:2607.04278."}