{"as_of":"2026-08-13T12:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a522ca71b31d96f5c16af7c733ff2382207a71a579e28041c558c673c779f18","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-13T06:32:02.005865+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-09T18:23:05.671582Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T15:51:42.901845Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.11778","last_updated":"2024-05-20T04:36:02Z","snapshot_observed_at":"2026-08-13T00:04:05.061416Z","submitted_at":"2024-05-20T04:36:02Z","title":"Efficient Multi-agent Reinforcement Learning by Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11778","snapshot_observed_at":"2026-08-09T18:23:05.671582Z","title":"Mastering atari, go, chess and shogi by planning with a learned model","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-12T11:00:37.287451Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-09T18:23:05.671582Z"},"links":{"cited_paper":"/paper/2405.11778","citing_paper":"/paper/2502.00633"},"observation_digest":"sha256:43d20b1a53c1070ad5b879fdcbece4d9ef5c6929fee1c7922fbd587030bc2127","observation_id":"c47ef75b-c920-4acd-a533-f60d55c811e3","resolution":{"observed_at":"2026-08-09T18:23:05.671582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11778","last_updated":"2024-05-20T04:36:02Z","snapshot_observed_at":"2026-08-13T00:04:05.061416Z","submitted_at":"2024-05-20T04:36:02Z","title":"Efficient Multi-agent Reinforcement Learning by Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11778","snapshot_observed_at":"2026-08-07T05:27:42.351828Z","title":"Efficient multi-agent reinforcement learning by planning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08149","last_updated":"2025-06-09T18:56:40Z","snapshot_observed_at":"2026-08-12T07:44:00.432691Z","submitted_at":"2025-06-09T18:56:40Z","title":"Ego-centric Learning of Communicative World Models for Autonomous Driving","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:27:42.351828Z"},"links":{"cited_paper":"/paper/2405.11778","citing_paper":"/paper/2506.08149"},"observation_digest":"sha256:d4fce6eadc1ba8ee26ede5c5d8b6949a4f4e1b4a3f922e32e110745c71d128b6","observation_id":"f9e674f8-ae03-4629-b107-98b46ec008ec","resolution":{"observed_at":"2026-08-07T05:27:42.351828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11778","last_updated":"2024-05-20T04:36:02Z","snapshot_observed_at":"2026-08-13T00:04:05.061416Z","submitted_at":"2024-05-20T04:36:02Z","title":"Efficient Multi-agent Reinforcement Learning by Planning","version":1},"cited_work":{"arxiv_id":"2405.11778","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.11778","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2405.11778 , year=","venue":null,"work_id":"9f75f5fb-7717-4c0e-b477-573ca4b01700","year":null},"citing_paper":{"arxiv_id":"2605.00751","last_updated":"2026-05-01T16:02:58Z","snapshot_observed_at":"2026-08-02T16:01:52.357634Z","submitted_at":"2026-05-01T16:02:58Z","title":"NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-09T19:08:50.518219Z"},"links":{"cited_paper":"/paper/2405.11778","citing_paper":"/paper/2605.00751"},"observation_digest":"sha256:57d2bd1335e7d3bec25004968166d4a6f2de1354e7061e3e8c3b9efb5f1d9da1","observation_id":"821ed9ee-38ea-40b9-9624-bc946f279322","resolution":{"observed_at":"2026-05-11T15:51:42.908349Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.11778/citation-record","integrity":"/paper/2405.11778/integrity","json":"/paper/2405.11778/citation-record.json","paper":"/paper/2405.11778"},"outbound":[],"paper":{"arxiv_id":"2405.11778","last_updated":"2024-05-20T04:36:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T00:04:05.061416Z","submitted_at":"2024-05-20T04:36:02Z","title":"Efficient Multi-agent Reinforcement Learning by Planning"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2405.11778."}