{"as_of":"2026-08-09T10:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34abeaa4fcd7a9bacd0294471d9a96ff3f4165261407a1546e3b44ddbbe4f750","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:42:31.937356Z","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-06T17:42:32.075513Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1206.5295","last_updated":"2012-06-20T15:19:47Z","snapshot_observed_at":"2026-07-06T02:50:30.556639Z","submitted_at":"2012-06-20T15:19:47Z","title":"Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs","version":1},"cited_work":{"arxiv_id":"1206.5295","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.5295","snapshot_observed_at":"2026-08-06T17:42:32.075513Z","title":"Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs","venue":"cs.AI","work_id":"8fe12442-453d-4ee5-a00d-012961a58dc7","year":2012},"citing_paper":{"arxiv_id":"2507.10251","last_updated":"2025-07-14T13:18:13Z","snapshot_observed_at":"2026-08-06T17:33:20.360132Z","submitted_at":"2025-07-14T13:18:13Z","title":"ToMacVF : Temporal Macro-action Value Factorization for Asynchronous Multi-Agent Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:42:31.937356Z"},"links":{"cited_paper":"/paper/1206.5295","citing_paper":"/paper/2507.10251"},"observation_digest":"sha256:12a1ef195e933315ac39bf236d1ae80d9ef0240b1450b4be7f84cad44d6b5733","observation_id":"213fe555-0bf7-4a43-9fdf-ed13993412af","resolution":{"observed_at":"2026-08-06T17:42:32.078285Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1206.5295/citation-record","integrity":"/paper/1206.5295/integrity","json":"/paper/1206.5295/citation-record.json","paper":"/paper/1206.5295"},"outbound":[],"paper":{"arxiv_id":"1206.5295","last_updated":"2012-06-20T15:19:47Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T02:50:30.556639Z","submitted_at":"2012-06-20T15:19:47Z","title":"Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1206.5295."}