{"as_of":"2026-08-20T02:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0cf0aca9b0e88d12f5acafddc3fa1465506fc7aa1a18dd5d3f71e9415d92a05d","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:46:03.790193Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"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/2412.10706/citation-record","integrity":"/paper/2412.10706/integrity","json":"/paper/2412.10706/citation-record.json","paper":"/paper/2412.10706"},"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-11T15:46:04.275787Z","title":"Cleaning robots: A review of sensor technologies and intelligent control strategies for cleaning,","venue":null,"work_id":"0eb21671-5c74-49f3-b652-f105641a4240","year":2025},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.661513Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:85d2a0d7c8ed8819b90aac84bdd5907c47af30507271ac2c65ec1260ace8d2df","observation_id":"967da07e-f085-4a3c-97f8-699dbc19a3ef","resolution":{"observed_at":"2026-08-11T15:46:04.281545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.255463Z","title":"Implementation of drone technology for farm monitoring & pesticide spraying: A review,","venue":null,"work_id":"84f4c647-50b0-4b9a-aa63-aa158da15b42","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.667756Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:aa9a1327a6c12cecadd728498978cfa9ef0ea508ca9c4d6d7018c96432fa4762","observation_id":"96d45ed6-3b59-484f-bb4e-e865e0b42f63","resolution":{"observed_at":"2026-08-11T15:46:04.261331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.236505Z","title":"Indoor coverage path plan- ning: Survey, implementation, analysis,","venue":null,"work_id":"16af1fd4-d513-4c12-9a7b-07cb85fdb174","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.674743Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:11aa7eff318fe65d875c0fdbbc7b240cad4692de46862113e89726ec49e52202","observation_id":"4e19012f-44ac-41cf-9705-95b014689aea","resolution":{"observed_at":"2026-08-11T15:46:04.242553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.213531Z","title":"A robust obstacle detection method for robotic vacuum cleaners,","venue":null,"work_id":"82a0aaf7-df36-4104-99b3-c960ad769cdc","year":2014},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.680858Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:b53ec3664bca710e712d9da46fadb64a25d7dd755b946c12fae6896273dd0bab","observation_id":"e481cd76-3024-4ddb-809d-53b936219401","resolution":{"observed_at":"2026-08-11T15:46:04.220014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.192105Z","title":"Fc-planner: A skeleton-guided planning framework for fast aerial coverage of complex 3d scenes,","venue":null,"work_id":"f41617bd-bd30-4d1e-83df-3eb261ea6eb7","year":2024},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.686345Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:4a05d485278c9c27c453b56b91b7d1c0588937d7d7c00adde3d98c52978ffb8a","observation_id":"ededd3cf-8388-4bcf-9020-2481919a529c","resolution":{"observed_at":"2026-08-11T15:46:04.198337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-11T15:46:03.693844Z","title":"A survey on coverage path planning for robotics,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.693844Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:ae971fc6ba14e13d34ff0186f294ce46fd8f2fc970670037a6aa66d292bd09b2","observation_id":"8df34f48-dc82-4327-bea6-aebae7ac4564","resolution":{"observed_at":"2026-08-11T15:46:03.693844Z","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-11T15:46:04.163059Z","title":"Coverage path planning: The boustrophedon cellular decomposition,","venue":null,"work_id":"2e0b2c44-9c7d-48ef-a5c6-16761033519b","year":1998},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.702000Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:f1cec6a38e4263858081d8b1cecd111ea5439277c3c71889dd4b97bdb2384f0c","observation_id":"26a24f9b-df7d-4b0d-9a06-2338a6580e4f","resolution":{"observed_at":"2026-08-11T15:46:04.168583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-11T15:46:03.708117Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.708117Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:3e42f5a272a5189f839b413bf53d04723956bd6cf57929013b8692de80475edd","observation_id":"b66eefc6-0a28-4455-8965-1b5318d649ee","resolution":{"observed_at":"2026-08-11T15:46:03.708117Z","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-11T15:46:04.129510Z","title":"Hierarchical coverage path planning in complex 3d environments,","venue":null,"work_id":"d74c6609-ea44-4a46-8aa9-f3c8c10332c8","year":2020},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.714437Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:1e713df26f5e156ee3bbeca3c7fa46c91014385e053b33ff2553211319dd0cc3","observation_id":"5d6b2309-1902-4b59-86d1-72cfa11c6aa6","resolution":{"observed_at":"2026-08-11T15:46:04.134986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.111344Z","title":"The constriction decomposition method for coverage path planning,","venue":null,"work_id":"eb427f8f-840e-44a8-bc45-9d2bb0b97d11","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.720003Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:03bf484e0ec963813dc5d6a3efa84faab6367155b31a6371f8c352072119a8fc","observation_id":"29c49e60-0616-482d-967d-303f9c07e936","resolution":{"observed_at":"2026-08-11T15:46:04.117319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.085325Z","title":"A deformable spiral-based algorithm to smooth coverage path planning for marine growth removal,","venue":null,"work_id":"cc51c05d-a2d9-4753-8b69-f82afc2e5bc0","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.724873Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:55849e5ed0d839d2f9fe5f21d7faa24d545769ce29f503a2d8a943a90aa6b97e","observation_id":"b2029865-c7a3-4430-87b4-d7ac47979ba6","resolution":{"observed_at":"2026-08-11T15:46:04.092612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.062308Z","title":"Flight testing boustrophedon coverage path planning for fixed wing uavs in wind,","venue":null,"work_id":"1b435c19-b79b-4cb6-8997-5809c08190b9","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.729838Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:ffe3ece936e246728c996fb33be4ec1ed32755e6e8187187b6681d012810de89","observation_id":"320d4483-78f4-4aa2-917b-5b52df03f247","resolution":{"observed_at":"2026-08-11T15:46:04.069985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.043013Z","title":"Coverage path planning using path prim- itive sampling and primitive coverage graph for visual inspection,","venue":null,"work_id":"7247420e-173f-4f9b-8bde-7b677a340ce5","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.733934Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:34b2bf44bab0f0b256184fdc3d2613976c6dfa72c96c46eb27d9d06091e0ada3","observation_id":"59177620-4d63-4a1b-8a70-63989f6ceb86","resolution":{"observed_at":"2026-08-11T15:46:04.048903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:04.024834Z","title":"Online complete coverage path planning of a reconfigurable robot using glasius bio-inspired neural network and genetic algorithm,","venue":null,"work_id":"6b748fa0-4ac1-4403-b1b7-9fc768f54c4b","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.739148Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:c208907abe04b5200b7c6de957d677d603482878a59cfaa9d6e5c14b12b6db8f","observation_id":"8f06831b-24b5-4e0d-a0b0-7948d24993ce","resolution":{"observed_at":"2026-08-11T15:46:04.031445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2412.00555","last_updated":"2024-11-30T18:53:34Z","snapshot_observed_at":"2026-08-19T02:00:39.390910Z","submitted_at":"2024-11-30T18:53:34Z","title":"Learning Dynamic Weight Adjustment for Spatial-Temporal Trajectory Planning in Crowd Navigation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00555","snapshot_observed_at":"2026-08-11T15:46:03.743637Z","title":"Learning dynamic weight adjustment for spatial- temporal trajectory planning in crowd navigation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.743637Z"},"links":{"cited_paper":"/paper/2412.00555","citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:fde474ebec457525e26da1dea61464ddd95fda0efd4db9ba7b9e4f272f24a07a","observation_id":"4490ca43-4b1b-4486-8866-f2699cc9e552","resolution":{"observed_at":"2026-08-11T15:46:03.743637Z","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-11T15:46:04.006307Z","title":"Fields2cover: An open-source coverage path planning library for unmanned agricultural vehicles,","venue":null,"work_id":"8233feb5-6abb-44fe-b629-66615a0bcd8b","year":2023},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.748873Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:a61948322061e300ce3e3e2b72ad9b93b77462faed9d6f0a418c69b1ebdb30ba","observation_id":"5c9a3b5e-3fc0-4f09-8180-67cacb97bfce","resolution":{"observed_at":"2026-08-11T15:46:04.012932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:03.984689Z","title":"Pishro-Nik, Introduction to probability, statistics, and random processes","venue":null,"work_id":"82814eac-b824-462b-9923-8a5368681511","year":2014},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.753755Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:c7b38f03db719d64747bb85889188b28762e979ede2da15d408bd15f4f95806c","observation_id":"74f5317e-29ac-4136-a636-461da5045956","resolution":{"observed_at":"2026-08-11T15:46:03.991566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2102.10808","last_updated":"2021-02-22T07:14:12Z","snapshot_observed_at":"2026-08-16T18:44:01.951025Z","submitted_at":"2021-02-22T07:14:12Z","title":"ikd-Tree: An Incremental K-D Tree for Robotic Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.10808","snapshot_observed_at":"2026-08-11T15:46:03.758059Z","title":"ikd-tree: An incremental kd tree for robotic applications,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.758059Z"},"links":{"cited_paper":"/paper/2102.10808","citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:7accdccd99a91bc95482fc867b27eb965823a97adb7f8050866b829a9ea92014","observation_id":"568f285c-ce61-48ee-aaa7-de6d521338ac","resolution":{"observed_at":"2026-08-11T15:46:03.758059Z","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-11T15:46:03.764330Z","title":"On the limited memory bfgs method for large scale optimization,","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.764330Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:215726facab48d7051eae896bd9502883dab2b00f06c6d8d47500279189c19af","observation_id":"e0f90ed1-9819-4afe-b3d4-fc4c586d2aac","resolution":{"observed_at":"2026-08-11T15:46:03.764330Z","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-11T15:46:03.942147Z","title":"A clustering-based coverage path planning method for autonomous heterogeneous uavs,","venue":null,"work_id":"0e6a2f79-d55b-477b-8078-5a99c03472f9","year":2021},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.769816Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:250b8502033f98260eceafb8d24161c3464bc727a8606de5f8a6753ab81593ff","observation_id":"0d34f56a-90e9-4bc9-94ec-539c8c853b75","resolution":{"observed_at":"2026-08-11T15:46:03.949038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:03.920967Z","title":"Cooperative coverage path planning for multi-mobile robots based on improved k-means clustering and deep reinforcement learning,","venue":null,"work_id":"7b1abf66-c12b-42f8-a5e6-30217b00c39d","year":2024},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.774723Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:c13e6ef68c4fd05b8fcb702df1804143d64ebafb0f691c14b61b8b56eda472be","observation_id":"92d4cd93-c290-4f5c-9030-8205583fb55c","resolution":{"observed_at":"2026-08-11T15:46:03.928529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:03.900637Z","title":"Eureka j15 pro ultra flagship robot vacuum,","venue":null,"work_id":"bb35b88a-32bb-47e6-b4ba-c729648cae8f","year":2025},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.779944Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:76b312ab1a1420b6af743245d6f266eda64c97526fb6230360d1cc945cb90e32","observation_id":"50b30e74-c594-4c11-9a32-02ce9531a612","resolution":{"observed_at":"2026-08-11T15:46:03.906624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:46:03.877084Z","title":"Fast-planner: An efficient coverage path planning framework for unmanned aerial vehicles,","venue":null,"work_id":"a760b51a-7e0b-4b9d-91c3-33c108a783ff","year":2019},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.784819Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:cf9bc9903cd71ead3396aab24b5e2a9405991540109a165c2e25a572093f582b","observation_id":"fed8d203-fb43-42ce-810f-1be4c1501e6c","resolution":{"observed_at":"2026-08-11T15:46:03.885702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-11T15:46:03.790193Z","title":"Real- time trajectory replanning for mavs using uniform b-splines and a 3d circular buffer,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:46:03.790193Z"},"links":{"citing_paper":"/paper/2412.10706"},"observation_digest":"sha256:4107c007eee1b63f0bfa9c6395f8a3dce4c57c590dd652e18c6b978bf62bdd48","observation_id":"3eabbdb1-87b7-4b9f-bb16-fa4a4c3e8b3c","resolution":{"observed_at":"2026-08-11T15:46:03.790193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.10706","last_updated":"2025-04-24T01:16:48Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-15T13:44:09.232648Z","submitted_at":"2024-12-14T06:32:20Z","title":"SHIFT Planner: Speedy Hybrid Iterative Field and Segmented Trajectory Optimization with IKD-tree for Uniform Lightweight Coverage"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":24},"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 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2412.10706."}