{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EY7KQDABBCM5233UBEWE4DA7ZO","short_pith_number":"pith:EY7KQDAB","schema_version":"1.0","canonical_sha256":"263ea80c010899dd6f74092c4e0c1fcb8807977ad745c89d7faa630b177d9a63","source":{"kind":"arxiv","id":"2403.02977","version":3},"attestation_state":"computed","paper":{"title":"Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chao Xu, Fei Gao, Jialin Ji, Mingyang Wang, Qianhao Wang, Rui Jin, Tianyue Wu, Yuman Gao, Zhepei Wang, Zhichao Han","submitted_at":"2024-03-05T13:58:12Z","abstract_excerpt":"Convex polytopes have compact representations and exhibit convexity, which makes them suitable for abstracting obstacle-free spaces from various environments. Existing generation methods struggle with balancing high-quality output and efficiency. Moreover, another crucial requirement for convex polytopes to accurately contain certain seed point sets, such as a robot or a front-end path, is proposed in various tasks, which we refer to as manageability. In this paper, we propose Fast Iterative Regional Inflation (FIRI) to generate high-quality convex polytope while ensuring efficiency and manage"},"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":"2403.02977","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-05T13:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"4621ba357d7c8a0429f691737edb3f80d4b4ee1ce337f36bb4a7250f45572fa6","abstract_canon_sha256":"d1df10114bc8639e907ee382ee34d62f04009dc44df90c9d389e342f889f350b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:03.413413Z","signature_b64":"hqa+qsHtd/OKpqahfRdwgkRUmdlNaH/M1mBobGr+Y+n8GylcERAcICW8rtx5xdO1h/AFJ27p8xdltzD2SklyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263ea80c010899dd6f74092c4e0c1fcb8807977ad745c89d7faa630b177d9a63","last_reissued_at":"2026-07-05T10:33:03.412406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:03.412406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Iterative Region Inflation for Computing Large 2-D/3-D Convex Regions of Obstacle-Free Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chao Xu, Fei Gao, Jialin Ji, Mingyang Wang, Qianhao Wang, Rui Jin, Tianyue Wu, Yuman Gao, Zhepei Wang, Zhichao Han","submitted_at":"2024-03-05T13:58:12Z","abstract_excerpt":"Convex polytopes have compact representations and exhibit convexity, which makes them suitable for abstracting obstacle-free spaces from various environments. Existing generation methods struggle with balancing high-quality output and efficiency. Moreover, another crucial requirement for convex polytopes to accurately contain certain seed point sets, such as a robot or a front-end path, is proposed in various tasks, which we refer to as manageability. In this paper, we propose Fast Iterative Regional Inflation (FIRI) to generate high-quality convex polytope while ensuring efficiency and manage"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02977","kind":"arxiv","version":3},"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/2403.02977/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":"2403.02977","created_at":"2026-07-05T10:33:03.412563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02977v3","created_at":"2026-07-05T10:33:03.412563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02977","created_at":"2026-07-05T10:33:03.412563+00:00"},{"alias_kind":"pith_short_12","alias_value":"EY7KQDABBCM5","created_at":"2026-07-05T10:33:03.412563+00:00"},{"alias_kind":"pith_short_16","alias_value":"EY7KQDABBCM5233U","created_at":"2026-07-05T10:33:03.412563+00:00"},{"alias_kind":"pith_short_8","alias_value":"EY7KQDAB","created_at":"2026-07-05T10:33:03.412563+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10290","citing_title":"TOP: Trajectory Optimization via Parallel Optimization towards Constant Time Complexity","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO","json":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO.json","graph_json":"https://pith.science/api/pith-number/EY7KQDABBCM5233UBEWE4DA7ZO/graph.json","events_json":"https://pith.science/api/pith-number/EY7KQDABBCM5233UBEWE4DA7ZO/events.json","paper":"https://pith.science/paper/EY7KQDAB"},"agent_actions":{"view_html":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO","download_json":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO.json","view_paper":"https://pith.science/paper/EY7KQDAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02977&json=true","fetch_graph":"https://pith.science/api/pith-number/EY7KQDABBCM5233UBEWE4DA7ZO/graph.json","fetch_events":"https://pith.science/api/pith-number/EY7KQDABBCM5233UBEWE4DA7ZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO/action/storage_attestation","attest_author":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO/action/author_attestation","sign_citation":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO/action/citation_signature","submit_replication":"https://pith.science/pith/EY7KQDABBCM5233UBEWE4DA7ZO/action/replication_record"}},"created_at":"2026-07-05T10:33:03.412563+00:00","updated_at":"2026-07-05T10:33:03.412563+00:00"}