{"as_of":"2026-08-14T14:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:590288d6db9b5dba9b8f5fc2fcbcd6ce06e5facc14d6729c352785b84131c578","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-14T06:32:32.682623+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-14T11:55:11.897683Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T11:55:11.982072Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1812.05748","last_updated":"2020-06-22T11:11:21Z","snapshot_observed_at":"2026-07-06T07:21:06.980572Z","submitted_at":"2018-12-14T00:29:39Z","title":"Dynamic Programming with Recursive Preferences: Optimality and Applications","version":4},"cited_work":{"arxiv_id":"1812.05748","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.05748","snapshot_observed_at":"2026-08-14T11:55:11.982072Z","title":"Dynamic Programming with Recursive Preferences: Optimality and Applications","venue":"econ.GN","work_id":"41f1da88-f5f1-4fdc-9d3c-b7f740bd38b3","year":2018},"citing_paper":{"arxiv_id":"1908.08208","last_updated":"2019-08-22T05:35:46Z","snapshot_observed_at":"2026-08-14T11:44:03.971821Z","submitted_at":"2019-08-22T05:35:46Z","title":"Equilibrium in Production Chains with Multiple Upstream Partners","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T11:55:11.897683Z"},"links":{"cited_paper":"/paper/1812.05748","citing_paper":"/paper/1908.08208"},"observation_digest":"sha256:397fdc12cbe43b46870aa8a20f402cb284ad4ae50c5601094ffad3721283aa73","observation_id":"af0f45dc-939e-42e0-b3a2-df496f618029","resolution":{"observed_at":"2026-08-14T11:55:11.987250Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05748","last_updated":"2020-06-22T11:11:21Z","snapshot_observed_at":"2026-07-06T07:21:06.980572Z","submitted_at":"2018-12-14T00:29:39Z","title":"Dynamic Programming with Recursive Preferences: Optimality and Applications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.05748","snapshot_observed_at":"2026-08-03T12:10:20.847652Z","title":"Nicolas Coeurdacier, Hélène Rey, and Pablo Winant","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.04438","last_updated":"2026-07-03T18:43:12Z","snapshot_observed_at":"2026-08-14T12:44:24.303463Z","submitted_at":"2026-01-07T22:52:17Z","title":"The Endogenous Grid Method for Epstein-Zin Preferences","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T12:10:20.847652Z"},"links":{"cited_paper":"/paper/1812.05748","citing_paper":"/paper/2601.04438"},"observation_digest":"sha256:c2fde4d46f6406bc364a15cf4d23d6b4cb1847a2e7abf6810bea37b7d3354810","observation_id":"d15c3160-369f-4f4e-a857-61f14aacbb4c","resolution":{"observed_at":"2026-08-03T12:10:20.847652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.05748","last_updated":"2020-06-22T11:11:21Z","snapshot_observed_at":"2026-07-06T07:21:06.980572Z","submitted_at":"2018-12-14T00:29:39Z","title":"Dynamic Programming with Recursive Preferences: Optimality and Applications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.05748","snapshot_observed_at":"2026-08-01T20:48:18.649156Z","title":"Dynamic programming with recursive preferences: Op- timality and applications.arXiv preprint arXiv:1812.05748, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.16538","last_updated":"2026-07-17T22:25:09Z","snapshot_observed_at":"2026-08-01T20:48:11.687297Z","submitted_at":"2026-07-17T22:25:09Z","title":"History-Dependent Recursive Preferences in Markov Decision Processes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T20:48:18.649156Z"},"links":{"cited_paper":"/paper/1812.05748","citing_paper":"/paper/2607.16538"},"observation_digest":"sha256:92db7cbcbea8703eeb7a729d86d20ca585855c85cccd3e6f9b072fd96011c7da","observation_id":"4ec6acc6-400a-4b91-b217-0471023222d9","resolution":{"observed_at":"2026-08-01T20:48:18.649156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1812.05748/citation-record","integrity":"/paper/1812.05748/integrity","json":"/paper/1812.05748/citation-record.json","paper":"/paper/1812.05748"},"outbound":[],"paper":{"arxiv_id":"1812.05748","last_updated":"2020-06-22T11:11:21Z","latest_version":4,"primary_category":"econ.GN","snapshot_observed_at":"2026-07-06T07:21:06.980572Z","submitted_at":"2018-12-14T00:29:39Z","title":"Dynamic Programming with Recursive Preferences: Optimality and Applications"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1812.05748."}