{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FXHBF6MU6XWNG2T5CCE2XTJB5L","short_pith_number":"pith:FXHBF6MU","schema_version":"1.0","canonical_sha256":"2dce12f994f5ecd36a7d1089abcd21eae3dbf7193d4661dcbc75b71c96858748","source":{"kind":"arxiv","id":"2608.05586","version":1},"attestation_state":"computed","paper":{"title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abhijeet M. Kulkarni, Guoquan Huang, Ioannis Poulakakis, Kunal S. Narkhede","submitted_at":"2026-08-06T04:17:13Z","abstract_excerpt":"Autonomous robot navigation requires the rapid generation of obstacle-free regions for trajectory planning. However, existing corridor generators struggle to meet real-time, sensor-rate computational constraints. To resolve this bottleneck, we introduce PathCover, a framework driven by RISP; a novel randomized algorithm that constructs convex polytopes directly from raw point cloud data in expected linear time under a mild probabilistic elimination condition. PathCover generates sequences of overlapping, obstacle-free polytopes that safely constrain downstream MPC and trajectory optimization. "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.05586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-08-06T04:17:13Z","cross_cats_sorted":[],"title_canon_sha256":"8f3e4f753cb6eaa60c74c3f8e332612ad618aab7b497b951a75473704247d20b","abstract_canon_sha256":"ed34f397c0cecf0973bac0f0a16a4612d2ef1d7442f30bffef9d540c9d808e75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:50:07.764183Z","signature_b64":"WzE8uFVYtR3QG9cw1DXbyhMEiTeYBQVBMu2Kg/yG7aOS+wzk+b/I5zT/HTcjR3M3deylI6Qp4zao7W1gXhJXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dce12f994f5ecd36a7d1089abcd21eae3dbf7193d4661dcbc75b71c96858748","last_reissued_at":"2026-08-07T00:50:07.762796Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:50:07.762796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Abhijeet M. Kulkarni, Guoquan Huang, Ioannis Poulakakis, Kunal S. Narkhede","submitted_at":"2026-08-06T04:17:13Z","abstract_excerpt":"Autonomous robot navigation requires the rapid generation of obstacle-free regions for trajectory planning. However, existing corridor generators struggle to meet real-time, sensor-rate computational constraints. To resolve this bottleneck, we introduce PathCover, a framework driven by RISP; a novel randomized algorithm that constructs convex polytopes directly from raw point cloud data in expected linear time under a mild probabilistic elimination condition. PathCover generates sequences of overlapping, obstacle-free polytopes that safely constrain downstream MPC and trajectory optimization. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05586","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.05586/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.05586","created_at":"2026-08-07T00:50:07.764220+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05586v1","created_at":"2026-08-07T00:50:07.764220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05586","created_at":"2026-08-07T00:50:07.764220+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXHBF6MU6XWN","created_at":"2026-08-07T00:50:07.764220+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXHBF6MU6XWNG2T5","created_at":"2026-08-07T00:50:07.764220+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXHBF6MU","created_at":"2026-08-07T00:50:07.764220+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L","json":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L.json","graph_json":"https://pith.science/api/pith-number/FXHBF6MU6XWNG2T5CCE2XTJB5L/graph.json","events_json":"https://pith.science/api/pith-number/FXHBF6MU6XWNG2T5CCE2XTJB5L/events.json","paper":"https://pith.science/paper/FXHBF6MU"},"agent_actions":{"view_html":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L","download_json":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L.json","view_paper":"https://pith.science/paper/FXHBF6MU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05586&json=true","fetch_graph":"https://pith.science/api/pith-number/FXHBF6MU6XWNG2T5CCE2XTJB5L/graph.json","fetch_events":"https://pith.science/api/pith-number/FXHBF6MU6XWNG2T5CCE2XTJB5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L/action/storage_attestation","attest_author":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L/action/author_attestation","sign_citation":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L/action/citation_signature","submit_replication":"https://pith.science/pith/FXHBF6MU6XWNG2T5CCE2XTJB5L/action/replication_record"}},"created_at":"2026-08-07T00:50:07.764220+00:00","updated_at":"2026-08-07T00:50:07.764220+00:00"}