{"as_of":"2026-08-11T00:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3aeac0b71449b3f8b496063ec1ee9a428e76e0226acba2e6989559a3225aa862","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-10T06:31:04.303077+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-10T23:04:02.348347Z","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-04T23:23:13.520543Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05027","last_updated":"2024-06-04T10:16:33Z","snapshot_observed_at":"2026-08-07T09:16:57.996386Z","submitted_at":"2024-02-07T16:53:09Z","title":"Towards Generalizability of Multi-Agent Reinforcement Learning in Graphs with Recurrent Message Passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05027","snapshot_observed_at":"2026-08-10T23:04:02.348347Z","title":"Towards generalizability of multi-agent reinforcement learning in graphs with recurrent message passing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-10T22:55:33.826827Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.348347Z"},"links":{"cited_paper":"/paper/2402.05027","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:0a190bb124c73ed3d5b1193da2c7f53cc2293ff59ae3690e175cb3d71d0a06e9","observation_id":"8f715a44-4264-48d4-b9e8-ccb0903fdf25","resolution":{"observed_at":"2026-08-10T23:04:02.348347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05027","last_updated":"2024-06-04T10:16:33Z","snapshot_observed_at":"2026-08-07T09:16:57.996386Z","submitted_at":"2024-02-07T16:53:09Z","title":"Towards Generalizability of Multi-Agent Reinforcement Learning in Graphs with Recurrent Message Passing","version":3},"cited_work":{"arxiv_id":"2402.05027","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.05027","snapshot_observed_at":"2026-08-04T23:23:13.520543Z","title":"Towards Generalizability of Multi-Agent Reinforcement Learning in Graphs with Recurrent Message Passing","venue":"cs.MA","work_id":"ac4f0867-840c-46a0-9f08-bfdd8784f2ba","year":2024},"citing_paper":{"arxiv_id":"2509.06665","last_updated":"2025-09-08T13:24:21Z","snapshot_observed_at":"2026-08-05T18:55:45.467434Z","submitted_at":"2025-09-08T13:24:21Z","title":"TrajAware: Graph Cross-Attention and Trajectory-Aware for Generalisable VANETs under Partial Observations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T23:23:13.315177Z"},"links":{"cited_paper":"/paper/2402.05027","citing_paper":"/paper/2509.06665"},"observation_digest":"sha256:4ce8af8653c5a2ed9c7b55fb915f5093d30a9890f66ad02499020adc3e336c2e","observation_id":"2bc365e8-7ff2-4772-be09-f1349d6e14c8","resolution":{"observed_at":"2026-08-04T23:23:13.527360Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.05027/citation-record","integrity":"/paper/2402.05027/integrity","json":"/paper/2402.05027/citation-record.json","paper":"/paper/2402.05027"},"outbound":[],"paper":{"arxiv_id":"2402.05027","last_updated":"2024-06-04T10:16:33Z","latest_version":3,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-07T09:16:57.996386Z","submitted_at":"2024-02-07T16:53:09Z","title":"Towards Generalizability of Multi-Agent Reinforcement Learning in Graphs with Recurrent Message Passing"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.05027."}