{"as_of":"2026-08-07T22:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34e8e70abae8a6c7c87aef8b3c1e59d75d02610c2d9a8712fef2e27c76e7bb83","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:48:17.861016Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.07302/citation-record","integrity":"/paper/2507.07302/integrity","json":"/paper/2507.07302/citation-record.json","paper":"/paper/2507.07302"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:48:17.812778Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.812778Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:f5e870aa58b9b4b5f5c5fdcee363d3dba8b938b6ff37a6114b60485d28aadde8","observation_id":"e4d7f3dd-b69e-4a0e-9b67-5543bcd91e29","resolution":{"observed_at":"2026-08-06T18:48:17.812778Z","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-06T18:48:17.815901Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.815901Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:dd4514a13801c2af376d4c38ee846822096759a94317e5db48bd2034c891405d","observation_id":"77493bc3-aed9-4043-acf1-ad104c6e4e19","resolution":{"observed_at":"2026-08-06T18:48:17.815901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.03249","last_updated":"2025-02-24T00:58:13Z","snapshot_observed_at":"2026-08-05T14:15:00.395755Z","submitted_at":"2023-10-05T01:42:16Z","title":"Can Large Language Models be Good Path Planners? A Benchmark and Investigation on Spatial-temporal Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.03249","snapshot_observed_at":"2026-08-06T18:48:17.818646Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.818646Z"},"links":{"cited_paper":"/paper/2310.03249","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:96aaf36ce2ef3ca4e679bf11180ac808a3e1aff285ae05fb1c6e4d5039b3e2f4","observation_id":"7a64bd95-3f08-498d-a2d6-430e667fa746","resolution":{"observed_at":"2026-08-06T18:48:17.818646Z","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-06T18:48:18.029812Z","title":"V.; Christianos, F.; and Sch\\\"afer, L","venue":null,"work_id":"cde5cb9c-5863-4209-bc3f-d5f308a20ec4","year":2024},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.821609Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:df3c576ed42f354459ad29e09348e4fafe602ff1a10f40cd1b6618f2d532e0ff","observation_id":"245e0e15-c97b-4e07-bcff-0f3d14311b93","resolution":{"observed_at":"2026-08-06T18:48:18.032394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.01502","last_updated":"2017-11-07T20:45:59Z","snapshot_observed_at":"2026-07-06T05:45:39.485902Z","submitted_at":"2017-06-05T19:01:26Z","title":"UCB Exploration via Q-Ensembles","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.01502","snapshot_observed_at":"2026-08-06T18:48:17.824172Z","title":"Y.; Sidor, S.; Abbeel, P.; and Schulman, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.824172Z"},"links":{"cited_paper":"/paper/1706.01502","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:1f0f408dd1299c5e793f0b649e2cbae5519d57026ed75da819f67909033890e3","observation_id":"01cb9d14-27c9-49de-90a8-9cb70d15ebfb","resolution":{"observed_at":"2026-08-06T18:48:17.824172Z","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-06T18:48:18.021598Z","title":null,"venue":null,"work_id":"798b13d9-0262-4209-b0ef-d2c29903d63c","year":2021},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.826995Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:1be8f5502caf88f66cede70bfdfd886787ad77dac479704ca7270864863aff8b","observation_id":"4cc08db7-11d9-45d2-abbb-3d6dc4b86a2b","resolution":{"observed_at":"2026-08-06T18:48:18.024359Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06692","last_updated":"2023-09-15T02:42:40Z","snapshot_observed_at":"2026-08-04T02:01:09.531676Z","submitted_at":"2023-02-13T21:16:03Z","title":"Guiding Pretraining in Reinforcement Learning with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06692","snapshot_observed_at":"2026-08-06T18:48:17.829460Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.829460Z"},"links":{"cited_paper":"/paper/2302.06692","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:ee0c28f28b7f78ab2040fbbdf20edc5c085e7f6893da795f021d8904848e85b1","observation_id":"69549246-4d4f-4c4b-9981-7ba6beb04456","resolution":{"observed_at":"2026-08-06T18:48:17.829460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.05334","last_updated":"2023-01-13T00:07:08Z","snapshot_observed_at":"2026-07-06T14:40:53.980335Z","submitted_at":"2023-01-13T00:07:08Z","title":"TransfQMix: Transformers for Leveraging the Graph Structure of Multi-Agent Reinforcement Learning Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.05334","snapshot_observed_at":"2026-08-06T18:48:17.832337Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.832337Z"},"links":{"cited_paper":"/paper/2301.05334","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:199558cd60476032b17a3cb45f875398080f5fc553f0422d3a42c1c0909adcc6","observation_id":"4fe27134-b04e-45e8-9654-655a59bd277b","resolution":{"observed_at":"2026-08-06T18:48:17.832337Z","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-06T18:48:18.012590Z","title":null,"venue":null,"work_id":"16d0d84e-c393-4b9b-86ed-bb15d2508861","year":2023},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.835130Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:1087bb48f8a441cf8dcb729110db7e959c429fead27dea920906d04c2e2b4e0a","observation_id":"aa3f1c20-bc29-467b-81d1-ee06cd52edc8","resolution":{"observed_at":"2026-08-06T18:48:18.015642Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03604","last_updated":"2024-06-21T09:02:22Z","snapshot_observed_at":"2026-08-05T02:47:35.216955Z","submitted_at":"2023-06-06T11:49:09Z","title":"Enabling Intelligent Interactions between an Agent and an LLM: A Reinforcement Learning Approach","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.03604","snapshot_observed_at":"2026-08-06T18:48:17.837436Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.837436Z"},"links":{"cited_paper":"/paper/2306.03604","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:129d0b775c55e41c6136aaeeb6ceab328bb8b6744ccb31bc18251fb040c1932c","observation_id":"dc315893-5824-43fa-83cd-ec954e3c8ebb","resolution":{"observed_at":"2026-08-06T18:48:17.837436Z","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-06T18:48:18.004955Z","title":null,"venue":null,"work_id":"b037ab0e-30d3-4c69-8d2b-92d364f90aea","year":2023},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.839803Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:90ee6160b2252b6b9ede1a4ec58df435929c18296a27f9be7466036e8ee20ba6","observation_id":"af8006f2-009c-4d66-9f4a-d046cf46577a","resolution":{"observed_at":"2026-08-06T18:48:18.007411Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.08232","last_updated":"2022-12-16T01:41:59Z","snapshot_observed_at":"2026-08-02T20:25:21.939753Z","submitted_at":"2022-12-16T01:41:59Z","title":"Offline Robot Reinforcement Learning with Uncertainty-Guided Human Expert Sampling","version":1},"cited_work":{"arxiv_id":"2212.08232","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.08232","snapshot_observed_at":"2026-08-06T18:48:17.926725Z","title":"Offline Robot Reinforcement Learning with Uncertainty-Guided Human Expert Sampling","venue":"cs.LG","work_id":"1362b97b-3969-4653-83c7-7a179177a0cd","year":2022},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.842040Z"},"links":{"cited_paper":"/paper/2212.08232","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:05a99bb235897d791d9ba687a384675bebe385f52b4912e402fbf3fdfec58cd0","observation_id":"0bb2d081-bfcd-427c-bd56-2e4ffd958a5b","resolution":{"observed_at":"2026-08-06T18:48:17.932047Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:48:17.996878Z","title":"A.; and Schwing, A","venue":null,"work_id":"c46cb680-ba8e-47e2-bdc5-59fb21689e70","year":2021},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.844601Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:665eb5b1899368794b4968518750008516fbd532aac4c249a71a277d036da0f5","observation_id":"d4674937-3ca0-455b-9e79-f70d2afa7f1b","resolution":{"observed_at":"2026-08-06T18:48:17.999265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T18:48:17.989088Z","title":null,"venue":null,"work_id":"b90cf746-8602-491c-9f9b-f8c878df1857","year":2017},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.846758Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:88d71defaba1bb88c55a71f9f56642030ae8163ae34de36c9fbf8f5b1e044d2b","observation_id":"bb3689af-9d12-49ee-81be-a73de0157d67","resolution":{"observed_at":"2026-08-06T18:48:17.991759Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.04908","last_updated":"2018-07-24T04:13:05Z","snapshot_observed_at":"2026-07-06T05:33:39.576355Z","submitted_at":"2017-03-15T03:30:13Z","title":"Emergence of Grounded Compositional Language in Multi-Agent Populations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.04908","snapshot_observed_at":"2026-08-06T18:48:17.848779Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.848779Z"},"links":{"cited_paper":"/paper/1703.04908","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:4cac83c188ecca909740b0d55fe8276a642880396a640b40e6e9559c0e92789b","observation_id":"9ec82759-c4d1-4e63-b425-8c4b5d2cb23e","resolution":{"observed_at":"2026-08-06T18:48:17.848779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.11485","last_updated":"2018-06-06T17:58:09Z","snapshot_observed_at":"2026-08-06T12:03:41.509273Z","submitted_at":"2018-03-30T14:23:39Z","title":"QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.11485","snapshot_observed_at":"2026-08-06T18:48:17.851187Z","title":"S.; Farquhar, G.; Foerster, J.; and Whiteson, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.851187Z"},"links":{"cited_paper":"/paper/1803.11485","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:c8dba0553da98ecbb9b8575599d96416a7f95bfced22d840cc5ff8ac1925c490","observation_id":"9b66142a-d4d1-4d0b-b2ef-9e2057a5e2fa","resolution":{"observed_at":"2026-08-06T18:48:17.851187Z","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-06T18:48:17.981714Z","title":null,"venue":null,"work_id":"6ee33f64-c4c4-45fa-bd03-0b81e2b8f0e6","year":2019},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.853592Z"},"links":{"citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:973f33b2b491b0d9411ff257f4026c72c4d566dcdc3ce1a782f8de5c73ab71cc","observation_id":"5328cec8-38e2-4171-9fb3-37ad0b295641","resolution":{"observed_at":"2026-08-06T18:48:17.984095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.10498","last_updated":"2023-11-26T01:15:41Z","snapshot_observed_at":"2026-07-06T13:23:11.566484Z","submitted_at":"2022-06-21T16:15:27Z","title":"PlanBench: An Extensible Benchmark for Evaluating Large Language Models on Planning and Reasoning about Change","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.10498","snapshot_observed_at":"2026-08-06T18:48:17.855773Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.855773Z"},"links":{"cited_paper":"/paper/2206.10498","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:5e194efd16c991f019429e4a106b47396413a25f1c7af6de1b3e5312358b38db","observation_id":"d2e22f05-25ae-4671-b40e-d5b1c81925dc","resolution":{"observed_at":"2026-08-06T18:48:17.855773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.04334","last_updated":"2024-01-09T03:22:16Z","snapshot_observed_at":"2026-07-06T17:13:08.935785Z","submitted_at":"2024-01-09T03:22:16Z","title":"Large Language Models for Robotics: Opportunities, Challenges, and Perspectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.04334","snapshot_observed_at":"2026-08-06T18:48:17.858056Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.858056Z"},"links":{"cited_paper":"/paper/2401.04334","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:f0e2bc1ee4fdd5e0353710392a979dfe490e5be2c491e93934b2788e9c016d65","observation_id":"1e67e8ca-531e-4eb5-b3fa-69138a8e51f6","resolution":{"observed_at":"2026-08-06T18:48:17.858056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05685","last_updated":"2023-12-24T02:01:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-09T05:55:52Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05685","snapshot_observed_at":"2026-08-06T18:48:17.861016Z","title":"P.; Zhang, H.; Gonzalez, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:48:17.861016Z"},"links":{"cited_paper":"/paper/2306.05685","citing_paper":"/paper/2507.07302"},"observation_digest":"sha256:6259f7d98b0429ce931f39d375f0b9f82e008d82e77ccd8bd97d2f053660b990","observation_id":"f6e2855a-246c-4ab4-9b15-ec24e1f1503d","resolution":{"observed_at":"2026-08-06T18:48:17.861016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.07302","last_updated":"2025-07-09T22:01:32Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T05:56:16.811721Z","submitted_at":"2025-07-09T22:01:32Z","title":"Application of LLMs to Multi-Robot Path Planning and Task Allocation"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":2},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2507.07302."}