{"as_of":"2026-08-18T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a351d9c83a173263ff332b39dffb738ae1cfb8d37c9971d208c40e5f994e897a","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-16T01:04:38.879120Z","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-11T12:08:45.769912Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1302.1525","last_updated":"2013-02-06T15:54:07Z","snapshot_observed_at":"2026-08-17T20:58:17.509963Z","submitted_at":"2013-02-06T15:54:07Z","title":"Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes","version":1},"cited_work":{"arxiv_id":"1302.1525","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.1525","snapshot_observed_at":"2026-08-11T12:08:45.769912Z","title":"Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes","venue":"cs.AI","work_id":"4c94c4d7-f8e9-4f38-87d0-f053a149dc94","year":2013},"citing_paper":{"arxiv_id":"2412.14614","last_updated":"2024-12-19T08:04:22Z","snapshot_observed_at":"2026-08-11T12:02:25.734129Z","submitted_at":"2024-12-19T08:04:22Z","title":"A Model-free Biomimetics Algorithm for Deterministic Partially Observable Markov Decision Process","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T12:08:45.145388Z"},"links":{"cited_paper":"/paper/1302.1525","citing_paper":"/paper/2412.14614"},"observation_digest":"sha256:6392d7dd09f7a46eafb47173d331bdf4468a6087d9db0aaca0dab80e2f5000c2","observation_id":"6bcf447c-7fc6-48ec-aaf6-099d1dfb5eb9","resolution":{"observed_at":"2026-08-11T12:08:45.777137Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1302.1525","last_updated":"2013-02-06T15:54:07Z","snapshot_observed_at":"2026-08-17T20:58:17.509963Z","submitted_at":"2013-02-06T15:54:07Z","title":"Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1302.1525","snapshot_observed_at":"2026-08-16T01:04:38.879120Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.02216","last_updated":"2025-05-12T03:34:54Z","snapshot_observed_at":"2026-08-18T00:22:52.221802Z","submitted_at":"2025-05-04T18:59:07Z","title":"LLM-Guided Probabilistic Program Induction for POMDP Model Estimation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T01:04:38.879120Z"},"links":{"cited_paper":"/paper/1302.1525","citing_paper":"/paper/2505.02216"},"observation_digest":"sha256:447e00f085a577024688a7e6c34ea3315fb1dbf7d9ad979ee49e73ca628b9bc0","observation_id":"01447aca-4e65-4f6e-ad32-1ad5ab7a540f","resolution":{"observed_at":"2026-08-16T01:04:38.879120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1302.1525/citation-record","integrity":"/paper/1302.1525/integrity","json":"/paper/1302.1525/citation-record.json","paper":"/paper/1302.1525"},"outbound":[],"paper":{"arxiv_id":"1302.1525","last_updated":"2013-02-06T15:54:07Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T20:58:17.509963Z","submitted_at":"2013-02-06T15:54:07Z","title":"Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1302.1525."}