{"as_of":"2026-08-12T13:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:540ef6fd720776edd69877e7d7e9a0ca9dca4304078d4d29f584a0b40eabc337","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-12T06:34:41.77262+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-11T00:10:22.365457Z","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-09T06:00:36.039447Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.20067","last_updated":"2025-01-31T10:02:45Z","snapshot_observed_at":"2026-08-12T05:32:36.899630Z","submitted_at":"2024-09-30T08:09:41Z","title":"Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.20067","snapshot_observed_at":"2026-08-11T00:10:22.365457Z","title":"Breaking the curse of multiagency in robust multi-agent reinforcement learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.19873","last_updated":"2024-12-27T16:37:33Z","snapshot_observed_at":"2026-08-10T23:53:11.923237Z","submitted_at":"2024-12-27T16:37:33Z","title":"Minimax-Optimal Multi-Agent Robust Reinforcement Learning","version":1},"reference_index":1953,"source":"pdf_text","source_observed_at":"2026-08-11T00:10:22.365457Z"},"links":{"cited_paper":"/paper/2409.20067","citing_paper":"/paper/2412.19873"},"observation_digest":"sha256:fa60c3c5fb10b887839f3fe81b4843b00ed5800d2460ae728599e9db0ef59128","observation_id":"39163fcf-0cbe-496c-a08c-d6efa405b086","resolution":{"observed_at":"2026-08-11T00:10:22.365457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.20067","last_updated":"2025-01-31T10:02:45Z","snapshot_observed_at":"2026-08-12T05:32:36.899630Z","submitted_at":"2024-09-30T08:09:41Z","title":"Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2409.20067","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.20067","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Can we break the curse of multiagency in robust multi-agent reinforcement learning?, 2024b","venue":null,"work_id":"b06f1520-14bc-48d9-9930-bdb13d8eedf4","year":null},"citing_paper":{"arxiv_id":"2605.03125","last_updated":"2026-05-06T22:03:28Z","snapshot_observed_at":"2026-08-04T04:13:10.377270Z","submitted_at":"2026-05-04T20:04:52Z","title":"Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T19:13:15.234351Z"},"links":{"cited_paper":"/paper/2409.20067","citing_paper":"/paper/2605.03125"},"observation_digest":"sha256:b6783b433b39d3e5b92a72fdd8265ae60997bebda62dfc2b94d0c1674bfd03f5","observation_id":"0d21c175-7920-41d2-969f-a03eb31c9303","resolution":{"observed_at":"2026-05-09T06:00:36.042169Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.20067/citation-record","integrity":"/paper/2409.20067/integrity","json":"/paper/2409.20067/citation-record.json","paper":"/paper/2409.20067"},"outbound":[],"paper":{"arxiv_id":"2409.20067","last_updated":"2025-01-31T10:02:45Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T05:32:36.899630Z","submitted_at":"2024-09-30T08:09:41Z","title":"Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2409.20067."}