{"as_of":"2026-08-20T03:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e08ed64c8a894ee7fe2f9edf53da8dad015d937e7461edc7306e88d804804284","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T09:25:39.543939Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2606.12614/citation-record","integrity":"/paper/2606.12614/integrity","json":"/paper/2606.12614/citation-record.json","paper":"/paper/2606.12614"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:25:39.543939Z","title":"Dependable demand response management in the smart grid: A stackelberg game approach,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:40956155f0bdaf38f234b55a8168cf497dbe42877c9f2d1607149bc7e2f3a7b4","observation_id":"2fc62d92-f584-4170-b526-21c2e6ed8f10","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"A game theoretical model for adversarial learning,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:d71b8105a0b7ba63bac05dc9d650e8f289b4691c564f0e2ad64ab6856e3ac91f","observation_id":"ce308e4e-8aee-46a9-bba3-c2b51fbb2041","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"Stackelberg game-based pricing and offloading in mobile edge computing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:6241dd94e7d3c9a718238014c1c5a9f4afbe55e344f86a042debed4719cb1beb","observation_id":"67c46271-7964-4e15-b6e8-8296641d51dc","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09246","last_updated":"2024-06-25T02:55:44Z","snapshot_observed_at":"2026-08-19T20:35:37.673554Z","submitted_at":"2024-02-14T15:34:38Z","title":"Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots","version":4},"cited_work":{"arxiv_id":"2402.09246","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09246","snapshot_observed_at":"2026-07-03T11:38:05.437944Z","title":null,"venue":null,"work_id":"cedb33b3-7c37-4a8c-83f4-bfc36f38fc55","year":2024},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"cited_paper":"/paper/2402.09246","citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:b70fe423c4449b9706b71c1c0dea414f753fac9d8d1ea19ab853cdd9ec264257","observation_id":"66b0c156-190e-48c6-99dd-8f7a3879cdfb","resolution":{"observed_at":"2026-07-03T11:38:05.439339Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:25:39.543939Z","title":"Branch-and-bound methods: General formulation and properties,","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:5662455ed64461e95a02d08de9ea662ab564b1301c1f7fcff4fa4dce2dbf0835","observation_id":"568bdfa9-5434-466c-a387-4db555bca621","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"A survey on trajectory-prediction methods for autonomous driving,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:a953fc83739d8bdbcd5d0151ff310babd73b5a91475ea9ae89b732d7a6ad7727","observation_id":"350572e9-098c-4fa5-932d-34aab37f564a","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"Human motion trajectory prediction: A survey,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:a5170be2b66f60814eab21da67ce620a32e5484cd083bf5296451a01a7134d9a","observation_id":"70a56480-6cb4-4319-b00b-37e4e23a74c4","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10477","last_updated":"2025-05-22T13:27:22Z","snapshot_observed_at":"2026-08-14T23:26:29.078710Z","submitted_at":"2025-02-13T19:32:41Z","title":"Knowledge Integration Strategies in Autonomous Vehicle Prediction and Planning: A Comprehensive Survey","version":2},"cited_work":{"arxiv_id":"2502.10477","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.10477","snapshot_observed_at":"2026-07-03T11:38:05.440758Z","title":"Manas and A","venue":null,"work_id":"7a0593a5-4932-484d-bb5c-771a6f822386","year":2025},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"cited_paper":"/paper/2502.10477","citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:5f4a0ba1942f6ca8f76ea3395bf4ea35ff27a6b19cb25691f3221330db70cdbe","observation_id":"d1b43576-01be-4e3a-b40f-40ec7a41ac5c","resolution":{"observed_at":"2026-07-03T11:38:05.442204Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:25:39.543939Z","title":"Vehicle trajectory prediction by integrating physics-and maneuver-based approaches using inter- active multiple models,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:1168202989b3dc77e5c3c5782bc0df3ea7dff4b5e14844858d241d5461d9712a","observation_id":"2ccdd8bb-808b-4d66-86bb-f20c8f0d1c10","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"Evolutionary decision-making and planning for autonomous driving: A hybrid augmented intelligence framework,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:76fa11ae1e54d15099e16513722d0ece1a3081959459937a711fc88d4beb72b1","observation_id":"e920f945-bc77-409d-99a8-3b752bf33f93","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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":"2410.04759","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T11:38:05.443358Z","title":"Driving with regulation: Interpretable decision-making for autonomous vehicles with retrieval-augmented reasoning via llm","venue":null,"work_id":"3ff8dce0-4ece-4367-97f1-9ea274d7c54d","year":2024},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:90df04819d7bd631c858a02f55304471fc1f78da247ec62d6fbc0e1a6173de92","observation_id":"437ce284-de90-4806-bb4a-6a75adcf436a","resolution":{"observed_at":"2026-07-03T11:38:05.444958Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:25:39.543939Z","title":"A physical law constrained deep learning model for vehicle tra- jectory prediction,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:acdf6d565932926fc185062a7b4e64dd954220552d522958c0931bf2b2fbed4f","observation_id":"d0a67970-ca5b-433f-8e50-0eaa28698da8","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"Edge computing and its application in robotics: A survey,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:5e664226eff528e3eaaeeb6df3cf695cb286e988b29a98711f338a7841f7a4e0","observation_id":"6edb3eaa-2e84-4ce6-a751-3c28d257fcdb","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"A survey on the convergence of edge computing and ai for uavs: Opportunities and challenges,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:77c8172990d0860f110c416be029d90ff15422905819152bcb698e6dae9b6803","observation_id":"2a9e2dd2-4c0b-494a-9958-d3897c0aacad","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"Partially observable markov decision processes and robotics,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:9904c0336f48e9343ec0fe322c37e1908a0588335d9b83413073a2a984fdb558","observation_id":"1a2b330c-1ed9-4ef9-a705-887d8a4efc76","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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":"2509.23425","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T11:38:05.434882Z","title":"Situational awareness for safe and robust multi-agent interactions under uncertainty,","venue":null,"work_id":"9e8a51e7-9d95-4148-9d92-d8907c0ed765","year":2025},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:68c6ecc267ce515a9b27f081e6dd36c4141b79f11770ad74ec0f813792776499","observation_id":"198cbafd-6097-4f84-a83b-2094f763545f","resolution":{"observed_at":"2026-07-03T11:38:05.436732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:25:39.543939Z","title":"Nesterov,Introductory lectures on convex optimiza- tion: A basic course","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:a1ff4f2f085cdf443a71df946db03707b9e4a9cd019a5c784b4e5765821835c2","observation_id":"0427d2e4-48f1-481c-9762-af9c193bb60e","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","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-06-27T09:25:39.543939Z","title":"Ben-Tal and A","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T09:25:39.543939Z"},"links":{"citing_paper":"/paper/2606.12614"},"observation_digest":"sha256:d73044c435480ca26954af3070ab73558408e4137fca38f0ff1a4db4d6c1efa1","observation_id":"2235f064-690e-4e51-a602-e193dccbd906","resolution":{"observed_at":"2026-06-27T09:25:39.543939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12614","last_updated":"2026-06-10T19:14:56Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-15T08:28:47.390956Z","submitted_at":"2026-06-10T19:14:56Z","title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":18},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2606.12614."}