{"as_of":"2026-08-09T15:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b0f0cb99c38714f6002d7e1a40c18ecab790a2bb61e72e0ce384ff155803ebc","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T06:08:32.762317Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2608.05586/citation-record","integrity":"/paper/2608.05586/integrity","json":"/paper/2608.05586/citation-record.json","paper":"/paper/2608.05586"},"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-08T06:08:34.262001Z","title":"Real-time motion planning with applications to autonomou s urban driving,","venue":null,"work_id":"0ea0eb15-c535-43d4-ba2b-b13ab5f7f5d6","year":2009},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.327891Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:5c0551e36f685f75bc365b4820b8d1442f800d6bf04a4805af44601fa5f094f0","observation_id":"c74c52d9-5dd9-4e24-85d3-65931af8c4dd","resolution":{"observed_at":"2026-08-08T06:08:34.265567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:34.188030Z","title":"GaitMesh: Co ntroller-aware navigation meshes for long-range legged locomotion planni ng in multi- layered environments,","venue":null,"work_id":"3266289e-a2df-4094-aa16-57dab5b3a33d","year":2020},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.331491Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:6aa66e6067942e846f9b6ec7ca8e6d65b75218d4850a97c1b12ae5713ad3a3a3","observation_id":"9aef4ae0-4caf-4e5c-b56b-3da994b58f6b","resolution":{"observed_at":"2026-08-08T06:08:34.256348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:34.030519Z","title":"An integrated framew ork for cooperative aerial manipulators in unknown environments,","venue":null,"work_id":"cd7fd049-f760-422b-90a2-128da15737fe","year":2018},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.333985Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:0e0f749559aa5e61b2578c0e69c7bcd2dfd500305a3d5680394f20f85a4b9b26","observation_id":"b0f64fd9-3709-45fb-859d-8dac535c529a","resolution":{"observed_at":"2026-08-08T06:08:34.113382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.750100Z","title":"Universal trajectory optimization framework for differential drive robot class,","venue":null,"work_id":"fb1afd7d-bb2e-4d92-a808-3703657616d1","year":2025},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.337213Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:75ca71325cbe86a6a9d1c56192d8fe0a43544f7324fce3d52ac82bd06042bb79","observation_id":"8bfb0175-fa06-4964-941c-30a269bd1d49","resolution":{"observed_at":"2026-08-08T06:08:33.890085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.690877Z","title":"DLSC: Distributed multi-agent trajectory planning in maze-like dynamic environments usi ng linear safe corridor,","venue":null,"work_id":"bfa6eaa9-2f13-4d8e-9d35-78954200866f","year":2023},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.339841Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:e3a9cc15652f3591194f712dceeaae6e6ee5f62e6680b6c36fc60020a4172363","observation_id":"109e5610-80e2-4219-898c-27d849cd76fb","resolution":{"observed_at":"2026-08-08T06:08:33.693925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.682176Z","title":"RAST: Risk-aware spatio-temporal safety corridors for ma v navigation in dynamic uncertain environments,","venue":null,"work_id":"8513fab3-b9db-43b4-b125-72bf4e13e218","year":2023},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.342719Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:6d8be9685b97bc078421d3d77120162e9dfa7cb0bb46b73f498ff414b321aafd","observation_id":"9ce28c17-16a6-47f7-b840-e730b00159ea","resolution":{"observed_at":"2026-08-08T06:08:33.685670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.673373Z","title":"FA STER: Fast and safe trajectory planner for navigation in unknown envir onments,","venue":null,"work_id":"b4185cf9-2200-45b3-ac06-be0e4e05ad85","year":2022},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.345882Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:484ba9a41c81d541c8d17c3c56cb3e722b6766525a82db96c243399ef7279859","observation_id":"422469c6-44a7-48c8-87d6-5f0a8a109a29","resolution":{"observed_at":"2026-08-08T06:08:33.676238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.664066Z","title":"A sequential MPC approach to reactive planning for bipedal ro bots using safe corridors in highly cluttered environments,","venue":null,"work_id":"1cfbe1c3-affc-4820-a8dc-511fae1e9cd8","year":2022},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.348619Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:e31938167a04b47ae9510b62100b5f6d442057b378eb9abf67803774314aacab","observation_id":"ce29ae95-63cf-4a36-87ff-ebde05bee0e9","resolution":{"observed_at":"2026-08-08T06:08:33.667959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.655771Z","title":"Fast iterative region inflation for comput ing large 2-D/3-D convex regions of obstacle-free space,","venue":null,"work_id":"1718ce60-6e0a-44ba-97d1-2f6abeeacd0b","year":2025},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.351388Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:6c3eced750e9d7477e0c86be36958a0a1451757f0a4222c3176256f2bc70a77c","observation_id":"42fd62e6-0e6f-44ea-b451-abc8b8404288","resolution":{"observed_at":"2026-08-08T06:08:33.658848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.648115Z","title":"Efficient mixed-integer plann ing for UA Vs in cluttered environments,","venue":null,"work_id":"769a6359-b0b8-4ac6-9eba-cdd525ec94d3","year":2015},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.354199Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:28be58e54bd8fd46a3700744f88a019cf1796467d0312439fce04cfc3cff3a77","observation_id":"d0e0caaf-2b18-4151-95ba-277928a862e0","resolution":{"observed_at":"2026-08-08T06:08:33.650513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.639804Z","title":"Planning dynamically feasible trajectories for quadrotors using safe flight corridors in 3-D complex environments,","venue":null,"work_id":"0874caa5-23c2-49dc-9ae8-632a318e959d","year":2017},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.357136Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:ef2e659b9cac9908c0d15b1b844815ca1b0f3f5f32c4ae86e63e8610f5b5e0c5","observation_id":"b796fa42-f8bf-4676-8160-5828eb3fca68","resolution":{"observed_at":"2026-08-08T06:08:33.643009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.631558Z","title":"Online dis tributed trajectory planning for quadrotor swarm with feasibility g uarantee using linear safe corridor,","venue":null,"work_id":"a6655a5e-cbfc-45fa-a3d4-361b7ff461d4","year":2022},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.360034Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:91bb72ef5e022f8e25848bb2af2c96af96f9bb6dfc1be9492c9530908f2ab086","observation_id":"d443e4b0-1078-4f32-9f2d-0e8c47ef70c1","resolution":{"observed_at":"2026-08-08T06:08:33.634919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.622821Z","title":"Bubble planner: Planning high-speed smooth quadrotor tra jectories using receding corridors,","venue":null,"work_id":"92dc047e-196e-4d62-ab36-742959625e82","year":2022},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.362769Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:4e5e6d4c09419ffed63f0cda379a704e6a591efe59c2f52cc1a433bdbf1a7b36","observation_id":"41aeb437-6f29-4beb-9853-37cc8c032b02","resolution":{"observed_at":"2026-08-08T06:08:33.626023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.612754Z","title":"Computing large convex region s of obstacle- free space through semidefinite programming,","venue":null,"work_id":"7c4f6906-dc3e-41ec-88a9-540f1cb7f38a","year":2015},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.365403Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:7c684c6a87f8e25f471df0eec6765870b0be1e95b64111e3722901f88ce312e7","observation_id":"4cf28387-43fb-4d4b-b009-3ac3c94625ad","resolution":{"observed_at":"2026-08-08T06:08:33.617540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14737","last_updated":"2023-03-26T14:37:06Z","snapshot_observed_at":"2026-07-06T15:08:08.184681Z","submitted_at":"2023-03-26T14:37:06Z","title":"Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.14737","snapshot_observed_at":"2026-08-08T06:08:32.368172Z","title":"Growing convex collision- free regions in configuration space using nonlinear programming,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.368172Z"},"links":{"cited_paper":"/paper/2303.14737","citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:55e7913e60872a0c4606876ccbd59f2f053b5256efad000647ff3bcc74b5b1cd","observation_id":"85b731b6-97db-4b8e-9214-3e6a882a45c5","resolution":{"observed_at":"2026-08-08T06:08:32.368172Z","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-08T06:08:33.531734Z","title":"Ce rtified polyhedral decompositions of collision-free configuratio n space,","venue":null,"work_id":"2f2a8add-2efc-4eed-81e1-8ecf7c7322aa","year":2024},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.371426Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:6c8330342e2ce6b0287d13f66cd997ac5b87aabda8b42914e336e6deab0ca29a","observation_id":"0d1d7416-8c48-4ba4-af64-8eb8a9471e34","resolution":{"observed_at":"2026-08-08T06:08:33.585416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-07-06T19:34:37.027078Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-08-08T06:08:32.373939Z","title":"Faster algorithms for growing collision-free c onvex poly- topes in robot configuration space,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.373939Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:6a6cf639054eaa1dbb44a4a0615ab505e84145e4a22915b15a4e046b9c32900b","observation_id":"4f10724a-aa54-40d3-9ac4-84a72ff60e93","resolution":{"observed_at":"2026-08-08T06:08:32.373939Z","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-08T06:08:33.426935Z","title":"Safety-assured high-speed navigation for mavs,","venue":null,"work_id":"3802c8b8-24be-46c1-9bbb-f96041942cb2","year":2025},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.377133Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:6004f23384bdf9f966d5cd8418f4d4a01f481fe97ec1d4a187eaf637af41e057","observation_id":"ab7fa3bf-70b9-4f38-96bf-e074c604679c","resolution":{"observed_at":"2026-08-08T06:08:33.478385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.312811Z","title":"Towar ds optimizing a convex cover of collision-free space for trajectory gener ation,","venue":null,"work_id":"c7a7fe52-fe74-4fd6-8a8c-62aed21940c8","year":2025},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.379911Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:8f735a1fabc3df4faea16d9219c6e688c1c0a1db19be8941ecebc4ef0b63c32d","observation_id":"81712a70-c951-4a55-b849-9207f74bf6e7","resolution":{"observed_at":"2026-08-08T06:08:33.384506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.269843Z","title":"An algorithm for generating convex obstacle -free regions based on stereographic projection,","venue":null,"work_id":"ba7de7dc-5a03-4d0e-a1e1-2ff1f3846d90","year":2017},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.394248Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:9ff2af29ad8bd584e871c455af0db738612a9efe3d4fe42cff2341f37b7b7590","observation_id":"7da77328-c6e6-4609-a9c4-d153a125a728","resolution":{"observed_at":"2026-08-08T06:08:33.272741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08744","last_updated":"2020-11-16T07:46:22Z","snapshot_observed_at":"2026-07-06T10:05:19.828232Z","submitted_at":"2020-10-17T08:36:12Z","title":"Generating Large Convex Polytopes Directly on Point Clouds","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.08744","snapshot_observed_at":"2026-08-08T06:08:32.449140Z","title":"Gener ating large convex polytopes directly on point clouds,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.449140Z"},"links":{"cited_paper":"/paper/2010.08744","citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:d5858fd7938b527ca69f8e87637827ab6ea7a7c18ba18eedefae27331e6acfe5","observation_id":"1527dd23-c99e-4dc1-9f6b-e810ba7b4c37","resolution":{"observed_at":"2026-08-08T06:08:32.449140Z","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-08T06:08:33.261694Z","title":"Star- convex constrained optimization for visibility planning w ith application to aerial inspection,","venue":null,"work_id":"98f24592-0c80-44da-8903-30056f82da86","year":2022},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.505343Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:d6d3bae149a3e053c6444af8d6ec9cedbda07a28979faad3c35f1c22da4b8209","observation_id":"2dece4ac-6a48-4319-bc76-75d580824e2a","resolution":{"observed_at":"2026-08-08T06:08:33.264584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.251712Z","title":"The quickh ull algorithm for convex hulls,","venue":null,"work_id":"bbc1b24c-48bd-4300-9f31-5f4df787398d","year":1996},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.591352Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:a9a4709133b5ca8b52b4059a869fe579d047018a641e681a18cabbf9019bc1ea","observation_id":"32091ef7-87a7-42b5-a0f7-48ac8b519bc9","resolution":{"observed_at":"2026-08-08T06:08:33.254738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.244148Z","title":"Optimal paths for polygonal robots in SE(2),","venue":null,"work_id":"2d1daa35-0ad6-49a3-8c1b-d5b67b7b3498","year":2018},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.652559Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:d186f2206194b0f84e9c6c5125959cda83cdee348cd1725b3b22ed0399359328","observation_id":"60803fce-abdf-41a9-92a2-54beefef3995","resolution":{"observed_at":"2026-08-08T06:08:33.247129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.235305Z","title":"Tea ch-Repeat- Replan: A complete and robust system for aggressive flight in complex environments,","venue":null,"work_id":"be175267-89a1-4fa0-9564-05f64aca2c3e","year":2020},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.712632Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:9b8e6128777f39e856f47d790504cdc759b9e335dd05b76dd35d4c5f935d8fc7","observation_id":"030d4379-74dc-45ed-88ef-482f7feac96d","resolution":{"observed_at":"2026-08-08T06:08:33.238236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.226342Z","title":"V oxel-grid based convex dec omposition of 3D space for safe corridor generation,","venue":null,"work_id":"0be8f50b-30e3-4c1f-87ec-67b7a1962527","year":2022},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.726042Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:7188aad90a71aa0e8bece16b72e0e48dc05522ba53e1dcaf74e2f70b41bb8243","observation_id":"73113bf7-c29c-4d71-b3fb-5da5e9971a82","resolution":{"observed_at":"2026-08-08T06:08:33.230004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.218098Z","title":"OctoMap: an efficient probabilistic 3D mapping framework b ased on octrees,","venue":null,"work_id":"740f3d6a-b598-4513-a185-cd4e04e57b53","year":2013},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.729105Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:fbd7fc0f33ca3bac8029f0917362d650d9d395a92d4e844cdc806f1dbecfdda5","observation_id":"828c9338-b72a-46ef-b731-891cc8701ca8","resolution":{"observed_at":"2026-08-08T06:08:33.220859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.209980Z","title":"Online safe trajector y generation for quadrotors using fast marching method and bernstein bas is polyno- mial,","venue":null,"work_id":"6f8fd40d-2024-4526-a6d4-91de95b08815","year":2018},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.732291Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:073807e52c17dcdaf7c0fc7c5251900f470129df5a2d4546dc15417d1c477669","observation_id":"51c05ccb-8b12-4f06-bb99-b8a9fe732db0","resolution":{"observed_at":"2026-08-08T06:08:33.212680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13169","last_updated":"2022-08-16T02:50:09Z","snapshot_observed_at":"2026-08-03T17:17:52.830868Z","submitted_at":"2021-12-25T02:07:08Z","title":"GPU Accelerated Voxel Grid Generation for Fast MAV Exploration","version":3},"cited_work":{"arxiv_id":"2112.13169","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.13169","snapshot_observed_at":"2026-08-08T06:08:32.784214Z","title":"GPU Accelerated Voxel Grid Generation for Fast MAV Exploration","venue":"cs.RO","work_id":"2e50d4ef-ebd5-47bd-a8e8-ae9e4ffdeff4","year":2021},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.735112Z"},"links":{"cited_paper":"/paper/2112.13169","citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:0ab070a976aad8db867e46b90795d6eeb6376b23ef0fc80b949d415237b66638","observation_id":"9e1f460c-bcdb-4a43-8198-03039bbae0cf","resolution":{"observed_at":"2026-08-08T06:08:32.789994Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.194801Z","title":null,"venue":null,"work_id":"34cb966f-b64e-4829-9f3b-e85b83d45fb2","year":2006},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.738831Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:844e2e959521da08a1ce3487b37241b60cab9d0dc16e4aab48eeb1ae14d08c53","observation_id":"3e5c1693-3491-4f05-906f-432894d8e78d","resolution":{"observed_at":"2026-08-08T06:08:33.202202Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.178402Z","title":"Online graph pruning for pa thfinding on grid maps,","venue":null,"work_id":"09687566-4442-47b5-bcf8-dac830643587","year":2011},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.741701Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:1a4e0e768086cd9acde56526b73ee03e451602725483a6a1b2172c7ca6512ede","observation_id":"2c89347e-c6df-491d-8e32-ed650c8ba8b7","resolution":{"observed_at":"2026-08-08T06:08:33.184990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:33.167046Z","title":"Minimum snap trajectory gen eration and control for quadrotors,","venue":null,"work_id":"57d2a27f-b5c8-49ef-beae-44960eead747","year":2011},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.744772Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:74835a07b07234f7f01367ef7be6b0d7bb97049078daf6fe595f879f09889d90","observation_id":"b9cc72bb-f690-45a4-9d65-3cd491a263b8","resolution":{"observed_at":"2026-08-08T06:08:33.172320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:32.970453Z","title":"Geometric tracki ng control of a quadrotor uav on SE(3),","venue":null,"work_id":"c4c38aa3-3924-43de-99a3-81e6a24dfb90","year":2010},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.747914Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:401abab08bee5a086231e73b3ded93a0886726f9e54242708e7d6bb5d691e4b9","observation_id":"59831ddf-92c9-4e84-a98f-740bc7b146c9","resolution":{"observed_at":"2026-08-08T06:08:33.073423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:32.851255Z","title":"CasADi-A software framework for nonlinear optimization a nd optimal control,","venue":null,"work_id":"0234387c-58fc-4281-93d9-0833e5e4bb0a","year":2019},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.750789Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:149c499cfdada706277325e91130ff55af32cd5dc3530c903ba6b0af312d48b0","observation_id":"7930d72b-dc37-45f7-b194-0546ebe93dcd","resolution":{"observed_at":"2026-08-08T06:08:32.874138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:32.842684Z","title":"OSQP: an operator splitting solver for quadratic programs,","venue":null,"work_id":"968f5a10-ace2-4b1a-82ac-02475184081e","year":2020},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.753103Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:52f6d7e204bd1e434b522a9169320834c6651e199fef6235f138aa437c011028","observation_id":"8b652f5b-186d-4312-8517-aa63bbf5a27e","resolution":{"observed_at":"2026-08-08T06:08:32.845896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:32.832418Z","title":"FA TROP: A fast constrained optimal control problem solver for robot t rajectory optimization and control,","venue":null,"work_id":"7ab25975-d225-4226-b38c-bd818856dc35","year":2023},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.756865Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:43dbe2b84d2eb662c1c15f83c95a4d766633d0126a1309bc8da58f1002650918","observation_id":"2f7045e5-9cf1-4d9b-8b46-d6b212c37001","resolution":{"observed_at":"2026-08-08T06:08:32.836562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T06:08:32.759584Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.759584Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:d1d4e9c5331e062db243236c4bde4c4f7e3cbdb85027e05ec93c667d049fa64a","observation_id":"47c1a363-04a9-462d-8158-b0fd87bcd0fd","resolution":{"observed_at":"2026-08-08T06:08:32.759584Z","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-08T06:08:32.819196Z","title":"Drift analysis a nd linear functions revisited,","venue":null,"work_id":"5d20f998-8a7a-4662-b0c8-63f2f36fcee0","year":2010},"citing_paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T06:08:32.762317Z"},"links":{"citing_paper":"/paper/2608.05586"},"observation_digest":"sha256:2e374a8864b65e55657d91f7ee5f90786054d36935725cd1ad89603721ead986","observation_id":"a73ab7d0-d48f-4905-a948-512d5e2796bb","resolution":{"observed_at":"2026-08-08T06:08:32.822192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.05586","last_updated":"2026-08-06T04:17:13Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-09T14:10:44.206028Z","submitted_at":"2026-08-06T04:17:13Z","title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":32},"total_outbound_references":38},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2608.05586."}