{"as_of":"2026-08-15T04:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:462b260b5335af97b720124f89214eecd3a814e33368974a0d2a74473ed419a7","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:25:59.994792Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2509.00678/citation-record","integrity":"/paper/2509.00678/integrity","json":"/paper/2509.00678/citation-record.json","paper":"/paper/2509.00678"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:26:00.439617Z","title":"Mastering the game of go with deep neural networks and tree search,","venue":null,"work_id":"6b87e533-70ca-454a-9a78-2924a39a54bf","year":2016},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.883548Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:55cf3dbe938a1d503acf8b120237eb53bfad5b252429f68f385eb2a1f070909c","observation_id":"d0b33f9c-321f-4f19-a4ad-335bcc4d45c6","resolution":{"observed_at":"2026-08-05T13:26:00.444103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:25:59.890372Z","title":"Grandmaster level in starcraft ii using multi-agent reinforcement learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.890372Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:8f1d2997ef8c6c2c1db667228da31805a64ca8e160611e2fdfda4e4bf13b184c","observation_id":"58e3bcf5-7b2a-4f4a-b40d-cf899842ed07","resolution":{"observed_at":"2026-08-05T13:25:59.890372Z","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-05T13:26:00.414053Z","title":"Nash q-learning for general-sum stochastic games,","venue":null,"work_id":"3684d856-f2c1-4322-8911-8e71d4d9f46e","year":2003},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.895645Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:e7f190aff75718a0d7070015ee48c0b4270d75b818ec07f8ecf928af9e458640","observation_id":"654eb9cc-baa9-4716-9d03-a01492134ddb","resolution":{"observed_at":"2026-08-05T13:26:00.419153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.09118","last_updated":"2021-08-20T11:32:23Z","snapshot_observed_at":"2026-08-13T18:44:41.873396Z","submitted_at":"2021-08-20T11:32:23Z","title":"CybORG: A Gym for the Development of Autonomous Cyber Agents","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.09118","snapshot_observed_at":"2026-08-05T13:25:59.900077Z","title":"Cyborg: A gym for the development of autonomous cyber agents,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.900077Z"},"links":{"cited_paper":"/paper/2108.09118","citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:7c4e96e22b87d2fb8deb628c7edb32d5420f5bea6eeeadb3d92a05ab63b3118a","observation_id":"6739e7ce-1158-4286-841c-bb0de738dd03","resolution":{"observed_at":"2026-08-05T13:25:59.900077Z","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-05T13:26:00.398405Z","title":"Markov games as a framework for multi-agent reinforcement learning,","venue":null,"work_id":"f9fa9b84-6036-4442-ab06-fd7671cd5c85","year":1994},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.905139Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:56af321068b31ebfdc12bb9e92d35b0ec32bdb8ac1380b2c256cc27cf0bf2b9d","observation_id":"cf402e31-f856-4e8f-8e9e-4ca5495a6105","resolution":{"observed_at":"2026-08-05T13:26:00.403467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.382462Z","title":"Markov perfect equilibrium in a repeated principal-agent rela- tionship,","venue":null,"work_id":"f3911f8f-92a7-4adb-9ddd-34b4de957ff1","year":1994},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.909628Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:05aff02bb39fa89878968241a41797f268ac7c73e0438528c957d402fa414adb","observation_id":"a11558df-aaa1-4c02-a5b8-3504999e5596","resolution":{"observed_at":"2026-08-05T13:26:00.387607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.365821Z","title":"A survey of game theory as applied to network security,","venue":null,"work_id":"2db816ad-a029-41d3-9512-070842fe8fe7","year":2010},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.914821Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:e4e1d55afb0cd0d297b76163a6171b500086c248d95a0730e270176648addb27","observation_id":"660e8977-5268-4bde-9b3b-1a897a2692ab","resolution":{"observed_at":"2026-08-05T13:26:00.371273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:25:59.919127Z","title":"The complexity of computing a nash equilibrium,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.919127Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:3d4bc2fe3e024726c6b359bc3a749923cc3281675a16c81dee85ee3383723dea","observation_id":"0e76ac92-a337-48c5-bae1-0506ba3f02b9","resolution":{"observed_at":"2026-08-05T13:25:59.919127Z","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-05T13:26:00.339592Z","title":"A comprehensive survey of multiagent reinforce- ment learning,","venue":null,"work_id":"7a929c03-022b-40b8-b74d-80b64b2fa2ca","year":2008},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.927226Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:f9d5c0f6a7243fca9ecad265d2aaa61c5a2913926f9d647afe453e35fc735fd7","observation_id":"47ba5eb8-7431-4792-a86f-2b4bd112a522","resolution":{"observed_at":"2026-08-05T13:26:00.344338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.323689Z","title":"A deep learning-based multi-agent system for intrusion detection,","venue":null,"work_id":"2b2e622c-209e-42da-80d1-b42d2e3a08d8","year":2020},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.931216Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:89b572457597ca6c2772ec218675490cdea395036f0848879e9dc482dd2f568a","observation_id":"791f92c5-7d29-4357-bcfe-32805ab67298","resolution":{"observed_at":"2026-08-05T13:26:00.328910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.307789Z","title":"Deep reinforcement learning for adaptive cyber defense in network security,","venue":null,"work_id":"138f590b-4bde-461c-9583-64b9000fd5d6","year":2024},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.936139Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:ecbdd892c54d5af6960c8deb75031029405615e3f1400770fbf8a11777940749","observation_id":"1536871c-4b62-4224-b043-26e0a91e9ca7","resolution":{"observed_at":"2026-08-05T13:26:00.312338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.289574Z","title":"Reinforcement learning for efficient network penetration testing,","venue":null,"work_id":"4bb1c54e-8f32-4a90-acc5-bc54acdebaaa","year":2019},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.940401Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:d7fb83bc7a636b58afb456ec73930f1d62d1c7072c70c6e99ef63a7c3819dfbc","observation_id":"268408f9-a9c1-48cf-b09c-44dcfedf9ec3","resolution":{"observed_at":"2026-08-05T13:26:00.295366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.269244Z","title":"Combining deep reinforcement learning and search for imperfect-information games,","venue":null,"work_id":"7c767574-e68c-4017-b1cf-cb491f6cf4ea","year":2020},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.945508Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:ee052ceba3a0e036a5a92f399f101bf4ea8b42dbf50721393c41827148474d1a","observation_id":"bc8725fc-5fec-4e80-9946-8621ad8eff54","resolution":{"observed_at":"2026-08-05T13:26:00.274921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15036","last_updated":"2024-11-22T16:08:42Z","snapshot_observed_at":"2026-08-14T10:43:17.045226Z","submitted_at":"2024-11-22T16:08:42Z","title":"Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15036","snapshot_observed_at":"2026-08-05T13:25:59.949703Z","title":"Safe multi-agent reinforcement learning with convergence to generalized nash equilibrium,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.949703Z"},"links":{"cited_paper":"/paper/2411.15036","citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:c6938b41f4c11a5315962fd7b67ecc20c67d80125c2a326cfd3d08fd84ec1699","observation_id":"c3f39add-fc6a-4cd0-a7fd-6abbe4244ead","resolution":{"observed_at":"2026-08-05T13:25:59.949703Z","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-05T13:26:00.252746Z","title":"A comprehensive systematic literature review on intrusion detection systems,","venue":null,"work_id":"19fe5525-7b5c-4a94-b803-8029c6855e94","year":2021},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.954379Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:972ff6439cf1489527f378d91839712ad5b08236e66674f80e54cf083f571685","observation_id":"c50cc2f2-d6a6-4d23-9237-2f8437e50846","resolution":{"observed_at":"2026-08-05T13:26:00.257456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.235938Z","title":"Correlated q-learning,","venue":null,"work_id":"ca505562-6ed5-463f-89b2-28b33eb07688","year":2003},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.959210Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:df48dcea8f5b9864fb92a410e56cdac8fe6ecae9fae83f651da7dee282805018","observation_id":"3cea5c4b-63d2-4098-8b7e-415fc20a21d2","resolution":{"observed_at":"2026-08-05T13:26:00.240980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.217191Z","title":"Alpcan and T","venue":null,"work_id":"465914fd-6ef6-4dee-89d9-438e1f9f69cd","year":2010},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.963344Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:8c30a8d56545480c4443ba3cfe79b7263b740417eba3d8bcf9a6a3f8d1de14e0","observation_id":"83fe8b63-e8fd-4d44-8fdd-c4361c9d43d6","resolution":{"observed_at":"2026-08-05T13:26:00.222553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.195603Z","title":"Deep q-learning for nash equilibria: Nash-dqn,","venue":null,"work_id":"d0c0f481-d823-422e-bd00-989b198f7327","year":2022},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.967510Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:5933ac2fe9f4095260fb9da8fe14bc32b722068d4f2b7be65a6622931d47e9b3","observation_id":"bac529b3-d118-43e0-a6da-8002aa74cc69","resolution":{"observed_at":"2026-08-05T13:26:00.201116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:25:59.971718Z","title":"Equilibrium points of bimatrix games,","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.971718Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:0e045e1ee5f948f3ed6ca269f0b2e832b20794aaa191bd70885717030eb0e686","observation_id":"619f91d3-2eb0-4a11-8fcb-73c5d162bd0c","resolution":{"observed_at":"2026-08-05T13:25:59.971718Z","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-05T13:26:00.158710Z","title":"Ray: A distributed framework for emerging{AI} applications,","venue":null,"work_id":"a307c324-8b70-4a29-9f65-b48e392a9db3","year":2018},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.976476Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:f6830c55c61e76b1d6d413798ebad0b0820690c9cefb4356bed082df7f8d9858","observation_id":"50a2a5f4-afb0-4d2e-b95d-8162a1f50534","resolution":{"observed_at":"2026-08-05T13:26:00.164551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-05T13:25:59.981069Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.981069Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:bad57cb4e4224e46ce59c611881ea166101b1af634655c0e6309bf6860913079","observation_id":"74578041-7280-4e3b-ab31-5f30c4d06c35","resolution":{"observed_at":"2026-08-05T13:25:59.981069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07388","last_updated":"2023-09-14T02:09:36Z","snapshot_observed_at":"2026-08-13T10:14:02.898498Z","submitted_at":"2023-09-14T02:09:36Z","title":"On Autonomous Agents in a Cyber Defence Environment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07388","snapshot_observed_at":"2026-08-05T13:25:59.985731Z","title":"On autonomous agents in a cyber defence environment,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.985731Z"},"links":{"cited_paper":"/paper/2309.07388","citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:59882eb6d1520c7d9c133bcda0113e7b85cf3476fe8625e0bf0dc34ded74cacf","observation_id":"d4e2f42a-cbbf-4ef5-a294-dbad97247885","resolution":{"observed_at":"2026-08-05T13:25:59.985731Z","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-05T13:26:00.141774Z","title":"Autonomous network defence using reinforcement learning,","venue":null,"work_id":"41d90055-9b9e-436f-b954-a1a61df85f85","year":2022},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.990406Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:ce9f5e961e30c7e5263152e1d640512ecee6782505359e85a4cf15e71a47c5d9","observation_id":"b93b0a16-c381-438c-b80f-1aa0ad38d38f","resolution":{"observed_at":"2026-08-05T13:26:00.147556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-05T13:26:00.121007Z","title":"Learning to communicate in multi-agent reinforcement learning for au- tonomous cyber defence,","venue":null,"work_id":"58a425e2-885a-480d-866d-e2eb4ef5eb83","year":2024},"citing_paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:25:59.994792Z"},"links":{"citing_paper":"/paper/2509.00678"},"observation_digest":"sha256:164840f22fa9dd5d0087a0fbbeae49b6c146d15e9956a0490232e451fb94a57d","observation_id":"fffac843-3bda-41fa-83e2-23177bb0b5d4","resolution":{"observed_at":"2026-08-05T13:26:00.127826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.00678","last_updated":"2025-08-31T03:18:02Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-13T10:05:01.988582Z","submitted_at":"2025-08-31T03:18:02Z","title":"Nash Q-Network for Multi-Agent Cybersecurity Simulation"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":24},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2509.00678."}