{"as_of":"2026-08-09T19:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc7cc3005b32ca90564053251751cb4070a9e225a62d077b6d841311efaed216","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T01:24:26.351167Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2608.00648/citation-record","integrity":"/paper/2608.00648/integrity","json":"/paper/2608.00648/citation-record.json","paper":"/paper/2608.00648"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T01:24:21.414780Z","title":"An iterative two-phase optimization method based on divide and conquer framework for integrated scheduling of multiple uavs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.414780Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:e6ebdf2d9375c31fc35d58fc1f5f51c323ebdb4f8039325cc5ebce989e705f73","observation_id":"bb5856f9-5cf2-4420-9cdd-2fcc069600e2","resolution":{"observed_at":"2026-08-04T01:24:21.414780Z","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-04T01:24:21.466318Z","title":"Dis- tributed multirobot task assignment via consensus admm,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.466318Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:46882aaceebbd85b9632d08d2ef2596246f66568f73bc45f960324d40fb0795b","observation_id":"35c71247-5967-4284-b3a9-db97098024f4","resolution":{"observed_at":"2026-08-04T01:24:21.466318Z","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-04T01:24:21.570141Z","title":"Distributed consensus control of multi-agent systems with higher order agent dynamics and dynamically changing directed interaction topologies,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.570141Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:d65d62821532ea6b84b4c6f7ec5f8c87419c94b46feb2e343cde5cca558453e8","observation_id":"15f67512-9a8b-4ba3-a1db-212ee7605677","resolution":{"observed_at":"2026-08-04T01:24:21.570141Z","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-04T01:24:21.665882Z","title":"Group-based distributed auction algorithms for multi-robot task assignment,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.665882Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:5d3ddc9d0f16a53840c4843ae30b6b2d10815444cfd8ccd13e4e7fbcb394f0a4","observation_id":"51829d3f-17f2-441a-ad12-52fe20b24113","resolution":{"observed_at":"2026-08-04T01:24:21.665882Z","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-04T01:24:21.741001Z","title":"Multi-robot task allocation: A review of the state-of-the-art,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.741001Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:07f90cc3533ee984180d988d8ddcc69de9c53f4dab6264934754ff9db94dd72d","observation_id":"567dffbb-b373-4320-bf09-c38d82f33e89","resolution":{"observed_at":"2026-08-04T01:24:21.741001Z","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-04T01:24:21.821525Z","title":"Energy efficient multi-robot task allocation constrained by time window and precedence,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.821525Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:15f628efbee11d411bbd5344ca97dd5ab456991dc5e1afe51fe410d8502fc2cd","observation_id":"417464c8-911e-40c0-bac3-9041c52075e9","resolution":{"observed_at":"2026-08-04T01:24:21.821525Z","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-04T01:24:21.873944Z","title":"Coalition-based approach to task allocation of multiple robots with resource constraints,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.873944Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:80764d843f96750dc77dc11d11c80bb5598c6359ff28b172988b0a1da5abed56","observation_id":"a133643c-dabf-4b6b-8964-11294901c025","resolution":{"observed_at":"2026-08-04T01:24:21.873944Z","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-04T01:24:21.940584Z","title":"Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:21.940584Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f5972d45596f21d3e1f48320033bc78e01b60c17b551e3b6ec19ddbb1dfb88a4","observation_id":"831a0ed0-d43b-40de-9003-4858c887c086","resolution":{"observed_at":"2026-08-04T01:24:21.940584Z","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-04T01:24:22.054760Z","title":"Integrated task assignment and path planning for capacitated multi- agent pickup and delivery,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.054760Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:e9e8c767530f191fcf9222425fc4ea71cc51ec812af15f530f3f099850f9e4d5","observation_id":"f11e2408-d3d3-42c8-b94a-ecc750b1acf5","resolution":{"observed_at":"2026-08-04T01:24:22.054760Z","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-04T01:24:22.089478Z","title":"A formal analysis and taxonomy of task allocation in multi-robot systems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.089478Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:72e14a4e2a1ff303f54bbe30d17c736aa35afa7c6fde842f0800d8402f98cdb4","observation_id":"2ea573ac-2b4f-4ec7-9543-7e8ef7f7e97e","resolution":{"observed_at":"2026-08-04T01:24:22.089478Z","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-04T01:24:22.136001Z","title":"Integrated task allocation and path coordination for large-scale robot networks with uncertainties,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.136001Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:27cb4320b458c58aa901cca16bf2221a473a69835477810fe7cc0210422572ac","observation_id":"7f9baa6b-736c-4369-8b49-964b2be22a60","resolution":{"observed_at":"2026-08-04T01:24:22.136001Z","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-04T01:24:22.220034Z","title":"Cooperative multiple task assignment problem with stochastic velocities and time windows for heterogeneous unmanned aerial vehicles using a genetic algorithm,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.220034Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:9148b868c849738028ac29894e6684f8782a8dd838a8121ed9dc5ee4286f9f64","observation_id":"62c39b9c-86cb-4861-b1cc-dacca5295668","resolution":{"observed_at":"2026-08-04T01:24:22.220034Z","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-04T01:24:22.258609Z","title":"Multi-agent distributed optimiza- tion via inexact consensus admm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.258609Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:b0f9c7d45aa88831e29193fc4ea4fab1e642fc0b1994fed5a6dee5e0bb8aa0aa","observation_id":"82bf4dc4-c416-499a-ad65-c0ed32c1efce","resolution":{"observed_at":"2026-08-04T01:24:22.258609Z","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-04T01:24:22.336157Z","title":"Distributed policy gradient for linear quadratic networked control with limited communication range,","venue":null,"work_id":null,"year":2087},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.336157Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:abac6d90b0cb44481544efa76a26d269575fc17d4514758fd0fb247d2c8b50d6","observation_id":"9b4d4b0a-abd6-457b-9775-1979c397f9ac","resolution":{"observed_at":"2026-08-04T01:24:22.336157Z","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-04T01:24:22.406461Z","title":"Consensus-based decentralized auctions for robust task allocation,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.406461Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:6f44a30431d6f660625a7e831f53ff82bafa33ee4034b19e5c6da666355ab36c","observation_id":"445d65aa-5e0f-4067-8ebf-e8a704ab587d","resolution":{"observed_at":"2026-08-04T01:24:22.406461Z","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-04T01:24:22.624771Z","title":"Reinforcement learning with multiple relational attention for solving vehicle routing problems,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.624771Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:5a01d31de5b4fe9f19d7a2580c8ac2c36c6f35a89339574f0232c337f0c3acda","observation_id":"3cd48902-326a-4897-8848-346196ede944","resolution":{"observed_at":"2026-08-04T01:24:22.624771Z","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-04T01:24:22.751614Z","title":"Consensus-based auction ap- proaches for decentralized task assignment,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.751614Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:3357097b92dfb087e076215e459fb4b6449d34398c4c646b392301d18852bf11","observation_id":"65eb3bb0-a359-4b64-9e2a-d76939a66e0c","resolution":{"observed_at":"2026-08-04T01:24:22.751614Z","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-04T01:24:22.872249Z","title":"A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and rescue scenario,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.872249Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:a27bc96784af1ddedd5a25b188eb12d4e6222cb704a7a2c97517e68ef7c1522a","observation_id":"d3ef9302-cde7-4937-b779-1fa699a70ef4","resolution":{"observed_at":"2026-08-04T01:24:22.872249Z","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-04T01:24:22.962274Z","title":"An asynchronous consensus method with low communication traffic and high efficiency for distributed multi-agent scheduling,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:22.962274Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f727166c6e437d4e32dd6a5e7ebd2ed2a792bc17a3d6dc07a842a7cd59c58746","observation_id":"6f066435-d336-4f64-a805-294b0bcdb49d","resolution":{"observed_at":"2026-08-04T01:24:22.962274Z","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-04T01:24:23.063765Z","title":"Distributed task assignment for multiple robots under limited communication range,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.063765Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f2d6ef5894d96039e98a86386f2a17fce6bb867793c3133ebc690368e5653485","observation_id":"a357ac40-4789-4b8c-80af-e34d68c3b3ac","resolution":{"observed_at":"2026-08-04T01:24:23.063765Z","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-04T01:24:23.174754Z","title":"Distributed task rescheduling with time constraints for the optimization of total task allocations in a multirobot system,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.174754Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:38d1d85227fd9bcff4a0c0a6118ecbfe0256f5246936962a94c041acdb154dc2","observation_id":"968b20cd-1c88-40a8-8352-1ffe78fa1a9d","resolution":{"observed_at":"2026-08-04T01:24:23.174754Z","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-04T01:24:23.294787Z","title":"An efficient distributed task allocation method for maximizing task allocations of multirobot systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.294787Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:80af914ae350ce8e8ae48fa2545f753b95bf4244e1325d7ba17329a13ba1f174","observation_id":"5b1680e6-7567-4726-984d-306c7d785fb6","resolution":{"observed_at":"2026-08-04T01:24:23.294787Z","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-04T01:24:23.365375Z","title":"Communication- efficient decentralized task allocation for large-scale multi-agent sys- tems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.365375Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f74ade1babbdf2da420994d58ed845170c648645ddf5e88ba923717c786c4536","observation_id":"580aaa45-b125-454f-a674-c0f98d0f9fc2","resolution":{"observed_at":"2026-08-04T01:24:23.365375Z","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-04T01:24:23.493214Z","title":"Pointer networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.493214Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:bd128e7d0712350726430ce2c75590110bca108649d2a62cba51b8fd644a3509","observation_id":"9141d8f7-9c3e-46d0-bc52-d814e3d18a4d","resolution":{"observed_at":"2026-08-04T01:24:23.493214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09940","last_updated":"2017-01-12T23:55:36Z","snapshot_observed_at":"2026-07-06T05:20:39.825511Z","submitted_at":"2016-11-29T23:22:39Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09940","snapshot_observed_at":"2026-08-04T01:24:23.674758Z","title":"Neural com- binatorial optimization with reinforcement learning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.674758Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:a322d5bf6e4ba0d5481d173bd2c1e077185ff27e659ea62abf4cd690b4b0b952","observation_id":"2cc419fe-25fb-4640-aa53-9f89e82eaf97","resolution":{"observed_at":"2026-08-04T01:24:23.674758Z","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-04T01:24:23.894937Z","title":"Learning combinatorial optimization algorithms over graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:23.894937Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:a98c6de0625505d774e4bf0d8a61e1689cb55200ba981aa32c512e983d84cc3f","observation_id":"89d1b39b-76d4-4c10-9092-71095b47eb70","resolution":{"observed_at":"2026-08-04T01:24:23.894937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","snapshot_observed_at":"2026-08-06T10:54:26.264740Z","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-04T01:24:24.165800Z","title":"An efficient graph con- volutional network technique for the travelling salesman problem,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.165800Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f6b181df15d427699a26f07e3699d41f186ff73c996176e270bdd5d986fdecb6","observation_id":"e0a18bf4-6dcb-4e54-b919-d59f0ff8b81b","resolution":{"observed_at":"2026-08-04T01:24:24.165800Z","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-04T01:24:24.300907Z","title":"Attention, learn to solve routing problems!","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.300907Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:39a515a9d9ad3b57368ff924f177afc6b9bd3374eef23bf9ccd1c3db7e11f8cb","observation_id":"599ff5e3-aac4-4351-bf0d-523ad0208fc6","resolution":{"observed_at":"2026-08-04T01:24:24.300907Z","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-04T01:24:24.464749Z","title":"Pointerformer: Deep reinforced multi-pointer transformer for the traveling salesman problem,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.464749Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:8ac8f2cdde9811cc8f815d8b226654baef00288401d8927c3d434ebbcc721d00","observation_id":"0c63d70a-c114-41ee-bf37-68ac573a8b89","resolution":{"observed_at":"2026-08-04T01:24:24.464749Z","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-04T01:24:24.634746Z","title":"Pomo: Policy optimization with multiple optima for reinforcement learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.634746Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:62e215e291c21866ac666db797d9aded6d10c7e14e46c792e4b985de6fc5cafc","observation_id":"8f6d5e44-40cf-4cb0-ae0f-e3f29cf64b91","resolution":{"observed_at":"2026-08-04T01:24:24.634746Z","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-04T01:24:24.732542Z","title":"Learning to handle complex constraints for vehicle routing problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.732542Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:695c91a4f75e814692fabcedbc018646e2014a3d9f01cbc589dffbfcbf33d9ee","observation_id":"94a12dcd-af19-463f-917c-13062750a5bf","resolution":{"observed_at":"2026-08-04T01:24:24.732542Z","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-04T01:24:24.823859Z","title":"Mapdp: Cooperative multi-agent reinforcement learning to solve pickup and delivery problems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.823859Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:9e8c06f6b1a99d06ee78eaa2bffabb1e25557a78f3274a646360399a2774c8c4","observation_id":"b0652e1c-cf8d-4eb6-b4f3-44126ff07b1b","resolution":{"observed_at":"2026-08-04T01:24:24.823859Z","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-04T01:24:24.952556Z","title":"Dl-drl: A double-level deep reinforcement learning approach for large-scale task scheduling of multi-uav,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.952556Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:03ae423d0bfa7c4b794d824b974158ebfa99d1270a3d2a0c043e57f1edb0a55b","observation_id":"b0da0d66-9dfc-4b95-9f56-19d693723b5d","resolution":{"observed_at":"2026-08-04T01:24:24.952556Z","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-04T01:24:25.029396Z","title":"A hierarchical multi-task and multi- agent assignment approach: Learning dqn strategy from execution,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.029396Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:b84caf3e0e04142e6a206279648027c0fa421dff535ab16d1586a8d0f3fbeff3","observation_id":"3976841a-aac5-4735-a4bf-5ac1bb938cec","resolution":{"observed_at":"2026-08-04T01:24:25.029396Z","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-04T01:24:25.073626Z","title":"Learning to allocate time-bound and dynamic tasks to multiple robots using covariant attention neural net- works,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.073626Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:985d1017d1058b58bad61a3d0fd21468fb5912b5fce921c1929b4e711d29565d","observation_id":"d3f8cdc9-4834-4aec-93bd-e2917d13aa6f","resolution":{"observed_at":"2026-08-04T01:24:25.073626Z","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-04T01:24:25.114585Z","title":"The complexity of decentralized control of markov decision processes,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.114585Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:cbb1d9361f0e325873342e8038a5068c0aa72eddd5bfeaacc698dd4a837a1f0d","observation_id":"adfb7fc8-a37d-4948-8d8f-9d2e62e77c60","resolution":{"observed_at":"2026-08-04T01:24:25.114585Z","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-04T01:24:25.195218Z","title":"Egam: Extended graph attention model for solving routing problems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.195218Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:df52de4f9eba3f92982b8594cc89a880c3d41de0f2ea85c8f2e8fbe718755f93","observation_id":"e52b13b0-8fd2-4cd5-81c3-89b14984042e","resolution":{"observed_at":"2026-08-04T01:24:25.195218Z","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-04T01:24:25.321394Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.321394Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:b01b2fd6a174435d664842333c7c6fcc11fde6c5ec3cce4c729e647fa390948a","observation_id":"55043c0e-03e9-4508-ae59-ffe800727275","resolution":{"observed_at":"2026-08-04T01:24:25.321394Z","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-04T01:24:25.435122Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.435122Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:978c346b306911c1540692500a2557bf22264bffd5c3aab466f0ae0beedad963","observation_id":"bef6fff9-53a5-4dd1-89f7-d30e93ee2541","resolution":{"observed_at":"2026-08-04T01:24:25.435122Z","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-04T01:24:25.552748Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.552748Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:9346e42a3eead6a36cb3b5fa857ac08dec8de97cfbc968877f8880ea2cea41a4","observation_id":"f5d384cd-0dfb-4920-addb-09462a23922c","resolution":{"observed_at":"2026-08-04T01:24:25.552748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-04T01:24:25.656785Z","title":"Layer normalization,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.656785Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f1740b5fca42ffcf1d626c7f49fa369557505059dac6563d213ee41a2e904e3c","observation_id":"58fa039d-2f7b-4088-95a5-e9b2eb806c1d","resolution":{"observed_at":"2026-08-04T01:24:25.656785Z","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-04T01:24:25.767086Z","title":"Multi-agent actor-critic for mixed cooperative-competitive environ- ments,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.767086Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:7f895173151f69a9e3c46a214ec2c73bed68a911c8f9fab106492cf0ed6ffdfc","observation_id":"21ba72b1-de78-4e13-8c40-8731d86a16b7","resolution":{"observed_at":"2026-08-04T01:24:25.767086Z","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-04T01:24:25.898109Z","title":"The surprising effectiveness of ppo in cooperative multi-agent games,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:25.898109Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:72eea0d75e22d87b3c54f014ea93047662a950fd1cb73e56cc1c038a5167705b","observation_id":"19e0f4cd-d101-4853-9785-8a23e6577714","resolution":{"observed_at":"2026-08-04T01:24:25.898109Z","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-04T01:24:26.002988Z","title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:26.002988Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:75f3e58e22d8666ce9cbc9642c7d4318ef4fddefc77900d484d3ad8fb1a8a0de","observation_id":"24fa474f-25e9-4557-979a-8e5b1d932f43","resolution":{"observed_at":"2026-08-04T01:24:26.002988Z","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-04T01:24:26.120506Z","title":"Sym-nco: Leveraging symmetricity for neural combinatorial optimization,","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:26.120506Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:02b7ad8a7ce3db1492fedc9d74e88190d957bc493a6781b5e3b55299102682a0","observation_id":"a3863cd7-8814-4d89-b76d-0ff1ce1d3275","resolution":{"observed_at":"2026-08-04T01:24:26.120506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-04T01:24:26.222077Z","title":"Deepseekmath: Pushing the limits of mathematical reason- ing in open language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:26.222077Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:8c40fceb5f2113990ddb79eca0488cb7fb7e86a1ce3d2e7e89de7d60fd538855","observation_id":"976b66d4-9c96-4572-9ad8-e9c2866559d5","resolution":{"observed_at":"2026-08-04T01:24:26.222077Z","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-04T01:24:26.299665Z","title":"Adam: A method for stochastic optimiza- tion,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:26.299665Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:bffb18b28908fe6461c5ecf9b6b917bbb351ca9493883c5843f09e38441a759f","observation_id":"0656bde9-ecaa-425e-b3a9-d9cb9b6e5acc","resolution":{"observed_at":"2026-08-04T01:24:26.299665Z","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-04T01:24:26.351167Z","title":"Learning the travelling salesperson problem requires rethinking generalization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:26.351167Z"},"links":{"citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:2dc5a19a9bce23a3c30be88d3e0b5fb12cd0b6f58f33700ef7dbe146bde1f64e","observation_id":"83c16283-2e03-43f7-ad70-ee36ec718d81","resolution":{"observed_at":"2026-08-04T01:24:26.351167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":48},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2608.00648."}