{"as_of":"2026-08-09T05:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5dd4069b6e1320afd99d922dfe0978c9cb9cb8b7fe6c4a22bd627282659333ec","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T22:13:00.107205Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:45:45.078825Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T00:45:45.612357Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.18809","snapshot_observed_at":"2026-08-02T10:39:41.077110Z","title":"Metric-gradient projection for stable multi-agent policy learning.arXiv preprint arXiv:2605.18809, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.20500","last_updated":"2026-06-20T21:46:17Z","snapshot_observed_at":"2026-08-05T21:32:12.614205Z","submitted_at":"2026-06-20T21:46:17Z","title":"FlowEdit: Information-Theoretic Control of LLM Reasoning Flows for Ill-posed Problems Involving Conflicts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T10:39:41.077110Z"},"links":{"cited_paper":"/paper/2605.18809","citing_paper":"/paper/2607.20500"},"observation_digest":"sha256:2d0fd67787a59907ae82dc2b0dddf2baf9dc52945f7996a571a0420f79b84aef","observation_id":"32377c4b-0ede-4256-9a68-3ab688476fde","resolution":{"observed_at":"2026-08-02T10:39:41.077110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"cited_work":{"arxiv_id":"2605.18809","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.18809","snapshot_observed_at":"2026-08-06T00:45:45.612357Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","venue":"cs.LG","work_id":"a7aa5b64-c17b-4f72-a84b-7a10cc9aa537","year":2026},"citing_paper":{"arxiv_id":"2608.00908","last_updated":"2026-08-02T00:27:01Z","snapshot_observed_at":"2026-08-07T08:34:21.560554Z","submitted_at":"2026-08-02T00:27:01Z","title":"Learning Not to Optimize: Physics-Informed Action-Space Reshaping for Intent-Based Network Control","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T00:45:45.078825Z"},"links":{"cited_paper":"/paper/2605.18809","citing_paper":"/paper/2608.00908"},"observation_digest":"sha256:9adb9de630ad82b6f9b3d52be11bf2d0413fac600028b1be37156e85c5382b31","observation_id":"41ada73a-9ebb-4a48-bad2-b28bc9ef4772","resolution":{"observed_at":"2026-08-06T00:45:45.617991Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.18809/citation-record","integrity":"/paper/2605.18809/integrity","json":"/paper/2605.18809/citation-record.json","paper":"/paper/2605.18809"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Markov games as a framework for multi-agent reinforcement learning","venue":null,"work_id":"7c9a4eaa-6836-4bd1-997a-d34b849f7dab","year":1994},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:6c8d9593cdcf29cd10267ead3b324b34f2e45fa79bfc2eb55b0b5c008291cc00","observation_id":"431d1d1c-af84-48bb-8dd3-dc82d76142c2","resolution":{"observed_at":"2026-05-20T22:13:47.550963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-05T21:23:00.469572Z","title":"Learning to collaborate with unknown agents in the absence of reward","venue":null,"work_id":"268ecb8f-799c-474e-a484-2c7fa53e7675","year":2024},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:ab35526ce5d6f62b5ce548d1e242b2891bb188d6c08d2fb86b759a748911ce00","observation_id":"5f6b9916-7d09-45dc-8f47-b98d89f3e164","resolution":{"observed_at":"2026-05-20T22:13:47.542787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14122","last_updated":"2024-05-23T02:49:05Z","snapshot_observed_at":"2026-07-06T18:18:16.530605Z","submitted_at":"2024-05-23T02:49:05Z","title":"Modeling Other Players with Bayesian Beliefs for Games with Incomplete Information","version":1},"cited_work":{"arxiv_id":"2405.14122","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.14122","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Network diffuser for placing-scheduling service function chains with inverse demonstration","venue":null,"work_id":"c63708a1-1fe2-413d-98d9-feebc23ef417","year":2025},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/2405.14122","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:3258e28cc2097777b69bcf3742b4165f4c6c5ceab36e732572828b64e617ba09","observation_id":"cc9f3ea4-086c-4107-b949-0480238b3f36","resolution":{"observed_at":"2026-05-20T22:13:46.730580Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"cited_work":{"arxiv_id":"2502.00633","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00633","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lipschitz lifelong monte carlo tree search for mastering non-stationary tasks","venue":null,"work_id":"4296da23-5347-43d4-9601-eaed2499ddc7","year":2025},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/2502.00633","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:5284532901759bec83edf847714437d1a7b6fa3b198d90a76c6ad92c343c65a3","observation_id":"cf33e756-3e32-44b9-aa43-1f5a4befbeda","resolution":{"observed_at":"2026-05-20T22:13:46.755847Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.21991","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Geometry of drifting mdps with path-integral stability certificates","venue":null,"work_id":"a4296ea3-429b-40e9-9f72-af63a55db14b","year":null},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:0beb1ec821ba4c85c71571c3a0cec86d274f074ecc6cb0d6399e8977e5c24843","observation_id":"7a72cee9-0251-4351-a65b-890e3433b57d","resolution":{"observed_at":"2026-05-20T22:13:46.745527Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02438","last_updated":"2018-10-20T18:55:07Z","snapshot_observed_at":"2026-08-08T15:29:26.223468Z","submitted_at":"2015-06-08T11:12:48Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","version":6},"cited_work":{"arxiv_id":"1506.02438","doi":"10.48550/arxiv.1506.02438","metadata_source":"pith","pith_arxiv_id":"1506.02438","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","venue":"cs.LG","work_id":"38e3ca94-96f0-4b19-a355-0754931af8be","year":2015},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/1506.02438","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:2197e1199675d5166d5a74f34854e0b9d6a416b580859905c66c7d0ed6408a89","observation_id":"d1cf2afa-db78-4c34-b2ee-0f2738b3b7f6","resolution":{"observed_at":"2026-05-20T22:13:46.740818Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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":"1706.05296","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.05296","snapshot_observed_at":"2026-07-04T19:30:07.924598Z","title":"Value-Decomposition Networks For Cooperative Multi-Agent Learning","venue":"cs.AI","work_id":"97c129f4-4b12-4e2d-a662-3431772ad2f6","year":2017},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/1706.05296","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:7300c17126705f664bbb2371d8081d3dc57c575739f4d26d98f6bafdfa8c0016","observation_id":"71da555e-6cdf-4216-9200-4bdc9f925f19","resolution":{"observed_at":"2026-05-20T22:13:46.750682Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.10551","last_updated":"2020-08-28T20:51:28Z","snapshot_observed_at":"2026-07-06T06:25:54.451916Z","submitted_at":"2018-02-28T17:40:05Z","title":"A Variational Inequality Perspective on Generative Adversarial Networks","version":5},"cited_work":{"arxiv_id":"1802.10551","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1802.10551","snapshot_observed_at":"2026-06-28T20:52:37.988605Z","title":"A variational inequality perspective on generative adversarial networks","venue":null,"work_id":"461b6fa7-9edc-46d6-8e8f-5865b24f60d5","year":2018},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/1802.10551","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:adb1358257138180ea826e72021732102fc0b50f1052335c71597708e8cb75e1","observation_id":"d59117f1-7687-457b-a8a9-845e873dae32","resolution":{"observed_at":"2026-05-20T22:13:46.735866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c841e52b-e969-40d0-b2d4-5fc834d66b08","year":2005},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:136f013ecb8337fae57fc5c12e300e73cbe77941309e0c82c09daa4838217dd3","observation_id":"00259185-6ade-4ca5-a807-c3042e6f934a","resolution":{"observed_at":"2026-05-20T22:13:47.536600Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-05T21:23:00.469572Z","title":"neurips.cc/paper/2005/hash/9752d873fa71c19dc602bf2a0696f9b5-Abstract.html","venue":null,"work_id":"51240bb6-3c0f-46f4-bf0c-156def5c47f8","year":2005},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:f1d675dad2da072c8405ea712cd0a2d2b7aca154d49a3958e9741e86db1d5406","observation_id":"62bb4fd6-ead0-4037-a239-64bbf3ad5d45","resolution":{"observed_at":"2026-05-20T22:13:47.530040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.02629","last_updated":"2018-10-01T23:11:31Z","snapshot_observed_at":"2026-07-06T06:48:52.967374Z","submitted_at":"2018-07-07T08:08:33Z","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","version":2},"cited_work":{"arxiv_id":"1807.02629","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.02629","snapshot_observed_at":"2026-07-09T08:46:05.739734Z","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","venue":"cs.LG","work_id":"6dd76124-83da-4c09-9a30-342809e0498a","year":2018},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/1807.02629","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:05a985c9b83c0d3c6e49bdb2147ea06dfcd726ab89a945bdc6a2b32daa8dea05","observation_id":"7fe04ec0-4364-45d5-9891-d4b31e0832d8","resolution":{"observed_at":"2026-05-20T22:13:46.714040Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00141","last_updated":"2018-02-13T16:33:55Z","snapshot_observed_at":"2026-07-06T06:07:09.962753Z","submitted_at":"2017-10-31T23:09:08Z","title":"Training GANs with Optimism","version":2},"cited_work":{"arxiv_id":"1711.00141","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.00141","snapshot_observed_at":"2026-07-01T23:56:24.257504Z","title":"Training GANs with Optimism","venue":"cs.LG","work_id":"97abf5d7-2dc1-4ce4-8e2c-dc1c714bcc0d","year":2017},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/1711.00141","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:c276dd7432573424d74abf822d707dd210c3b654fb0641c11f70344dff1ee154","observation_id":"76497578-d2c3-4c27-9e54-8c5b78121797","resolution":{"observed_at":"2026-05-20T22:13:46.735399Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-05T21:23:00.469572Z","title":"Algorithms, graph theory, and linear equations in laplacian matrices","venue":null,"work_id":"055c43b4-6985-4217-bf55-a7ac6841b475","year":2010},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:4a24f10dfc7d94891f801a2f99d9e388a2769173703124e2de8bf09da85bc3cf","observation_id":"c1475e4b-3f28-4bc2-bfe8-f5199a3f1f71","resolution":{"observed_at":"2026-05-20T22:13:47.528832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-05T21:23:00.469572Z","title":"Discrete calculus: Applied analysis on graphs for computational science, leo grady, jonathan polimeni, springer (2010), $129.00, isbn: 978-1-84996-289-6","venue":null,"work_id":"de8b263e-b0f3-4d66-bf88-cd94bc2be59b","year":2010},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:68a5f0a1e2830a4e8be9d51cac1b6619cd53d18b1b2d52e7ed3b9583feacd806","observation_id":"8ba9d677-3c5b-4b4e-9b5d-219586756a36","resolution":{"observed_at":"2026-05-20T22:13:47.515900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.06939","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T10:49:45.747262Z","title":"Cochain perspectives on temporal-difference signals for learning beyond markov dynamics.arXiv preprint arXiv:2602.06939, 2026b","venue":null,"work_id":"5bc83485-6f67-42fc-b5e2-ee0be098b48e","year":2026},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:b36fb2efdaf47eb5edd047d2cd79a86617f8ef3af47a2baad1cab0411174f314","observation_id":"d321031c-eb48-4861-b417-ee43ed033c99","resolution":{"observed_at":"2026-05-20T22:13:46.725417Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.13746","last_updated":"2023-10-31T00:06:14Z","snapshot_observed_at":"2026-07-31T17:57:44.437235Z","submitted_at":"2022-11-24T18:23:28Z","title":"Melting Pot 2.0","version":6},"cited_work":{"arxiv_id":"2211.13746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.13746","snapshot_observed_at":"2026-07-09T10:26:11.053924Z","title":"Melting pot 2.0","venue":"cs.MA","work_id":"761894c7-1b77-465a-92be-fe5819372cd7","year":2022},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/2211.13746","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:f7a327d41ebca187f030e7431fa17d7ca236611d912c5b238df1300da2b3bd02","observation_id":"d6bf5b80-299b-4bec-804d-3ff3c5d4d63a","resolution":{"observed_at":"2026-05-20T22:13:46.731145Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.02995","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T16:09:57.360937Z","title":"Agent alpha: Tree search unifying generation, exploration and evaluation for computer-use agents.arXiv preprint arXiv:2602.02995","venue":null,"work_id":"88cbdc5d-0e07-4c4b-a64c-3b79bf266bab","year":2026},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:bab4231e35c66889b5d422a8b4aeb898f94de67fa2c630fe4b409db19817bae9","observation_id":"8be89070-a4b1-43b4-9bfb-a0c50b7d81b2","resolution":{"observed_at":"2026-05-20T22:13:46.739801Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.00751","last_updated":"2026-05-01T16:02:58Z","snapshot_observed_at":"2026-08-02T16:01:52.357634Z","submitted_at":"2026-05-01T16:02:58Z","title":"NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search","version":1},"cited_work":{"arxiv_id":"2605.00751","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.00751","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"NonZero: Interaction-Guided Exploration for Multi-Agent Monte Carlo Tree Search","venue":"cs.LG","work_id":"bafed776-75e0-43ce-b4ae-8ad109b97207","year":2026},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/2605.00751","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:36136c4d784335cd8644ab00aa1f87b4f6f1bcb5c062f0446992c4193e2e796c","observation_id":"bf6547c0-7d3a-4068-8e95-5c9bc24a9ec3","resolution":{"observed_at":"2026-05-20T22:13:46.709264Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.14360","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lisfc-search: Lifelong search for network sfc optimization under non-stationary drifts.arXiv preprint arXiv:2602.14360, 2026a","venue":null,"work_id":"a6dd7e5e-11de-4862-9c36-eba1c5301ffd","year":null},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:57495edd5f25e6f87cd2d72bcc279871abdeb7b7da3064cf278712ed459a1074","observation_id":"7fe68f37-42e7-4e88-93bd-679eaf6c85e7","resolution":{"observed_at":"2026-05-20T22:13:46.744924Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-05T21:23:00.469572Z","title":"First, cyclic matrix games, including Rock–Paper–Scissors and generalized cyclic games on∆K ×∆ K, expose cyclic interaction dynamics in a familiar simplex geometry","venue":null,"work_id":"cfa90504-c1c1-4cf7-bd36-55843f29181c","year":2021},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:51787f63bcebceb89b72af0e99b344e29d582059046f45694b9ca92cd1a78b6d","observation_id":"24334fc3-f4fa-41d3-9a93-1f7445636fe1","resolution":{"observed_at":"2026-05-20T22:13:47.525688Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":13,"verified_fuzzy":5},"total_outbound_references":20},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 2 inbound Pith citation observations for arXiv:2605.18809."}