{"as_of":"2026-08-10T14:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7accf124fd64a500d339cd9dac382c533aceeb2f01d94c8c04b1b645ab1ea03c","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:01:14.037729Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.20031/citation-record","integrity":"/paper/2506.20031/integrity","json":"/paper/2506.20031/citation-record.json","paper":"/paper/2506.20031"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1115/detc2018-86161","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Decentralized task allocation in multi-robot systems via bipartite graph matching augmented with fuzzy clustering,","venue":null,"work_id":"b1a8120b-328a-42ac-9ec0-132e5e411e75","year":2018},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.940625Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:a3e574c8e8b04e89ce2969e7638ab2823b7b6265873de5ef61cf8f94062dff68","observation_id":"66916b1d-196a-4c91-96d4-32518e2f24c2","resolution":{"observed_at":"2026-08-06T23:01:14.122178Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-18278-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":null,"venue":null,"work_id":"8719edd6-48ce-43b3-b465-329e2a588954","year":2011},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.945498Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:ec048b8b26de20ad121f9b6a4a50832abe6a1e41c29eef59b5233d6b3d844ac9","observation_id":"6a51d879-a64d-4373-9fdb-322a702315b0","resolution":{"observed_at":"2026-08-06T23:01:14.110306Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1186/s12544-019-0368-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Last mile delivery by drones: an estimation of viable market potential and access to citizens across european cities,","venue":"European Transport Research Review","work_id":"a270ffc2-3df4-474b-87b6-1dd300e729d7","year":2019},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.949772Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:72bf7918bbffa3de5ca1f4dc44b460c0e4c022faa01cb6d9a962917c1ecaaf4c","observation_id":"128e7e11-440c-4579-b81e-e42d2af3c99d","resolution":{"observed_at":"2026-08-06T23:01:14.098511Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2514/6.2024-4006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Poddar, S","venue":null,"work_id":"d6b7026a-ac80-4253-9316-c9f9f92faf37","year":2024},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.953948Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:eeb71be0a76aa760d4a3a29e3b056e87a6bdb2db1001122e9a2003a6010504a4","observation_id":"e8f0a9f8-c413-48f9-a7ae-bd1a28e8c498","resolution":{"observed_at":"2026-08-06T23:01:14.087162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-07T06:19:28.905819+00:00","source":"paper_reference_links","state":"open"},"event_date":"2024-09-20","event_type":"correction","notice_doi":"10.2514/6.2024-4006.c1","provenance":{"observed_at":"2026-07-11T03:05:20.819012+00:00","source":"crossref","source_record_id":"10.2514/6.2024-4006.c1->10.2514/6.2024-4006:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.341480Z","title":"An effective collaboration evolutionary algorithm for multi-robot task allocation and scheduling in a smart farm,","venue":null,"work_id":"77293057-ebc2-4542-b6ea-cedccb05b873","year":2024},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.958525Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:30a1783a344c9fc1ed8050bfb078f18af04bac4a79aba137048bd61af8e0b8eb","observation_id":"0b1ce55f-3618-4956-9deb-bf6c467612ae","resolution":{"observed_at":"2026-08-06T23:01:14.346053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.330682Z","title":"A multi-agent architecture for modelling and simulation of small military unit combat in asymmetric warfare,","venue":null,"work_id":"10d1f371-122e-47ec-a353-bb989d7c4b8d","year":2010},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.962165Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:fce6557a9e6e13149c2354e3a8ba93c1a7bb3641f45ca25de30d30028c90d5d7","observation_id":"a290e803-a801-4d73-a149-4dac1b16008a","resolution":{"observed_at":"2026-08-06T23:01:14.334043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.319105Z","title":"Learning scalable policies over graphs for multi-robot task allocation using capsule attention net- works,","venue":null,"work_id":"b2f924e7-b027-4497-be86-1ea7779ae3c5","year":2022},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.967142Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:c2051c46838ccfe1f31dc91c4c5c2d98289971cb22de6e020feb8ef44ba3276d","observation_id":"d89e0d37-513b-4a67-ae4f-09c0b5e66230","resolution":{"observed_at":"2026-08-06T23:01:14.322778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.308275Z","title":"Efficient planning of multi-robot collective transport using graph reinforcement learning with higher order topological abstraction,","venue":null,"work_id":"477e5da7-f55d-4a63-89d8-a5b9692e13e6","year":2023},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.970870Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:677dfb2637e01b69e9ba3fdd1cd63d9962d36a7f320bfd463ad47a8d09992304","observation_id":"d57224cd-242a-452b-98fc-f28336a99b93","resolution":{"observed_at":"2026-08-06T23:01:14.312061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.293342Z","title":"The cooperative orienteering problem with time windows,","venue":null,"work_id":"b51607e9-d971-400e-81fe-4d5628316a81","year":2014},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.974152Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:e20d857cb091e0f375d85bfb3a766dbf1ca03bc7b05bd664b21e703695d3da1f","observation_id":"dcb2b538-7f9c-47e5-8ea1-53b58536a71a","resolution":{"observed_at":"2026-08-06T23:01:14.299798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.281592Z","title":"A solution approach to the orienteering problem with time windows and synchronisation constraints,","venue":null,"work_id":"cd461593-a737-4ac9-a26b-baf79c0e20eb","year":2020},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.977716Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:881bc17a9cfd00bd042fa1d4682835adb83e958f9e5746b66438fb5dc34460eb","observation_id":"4a6b93b1-0189-4ea5-b63f-7f8dbb9bffd0","resolution":{"observed_at":"2026-08-06T23:01:14.285379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.268959Z","title":"A formal analysis and taxonomy of task allocation in multi-robot systems,","venue":null,"work_id":"8f3f853b-a1f4-4f11-bc60-5332ad0bcf72","year":2004},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.981479Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:ff03ae794ba61d59574744877b67a348934e5fdefcbb24dc54ed9a5a87fce189","observation_id":"8b23c1dc-9116-4f3e-9b8c-8c05cabda7e8","resolution":{"observed_at":"2026-08-06T23:01:14.272965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.257826Z","title":"Iterated local search for time- extended multi-robot task allocation with spatio-temporal and capacity constraints,","venue":null,"work_id":"167339aa-f1aa-4f6b-8c31-5487ad512cf9","year":null},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.985170Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:3ad072bfb773903817e2ab56d4c41fcf6e91a7f2fa591e618c9a402548c2d31d","observation_id":"bfaffbdc-94ad-4ad0-bfba-ca377f03d349","resolution":{"observed_at":"2026-08-06T23:01:14.261305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.233824Z","title":"A meta-heuristic approach for capacitated vehicle routing problem in fuel distribution,","venue":null,"work_id":"4fb583ed-ca55-4a13-972b-860931f13e6a","year":2024},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.991905Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:3945ff7a7b7dcf6c0e89fbf1152023bb4303b98767b1e76b6587bacb6cd2ec60","observation_id":"d8e70fdf-3739-4610-81fe-70a639c471b5","resolution":{"observed_at":"2026-08-06T23:01:14.239061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.221631Z","title":"An augmented large neighborhood search method for solving the team orienteering problem,","venue":null,"work_id":"a79793fa-28b7-4777-abd0-22e238cc7ce9","year":2013},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.995421Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:bdd0b5762dea78663c90fe7141b19d34c2ba47cef9443a706949bf2f64003659","observation_id":"deacbc68-c82c-4d5e-8a25-77f5ffb88647","resolution":{"observed_at":"2026-08-06T23:01:14.225182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1110.0377","last_updated":"2011-10-04T01:04:50Z","snapshot_observed_at":"2026-07-06T02:35:05.258609Z","submitted_at":"2011-10-03T15:17:34Z","title":"A novel nonlinear spin wave theory for the spin 1/2 antiferromagnetic Heisenberg model on a triangular lattice","version":2},"cited_work":{"arxiv_id":"1110.0377","doi":null,"metadata_source":"pith","pith_arxiv_id":"1110.0377","snapshot_observed_at":"2026-08-06T23:01:14.152821Z","title":"A novel nonlinear spin wave theory for the spin 1/2 antiferromagnetic Heisenberg model on a triangular lattice","venue":"cond-mat.str-el","work_id":"4062a968-c50f-4e2e-96ea-7d927292cba5","year":2011},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.998510Z"},"links":{"cited_paper":"/paper/1110.0377","citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:ae24997695bef9739526738fbfe07c2af52414646eee52439ccb5ea8bfe1094c","observation_id":"25619fd8-aac9-4b28-92fe-b674802b0065","resolution":{"observed_at":"2026-08-06T23:01:14.157553Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.211320Z","title":"Fast scheduling of robot teams performing tasks with temporospatial constraints,","venue":null,"work_id":"7f0a66aa-4370-4a14-a45c-f3fd119d1e86","year":2018},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.002076Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:495aaa7d2d28907364b31e1c27ecc31c5491d4875814b9e2c69fd59dad1b939a","observation_id":"3da10ebc-ff12-4447-a18b-52ba66bd44ba","resolution":{"observed_at":"2026-08-06T23:01:14.215147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.199953Z","title":"Non-cooperative- game-based multi-agent collaborative planning method for distributed generations,","venue":null,"work_id":"6f4cb804-5fb6-4fd7-8d96-875f1ac2fe2c","year":2020},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.006188Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:fb6b934db9e4c70e44aacab498132204b18276a91499efc51a24b9b8535f1e4c","observation_id":"3066076d-6e43-46d9-a6ef-2a419c2aacb1","resolution":{"observed_at":"2026-08-06T23:01:14.204223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/int.23075","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Diversifying agent’s behaviors in interactive decision models,","venue":"International Journal of Intelligent Systems","work_id":"b3cc582c-3bca-43ee-bbd5-bdd75fa19b0a","year":2022},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.010018Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:8695c47c147b4ad778583d9a9a6f7cbda4b9d013b64f822eec27773b0eace807","observation_id":"8cab10a7-1344-4f9e-a2a1-b70dedb4ab7c","resolution":{"observed_at":"2026-08-06T23:01:14.076963Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1115/1.4065883","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Learning to allocate time-bound and dynamic tasks to multiple robots using covariant attention neural networks,","venue":"Journal of Computing and Information Science in Engineering","work_id":"87827d3b-f072-4b4e-937c-f80d32971616","year":2024},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.013332Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:9a0306acc732f83058c57d6a95e7a9c6917302ec13490c4a183115d4a984576e","observation_id":"638920ed-5522-41f4-a548-20d668d6cc92","resolution":{"observed_at":"2026-08-06T23:01:14.064417Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.188773Z","title":"Toward soft heterogeneity in robotic swarms,","venue":null,"work_id":"849ec28f-a8c8-4a27-8b8f-7dd212d41e5c","year":2013},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.016535Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:cefbff63f50f89e92c2aa0e13bf4108a9bd1af382008c7289cb6f70e8529fb68","observation_id":"0c9633a8-299d-4788-a5b9-0bd259a35878","resolution":{"observed_at":"2026-08-06T23:01:14.192969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.178646Z","title":"Adaptive neuroevolution with genetic operator control and two-way complexity variation,","venue":null,"work_id":"50750bf1-e1fb-41c6-96cb-6f7e4f9a5e10","year":2023},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.020155Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:8f4fe4db33bb0d0b40dd618b91bfb14896914d82c3550f2f611f07c1f7a5d5cc","observation_id":"9357d345-65be-4bb1-a418-33195d85279a","resolution":{"observed_at":"2026-08-06T23:01:14.182162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.08090","last_updated":"2018-08-26T00:13:38Z","snapshot_observed_at":"2026-08-10T04:32:40.792688Z","submitted_at":"2018-05-21T14:38:31Z","title":"Graph Capsule Convolutional Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.08090","snapshot_observed_at":"2026-08-06T23:01:14.030192Z","title":"Graph capsule convolutional neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.030192Z"},"links":{"cited_paper":"/paper/1805.08090","citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:473c9b0d876d5ade8f45d0e222d16c8fb24f2d4222c6d4aa9b4ceb5175cf9466","observation_id":"8b9486d9-3950-48ec-9f7c-dd7715f7de10","resolution":{"observed_at":"2026-08-06T23:01:14.030192Z","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-06T23:01:14.034258Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.034258Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:3c5fc1affd29f5761c2c6e75eb0ff886bcfb5cd8a224221a48090bff485d69a9","observation_id":"26614bd5-9d68-4a95-8ae2-b7ea53037688","resolution":{"observed_at":"2026-08-06T23:01:14.034258Z","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-06T23:01:14.037729Z","title":"Stable-baselines3: Reliable reinforcement learning implementations,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.037729Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:55a9d4fe304439b7928c1c4b3abd8af32ccb06903fbc85d8f0edb887b8454c6a","observation_id":"8a0b61e2-744f-4aa7-897c-4be23c6654ab","resolution":{"observed_at":"2026-08-06T23:01:14.037729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-06T23:01:14.027016Z","title":"Available: http://arxiv.org/abs/1707.06347","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:14.027016Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:1c90f5e5cb839a4f0097bb9e2467f79b30cea6b1ca9f44fe5e5f9135bbaa4049","observation_id":"3ad2a09d-5d60-4529-b64c-a2a55fa92b46","resolution":{"observed_at":"2026-08-06T23:01:14.027016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:01:14.246855Z","title":"Available: https://api.semanticscholar.org/CorpusID: 69802635","venue":null,"work_id":"b152e1e3-f9ef-4408-aefd-a326a7116c2b","year":null},"citing_paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T23:01:13.988516Z"},"links":{"citing_paper":"/paper/2506.20031"},"observation_digest":"sha256:5b4dd6a6ba10f3dbba2be41ce6a1c305ab2ff2288ddafb6bf2692e6caf51639a","observation_id":"f120e7c3-1e25-42b5-b2fb-68e63fe70c2f","resolution":{"observed_at":"2026-08-06T23:01:14.250377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.20031","last_updated":"2025-07-29T00:31:23Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T22:53:42.928022Z","submitted_at":"2025-06-24T21:58:30Z","title":"Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":4,"verified_exact":6,"verified_fuzzy":15},"total_outbound_references":26},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2506.20031."}