{"as_of":"2026-08-12T09:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb55a0732440402fb0150c23625b4c2a1af3e8b26eaaba79f136ef39dccb9ee3","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-12T06:34:41.77262+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-11T04:40:30.098247Z","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:2b80845a7c2e848f1d695f1c3bc827c64cc15586d139a0919d3cb6dd29427f3c","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-11T04:40:30.098247Z","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:b658312c024517108cc34b37d610c404d66738e93d8459ec8d683cc8e87cdfc1","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-11T04:40:30.098247Z","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:d74473369798f76aa9ce64df0e65fc82d1d302abe6404fb3137efddd2583d690","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-11T04:40:30.098247Z","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:ee4b64ff4de89dbbd88e59af8a0263abf7f1a3dbba67942da788c9bf0a1313c8","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-11T04:40:30.098247Z","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:fe4c03a65092dfedbc36bacc0d786c2ab3c1a3954f609bd838c44b76afc3941a","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-11T04:40:30.098247Z","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:7816d752dbd049e2f9d6caec0506c0997cce70a4318b448fff431c887bbb9495","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-11T04:40:30.098247Z","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:a2c3aa0781ae0de65bbb1cb949b270dc4df77c97239cc4f09d3e90cd26e8e8c5","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-11T04:40:30.098247Z","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:6160337401720048772e79306bf6708bbeaecc2440418d83e194c3cffcdba570","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-11T04:40:30.098247Z","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:dd2ede8f6f2ff8767a8c10836c03fad2f751c601398ad0e91b0248a45b832fcb","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-08-11T04:38:29.399734Z","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-11T04:40:30.098247Z","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:fcd003093360b903f5c22f78006061d2b1ebaf2e47b9cd2bd555f1cada9a72af","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-11T04:40:30.098247Z","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:e02d306f3a5481ce67e1c850707503c434230a01ef32e0fc10f38f2b2737660a","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-11T04:40:30.098247Z","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:349bbb2fbc16a7ce61ffe91c083556b67a6053bf34f8cff530147d345ed5f289","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-11T04:40:30.098247Z","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:11c687db6e06f7bb183a215da0f9e7f8009e9bd25bfac1cdd37eb9f308d647cf","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-11T04:40:30.098247Z","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:3834737421a7753f4bc45a1cf7aa51a8b991040f548fc45b5799084f133d6f9f","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-11T04:40:30.098247Z","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:755f57385ad21cc92691921082aab26f06cb2c78206e20957e24b4b091a73280","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-11T04:40:30.098247Z","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:a91b724f7001153e81a95d2669e3e9eba789104751c61efb0e29573f31f8a4b1","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-11T04:40:30.098247Z","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:face1668ea481d593c37ebfa3cfc662de8630b82f5f77ec5a8da19d6532f513f","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-11T04:40:30.098247Z","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:c258226ff36ca097466f545770e650c0bcb6a427b7dd4e5e18c2d8160f724098","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-11T04:40:30.098247Z","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:e37261595e501e5296aa84874b427a8f138000caf04bd43b6aee8673cdc0e3b1","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-11T04:40:30.098247Z","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:b6c69a9b6ec445a0f6058428a99a01543fed41fe7c120aff68f193291c321c91","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-11T04:40:30.098247Z","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:6bafef089556381a190a514fb5b682623feab1420b7c82207b202b6b45852d58","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-11T04:40:30.098247Z","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:34f7eee9cfb63ca60400880cff96fbbd2bccbd95bfd08c572fcc702dd426f22c","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-11T04:40:30.098247Z","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:1cd3f0101159e1294530195d8e681bcb8fb9c23b7c8b829dbf9257d3b5f42ee0","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-11T04:40:30.098247Z","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:60858f8326fae2f28086ac62b1a870a1e4c45146f641bb1f759989d3a6a9fa39","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-11T04:40:30.098247Z","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:bfb457414562ab5d9111f6fb27a8fe98902eaa765f96b10abf8af32475d7e59e","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-11T04:40:30.098247Z","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:1d27d098b40e60bbefbc5473f4b0239508292caa901eb026440f9558231f9eff","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-11T04:40:30.098247Z","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:13c7b07537e1ddbe0b1c2cac2bc3d630b2b95604c94ccbc0176a743dcac4c750","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-11T04:40:30.098247Z","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:11c2421a46547c1a7740fdc360393b569c69795246ff4d619a932e60da002554","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-11T04:40:30.098247Z","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:0a343e6de5d07180729b23705e3e53d4035a180a6a8ba43e0ba02f4040fff4b6","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-11T04:40:30.098247Z","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:9b805e05b664ebbd6343b367d3c84bd715f066476401a4efe1057108288d1ff6","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-11T04:40:30.098247Z","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:0a783fb03a044f96fe35451bb1815954e26c9e91887d8f6766d7ff24e285e81d","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-11T04:40:30.098247Z","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:ba1a9c01f7463d99efefd05370c7290506a96152f0a68150179fcf26326d25d2","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-11T04:40:30.098247Z","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:c3a8be939b19a56b9bfad373a799664e29124c7a2b00f312cce9a7fa2dae7dfc","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-11T04:40:30.098247Z","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:8c7a235fb35f64d376aa78b025b86fea4f712c0e67a8504d5e4e08c44267b8ba","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-11T04:40:30.098247Z","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:cf12731b345956a2d0978d304f9f155f57c46a3fdc9dfa048b8fcbf9974481ca","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-11T04:40:30.098247Z","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:5a516f97ee0aefffe8c4eeeea5e639a75cdf0e2d3ee642bc9ee28b0dca27ca99","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-11T04:40:30.098247Z","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:f4ed0bd07a0ef51c99ea8192c91e7dc5fd5d063a803d6e74422ec925cc3e2952","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-11T04:40:30.098247Z","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:fcc52cc05eee711fe8d565eb3ed0829abf671b8c0418ec5fb30f58d78f097fbf","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-11T04:40:30.098247Z","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:08def00b1577b041c22ac72324a4a703a1ac01cabcefdef900fa9404d142fbfe","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-11T04:40:30.098247Z","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:4ee99d05a8b093f9104d39c039cb720ec71033ffb15dd337823870eae2011527","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-11T04:40:30.098247Z","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:b465f16a255754e65abc530cc6b22048490f0cf9ccc145bd74207a7058fab13f","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-11T04:40:30.098247Z","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:9589075f50160262d71f8b0a85e00b506e5bd01f42ebd7097ac7dd590f5bc55f","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-11T04:40:30.098247Z","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:1ae85bfee9ef6e7d46148e7ed70ddf6704e598a7192246fe25c8b6ab36dfaf06","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-11T04:40:30.098247Z","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:b95b29a16b446bde619f7b09c5bb36b0458609c98357852c7cdf6c0c0e134815","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-11T04:40:30.098247Z","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:6a560425d52b092afffd64a9a46a12a63b7ef5a30e7353c779c103115a07e4cd","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-11T04:40:30.098247Z","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:a7d9d3838102dee29b39c5beb049f952feefe73ccecd43f387c58768b1ac7f8a","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-11T04:40:30.098247Z","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:39bd03fcd807ab00c07a5361cb8f91ac832dabccc2003fcf1599bd18d155d26b","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-11T04:40:30.098247Z","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:08d955afee52cfa38f5cdc8bec4b12ac11e16834907bf08a855ced36b4a21a0b","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-11T04:40:30.098247Z","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:934a317c0677524f0241baad23be94203c77f9db2f75b625a095a53b8adfd543","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-11T04:40:30.098247Z","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:8e6a623345b0f17695b493397c78da20d05a3e52e5e14a108c4837d48d685d0c","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-11T04:40:30.098247Z","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:fdb587c61c94e1f439703a34197af8a228436c5958ae6b48b8c3271edc8e5116","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-11T04:40:30.098247Z","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:b9ce51e5d79784b45aa034750856cf4c3c295ad8719458c08aaf3f504b4097e4","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-11T04:40:30.098247Z","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:90fb6cf29d8e818f3bcfd116e25c67cf186efc08e7d0f0de0830a862991d0f63","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-11T04:40:30.098247Z","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:b77532f6f87c3942f7fe240f03c686d517164d1d3fd73ee7a84e487f949218fd","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-11T04:40:30.098247Z","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:4dc6940d58ffa9ef281e3e1b239aca74bee7d9c5d8d3009674fb623d050b083f","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-11T04:40:30.098247Z","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:21c29e071430a826e183180af02179346fb25a397934a4f1bfbce0ec822fb873","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-11T04:40:30.098247Z","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:a9ee94aa598501a390908a820e62c6f3fb93285617e09eed2b9acd38059892ea","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-11T04:40:30.098247Z","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:18006e7a91127ded7b61315a0b43ea4a4ae39fcc6cca55b8ada36dd3650eb6b4","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-11T04:40:30.098247Z","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:626588f9d54cfa24f28ed6f1dee9fe9c2e3d41e4a0b6fc2b6b79cb9692d06c2e","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-11T04:40:30.098247Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2509.08956."}