{"as_of":"2026-08-10T16:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0dd3c8c9468866c5cb172201a027a497fb4a07afd6965c86b46e2fca122fdc2b","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T20:08:06.499666Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.08956/citation-record","integrity":"/paper/2509.08956/integrity","json":"/paper/2509.08956/citation-record.json","paper":"/paper/2509.08956"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:08:06.190479Z","title":"UA V swarm intelligence: Recent advances and future trends,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.190479Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:c678954d1e372f7753e3a2389eae70f2204bdbcfb3059ab112073aaeff706333","observation_id":"6ac20142-e8b7-45b2-9372-24922e240e3b","resolution":{"observed_at":"2026-08-04T20:08:06.190479Z","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-04T20:08:06.196202Z","title":"UA V communication networks issues: A review,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.196202Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:947cb0ec24b6fc9213e7d4513b4e8d9f1a09185220851a68f787d209fdecfbf7","observation_id":"d82788f4-330f-4178-a429-6a6d70f5a7f3","resolution":{"observed_at":"2026-08-04T20:08:06.196202Z","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-04T20:08:06.199818Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.199818Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:08cc914f30618809602a0492b716504cd04a5589622846ce6e45358f1d7c2a48","observation_id":"37f05878-ac76-410f-9d08-80ca26809157","resolution":{"observed_at":"2026-08-04T20:08:06.199818Z","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-04T20:08:06.313616Z","title":"Electronic warfare systems,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.313616Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:8ab53731e2230d488474740f95b4cbabbc991197ab3e399875a79b34165203ae","observation_id":"709442ff-28d9-4222-9666-73f9319dc59f","resolution":{"observed_at":"2026-08-04T20:08:06.313616Z","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-04T20:08:06.317196Z","title":"Identifying coor- dination in a cognitive radar network–a multi-objective inverse reinforcement learning approach,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.317196Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:84352c65fa9369e79ff4385533687a77fa65f0df951c76b21fd438e236de95de","observation_id":"6be7a1b1-1cea-4296-8603-6f61dea19896","resolution":{"observed_at":"2026-08-04T20:08:06.317196Z","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-04T20:08:06.320856Z","title":"Statistical detection of coordination in a cognitive radar network through inverse multi-objective optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.320856Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:08298be61674ef57244bcc7fbb3c53efeda42b75c0e00b11bb8ea43ea047f3d2","observation_id":"b441a293-c99a-46b5-901e-9c7fd4881d07","resolution":{"observed_at":"2026-08-04T20:08:06.320856Z","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-04T20:08:06.324688Z","title":"Revealed preference,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.324688Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:cec7acf66b0c375daed6ee3bf65c0a03fc4e821be858bfcb581a4c62f8632b50","observation_id":"e12d1318-c890-4ea9-bdc8-56175e0ef30f","resolution":{"observed_at":"2026-08-04T20:08:06.324688Z","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-04T20:08:06.328417Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.328417Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:9affe808c41bceeacddde78f81f49ef004cd5cc87fc6f82809e8a2fadd73fa3e","observation_id":"477bfa4a-cfc8-4c08-9ac3-f64573b27452","resolution":{"observed_at":"2026-08-04T20:08:06.328417Z","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-04T20:08:06.331758Z","title":"The construction of utility functions from expendi- ture data,","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.331758Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:39ef52cd4f6223410a5835a9cee7a38b6884b5630a548a7a03f62d70d4b901ff","observation_id":"4aa06cf9-6c18-4793-840f-71c74d42b448","resolution":{"observed_at":"2026-08-04T20:08:06.331758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.05659","last_updated":"2019-08-13T00:43:41Z","snapshot_observed_at":"2026-07-06T08:14:39.851659Z","submitted_at":"2019-08-13T00:43:41Z","title":"Distributionally Robust Optimization: A Review","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.05659","snapshot_observed_at":"2026-08-04T20:08:06.335689Z","title":"Distributionally robust optimiza- tion: A review,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.335689Z"},"links":{"cited_paper":"/paper/1908.05659","citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:dd6762ec5797d3491a596589c3c29c7b03934f78fa663537e24648e8c2390e63","observation_id":"093c0286-0882-459e-8b15-fe21ef591617","resolution":{"observed_at":"2026-08-04T20:08:06.335689Z","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-04T20:08:06.339355Z","title":"Frameworks and results in distributionally robust optimiza- tion,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.339355Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:c36c55da75dbc7dba8d187a53fb30b9376edd2926cf15650458acc95982b7e8e","observation_id":"677d5c95-53b4-480d-aeea-66ae0f1e61f7","resolution":{"observed_at":"2026-08-04T20:08:06.339355Z","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-04T20:08:06.343198Z","title":"Wasserstein distributionally robust optimization: The- ory and applications in machine learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.343198Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:0c1d4d5e123816db5d8d06bcb89ae67a634d5680ee367e035c654299f9835717","observation_id":"796f53ec-d16b-46a2-a979-b71779aeb2c2","resolution":{"observed_at":"2026-08-04T20:08:06.343198Z","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-04T20:08:06.346460Z","title":"Thirty years of machine learning: The road to Pareto-optimal wireless networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.346460Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:883b2418df1ae41598cfcb2ed363333b17aff77a48b0771b48f40d20cf9f6baa","observation_id":"7a2058d8-bac3-40ea-9224-fc8608ffb5a5","resolution":{"observed_at":"2026-08-04T20:08:06.346460Z","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-04T20:08:06.349395Z","title":"Pruning and ranking the Pareto optimal set, application for the dynamic multi-objective network design problem,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.349395Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:221602b07bb94c085cb7afdd5ec25f4a17e2c60b7a21b17ece5540ccdc42c812","observation_id":"50d038b7-2655-4797-9c3a-c738888da433","resolution":{"observed_at":"2026-08-04T20:08:06.349395Z","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-04T20:08:06.352837Z","title":"Energy and age Pareto optimal trajectories in UA V-assisted wireless data collection,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.352837Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:ef738003e2fcf58c396d03bba3f916e1968ab3a04c17012f5fd7ab1768b3e1e9","observation_id":"d5d7599b-7934-4f3f-9f27-5cd0dd17f4b5","resolution":{"observed_at":"2026-08-04T20:08:06.352837Z","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-04T20:08:06.355946Z","title":"Topology control of unmanned aerial vehicle (UA V) mesh networks: A multi-objective evolutionary algorithm approach,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.355946Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:6b7a12cc9dc4f13516805a6a902a5fbf843411af31e45fe153b393c9956f5eed","observation_id":"4e1da62b-fdc7-4f88-8cac-678db38d3b59","resolution":{"observed_at":"2026-08-04T20:08:06.355946Z","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-04T20:08:06.359361Z","title":"Multi-UA V task allo- cation based on improved algorithm of multi-objective parti- cle swarm optimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.359361Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:33e64d89507718882acede16bcb9183b4221fd12bf6e1062f29b1281c9b758c6","observation_id":"a5c83b8d-fa45-49f9-b264-83ca7bcc14a6","resolution":{"observed_at":"2026-08-04T20:08:06.359361Z","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-04T20:08:06.362648Z","title":"Pareto optimal pid tuning for px4-based unmanned aerial vehicles by using a multi-objective particle swarm optimization algorithm,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.362648Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:696261cfed9d9062d3b459591a9c0fa047fdd31653b915a7d10a589f304c6007","observation_id":"9ece1cb2-d0b9-4d89-803c-61bbd4c70a85","resolution":{"observed_at":"2026-08-04T20:08:06.362648Z","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-04T20:08:06.365583Z","title":"Achieving Pareto opti- mality through distributed learning,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.365583Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:f243b4242dff2eead718e53b8fe96cbcd1f4f23d2cef2633cad0d20a7a194ebb","observation_id":"887d48ac-9ab7-4ad4-83bc-29821906e17e","resolution":{"observed_at":"2026-08-04T20:08:06.365583Z","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-04T20:08:06.368824Z","title":"Multi- objective multi-agent decision making: a utility-based analysis and survey,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.368824Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:b34cdb34af46c76f75c474fdb5dfdae2068400c19f22119ccc29244da96bfb74","observation_id":"4e35c78e-4f0d-4faf-9817-6ef9cac4fbe9","resolution":{"observed_at":"2026-08-04T20:08:06.368824Z","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-04T20:08:06.371955Z","title":"Iden- tifying cognitive radars-inverse reinforcement learning using revealed preferences,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.371955Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:1059610f970bb988c8e9866fdd7f5760df44a978de4f3868568ecdc6286b3389","observation_id":"8ab15be7-0a8b-4e9a-9b6c-1e4b9c82bc58","resolution":{"observed_at":"2026-08-04T20:08:06.371955Z","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-04T20:08:06.375204Z","title":"Meta-cognition. an inverse-inverse reinforcement learning approach for cogni- tive radars,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.375204Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:509b89d00c6044693e5fdd72229fcabd83fece8cbeb9a2871647c92ebe4524b4","observation_id":"165bfbd3-d0b1-41e0-9ab8-89ecbf402c2e","resolution":{"observed_at":"2026-08-04T20:08:06.375204Z","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-04T20:08:06.378086Z","title":"How can a cognitive radar mask its cognition?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.378086Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:4f7d73a846ddb6ddec2a503b576f1bb8f80daa7c608b3e6d9c0a0642b1f19672","observation_id":"f5851083-db78-48e3-b1cd-08d121995ea7","resolution":{"observed_at":"2026-08-04T20:08:06.378086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.04888","last_updated":"2016-03-11T11:02:00Z","snapshot_observed_at":"2026-07-06T04:24:07.477067Z","submitted_at":"2015-07-17T09:30:03Z","title":"Maximum Entropy Deep Inverse Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.04888","snapshot_observed_at":"2026-08-04T20:08:06.381097Z","title":"Maximum en- tropy deep inverse reinforcement learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.381097Z"},"links":{"cited_paper":"/paper/1507.04888","citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:cd307bf4773837fc4c7d6d15ed7de45e5b1e8ceebd0fb51be612dd25bb828302","observation_id":"ada8336e-1359-4cd5-a525-14190858a584","resolution":{"observed_at":"2026-08-04T20:08:06.381097Z","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-04T20:08:06.384371Z","title":"Large-scale cost function learning for path planning using deep inverse reinforcement learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.384371Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:f2ba56e105bd854bad7604501042ba5a11eca35313410bc05fcb5e8bbbbd4edc","observation_id":"81f3100a-9a72-4a2a-be2d-0f1065238f78","resolution":{"observed_at":"2026-08-04T20:08:06.384371Z","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-04T20:08:06.387404Z","title":"Inferring group intent as a cooperative game. an nlp-based framework for trajectory analysis,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.387404Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:dd017a46678bb1a48d19af50b8844cf2cc4cfd76470f9bbbd376127e0beb87fd","observation_id":"abbf61b2-63e4-4696-953e-3606de28c80a","resolution":{"observed_at":"2026-08-04T20:08:06.387404Z","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-04T20:08:06.391046Z","title":"The computational algorithm for the para- metric objective function,","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.391046Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:1360c69b3e1add4b50203aa042fb62920acc3d711c95c8065776f147e9cd2477","observation_id":"bac99b44-f793-491a-b02f-d312591c3899","resolution":{"observed_at":"2026-08-04T20:08:06.391046Z","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-04T20:08:06.394645Z","title":"Miettinen, Nonlinear multiobjective optimization","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.394645Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:552d0ea1d4f684097f1a9c4e1f69548e50ee32ca565a83308fcbcc8b89fb8aeb","observation_id":"1bc3e06a-1b69-42b1-a105-5b3df85c2fc2","resolution":{"observed_at":"2026-08-04T20:08:06.394645Z","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-04T20:08:06.397578Z","title":"A CA V platoon control method for isolated intersections: Guaranteed feasible multi-objective approach with priority,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.397578Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:ca1355336f47f3a4e23dbe9c86c29a6ba7cf68aa0e0147dcb6dfa587a9748d17","observation_id":"409a3a55-5ef7-411a-aedd-50f3ef9a8ffa","resolution":{"observed_at":"2026-08-04T20:08:06.397578Z","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-04T20:08:06.401014Z","title":"Multi-objective optimization framework for enhancing efficiency and sustainability in smart grids,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.401014Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:5da82cd0b156b2f2d8aa5a5787214a0357072dfc6daec04537937a126bb6935b","observation_id":"234043df-1267-4bab-a5e6-0908e1f912eb","resolution":{"observed_at":"2026-08-04T20:08:06.401014Z","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-04T20:08:06.404278Z","title":"Revealed stochastic preference: a synthesis,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.404278Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:52c5ca3bbdde536f537db63713865b406006b2e5d515ca2b2eccd1411a5bd1c3","observation_id":"1d39181b-a9a4-4cef-887b-fa0624d992f0","resolution":{"observed_at":"2026-08-04T20:08:06.404278Z","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-04T20:08:06.407638Z","title":"The revealed pref- erence approach to collective consumption behaviour: Testing and sharing rule recovery,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.407638Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:983f9a48cda3c24d05de287dd05f01cd35c470e6e51a1e7d3103ce50d6a167c6","observation_id":"d01e6911-a7c7-4aab-b4b8-ff57dddb44d6","resolution":{"observed_at":"2026-08-04T20:08:06.407638Z","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-04T20:08:06.411050Z","title":"Recent advances in robust optimization: An overview,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.411050Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:cc21f81c7385334c7f2c287cded21364f35ce584e1f976879f09e9ff452f96a8","observation_id":"6394ad3d-e80d-4586-adf8-da1f540c575a","resolution":{"observed_at":"2026-08-04T20:08:06.411050Z","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-04T20:08:06.414456Z","title":"Distributionally robust optimization: A review on theory and applications,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.414456Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:46f4c11a35652a640d5c246b44002ea725c73c27689a09d21bb1a16a428d72c6","observation_id":"72a7262a-ce55-4db4-bace-5fe53ac2e78e","resolution":{"observed_at":"2026-08-04T20:08:06.414456Z","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-04T20:08:06.417752Z","title":"Wasserstein distributionally robust inverse multiobjective optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.417752Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:cbc22573a1c453d5c3f7738e910b184a0f99dc22d6dc9c3b9be77e55423f9e63","observation_id":"7a383a12-5725-4ee3-b65b-460a2e8dbc61","resolution":{"observed_at":"2026-08-04T20:08:06.417752Z","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-04T20:08:06.420931Z","title":"Adaptive distributionally robust optimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.420931Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:9f9a5d99bc3b1f8366dbe749a1439a734f93dcd460697d59026ac42720cc46f9","observation_id":"9ba47c71-ce4b-48c1-bdee-d718a7685e4a","resolution":{"observed_at":"2026-08-04T20:08:06.420931Z","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-04T20:08:06.424454Z","title":"Wasserstein distributionally robust look-ahead economic dispatch,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.424454Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:44561be44ac4ff1562c479336a5810fc5bfb7c5f2e8ff8f836477e00c144bfe0","observation_id":"806f4dee-55c7-4104-aced-fc7064ecce28","resolution":{"observed_at":"2026-08-04T20:08:06.424454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.03920","last_updated":"2017-04-12T20:29:12Z","snapshot_observed_at":"2026-07-06T05:37:37.792043Z","submitted_at":"2017-04-12T20:29:12Z","title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.03920","snapshot_observed_at":"2026-08-04T20:08:06.427532Z","title":"Decomposition algorithm for distribu- tionally robust optimization using wasserstein metric,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.427532Z"},"links":{"cited_paper":"/paper/1704.03920","citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:bb5ef03c6bdff09ed6aae67a28c40f0cf994c92889bb42cb2afa6b45fdd50d8b","observation_id":"ec892d65-cd13-425a-a5ee-7564560881bb","resolution":{"observed_at":"2026-08-04T20:08:06.427532Z","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-04T20:08:06.431320Z","title":"Semi-infinite programming: the- ory, methods, and applications,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.431320Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:992e0b5c8fdc4a8706fd2b7c7f8e7c985cd22d8e6120fb67fec324edb0dc7082","observation_id":"5e431f02-f271-42b4-9a7c-8bac4b11cf70","resolution":{"observed_at":"2026-08-04T20:08:06.431320Z","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-04T20:08:06.434727Z","title":"Cutting-plane training of structural svms,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.434727Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:f4f2d492624a092a37321d7d071c937c8b7bf0675e534eee36410fbefb0a7154","observation_id":"fcb5e86e-806c-43ed-85c1-d33fb87de982","resolution":{"observed_at":"2026-08-04T20:08:06.434727Z","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-04T20:08:06.437989Z","title":"Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.437989Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:81d83eb6084d3cee455ea2d1e63cab1f970768d570a8559745afc36a96a30044","observation_id":"18216d36-e579-43a1-a12e-0e457f4f67cb","resolution":{"observed_at":"2026-08-04T20:08:06.437989Z","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-04T20:08:06.441232Z","title":"Hiding unmanned aerial vehicles for wireless transmissions by covert communications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.441232Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:c755e236dab5b7c1a8c372ac8a04401e125f1cd4d9055485f7e388bc8640c987","observation_id":"b7bd0915-30fe-460e-a417-dd4c9c69239c","resolution":{"observed_at":"2026-08-04T20:08:06.441232Z","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-04T20:08:06.444317Z","title":"UA V-enabled covert wireless data collection,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.444317Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:0a1f011b4e55c519cd2f43d20b055311da3fd4222f893cc594051f2d46ff60d5","observation_id":"5e133aa6-49af-46e2-959a-0590d029224d","resolution":{"observed_at":"2026-08-04T20:08:06.444317Z","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-04T20:08:06.447752Z","title":"UA V-enabled covert federated learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.447752Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:852574de56cc617c2035e97294e5998a0cbd350cf0c278f9d07e18e6444196e9","observation_id":"3235df6d-0958-4303-bddc-036783f602e2","resolution":{"observed_at":"2026-08-04T20:08:06.447752Z","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-04T20:08:06.451124Z","title":"Survey of maneuvering target tracking. part i. dynamic models,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.451124Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:9d4555dbcd17a12375103d9a2ba57f4e977b9713a6280051c4e509de34162404","observation_id":"b11cf2ff-44e2-4637-aaec-67bfc7ac6f67","resolution":{"observed_at":"2026-08-04T20:08:06.451124Z","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-04T20:08:06.454173Z","title":"Bar-Shalom, X","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.454173Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:6bbcf5ce79ef109cf6aa8ff6d08fc2f33565ba91a65f902ef85c3a5cc713ce4a","observation_id":"b840c94e-2dc4-40ee-890b-ff1d3fee7583","resolution":{"observed_at":"2026-08-04T20:08:06.454173Z","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-04T20:08:06.457493Z","title":"Multi-target tracking using joint probabilistic data association,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.457493Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:da0ee565e4f9c6a10c174a59cb703f0b636bc72bac30775293d2a4b44bf91fa8","observation_id":"043f5db3-d9fd-4815-8662-ebfc130a6bf1","resolution":{"observed_at":"2026-08-04T20:08:06.457493Z","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-04T20:08:06.461383Z","title":"Joint probabilistic data association revisited,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.461383Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:853e85645ed46d6f2a4e8192b23979347dc7df9c8a77693493fc81a5dce07f6d","observation_id":"5bb37746-8c29-4146-85d7-0bcb2e835324","resolution":{"observed_at":"2026-08-04T20:08:06.461383Z","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-04T20:08:06.464797Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.464797Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:2cbfb74adc786d4318ff11dfbd57fcd3083a738145bbedd59125cd13db535cb5","observation_id":"933c6088-3767-4a9c-8cb4-6bd3e8438344","resolution":{"observed_at":"2026-08-04T20:08:06.464797Z","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-04T20:08:06.468083Z","title":"Optimal waveform selection for tracking systems,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.468083Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:6cde8681b59a360034e8809914a52c467e500ba67a4d1f077c9ebecdb8a45cff","observation_id":"5332636b-2fa5-472d-9bcf-7743cf2cb97c","resolution":{"observed_at":"2026-08-04T20:08:06.468083Z","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-04T20:08:06.471470Z","title":"Bar-Shalom and X.-R","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.471470Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:5871f6da22be20631780265c9b85bea5dc3458c5386e82e87a80d1e78eff394f","observation_id":"237a97cb-5c04-42f4-b5f3-6272748a353f","resolution":{"observed_at":"2026-08-04T20:08:06.471470Z","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-04T20:08:06.475027Z","title":"collective rationality","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.475027Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:0bbee87af5a87c9c65b0488f3e6dac137fc2580a261e99ac0929c451174bcee9","observation_id":"e4edbacf-c291-4b7c-9d0a-b89fe7ab0cc6","resolution":{"observed_at":"2026-08-04T20:08:06.475027Z","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-04T20:08:06.478674Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.478674Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:ea42b25dea43b70fd1c78b98593f778e9022dc499eab70157e1e78271ca3a08f","observation_id":"ca45a65e-38e7-4f01-8332-38e0c7a70881","resolution":{"observed_at":"2026-08-04T20:08:06.478674Z","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-04T20:08:06.481801Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.481801Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:591e7abe0daa3c520eff3cb57dd520a5f2de43ee5a2ca48127428c6dc18881d7","observation_id":"9430a818-49ae-468f-89c8-f99c50cd29d5","resolution":{"observed_at":"2026-08-04T20:08:06.481801Z","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-04T20:08:06.485680Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.485680Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:d5bc2ea32c78afb237354f14463c65577ab694130de1ba07a7b3a9852df89d30","observation_id":"7817ac2d-3418-4fa5-b7e8-f1f0507aafca","resolution":{"observed_at":"2026-08-04T20:08:06.485680Z","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-04T20:08:06.489209Z","title":"none of the targets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.489209Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:01292dbd26b85c79aca14490255510444b8992e6a04cd8a006c3e50ed7fdb305","observation_id":"b6c4db73-8a88-43f4-8adf-cb6495cdbd76","resolution":{"observed_at":"2026-08-04T20:08:06.489209Z","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-04T20:08:06.492455Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.492455Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:4e92c73b6286bff4d50d0a401e192c202317286789548f8147363c90727c4719","observation_id":"0fd87156-a23c-4601-85f3-6e563785295e","resolution":{"observed_at":"2026-08-04T20:08:06.492455Z","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-04T20:08:06.495898Z","title":"target detection indicator","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.495898Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:3560aa2d16da61e081425bdf902d42d5c6b1645db27d5951e775eeb591f7cd25","observation_id":"452b557f-1764-41d8-a69a-54a90f1ecb26","resolution":{"observed_at":"2026-08-04T20:08:06.495898Z","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-04T20:08:06.499666Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.499666Z"},"links":{"citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:b912d82928be92659923a136ea4c671dff819a2e2014df979fed5350aeec899d","observation_id":"3e8fac1f-f8ac-4b13-9a59-56209b5825f0","resolution":{"observed_at":"2026-08-04T20:08:06.499666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":59,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":59},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2509.08956."}