{"as_of":"2026-08-11T16:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:434da3b71d6db2fb0451450204df35df2c2ac20399d8b57f34098d5e6a75de90","coverage":[{"denominator":97,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":97,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:04:02.398509Z","state":"measured"},{"denominator":98,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":98,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-04T07:17:44.625112Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00165","snapshot_observed_at":"2026-08-04T07:17:44.625112Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.26270","last_updated":"2026-05-28T11:04:33Z","snapshot_observed_at":"2026-08-10T01:18:05.688661Z","submitted_at":"2025-10-30T08:53:41Z","title":"Graph-Enhanced Policy Optimization in LLM Agent Training","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T07:17:44.625112Z"},"links":{"cited_paper":"/paper/2501.00165","citing_paper":"/paper/2510.26270"},"observation_digest":"sha256:a0a16009c579d08f851f4c8e53800fe43804ab5bcfc9ee31b3f42049064de929","observation_id":"c3ed4377-d828-4669-9dbc-543bb5e2aa8e","resolution":{"observed_at":"2026-08-04T07:17:44.625112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.00165/citation-record","integrity":"/paper/2501.00165/integrity","json":"/paper/2501.00165/citation-record.json","paper":"/paper/2501.00165"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.843424Z","title":"Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.843424Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:c2cd8de95a0bfc1a49f7bf0665487abbe0dac8bb9c40aa39d39dddfc54c1cf79","observation_id":"a8e4b05e-3d47-4530-93ff-96c73a64bb6c","resolution":{"observed_at":"2026-08-10T23:04:01.843424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.848963Z","title":"Decentralized control of partially observable markov decision processes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.848963Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:0b4a0db3e477e623e9582aa5553b0f99f88d0e5b51f1e261bc485dcf3357767b","observation_id":"b848690e-3849-4955-b4f6-17b6eab4551a","resolution":{"observed_at":"2026-08-10T23:04:01.848963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.965652Z","title":"A comprehensive guide to network routing","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-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.965652Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:16fcc8adb29b16a1522a1bcda8c2a77af4e0fe9af4458eb50cdb9c6c8ee6e6d8","observation_id":"f292d0a0-250d-4d4a-9974-e9ba44dd67cf","resolution":{"observed_at":"2026-08-10T23:04:01.965652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.970943Z","title":"A markovian decision process","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.970943Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:31baf6b47cd86ad2036b941fa0cc4a4413a51f66ff861055910f0f0f2419d85d","observation_id":"00873ab2-cf67-47de-981c-2b22751cc460","resolution":{"observed_at":"2026-08-10T23:04:01.970943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.976313Z","title":"Packet routing in dynamically changing networks: A reinforcement learning approach","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.976313Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:3b4ac5608f1e125675419d04ebc71ef50375a35f45057225c7570e5c9db97483","observation_id":"7102f297-7981-4670-8c9a-c1e69b375dee","resolution":{"observed_at":"2026-08-10T23:04:01.976313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.981260Z","title":"Intelligent routing based on reinforcement learning for software-defined networking","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.981260Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:2dfb55d4b138f70245a0090ee6266f67a1901c9fe828d18dd75de19c7473af96","observation_id":"69325b79-e5f6-484b-8518-f6689911a798","resolution":{"observed_at":"2026-08-10T23:04:01.981260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.1078","last_updated":"2014-09-03T00:25:02Z","snapshot_observed_at":"2026-07-06T03:45:28.546418Z","submitted_at":"2014-06-03T17:47:08Z","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.1078","snapshot_observed_at":"2026-08-10T23:04:01.986512Z","title":"Learning phrase representations using rnn encoder-decoder for statistical machine translation","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.986512Z"},"links":{"cited_paper":"/paper/1406.1078","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:13e5988507906f5b783d3fd4c27628f3ed6b793bcd9c603413fc59c5f510b52e","observation_id":"08d1b0a7-b526-43bc-8341-3a75740e2c81","resolution":{"observed_at":"2026-08-10T23:04:01.986512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:01.992093Z","title":"Deep reinforcement learning from human preferences","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.992093Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:5fa1986b9c4dda2f44db5a92c729262b8f44e8967eb561f05d71ef13466f7545","observation_id":"a0a99afb-4708-4c2d-bce9-145934c96eaa","resolution":{"observed_at":"2026-08-10T23:04:01.992093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.01339","last_updated":"2020-04-24T01:54:46Z","snapshot_observed_at":"2026-08-11T01:57:51.115236Z","submitted_at":"2020-04-03T02:21:07Z","title":"Multi-agent Reinforcement Learning for Networked System Control","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.01339","snapshot_observed_at":"2026-08-10T23:04:01.996795Z","title":"Multi-agent reinforcement learning for networked system control","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:01.996795Z"},"links":{"cited_paper":"/paper/2004.01339","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:8b149798a66ffc65d4fc48c2868622da464ed2f03ccc96298a3f2ee40338b515","observation_id":"52d396c7-db28-4be0-81c8-ea747d2bce23","resolution":{"observed_at":"2026-08-10T23:04:01.996795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.001365Z","title":"A deep reinforcement learning-based multi- optimality routing scheme for dynamic iot networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.001365Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:abbe3127faf93a6a7fed71f2b96955b1c97886eeebd790cceac6b11920ec91bc","observation_id":"5f8da771-163b-4bfe-b87b-9b8728afa4e5","resolution":{"observed_at":"2026-08-10T23:04:02.001365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.006209Z","title":"Tarmac: Targeted multi-agent communication","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.006209Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:45a93697366ce5b3c6f5c8916e9098c598c40b4b5f9363810bda8e704f0126c4","observation_id":"1c18333a-aa79-49f4-88b4-3001ca8324e6","resolution":{"observed_at":"2026-08-10T23:04:02.006209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.09533","last_updated":"2020-11-18T20:29:59Z","snapshot_observed_at":"2026-08-06T15:48:23.562152Z","submitted_at":"2020-11-18T20:29:59Z","title":"Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.09533","snapshot_observed_at":"2026-08-10T23:04:02.010511Z","title":"Is independent learning all you need in the starcraft multi-agent challenge? arXiv preprint arXiv:2011.09533, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.010511Z"},"links":{"cited_paper":"/paper/2011.09533","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:bc893fec0562402820fcf55f83ebd1be18622d61436ab876a6d34c0997f3882c","observation_id":"ab1b8b78-4917-4734-a0b5-8e54b104d983","resolution":{"observed_at":"2026-08-10T23:04:02.010511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.015048Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering.Advances in neural information processing systems, 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.015048Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:4fecbe3187878839ccdd0bf79a37ced4dc2513d98002e897d1605e329a6ad751","observation_id":"bde8f26d-e886-4b7a-be37-e670cae6bc26","resolution":{"observed_at":"2026-08-10T23:04:02.015048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.019219Z","title":"Learning individually inferred communication for multi-agent cooperation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.019219Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:290692fe879834f15af38d397cd3b7333eead317dcfeab6f8f39047ef1f11b58","observation_id":"72dccdcb-b76b-4d82-a081-96522465c861","resolution":{"observed_at":"2026-08-10T23:04:02.019219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.023580Z","title":"Learning correlated communication topology in multi-agent reinforcement learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.023580Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:6ce9b719c0baedf919ce9efb971f984033b74cb8155a9d9f30688763360a908a","observation_id":"a2787b4e-1471-440b-9a2b-8565c2efe51d","resolution":{"observed_at":"2026-08-10T23:04:02.023580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05162","last_updated":"2023-12-08T16:42:15Z","snapshot_observed_at":"2026-08-11T01:56:39.710549Z","submitted_at":"2023-12-08T16:42:15Z","title":"A Review of Cooperation in Multi-agent Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.05162","snapshot_observed_at":"2026-08-10T23:04:02.027798Z","title":"A review of cooperation in multi-agent learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.027798Z"},"links":{"cited_paper":"/paper/2312.05162","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:68bad604b7e9f5cb6f51ea6486dfc7a9bb5dc09e4bd53b691c8f37aecd778802","observation_id":"9df10032-8096-4d38-9331-051ec0cdcd92","resolution":{"observed_at":"2026-08-10T23:04:02.027798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.032904Z","title":"Learning to communicate with deep multi-agent reinforcement learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.032904Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:c071f8a5dbf76b9847cb329019b0e8bbb90e79bb9f7cfb01f87d07198889e9fd","observation_id":"8fca9d74-4d64-4847-a067-830f1c4ccb5e","resolution":{"observed_at":"2026-08-10T23:04:02.032904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.037684Z","title":"Stabilising experience replay for deep multi-agent reinforcement learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.037684Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:abdaf2f25c3dad64e46efd2260c554f4f4beb83b28b5ff50748368eae4289f0e","observation_id":"e5b6c828-69a3-45c8-b29c-4fdee18c1536","resolution":{"observed_at":"2026-08-10T23:04:02.037684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.042259Z","title":"Counterfactual multi-agent policy gradients","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.042259Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:b92508b99e89c26fdda241b164fb6e3033fe74286fc6afea960551e8fa22ec67","observation_id":"c7bb6053-10b5-47d1-8e03-ed1d32486303","resolution":{"observed_at":"2026-08-10T23:04:02.042259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.02672","last_updated":"2016-02-08T18:01:35Z","snapshot_observed_at":"2026-08-11T01:57:52.861221Z","submitted_at":"2016-02-08T18:01:35Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.02672","snapshot_observed_at":"2026-08-10T23:04:02.046701Z","title":"Learning to communicate to solve riddles with deep distributed recurrent q-networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.046701Z"},"links":{"cited_paper":"/paper/1602.02672","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:9f80568d5adc3d17c4b05168524861cf127e2b742d5b0b8c62896e74ce2727cc","observation_id":"5e4718cb-7f45-4e1f-8103-1c7b30f56219","resolution":{"observed_at":"2026-08-10T23:04:02.046701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.051669Z","title":"Learning and generating distributed routing protocols using graph-based deep learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.051669Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:728fd6e4b6f661610ce59bf3a349062d9e95d6f5e39200a8d3657c05496b1869","observation_id":"c367435e-5475-471e-a617-6f69430840a9","resolution":{"observed_at":"2026-08-10T23:04:02.051669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.056181Z","title":"Understanding the difficulty of training deep feedforward neural networks","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.056181Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:872112ad5c6cbec2092118a57dacf644bf93de273a7cf14c836a9d6e49c3a194","observation_id":"c10a9f8f-dfcf-4bf2-ae3a-107d7b089731","resolution":{"observed_at":"2026-08-10T23:04:02.056181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.09789","last_updated":"2023-02-08T14:34:59Z","snapshot_observed_at":"2026-08-11T01:57:20.243040Z","submitted_at":"2022-10-18T12:04:55Z","title":"Anti-Symmetric DGN: a stable architecture for Deep Graph Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.09789","snapshot_observed_at":"2026-08-10T23:04:02.060767Z","title":"Anti-symmetric dgn: a stable architecture for deep graph networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.060767Z"},"links":{"cited_paper":"/paper/2210.09789","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:ff032da6df509170708b1feca4a4af31766c2e2269099ae3b013f51bdb23809c","observation_id":"b5b82f43-8b52-4057-ac39-b5c2f8be437a","resolution":{"observed_at":"2026-08-10T23:04:02.060767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.768823Z","title":"Model-based sparse communication in multi-agent reinforcement learning","venue":null,"work_id":"11cb5bd6-edc9-4ee5-8003-c9ff25fa0263","year":2023},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.065751Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:0614c90a5f6ef02b68d4c53df8b563ec07cb09c614826be7a258b39c62dc7fe3","observation_id":"17a6a3a7-572c-4486-80f9-9da945e985fe","resolution":{"observed_at":"2026-08-10T23:04:03.773547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.754644Z","title":"Deep recurrent q-learning for partially observable mdps","venue":null,"work_id":"e70c7587-20f1-4e2a-9eb4-84b2dd770c98","year":2015},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.070238Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:3b788353535419de6e7369c26a408ea4f11df25198ff438fb31ef950df1c6bd9","observation_id":"064e3636-07eb-420c-a38c-a2e9c701fc39","resolution":{"observed_at":"2026-08-10T23:04:03.758956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.741016Z","title":"Routing information protocol","venue":null,"work_id":"a4b562d1-f8d2-4f96-9c08-103b6cc9aa3a","year":1988},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.075103Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:bad06dcc1ff4323f79cda42848d96a2b8956e5ca6ebff7d0bfe6fcc9afeaa27c","observation_id":"3d3f85fe-101e-4e08-98f1-09077ac38ca5","resolution":{"observed_at":"2026-08-10T23:04:03.745415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09183","last_updated":"2019-03-11T20:17:29Z","snapshot_observed_at":"2026-07-06T05:53:08.086224Z","submitted_at":"2017-07-28T10:49:41Z","title":"A Survey of Learning in Multiagent Environments: Dealing with Non-Stationarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09183","snapshot_observed_at":"2026-08-10T23:04:02.079692Z","title":"A survey of learning in multiagent environments: Dealing with non-stationarity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.079692Z"},"links":{"cited_paper":"/paper/1707.09183","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:c7af815b5c9cdc0ac16c7d51fee9336084409fab19bc995ac1be7f97263da360","observation_id":"51fc9586-3a3e-4c9f-90f4-01767b167e26","resolution":{"observed_at":"2026-08-10T23:04:02.079692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.725621Z","title":"A survey and critique of multiagent deep reinforcement learning","venue":null,"work_id":"90ed266c-2e11-420d-9f8c-884f335398da","year":2019},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.084446Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:7dfb1961d81794e72b90597c6ee2cdb5cb9a50251c53eff513322ee032bc2860","observation_id":"bceacc9e-0113-4a9e-8a6d-003c7e0b4bd9","resolution":{"observed_at":"2026-08-10T23:04:03.730443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.710178Z","title":"Learning attentional communication for multi-agent cooperation","venue":null,"work_id":"25edbe21-1891-4ed1-8dac-bad1011bd701","year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.088894Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:d88085234d9e52425d267677e1c58f713ebc5e17d871665e7a1eacb63f8d5b32","observation_id":"19173d81-38c5-48d7-b652-392d8f2537fa","resolution":{"observed_at":"2026-08-10T23:04:03.715301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.09202","last_updated":"2020-02-11T13:46:23Z","snapshot_observed_at":"2026-08-10T12:10:47.921121Z","submitted_at":"2018-10-22T12:17:40Z","title":"Graph Convolutional Reinforcement Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.09202","snapshot_observed_at":"2026-08-10T23:04:02.093258Z","title":"Graph convolutional reinforcement learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.093258Z"},"links":{"cited_paper":"/paper/1810.09202","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:87e3287443ecd3387e44cba29d9c4732308ff0ea560b2d316d3fbdc7c8209bf4","observation_id":"a0f051ea-6c39-4a3b-9071-0635dd4eda75","resolution":{"observed_at":"2026-08-10T23:04:02.093258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.693257Z","title":"Message-dropout: An efficient training method for multi-agent deep reinforcement learning","venue":null,"work_id":"08ec1ab5-996d-426a-b17c-00b9103181a4","year":2019},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.097762Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:467666da4bb69918afb4f5e7ae5f59844bd86417ced9dee6d1b8d7f2f4e3c920","observation_id":"169d0801-802b-44a9-85a6-ef138e94a04c","resolution":{"observed_at":"2026-08-10T23:04:03.698752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-10T23:04:02.102161Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.102161Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:470d2aad61eb5bc4a87555da517ea61b1e29cc42dcaf31f0abecda29b4ae33d4","observation_id":"68f434d0-8528-4923-a0bc-70b3a1fa74d6","resolution":{"observed_at":"2026-08-10T23:04:02.102161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.677621Z","title":"Deep reinforcement learning for autonomous driving: A survey .IEEE Transactions on Intelligent Transportation Systems, 23(6):4909– 4926, 2021","venue":null,"work_id":"d5400770-388b-4b0a-a924-0666a0da5e6b","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.106837Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:194bac874d544b2f15a2bfeff206ec7539080e2c2aa5c37650bb8d6a9146ad54","observation_id":"a6f5efb7-182b-4cfa-ab26-e456d1425aac","resolution":{"observed_at":"2026-08-10T23:04:03.682658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.662101Z","title":"Reinforcement learning in robotics: A survey .The International Journal of Robotics Research, 32(11):1238–1274, 2013","venue":null,"work_id":"b3efed77-4546-4d21-bd2e-5f51864c7112","year":2013},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.111539Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:cdcc4d84c3bc0a158986650e99d7160ce21656e4d234c92c1506e375ebe2cce9","observation_id":"33248a28-b17f-4e72-9bd2-4761ebbda4de","resolution":{"observed_at":"2026-08-10T23:04:03.667302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.647088Z","title":"Actor-critic algorithms","venue":null,"work_id":"ea715022-5d24-43c8-8884-ef962dc53692","year":1999},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.116340Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:ceb17cde86225f9b1e8a6b4710e15ca99943ea05ef504ef354d91d0dae7bab81","observation_id":"b5a6de7b-bf60-4ccc-a213-077719077fab","resolution":{"observed_at":"2026-08-10T23:04:03.651678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.632501Z","title":"An algorithm for distributed reinforcement learning in cooperative multi-agent systems","venue":null,"work_id":"6d9a2ce0-928d-44d0-a29d-57057e9d5b40","year":2000},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.120976Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:14639ad4df5310967229756fe2f3a2720f98604e22fdb3808c94cc1139b1a13d","observation_id":"c4d22917-2221-40ae-bd8d-d0dcff72c2a6","resolution":{"observed_at":"2026-08-10T23:04:03.637334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.02971","last_updated":"2019-07-05T10:47:27Z","snapshot_observed_at":"2026-07-06T04:29:24.362640Z","submitted_at":"2015-09-09T23:01:36Z","title":"Continuous control with deep reinforcement learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.02971","snapshot_observed_at":"2026-08-10T23:04:02.125794Z","title":"Continuous control with deep reinforcement learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.125794Z"},"links":{"cited_paper":"/paper/1509.02971","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:974ca9fa62e73e713b629ec09fa10751cfe64c79b065afd406228b9f1d064969","observation_id":"aef3018b-a927-4565-94fc-c6f2cbf1261c","resolution":{"observed_at":"2026-08-10T23:04:02.125794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.617545Z","title":"Learning to ground multi-agent communication with autoencoders.Advances in Neural Information Processing Systems, 34:15230–15242, 2021","venue":null,"work_id":"655484a4-6e03-4c3b-a0e2-4c3244a46062","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.130448Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:4e0221500eb84468ca087ea5e0683c7e1ab41393dd8662106646117cc61f8b53","observation_id":"cc42ed77-90e1-4977-b453-6fc887506141","resolution":{"observed_at":"2026-08-10T23:04:03.622446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.603292Z","title":"Markov games as a framework for multi-agent reinforcement learning","venue":null,"work_id":"27f17014-b504-41f5-902c-9b29c2d034e7","year":1994},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.134957Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:0a1d392854f239633f842bc5208a985962f331419a92730c7c92a20d538e0165","observation_id":"055f5205-2550-419c-a7bc-69790d398054","resolution":{"observed_at":"2026-08-10T23:04:03.608086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.589881Z","title":"When2com: Multi- agent perception via communication graph grouping","venue":null,"work_id":"103614e1-cd32-47e3-90fc-06a6d047a04c","year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.139485Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:3992debedab33852cf13ff8950fedbcf9c643f76ad4ad11dfa5945a794ec703b","observation_id":"5916d252-8048-449f-bbe9-8850ff036a2b","resolution":{"observed_at":"2026-08-10T23:04:03.594223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.575026Z","title":"Multi- agent game abstraction via graph attention neural network","venue":null,"work_id":"4efeb365-4427-487e-b01d-0408c92a7d73","year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.144040Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:9cd1c3b1b643a939bc0b9ca29d4ef51fb3e4bb950da7f63a58071699efcf8e7b","observation_id":"12446ce0-f48f-490e-a32b-fe29563756a3","resolution":{"observed_at":"2026-08-10T23:04:03.580577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-08-09T20:34:52.923500Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-10T23:04:02.149128Z","title":"Decoupled weight decay regularization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.149128Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:a252f4d9af4fda64d3c5b0fa485db228c9b9a7eceb24ebb6697b536099737cf8","observation_id":"fed748fa-1a17-4104-b82b-1dbe010d6678","resolution":{"observed_at":"2026-08-10T23:04:02.149128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.560458Z","title":"Border Gateway Protocol (BGP)","venue":null,"work_id":"fcdf41d9-9b94-4e81-88a4-0239806b1484","year":1989},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.153852Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:edcfb9f41dd57173e5e1fd0014df056a0147c46fda04c00a65d52a671e9fd4ed","observation_id":"e46ab52e-eaaf-4656-9fea-e1ca635b6837","resolution":{"observed_at":"2026-08-10T23:04:03.565087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.546298Z","title":"Multi-agent actor-critic for mixed cooperative-competitive environments","venue":null,"work_id":"9a6ea4d1-a940-4954-8e96-424a3c8d191b","year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.157861Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:bbe85c3f475fc8dacce5e862370db5b034cb126a34bce703f9f1ef984be0fa56","observation_id":"b0ab3129-96a4-488d-886a-1e20e290ee93","resolution":{"observed_at":"2026-08-10T23:04:03.550906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.530991Z","title":"Rectifier nonlinearities improve neural network acoustic models","venue":null,"work_id":"89fa2cbf-2abf-4541-ad8d-96ebdb788562","year":2013},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.162232Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:56cb396a3f8e906f501105750a58afca0ba7c9ad09b5d8cd113c5ce13c1b6785","observation_id":"62b6ea2c-6a63-4893-aedf-1cadfbf93908","resolution":{"observed_at":"2026-08-10T23:04:03.536069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.516053Z","title":"Distributed policy evaluation under multiple behavior strategies","venue":null,"work_id":"3fd36da3-5ed0-43d4-a64d-f230a97e9ec4","year":2014},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.166088Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:dd8c4ffb7d8b6a245b8c21e9744b9a59376091bab81ddd722f058b063c2b8e8c","observation_id":"934118c1-5dd1-4414-8bcb-551a19e72630","resolution":{"observed_at":"2026-08-10T23:04:03.520878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.500242Z","title":"An sdn perspective to mitigate the energy consumption of core networks–g´eant2","venue":null,"work_id":"3b1a0c21-f0a5-43cd-a47f-cf043e85acae","year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.170125Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:4492ab936c01ee1ad3b4ed8a9a981415443523e1a94d8b2ba4135129fb448927","observation_id":"b90ae8d7-436d-4868-8c9b-4b3b7051e4b6","resolution":{"observed_at":"2026-08-10T23:04:03.505023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.484046Z","title":"Hysteretic q-learning: an algorithm for decentralized reinforcement learning in cooperative multi-agent teams","venue":null,"work_id":"da97737e-bac5-4b78-b5de-0790d17606fa","year":2007},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.174116Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:23ecddc4e213281b236983b0a8825fd640e2edcc62f0e0e526b57d79adf7eb48","observation_id":"0d25e29f-7c49-48bb-a31a-3a62e47b56d6","resolution":{"observed_at":"2026-08-10T23:04:03.489401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-07-06T03:31:23.521122Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-10T23:04:02.178466Z","title":"Playing atari with deep reinforcement learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.178466Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:fa1af62b55477a58ce09be534f2dc51b0671c883b64572959bf69da0dd151379","observation_id":"db165626-55e7-4c05-91b8-894b99a0264b","resolution":{"observed_at":"2026-08-10T23:04:02.178466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.469084Z","title":"Multi- agent deep learning for simultaneous optimization for time and energy in distributed routing system","venue":null,"work_id":"15cf7da0-5627-4d96-9601-d29db5a24917","year":2019},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.183027Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:d83802c7e60353d7bb33fe5006c4e1c42b000ce2ef33ba5ad690fe170d8cdbbf","observation_id":"1b062434-a96f-45db-b7bf-b5798f19d1e0","resolution":{"observed_at":"2026-08-10T23:04:03.473959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.454078Z","title":"The complexity of optimal small policies","venue":null,"work_id":"3b50b5b8-6afa-45f7-b257-27cc080038c0","year":2000},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.187280Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:ff137802980e71caf950988c143b075e07c51e8955c9c74e6cbabfe86acded38","observation_id":"64a517a9-cacb-414f-b124-57c4e9159f5f","resolution":{"observed_at":"2026-08-10T23:04:03.459025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04740","last_updated":"2021-02-10T07:33:31Z","snapshot_observed_at":"2026-08-03T16:36:35.235872Z","submitted_at":"2020-10-09T18:01:01Z","title":"Graph Convolutional Value Decomposition in Multi-Agent Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.04740","snapshot_observed_at":"2026-08-10T23:04:02.191960Z","title":"Graph convolutional value decomposition in multi-agent reinforcement learning","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.191960Z"},"links":{"cited_paper":"/paper/2010.04740","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:b9f01cf8e89c42dd432a32592df8bd5957d98e242bd09c1130d49bd8f245f311","observation_id":"0c82be9f-b531-4a46-9f6e-c64e09b90afc","resolution":{"observed_at":"2026-08-10T23:04:02.191960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.196746Z","title":null,"venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.196746Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:0597a456fdbc265a5dcdafc5f1ea584e9f13eb09399dd7b36edc8da6096d2de2","observation_id":"a8654248-452a-4490-bc2b-693ede7fce15","resolution":{"observed_at":"2026-08-10T23:04:02.196746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.439354Z","title":"Magic: Multi-agent graph-attention communication","venue":null,"work_id":"97a1c5b2-b661-499b-ba0e-7fdd5de8ade5","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.201498Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:143b62a86db09ff3bec4de0599ee7129f5923a3e1ba2716c35f72b4c15556e6b","observation_id":"44149666-9d4d-4f3a-8a5f-7a574ebbddd5","resolution":{"observed_at":"2026-08-10T23:04:03.444269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.425297Z","title":"Tree-based solution methods for multiagent pomdps with delayed communication","venue":null,"work_id":"f7cd5e7e-ffef-4baa-8fd8-dbd212b14f71","year":2012},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.206210Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:f6696d329733d34197ceddb401f91679acf64a3c8c336b98e16ccd5d8f8e0e8f","observation_id":"e18b11af-b065-40f8-90b3-093c52edd20b","resolution":{"observed_at":"2026-08-10T23:04:03.429498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.410790Z","title":"A review of cooperative multi-agent deep reinforcement learning","venue":null,"work_id":"1d3cddd8-911c-4141-bac3-cb019722bb05","year":2023},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.210694Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:6723786200fd77a9797b978537ae13758188567bd79966a20173a4d8a5a00433","observation_id":"0c0c5910-7727-4b67-a10e-e9bbac1e1773","resolution":{"observed_at":"2026-08-10T23:04:03.415263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.396200Z","title":"Reinforcement learning algorithm for non-stationary environments.Applied Intelligence, 50(11):3590– 3606, 2020","venue":null,"work_id":"a6fee56c-5437-43a3-ab26-19bb5aaaf34e","year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.215374Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:c1cc11a14deec55110fe79465f700025985f2df72b90928ce5367ec2052fdb2f","observation_id":"734c7894-32da-473f-a3f1-0ebae3fae2ed","resolution":{"observed_at":"2026-08-10T23:04:03.400718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.10069","last_updated":"2017-09-14T12:45:46Z","snapshot_observed_at":"2026-07-06T05:35:43.650268Z","submitted_at":"2017-03-29T14:37:25Z","title":"Multiagent Bidirectionally-Coordinated Nets: Emergence of Human-level Coordination in Learning to Play StarCraft Combat Games","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.10069","snapshot_observed_at":"2026-08-10T23:04:02.220165Z","title":"Multiagent bidirectionally-coordinated nets: Emergence of human- level coordination in learning to play starcraft combat games","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.220165Z"},"links":{"cited_paper":"/paper/1703.10069","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:04091727b01c4772cba81c2724915ea1533fbaebd4e01a5220b7cd6d16ed45da","observation_id":"24c5df1a-8303-4637-9a0d-6b9ca01289ca","resolution":{"observed_at":"2026-08-10T23:04:02.220165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.381025Z","title":"Markov decision processes: discrete stochastic dynamic programming","venue":null,"work_id":"e411adce-79a2-4205-a0af-8502bc298e65","year":2014},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.224930Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:5c14adf02ac6484d918af81b3954d33970a2fb994d131a1fc0d606b8c6953be6","observation_id":"9d3e9928-dd92-42a3-8b3c-cfa2c3dd72b8","resolution":{"observed_at":"2026-08-10T23:04:03.386286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.366341Z","title":"Monotonic value function factorisation for deep multi-agent reinforcement learning","venue":null,"work_id":"cec61f4d-0122-42d6-a945-e823f120017b","year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.229257Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:9b36a363af2a8b2eca575c79577ae4574f8a04e81bfe95a7554dc1ca2a1ede7b","observation_id":"2d7f95bb-c95c-456c-bc9c-2f98db904614","resolution":{"observed_at":"2026-08-10T23:04:03.371170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.351485Z","title":"The graph neural network model","venue":null,"work_id":"df76eeb7-d1a4-45d5-ab31-b9f07c372c1c","year":2008},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.233894Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:4d768d0837eea3383df57154bdb6d71ad018935bac161dff1dec843187c1c7e0","observation_id":"929af3e0-f805-4262-b087-96633f8b376b","resolution":{"observed_at":"2026-08-10T23:04:03.356302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.336604Z","title":"Distributed online service coordination using deep reinforcement learning","venue":null,"work_id":"feb85cc9-43e8-442b-b3df-008e3559235b","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.238335Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:92057dfd971c5597ce3108c9f52272452d4fbbe364b36f4110b9ae097bbb144c","observation_id":"24f182d9-21bf-465b-a632-10751b784a91","resolution":{"observed_at":"2026-08-10T23:04:03.341484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.322288Z","title":"Trust region policy optimization","venue":null,"work_id":"fcd5c679-6feb-4a93-bc63-e3327011dd83","year":2015},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.242925Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:bdc9d75cabc173374e22f97682c541e2c2e51b3632ed11a13b679665378bdd18","observation_id":"e10c11e5-7c8c-4928-9058-87ca849c2c0a","resolution":{"observed_at":"2026-08-10T23:04:03.326988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-10T23:04:02.247433Z","title":"Proximal policy optimization algorithms.arXiv preprint arXiv:1707.06347, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.247433Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:0622d59cfcdda759d158f8a28d64aa0d71073c4f643d7583b03397b549e3e11a","observation_id":"342f4641-78e5-4a33-91f2-b114d6bcfbe1","resolution":{"observed_at":"2026-08-10T23:04:02.247433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.307725Z","title":"Structured sequence modeling with graph convolutional recurrent networks","venue":null,"work_id":"593e0e13-cbc0-4ae1-8f60-e462cf8d4daf","year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.252142Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:d58aca78ee827c0e5907f230f8ca14afd0afde697282eda2e68373aee609c468","observation_id":"7a022650-2649-4b8e-9643-de3bca80f10d","resolution":{"observed_at":"2026-08-10T23:04:03.312441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.292335Z","title":"Software-defined networking (sdn): A reference architecture and open apis","venue":null,"work_id":"f710b484-feff-4201-823a-65c5ff17ec13","year":2012},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.256871Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:e431302a9b183bbd107a171aa95fb48e372df181e3ddcf9df29f1253e0135507","observation_id":"81e0e62d-b99d-4ee4-8b83-361d32223f6d","resolution":{"observed_at":"2026-08-10T23:04:03.297284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.276403Z","title":"Open shortest path first (ospf) routing protocol simulation.ACM SIGCOMM Computer Communication Review, 23(4):53–62, 1993","venue":null,"work_id":"1ee3ae4b-964f-4032-abcb-455499e03f57","year":1993},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.262085Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:790e00182da7fe87c951239fc86456775c4ba29a509f518bf709d37de7ad574f","observation_id":"5c3286a0-fdea-4427-b09c-973db1a885b9","resolution":{"observed_at":"2026-08-10T23:04:03.281633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.261443Z","title":"Mastering the game of go with deep neural networks and tree search","venue":null,"work_id":"9257834b-6830-4d36-99b9-72ee6cc831ea","year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.266650Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:3fecc9207a590f952b9dc5ad703a8d7048a11ba4831aae8dec9ce1eb18b10a11","observation_id":"9e2a8687-8c28-4c72-9b5d-00ab8f6040f3","resolution":{"observed_at":"2026-08-10T23:04:03.266269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.246598Z","title":"The behavior of organisms: An experimental analysis","venue":null,"work_id":"f9c2b58b-e487-4691-b03e-f479f097c845","year":1938},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.271303Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:1f50b9cb65fa6195ebddd7c1603d3d90919a85ee0c924813cb284a708c43d763","observation_id":"e2e1c5d4-bd6e-4265-93e1-be38b11fb6cd","resolution":{"observed_at":"2026-08-10T23:04:03.251476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.231810Z","title":"Qtran: Learning to factorize with transformation for cooperative multi-agent reinforcement learning","venue":null,"work_id":"b1b763ec-694c-438c-86ad-70b87d61eeab","year":null},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.276121Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:75c8d98e519df057a21ccbcdfd551e8bbbcf55b78c18fa73d9da7c3fc79d63dd","observation_id":"4a80ce4a-ef93-4180-a452-92db04dfeaa6","resolution":{"observed_at":"2026-08-10T23:04:03.237000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.200644Z","title":"Multi-agent temporal-difference learning with linear function approximation: Weak convergence under time-varying network topologies","venue":null,"work_id":"f42bb723-8894-4b9c-8833-1f6896ad9a40","year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.285325Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:8d263af84b24f9c817bc4cc4c178aecc8beaa8b25968fa8b18dee76f9a5a2f98","observation_id":"89b45f03-85f4-4e75-846b-bb842941004d","resolution":{"observed_at":"2026-08-10T23:04:03.205297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.186132Z","title":"Phase transitions and critical phenomena , volume 7","venue":null,"work_id":"b859d39e-64fc-4857-be25-6bc059e599e8","year":1971},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.289768Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:2da3004519b553dc21464102ec329a6e0c5f12fd04a291b2e95d29e2583616ad","observation_id":"56ace35b-e1d8-49d8-829f-d8d14d6faf5d","resolution":{"observed_at":"2026-08-10T23:04:03.190401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03032","last_updated":"2022-11-06T05:38:23Z","snapshot_observed_at":"2026-08-11T01:56:40.698039Z","submitted_at":"2022-11-06T05:38:23Z","title":"Decentralized Policy Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.03032","snapshot_observed_at":"2026-08-10T23:04:02.294489Z","title":"Decentralized policy optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.294489Z"},"links":{"cited_paper":"/paper/2211.03032","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:36420f79ea5fdb4d9cac2e79c8136e193070180bd15b164499e65d82536b5ba7","observation_id":"8ecb1d65-0663-4ae4-80d4-85c1dd0b6698","resolution":{"observed_at":"2026-08-10T23:04:02.294489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.171744Z","title":"A general formulation of independent policy optimization in fully decentralized marl","venue":null,"work_id":"dd172cc7-a784-40e3-99c7-afc5a5cacc36","year":2024},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.299228Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:52cc2a6d00d82e88ecb672712b5502290d1a5ae912c4a4fe492d4554a35663ff","observation_id":"ecdb2a53-d8f6-40e9-8bfb-eaf0aad2f13d","resolution":{"observed_at":"2026-08-10T23:04:03.176309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.157294Z","title":"Learning multiagent communication with backpropagation","venue":null,"work_id":"531a23f5-a72f-4d56-888a-752e9e1ecddc","year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.303797Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:b810ae6f639d5692fd99a9f07f8ee7ab9d454ea3858fa866397062cfb58f42b3","observation_id":"f6d63df4-eb55-4646-a2c5-5aebb875efa5","resolution":{"observed_at":"2026-08-10T23:04:03.161850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05296","last_updated":"2017-06-16T14:47:21Z","snapshot_observed_at":"2026-07-06T05:47:10.770104Z","submitted_at":"2017-06-16T14:47:21Z","title":"Value-Decomposition Networks For Cooperative Multi-Agent Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05296","snapshot_observed_at":"2026-08-10T23:04:02.308211Z","title":"Value-decomposition networks for cooperative multi-agent learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.308211Z"},"links":{"cited_paper":"/paper/1706.05296","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:3ae9d62ed0f783d95286bb6675036abec7233b34c67cf32a9fbbd10fe1bafc3a","observation_id":"dc6d53f6-8f8d-4b9b-bfc8-bf91e9256274","resolution":{"observed_at":"2026-08-10T23:04:02.308211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.142625Z","title":"Learning to predict by the methods of temporal differences","venue":null,"work_id":"b8e1ad16-e053-4aee-81d1-8b5e979598e4","year":1988},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.312717Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:f9daae57f5a631e071128c11f474411d920c53c74ea6a05f000163a1a178b6b4","observation_id":"e405b032-81b0-42dc-bd14-fe1edba86e07","resolution":{"observed_at":"2026-08-10T23:04:03.147366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.127878Z","title":"Reinforcement learning: An introduction","venue":null,"work_id":"409e143d-1948-4334-ae07-5dcd9f020de9","year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.317262Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:1a45130551e5eebba770ab6f0b4915f9474c8d4b93e2269929d514f7c7c26ac1","observation_id":"2001a644-55c6-4061-8c17-bc17ebed092f","resolution":{"observed_at":"2026-08-10T23:04:03.132584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.112977Z","title":"Policy gradient methods for reinforcement learning with function approximation","venue":null,"work_id":"5cff0314-8fed-43dd-8587-b04ac859bd43","year":1999},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.321697Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:7674fb215ea3fcebbac352db5148bade3aee56902f7a41f2d4db7351e170f383","observation_id":"bc7465da-7d64-469d-aec6-10acd90c907c","resolution":{"observed_at":"2026-08-10T23:04:03.117927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.097836Z","title":"Attention is all you need","venue":null,"work_id":"fab77f18-9c90-4074-a9cb-5be74108bf70","year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.325958Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:60ca192564a6d1cd610c6d1e59dff8e4681226592083592ed6d6137655a80cf9","observation_id":"43f6bd8e-d1cd-4999-89e8-f4fba2835886","resolution":{"observed_at":"2026-08-10T23:04:03.102917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-10T23:04:02.330494Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.330494Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:6769a88dd00a9f65d117346ce7a7d53503bfa9200230ea48378e6274a69e5ba2","observation_id":"b12d16cb-99ff-42d8-8930-9c9ab9918e40","resolution":{"observed_at":"2026-08-10T23:04:02.330494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.01062","last_updated":"2021-10-04T01:36:59Z","snapshot_observed_at":"2026-08-11T01:56:41.794818Z","submitted_at":"2020-08-03T17:52:09Z","title":"QPLEX: Duplex Dueling Multi-Agent Q-Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.01062","snapshot_observed_at":"2026-08-10T23:04:02.335088Z","title":"Qplex: Duplex dueling multi-agent q-learning","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.335088Z"},"links":{"cited_paper":"/paper/2008.01062","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:df60026295391d88436cf775f109bbf54bfe4e2d6af4f6a0f28f17b0e9cc3032","observation_id":"7a44ae58-9373-41ef-aede-9d78a03c3981","resolution":{"observed_at":"2026-08-10T23:04:02.335088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12515","last_updated":"2023-05-23T12:59:56Z","snapshot_observed_at":"2026-08-11T01:56:53.450798Z","submitted_at":"2023-02-24T09:00:34Z","title":"AC2C: Adaptively Controlled Two-Hop Communication for Multi-Agent Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2302.12515","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.12515","snapshot_observed_at":"2026-08-10T23:04:02.468811Z","title":"AC2C: Adaptively Controlled Two-Hop Communication for Multi-Agent Reinforcement Learning","venue":"cs.MA","work_id":"53192ded-d07b-4183-9f47-699b39ff84d8","year":2023},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.339603Z"},"links":{"cited_paper":"/paper/2302.12515","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:766cd9568224811c0897c0f3f110d9f378ee6ff97a7727405c91ef0434f827d2","observation_id":"b81c1452-5db4-4a2a-a318-c76b04ab6606","resolution":{"observed_at":"2026-08-10T23:04:02.475872Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.082905Z","title":"Learning from delayed rewards","venue":null,"work_id":"fae1c9cd-49ba-4fbd-a6df-2aae8305416a","year":1989},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.343905Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:2afa51436a7a1c07d089b06225502f900ca3468543de9d449e2dad5e072840ed","observation_id":"4acaf67d-26f6-4fb5-88ba-bbe840787b42","resolution":{"observed_at":"2026-08-10T23:04:03.087803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05027","last_updated":"2024-06-04T10:16:33Z","snapshot_observed_at":"2026-08-11T01:56:59.261975Z","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-11T01:57:51.381842Z","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:167f639ab204b8ccca25b21eb6301e71f01d20b78f00435b57aca90b05cb9425","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.067601Z","title":"Mambpo: Sample- efficient multi-robot reinforcement learning using learned world models","venue":null,"work_id":"13322790-e767-4ee2-aafa-8633c6faa438","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.353035Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:373a035884c5d4631e978b58a42bcb02005fae5c99af6a638bed9a55674eb450","observation_id":"1004d036-1a94-4167-a43f-619c514d3b24","resolution":{"observed_at":"2026-08-10T23:04:03.072713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.051849Z","title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning","venue":null,"work_id":"f741b40b-e3a6-49e1-9881-4ceab450b555","year":1992},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.357509Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:e561178335a9ac267fadbc8d440e35d0d8e75c00e8b512a0064b87d274611a20","observation_id":"c85d29e8-f2d3-4842-8ada-616f180010ca","resolution":{"observed_at":"2026-08-10T23:04:03.056741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.035919Z","title":"Distributed average consensus with least-mean-square deviation","venue":null,"work_id":"683059bb-2a28-46f0-95e4-a6584cef659b","year":2007},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.362104Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:6e6d55fc69ca49a184e69da80d78d0aa172e708389f601afce8f0bb98fbcd21f","observation_id":"c558a1a2-b6db-4a16-8794-5c0b06b90a4d","resolution":{"observed_at":"2026-08-10T23:04:03.041135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.020563Z","title":"Mean field multi-agent reinforcement learning","venue":null,"work_id":"ec5e1a36-1d8d-4745-b2cb-0a3eed17ba44","year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.366700Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:78b5564e381fef58de19bb02dc80dd91effbb38e564586a3bf642dc2a65929da","observation_id":"b50db915-bd6a-4caf-bd02-c92a48ac364b","resolution":{"observed_at":"2026-08-10T23:04:03.025457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.003516Z","title":"Toward packet routing with fully distributed multiagent deep reinforcement learning","venue":null,"work_id":"009b8846-b25f-40da-bb0c-73d30905f266","year":2020},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.371325Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:a5f7b2474f124f0ded41eb7e31579dd333702ca0eda1bcf4d46865f098a906c2","observation_id":"0f5fb461-6ba9-484e-811f-6208202d90c5","resolution":{"observed_at":"2026-08-10T23:04:03.009167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.988289Z","title":"The surprising effectiveness of ppo in cooperative multi-agent games","venue":null,"work_id":"df15143c-36a3-4804-93aa-4e00b876f2e7","year":2022},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.376136Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:774b3813e4adec6330d173c5cfc73bbdc17b9c133f34f3211d84fc95c2cfec44","observation_id":"94d3e610-6c29-4175-85d6-9d36fb533e71","resolution":{"observed_at":"2026-08-10T23:04:02.992836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03398","last_updated":"2023-04-11T07:02:39Z","snapshot_observed_at":"2026-08-11T01:57:48.264614Z","submitted_at":"2023-01-09T14:53:38Z","title":"Asynchronous Multi-Agent Reinforcement Learning for Efficient Real-Time Multi-Robot Cooperative Exploration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.03398","snapshot_observed_at":"2026-08-10T23:04:02.380740Z","title":"Asynchronous multi-agent reinforcement learning for efficient real-time multi-robot cooperative exploration","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.380740Z"},"links":{"cited_paper":"/paper/2301.03398","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:e09a1b12d08f30b8876cd6618c53da30638f5da55ef733ccd5c5e911416adbdc","observation_id":"a0d22916-023a-49d2-ae23-165b655e0e06","resolution":{"observed_at":"2026-08-10T23:04:02.380740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.973117Z","title":"Fully decentralized multi-agent reinforcement learning with networked agents","venue":null,"work_id":"93527fa6-35cf-4034-9fb0-c64908990933","year":2018},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.385421Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:426091912837cb6441ee462edfde543884b735c7739c18467b88c0d6002dd9ee","observation_id":"9cc70e94-6f38-4545-84b4-64cad5839837","resolution":{"observed_at":"2026-08-10T23:04:02.977696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.958108Z","title":"Decentralized multi-agent reinforcement learning with networked agents: Recent advances","venue":null,"work_id":"da32f70e-d309-46eb-9922-606fc28d8dde","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.389853Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:b8985c82c2a6cac845b951e134d76a295f7afa16cd14e34e4d4e0dcda20ee6b2","observation_id":"5920b819-cf2f-4cdf-ba83-111f255b75ab","resolution":{"observed_at":"2026-08-10T23:04:02.962835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.942050Z","title":"Multi-agent reinforcement learning: A selective overview of theories and algorithms","venue":null,"work_id":"c5751ebb-4530-4386-b764-dd2f4dddd611","year":2021},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.394219Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:a77fba7dc9c17346d6ce3c105c90a7b5635ed7ad47d9dd96f77b46e7513fa8bc","observation_id":"3ba6dbf6-e9b1-4e5a-8957-f02418e16ed6","resolution":{"observed_at":"2026-08-10T23:04:02.947232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:02.925084Z","title":"High- speed ramp merging behavior decision for autonomous vehicles based on multi-agent reinforcement learning","venue":null,"work_id":"1ab0c72d-410d-48d0-a68b-4e9305b2cf74","year":2023},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.398509Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:c24f7b10f4211e18b56b564ad4d84c0e9122d731cc9ade85a01cede778100830","observation_id":"29e8da4b-121a-42bd-aba7-ad440f4fa09a","resolution":{"observed_at":"2026-08-10T23:04:02.930577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:04:03.214881Z","title":"pages 16","venue":null,"work_id":"b44b316c-6fae-45f9-9a8f-c9db3ed9eadc","year":2019},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":5896,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.280872Z"},"links":{"citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:c171083cc3b37980bba7906d8e01873a5fe166e5583e1d7eef8cee19712ac5ac","observation_id":"c79fcaf0-ccbd-4626-ba2c-4bd1484e0f33","resolution":{"observed_at":"2026-08-10T23:04:03.220806Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning"},"reference_resolution":{"displayed":97,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":39,"verified_exact":1,"verified_fuzzy":56},"total_outbound_references":97},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 1 inbound Pith citation observation for arXiv:2501.00165."}