{"as_of":"2026-08-17T23:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b65375e75deeb75fa25bc23e5e384bce3fcf003b34cda55b5777b4451f8cd28","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-17T06:30:58.91139+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-15T22:59:50.436133Z","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-15T22:59:50.974287Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.12696","last_updated":"2023-09-22T08:10:25Z","snapshot_observed_at":"2026-08-16T14:58:31.252615Z","submitted_at":"2023-09-22T08:10:25Z","title":"Counterfactual Conservative Q Learning for Offline Multi-agent Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2309.12696","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.12696","snapshot_observed_at":"2026-08-15T22:59:50.974287Z","title":"Counterfactual Conservative Q Learning for Offline Multi-agent Reinforcement Learning","venue":"cs.AI","work_id":"50577d3b-80af-4b0d-b0b3-d7f0b8789f66","year":2023},"citing_paper":{"arxiv_id":"2505.05968","last_updated":"2026-05-28T04:19:51Z","snapshot_observed_at":"2026-08-16T05:25:10.745287Z","submitted_at":"2025-05-09T11:42:31Z","title":"Offline Multi-agent Reinforcement Learning via Sequential Score Decomposition","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T22:59:50.436133Z"},"links":{"cited_paper":"/paper/2309.12696","citing_paper":"/paper/2505.05968"},"observation_digest":"sha256:24b33615ddff2d0c8c5942b5f143360cc9019455d7c5d9756a2038c8f06774dd","observation_id":"9180358f-4391-4bbb-a6ce-28c01ca85939","resolution":{"observed_at":"2026-08-15T22:59:51.042106Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2309.12696/citation-record","integrity":"/paper/2309.12696/integrity","json":"/paper/2309.12696/citation-record.json","paper":"/paper/2309.12696"},"outbound":[],"paper":{"arxiv_id":"2309.12696","last_updated":"2023-09-22T08:10:25Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T14:58:31.252615Z","submitted_at":"2023-09-22T08:10:25Z","title":"Counterfactual Conservative Q Learning for Offline 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2309.12696."}