{"as_of":"2026-08-16T02:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f478ef34f77c71f1cd3085929e30f56d3fb2e5c113d5702c46c5f8ab4a489e1","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:35:36.164607Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2505.14760/citation-record","integrity":"/paper/2505.14760/integrity","json":"/paper/2505.14760/citation-record.json","paper":"/paper/2505.14760"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:35:38.335405Z","title":"Visibility-based deployment of robot formations for communication maintenance,","venue":null,"work_id":"83ff223b-f39f-422d-8710-db1415177376","year":2011},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.215340Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:26f4e7f2c0ef5676c15cdda6ad15977f3f683cd3727244b163e2290ba2a0f7d7","observation_id":"a4783d09-e09e-46c1-b1f9-f4d3ba00b6c6","resolution":{"observed_at":"2026-08-07T15:35:38.428859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:38.194161Z","title":"Decentralized connectivity- preserving deployment of large-scale robot swarms,","venue":null,"work_id":"e28530a4-2ddb-44a6-8e33-ffd056e773e8","year":2018},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.273695Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:7d983a02b7c3d8af22b4c50c4c6d10a7e965dea9d576b1d5939ff2376e9328f6","observation_id":"b364c0fb-6241-4c7c-ba9d-801a534790dc","resolution":{"observed_at":"2026-08-07T15:35:38.264551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:38.094722Z","title":"Robust control of mobility and communications in au- tonomous robot teams,","venue":null,"work_id":"a6a4757b-cd8c-4fb5-b14c-1282f72a913b","year":2013},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.359719Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:d47bd88971ed3e1ad5ad073a0455d6697b4dedfd0fdd163b366f64bf318865d9","observation_id":"d09210b7-c629-48a0-b6c4-9542866dabc1","resolution":{"observed_at":"2026-08-07T15:35:38.120246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.915490Z","title":"A two phase recursive tree propagation based multi-robotic exploration framework with fi xed base station constraint,","venue":null,"work_id":"e926f1dd-a78d-4a92-a491-dc0b95c0b517","year":2010},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.407305Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:287d64d29c8624dd963b38559bc2503d21701e36b6dee6f1e57ff6d9890696bc","observation_id":"be7bad09-010d-46be-90d0-3db5bae0300b","resolution":{"observed_at":"2026-08-07T15:35:38.025350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.820151Z","title":"Multi-robot path planning with maintenance of generalized connectivity,","venue":null,"work_id":"49707838-c811-4971-b14e-5ea15b042366","year":2017},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.451299Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:d39b75a28b1cba9dc3d7c298884e11f362f44b87d65e56d88c117abbcb7d093f","observation_id":"84a6cc92-ac07-4073-a4d3-b5b9eecd0f8b","resolution":{"observed_at":"2026-08-07T15:35:37.878305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.693409Z","title":"Robot teams for intervention in con fi ned and structured environments,","venue":null,"work_id":"706dc740-4891-47b6-b3ca-95f6cc790cf5","year":2016},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.516167Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:c558c2080cd2c4962a62cfbe5a7398002ddfa5a421b277639e23c0c698c8d5ce","observation_id":"a30e9d6c-c1ba-4ab6-8008-6ddcd61a538f","resolution":{"observed_at":"2026-08-07T15:35:37.725963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.545090Z","title":"Distributed data gathering with bu ff er constraints and intermit- tent communication,","venue":null,"work_id":"feefb5b5-17a2-46ee-9ab8-e41941b43722","year":2017},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.608189Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:1deee7d899e848d3ccf2c59d410340f9e0809cddc4e154e6582dabf18237b6a0","observation_id":"d139c1fd-3be0-459b-a5ca-74ea1176b4a8","resolution":{"observed_at":"2026-08-07T15:35:37.651254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.433506Z","title":"Online pickup and delivery planning with transfers for mobile robots,","venue":null,"work_id":"4c468fb7-ad04-4a40-af9a-d2e1e09353bb","year":2014},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.650383Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:a53afd8dcb650a7338c87985050d462ff9dc1b4dd32a2343e2ebe8adc9455540","observation_id":"227efacb-c335-46f8-bdea-da757a84c549","resolution":{"observed_at":"2026-08-07T15:35:37.486927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.307354Z","title":"Dis- tributed on-line dynamic task assignment for multi-robot patrolling,","venue":null,"work_id":"891e40a6-eec8-49ec-948a-975054940d1e","year":2017},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.723562Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:b44a2da501156025a9712280718d6a37e3a7147e613033f43ac7b45939467612","observation_id":"b44216d8-0ce5-48ff-ac75-307f4fab3964","resolution":{"observed_at":"2026-08-07T15:35:37.338611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.145632Z","title":"Msp algorithm: Multi-robot patrolling based on territory alloca- tion using balanced graph partitioning,","venue":null,"work_id":"394c8b1d-6e1a-44d7-946e-c66c7de3f5e7","year":2010},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.779504Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:2bddcd4bac40685d98ef79aed8f1bbc2701a58105abc4b76b9daa0fcdb229f51","observation_id":"cf687de4-a8f3-4623-b73c-b27a32d83438","resolution":{"observed_at":"2026-08-07T15:35:37.240140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:37.064987Z","title":"Asynchronous multirobot exploration under recurrent connectivity con- straints,","venue":null,"work_id":"49e75f00-c8b5-4fda-a97d-215584d56035","year":2016},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.814075Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:0bfd2e240027dbfdb0fb00b47db681b186a779be9c4352d0d3080df60a127b75","observation_id":"a8160a6d-9865-45af-887f-963480b9c16f","resolution":{"observed_at":"2026-08-07T15:35:37.091995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:36.882476Z","title":"Coordinated multi-robot real-time exploration with connec- tivity and bandwidth awareness,","venue":null,"work_id":"6eac684f-37e3-4440-a2fc-589f798e7008","year":2010},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.931236Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:a9ee5ecb6d4541de470753698ec8dd851716a1894e452254629d65d1c9fa945b","observation_id":"f312ecf0-39ab-4e10-ab49-e25b3a4d5208","resolution":{"observed_at":"2026-08-07T15:35:36.913162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:36.676076Z","title":"Communication-aware planning for robot teams deployment,","venue":null,"work_id":"1519fc36-e044-47c6-826c-c7cb2d03653d","year":2017},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:35.969137Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:6d8ab6b39cf8e154ea47537f3c4225c487dc153ba314d4bae1a900cbbeef3c44","observation_id":"b6b617a5-2741-4497-8b19-8167b95f6c35","resolution":{"observed_at":"2026-08-07T15:35:36.823860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:36.576653Z","title":"A fast marching level set method for monotonically advancing fronts,","venue":null,"work_id":"51b98a2c-1823-464f-8739-34cce3c534d0","year":1996},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:36.007600Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:94017576adcc815cfe53e4a1ae01a5f2dff9470631133101bf596b88727c8836","observation_id":"0696495c-64be-49d9-9ae3-529fcb6ff3ee","resolution":{"observed_at":"2026-08-07T15:35:36.608054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:36.380411Z","title":"The orienteering problem: A survey,","venue":null,"work_id":"8d583007-e114-45ca-9025-2cfe0ba9b52e","year":2011},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:36.097904Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:d6297b6ee19c2ae29ac98f41cb442cdb1a9980c37cae0db2bcd3c072f3cfb3cc","observation_id":"c7d05025-eaea-4ef5-b69a-0660adb5a66e","resolution":{"observed_at":"2026-08-07T15:35:36.453137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-07T15:35:36.219212Z","title":"A method for solving traveling- salesman problems,","venue":null,"work_id":"72074e5b-55b1-4273-8f3f-23f8182a101c","year":1958},"citing_paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:35:36.164607Z"},"links":{"citing_paper":"/paper/2505.14760"},"observation_digest":"sha256:00ede8afdc905f8ed40846ef8be0872257fea2dc673266807d2940654b1d7147","observation_id":"3462f989-f00f-4ff7-aff5-d26f98094d19","resolution":{"observed_at":"2026-08-07T15:35:36.316746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14760","last_updated":"2025-05-20T16:41:14Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-14T01:55:13.915995Z","submitted_at":"2025-05-20T16:41:14Z","title":"Fast and scalable multi-robot deployment planning under connectivity constraints"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":16},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2505.14760."}