{"as_of":"2026-08-05T03:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9bbcc4a7a7bbbc75be364e90a39054071c29f2da801fe9c1468d66901726244b","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T05:24:06.422200Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2605.14085/citation-record","integrity":"/paper/2605.14085/integrity","json":"/paper/2605.14085/citation-record.json","paper":"/paper/2605.14085"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Toward a systems- and control-oriented agent framework","venue":null,"work_id":"34bd9c35-219a-4e52-906c-25b987f13493","year":2005},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:57702552ffca4dcc2d5fb92795037d016b27c7ba2fb70bb3ec102249edcca6ed","observation_id":"2f982b8c-350b-4f31-9d33-a58cc41d298d","resolution":{"observed_at":"2026-05-15T05:25:05.628362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Mission-Driven Trajectory Homotopy to Explore Dynamic Coverage of USV–UA V Sys- tems","venue":null,"work_id":"accd8404-d131-43b6-a2b3-f9aca524e90e","year":2025},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:4b91e7d713973bf0401a017c9e979468ba6ab98ac9ab1976a369c0e7628fcc63","observation_id":"d8bb5ba8-38be-49cc-b92e-4e2ac1618807","resolution":{"observed_at":"2026-05-15T05:25:05.633304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A Universal Reactive Approach for Graph-Based Persistent Path Planning Problems With Temporal Logic Constraints","venue":null,"work_id":"b18aab38-b54e-4e43-81be-47cb026bce9e","year":2025},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:ac6573ccd8f9cd501444a9c06235e5acf790734f91aa4414005c56741633f301","observation_id":"52f274ab-230a-4e76-9646-00dc84588aef","resolution":{"observed_at":"2026-05-15T05:25:05.638556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Distributed Search Planning in 3-D Environments With a Dynamically Varying Number of Agents","venue":null,"work_id":"b870c928-8748-4ff9-aab4-3d9615b6f4d6","year":2023},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:b5e81d6af90c6d9385c2f92177dfc98790bef31d25af298c995f0c4c827e1e6f","observation_id":"81f2e7e1-5a1c-44f5-b25e-d20e96a7aefc","resolution":{"observed_at":"2026-05-15T05:25:05.619140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Decentralized Motion Planning for Multiagent Collaboration Under Coupled LTL Task Specifications","venue":null,"work_id":"5c4125b8-3fd2-4f45-8f2f-3586b438e148","year":2022},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:c11382d036be72330a6439f82fc85aa44f7d6bcad0494c59a633415a56a5c3c9","observation_id":"f43c0859-b8fb-46e9-9036-676c96ecbbb5","resolution":{"observed_at":"2026-05-15T05:25:05.614496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Synthesis of a Time-Varying Communication Network by Robot Teams With Information Propagation Guarantees","venue":null,"work_id":"bc3d9065-e3d2-488b-b4f8-d26ebc822797","year":2020},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:84d2a64b95805ce0de18febd55e9b15106ff0bdd53d99d9f270bbae603832714","observation_id":"b4effedc-43f7-4c0b-b5ca-41b87a78871b","resolution":{"observed_at":"2026-05-15T05:25:05.596221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A Real-Time and Fully Distributed Approach to Motion Planning for Multirobot Systems","venue":null,"work_id":"9b506be0-850e-4101-9be4-151005dddeea","year":2019},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:3254636f2d6aef19e4084cf716ea660876ba69ccf37cf2e01616dc9f05852419","observation_id":"10fa737c-c25a-4a1e-91f4-8b14bc259af5","resolution":{"observed_at":"2026-05-15T05:25:05.592156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01306","last_updated":"2023-10-05T23:18:40Z","snapshot_observed_at":"2026-07-06T13:17:01.373088Z","submitted_at":"2022-06-02T21:23:16Z","title":"Deceptive Planning for Resource Allocation","version":2},"cited_work":{"arxiv_id":"2206.01306","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2206.01306","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deceptive Planning for Resource Allocation","venue":null,"work_id":"973ae84f-2fd6-4040-939a-fce28d7ce853","year":2022},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"cited_paper":"/paper/2206.01306","citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:34e418aa3a4c6834f9e86e11db92c3e63bb0b5aee720f880e5a51b2e317f5ef8","observation_id":"b5885f74-d2e0-4b8d-a135-692628e65de9","resolution":{"observed_at":"2026-05-15T05:25:04.071800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Deceptive Path Planning via Reinforcement Learning with Graph Neural Networks","venue":null,"work_id":"3e4a4d31-e580-4e60-8dfe-9abd962f599e","year":2024},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:778ce4822bfc823c4bb3b8766272607310e43b837c0952f46d52307112ade577","observation_id":"ad1adfad-66ff-449d-a9c1-b3409d14af54","resolution":{"observed_at":"2026-05-15T05:25:05.600522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Deceptive Decision-Making Under Uncertainty","venue":null,"work_id":"defc986c-8c12-4da5-b91e-d947cc45a486","year":2022},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:e80a63402e5a3aaabcb2fadf160bc7fa43b812841a701d3d6a9d29068401fed2","observation_id":"a46c4393-d2a7-495a-8b8e-b820864737a6","resolution":{"observed_at":"2026-05-15T05:25:05.609645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Single Real Goal, Magnitude- Based Deceptive Path-Planning","venue":null,"work_id":"d3792c3e-ca5c-44e5-b53c-618ad57e4746","year":2020},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:aeb8d97deb9278b8f7f5cdf94fc28561a5e41ee03d642e83725c8016cf860f55","observation_id":"8f3bbc7c-5603-40ff-8758-8016b84a2d5d","resolution":{"observed_at":"2026-05-15T05:25:05.604675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On Almost-Sure Intention Deception Planning that Exploits Imperfect Observers","venue":null,"work_id":"07733c1d-19a6-466a-98d7-9b5814567602","year":2022},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:e9039bd56e28b50e7bc533169d2e307ef793f596bdd42fa7a6b534f5602190a0","observation_id":"584e5776-a8ad-42a7-9f6f-28328d20d1a9","resolution":{"observed_at":"2026-05-15T05:25:05.648103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Optimal Deceptive Strategy Synthesis for Au- tonomous Systems Under Asymmetric Information","venue":null,"work_id":"bb484aed-1bd8-4e85-8870-cb86094a0c9e","year":2024},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:9e0b96b43f59c963fcaf253b927b0b63dbafc1c1db1922ae90710ad4a8b10e1d","observation_id":"e3834da8-b06b-460c-8f93-eb5fa4ec13bf","resolution":{"observed_at":"2026-05-15T05:25:05.587786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Domain-Independent Deceptive Planning","venue":null,"work_id":"313f0d81-edc3-45b7-a25c-c2eb79f25e8f","year":2023},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:704642456305d9b6b23cbb67cb31d5e975f7521861c08e72c185a6f732e95899","observation_id":"f79f211d-63fe-48d9-9814-503898bb0aca","resolution":{"observed_at":"2026-05-15T05:25:05.573914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"The CADETOPATH Framework: Case-Based Deceptive Topographic Path Planning for Computing, Recording, and Reusing Deceptive Path Plans in Agent-Based Simulation Systems","venue":null,"work_id":"17edac6b-be78-4bcc-aa0f-bf42c8b60b0d","year":2025},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:2a83c46b5dcd5b6da0d39ddb586b6185fa6630996a4e8fa2f4ddbb37925b6775","observation_id":"653045f8-c06b-4d20-b2f8-ac381fdef081","resolution":{"observed_at":"2026-05-15T05:25:05.578247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Improving the Scalability of the Magnitude-Based Deceptive Path-Planning Using Subgoal Graphs","venue":null,"work_id":"f30095ca-6680-4ef4-afe7-6c818a216697","year":2020},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:d192612a15f3453f8e8100e4ab23b8a6fc14d6d0b3abe0e4823558242d98e688","observation_id":"cc8673a3-f2c6-4a55-b7ca-d72cb7729450","resolution":{"observed_at":"2026-05-15T05:25:05.545769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Efficient Deceptive Path Planning for UA Vs via Attention-Based Reinforcement Learning","venue":null,"work_id":"5dda4da2-5cc2-4b42-91b1-fe00cbbebafd","year":2026},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:cf7e94eb47a8fadfe3e1bd0bcbd1da0580949a3a4f816e035e679010f31d2d07","observation_id":"1ae72147-0101-4d75-878c-c21973e486c9","resolution":{"observed_at":"2026-05-15T05:25:05.550148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Deceptive Path Planning via Count-Based Reinforcement Learning under Specific Time Constraint","venue":null,"work_id":"2ebcd687-fe48-4cf7-b9e5-3bb121665d9f","year":1979},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:03952dfee335706eb95b472f2f788647a814110400d500a38cecdbf50e7832e9","observation_id":"5c0a2c87-68d0-4201-a3ca-dd5bc9a90c80","resolution":{"observed_at":"2026-05-15T05:25:05.559359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Deceptive Robot Motion: Synthesis, Analysis and Experiments","venue":null,"work_id":"f01a462d-ba12-4f23-97b9-710f11722b60","year":2015},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:10565397d4d04c1c5ee80ff38719f179600d7cae2eb7aef75375632a3bd111e8","observation_id":"91dd70cb-9dfb-419a-82ad-dbf76502a089","resolution":{"observed_at":"2026-05-15T05:25:05.623657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Randomized Path Planning with Deceptive Strategies","venue":null,"work_id":"b3c76098-9160-4d0e-adbb-bf005927245e","year":2005},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:c0b243815aacba8ad51649972b2382790f20fcb0c5a4fd1b169ad6b1ff4f53e9","observation_id":"6352b370-080a-4917-b3d0-03f6b8049852","resolution":{"observed_at":"2026-05-15T05:25:05.563978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Deceptive Path-Planning","venue":null,"work_id":"ffc89680-5d7b-4b79-927a-6dd96578d65f","year":2017},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:86839d1944ec64f56672504bbb228f3b297cdb2dc0604073f1eb1d2652a279ef","observation_id":"d0f083d0-d9c5-498c-bf01-894952e845f3","resolution":{"observed_at":"2026-05-15T05:25:05.652587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Agent Deception via Polynomial Path Planning","venue":null,"work_id":"ba03e575-7be9-46e2-8fe3-7e0c54d394a9","year":2025},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:c0e224dc6901c06d7619fe144121d20cba2f6a4a068f41e6182df743eb940237","observation_id":"f0f9b1db-1560-4ac5-bab3-5ba1477eab5e","resolution":{"observed_at":"2026-05-15T05:25:05.643076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Collaborative UA V Path Planning with Deceptive Strategies","venue":null,"work_id":"49c81f5b-ab95-465c-b2c8-47f239ea5331","year":2005},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:9d7c1f1775a1cd70dff35757e6a8751d7142e9db42aa8370da409b3e994477c9","observation_id":"e5219c59-454f-4ada-8422-ed43f8d1ad3d","resolution":{"observed_at":"2026-05-15T05:25:05.536616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"82ebb07a-8f8d-416d-89d0-7d0738474ebd","year":2018},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:f254595bb8b9253fb0f230f69203eb4c2d58873678ed5a522ff1338e50e1dffe","observation_id":"4e7343d5-9d40-4787-88f1-0a6e8a68d03a","resolution":{"observed_at":"2026-05-15T05:25:05.540955Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Finite-Time Analysis of the Multiarmed Bandit Problem","venue":null,"work_id":"35b8fc38-14ba-4cf7-a509-36f028986e70","year":2002},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:d7521cf53944e56de79bb7d66e565cfb7acc14f04c92792ec5a376ea78d79729","observation_id":"9f40a573-c69d-496e-b13d-42b45085f23a","resolution":{"observed_at":"2026-05-15T05:25:05.583066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems","venue":null,"work_id":"6fbcfdb4-541b-4a9b-b1fe-7aeb1462791c","year":2012},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:b793b05604c76670023238bb3d3c1448f240f9abe74805fb118d452ca684dab3","observation_id":"aa162078-59ec-4a5a-829a-93f718e8e3fb","resolution":{"observed_at":"2026-05-15T05:25:05.554563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On the Likelihood that One Unknown Probability Exceeds Another in View of the Evidence of Two Samples","venue":null,"work_id":"5c80c7e6-99fe-4915-88c2-200a6c88af13","year":1933},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:da0093056e6d6d8a3a212647ae62635f97ae8916820d81986bb4f59965f15e81","observation_id":"4075d3de-534b-4748-9407-5982fc457440","resolution":{"observed_at":"2026-05-15T05:25:05.569342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Weitere Studien ¨uber das W ¨armegleichgewicht unter Gasmolek¨ulen","venue":null,"work_id":"0acd6c2f-f291-42b3-828e-3b476ef9ff88","year":null},"citing_paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-15T05:24:06.422200Z"},"links":{"citing_paper":"/paper/2605.14085"},"observation_digest":"sha256:8077f55227be5d0edade30795745ea0da60d42e4efbea71ba33e6475a0195f1a","observation_id":"1c685bbc-1e39-421c-9610-a2bfdbbd027a","resolution":{"observed_at":"2026-05-15T05:25:05.531838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.14085","last_updated":"2026-05-13T20:10:35Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-02T10:56:00.778409Z","submitted_at":"2026-05-13T20:10:35Z","title":"Receding Horizon Multi-Agent Deceptive Path Planner"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":26},"total_outbound_references":28},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2605.14085."}