{"as_of":"2026-08-15T02:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0156a47b7a01f882aec8b672f7f2089fe7a41706e773d0064087a435d634034","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T07:05:48.376606Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-06T19:51:26.833182Z","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-06T19:51:28.885479Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"cited_work":{"arxiv_id":"2507.01324","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.01324","snapshot_observed_at":"2026-08-06T19:51:28.885479Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","venue":"math.OC","work_id":"62ce314c-6d67-4d70-b96d-fcac51e84f7f","year":2025},"citing_paper":{"arxiv_id":"2507.04646","last_updated":"2025-07-07T03:59:31Z","snapshot_observed_at":"2026-08-14T04:58:35.711444Z","submitted_at":"2025-07-07T03:59:31Z","title":"Feature-Based Belief Aggregation for Partially Observable Markov Decision Problems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T19:51:26.833182Z"},"links":{"cited_paper":"/paper/2507.01324","citing_paper":"/paper/2507.04646"},"observation_digest":"sha256:f8c5707e123467370c364fd53d938b72030a94ce1ab53b81227e5f7570c8b823","observation_id":"2137eb09-2dce-4e34-9355-71b02156a84b","resolution":{"observed_at":"2026-08-06T19:51:29.002886Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.01324","snapshot_observed_at":"2026-08-01T19:13:30.774106Z","title":"and Bertsekas, D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17073","last_updated":"2026-07-19T04:41:17Z","snapshot_observed_at":"2026-08-14T00:58:34.015683Z","submitted_at":"2026-07-19T04:41:17Z","title":"Faithful Decoding","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T19:13:30.774106Z"},"links":{"cited_paper":"/paper/2507.01324","citing_paper":"/paper/2607.17073"},"observation_digest":"sha256:39ef9f7a03d844671f187fa7b3ada7d3cda6aa38df0465ffc5ad9b53f4dd3666","observation_id":"5b35ca52-11e7-47ca-8610-0253946a6e17","resolution":{"observed_at":"2026-08-01T19:13:30.774106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.01324/citation-record","integrity":"/paper/2507.01324/integrity","json":"/paper/2507.01324/citation-record.json","paper":"/paper/2507.01324"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bertsekas and David A","venue":null,"work_id":"6fc52d69-68e2-4c80-bb2f-36feb4344e16","year":1989},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:7e6b49c8e191e1a4e3c2206dee8b2a6856d45ad1ecebe1e2a088fd27bfb390c0","observation_id":"1f9f079f-3a3c-4ac5-8041-ed6bac0eed44","resolution":{"observed_at":"2026-05-19T07:07:08.261301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bertsekas","venue":null,"work_id":"db3c2683-6a43-4a3b-ad02-551d9993b948","year":2012},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:a2001a315b766f890f64c47fbd6b182c70dd28b48cb86df2ed469ecf7e8465d9","observation_id":"f428b488-a154-4145-b974-e41d4bba3730","resolution":{"observed_at":"2026-05-19T07:07:08.256239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bertsekas","venue":null,"work_id":"bd1fbed6-5e52-4438-9709-757db8f0903f","year":2018},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:74345ac64a2088db2dbed5805b9697fad2d231829d7c0d15d40eb87a5eae3d6b","observation_id":"6c57967d-3fa0-466b-bc43-eed5694e3aeb","resolution":{"observed_at":"2026-05-19T07:07:08.259617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1910.02426","last_updated":"2019-10-06T11:51:00Z","snapshot_observed_at":"2026-08-14T19:30:13.954843Z","submitted_at":"2019-10-06T11:51:00Z","title":"Biased Aggregation, Rollout, and Enhanced Policy Improvement for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1910.02426","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.02426","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bertsekas","venue":null,"work_id":"6b9d86ae-5c07-4d1d-8f3c-ff4b5c62d044","year":1910},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"cited_paper":"/paper/1910.02426","citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:f768f9ca151a534b3b38af09cff18b9c4ba0944fae4305ebfcab16740fb43cbe","observation_id":"17443326-0950-4f13-9c6f-9a5593af5a0b","resolution":{"observed_at":"2026-05-19T07:07:07.713800Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bertsekas","venue":null,"work_id":"26d9e0bb-380a-4529-bbd1-a3f4744de15f","year":2019},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:babeb3fbbea0174c3b0f3f57fe98fd8f2ef17894855be7f0e2c714b891088580","observation_id":"fec783ea-3f93-4c8f-8eff-344604607a0d","resolution":{"observed_at":"2026-05-19T07:07:08.254472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bertsekas and John N","venue":null,"work_id":"fe9893e7-32f6-4fc2-b1e1-fac7faa9414f","year":1996},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:b7afb59d7e3a415cdbd04a93b2f6f4fb6f44aba7bcf6a1d9ce14749abf473c2d","observation_id":"d6256737-5912-4157-aef2-0d524a1eb73e","resolution":{"observed_at":"2026-05-19T07:07:08.257977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"10cf81c3-e0b6-47e2-9471-631061bc0083","year":1995},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:2655d19678fdc14777b8e245aab8cccc234761ece51df1cab6179f2d24400691","observation_id":"2999429b-6660-4a3c-b6b9-469bf96d80e5","resolution":{"observed_at":"2026-05-19T07:07:08.250786Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reinforcement learning with soft state aggregation","venue":null,"work_id":"56e27b7f-6ef8-4818-9bdf-b99c5079bbf9","year":1994},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:467e14079672ca39fd6b4f7226e7bbb2f035e3017a1ca3010afeea73ee51fb50","observation_id":"d0bfc8ff-6297-4697-9950-0b2318b62add","resolution":{"observed_at":"2026-05-19T07:07:08.252737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tsitsiklis and Benjamin van Roy","venue":null,"work_id":"04908962-212f-464f-b79b-32fd8bda35af","year":1996},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:93d22de57b1b8df756a6a97b588c97c4abb41b13690924fcdccc50baa163dc04","observation_id":"22341369-7c86-4c90-9c5f-24f6fc8fddcd","resolution":{"observed_at":"2026-05-19T07:07:08.247003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Feature-based methods for large scale dynamic programming","venue":null,"work_id":"360243ca-8041-4426-931e-920fc64400a9","year":1995},"citing_paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-19T07:05:48.376606Z"},"links":{"citing_paper":"/paper/2507.01324"},"observation_digest":"sha256:42f7bb11eced179f47f5df4c22588317fba973932270ecf81c90f8a3fdf1c34c","observation_id":"f338ea0f-fbe7-4f23-81c2-ee6c35c25ee1","resolution":{"observed_at":"2026-05-19T07:07:08.249021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2507.01324","last_updated":"2026-05-04T16:34:32Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-02T03:17:28Z","title":"An Error Bound for Aggregation in Approximate Dynamic Programming"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":10},"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 15 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 2 inbound Pith citation observations for arXiv:2507.01324."}