{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZLPZMKKTRZWINMPXCWH74LCXFY","short_pith_number":"pith:ZLPZMKKT","schema_version":"1.0","canonical_sha256":"cadf9629538e6c86b1f7158ffe2c572e02bbe9f00fb07275f9e41fcadbc217d5","source":{"kind":"arxiv","id":"2112.13169","version":3},"attestation_state":"computed","paper":{"title":"GPU Accelerated Voxel Grid Generation for Fast MAV Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alain Lambert, Charbel Toumieh","submitted_at":"2021-12-25T02:07:08Z","abstract_excerpt":"Voxel grids are a minimal and efficient environment representation that is used for robot motion planning in numerous tasks. Many state-of-the-art planning algorithms use voxel grids composed of free, occupied and unknown voxels. In this paper we propose a new GPU accelerated algorithm for partitioning the space into a voxel grid with occupied, free and unknown voxels. The proposed approach is low latency and suitable for high speed navigation."},"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":"2112.13169","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-12-25T02:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"9df40623a8278e9d5a1e781b67040beaed3c87ee4ec70772390e80aa3c8f0395","abstract_canon_sha256":"7124c628b09326947ed281bc6556b0e5c3b11be7d31db32e301a9f2f72665e6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:40.464043Z","signature_b64":"e8fseYhuqnARt1N0nQURIsjutv15zZbSGiIgllFjSSY5uNTtDgOmyPeVV0sPtQNfV68fJ8I9k8CvOueEF5Q4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cadf9629538e6c86b1f7158ffe2c572e02bbe9f00fb07275f9e41fcadbc217d5","last_reissued_at":"2026-07-05T04:48:40.463570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:40.463570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU Accelerated Voxel Grid Generation for Fast MAV Exploration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alain Lambert, Charbel Toumieh","submitted_at":"2021-12-25T02:07:08Z","abstract_excerpt":"Voxel grids are a minimal and efficient environment representation that is used for robot motion planning in numerous tasks. Many state-of-the-art planning algorithms use voxel grids composed of free, occupied and unknown voxels. In this paper we propose a new GPU accelerated algorithm for partitioning the space into a voxel grid with occupied, free and unknown voxels. The proposed approach is low latency and suitable for high speed navigation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13169","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/2112.13169/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":"2112.13169","created_at":"2026-07-05T04:48:40.463626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.13169v3","created_at":"2026-07-05T04:48:40.463626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13169","created_at":"2026-07-05T04:48:40.463626+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLPZMKKTRZWI","created_at":"2026-07-05T04:48:40.463626+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLPZMKKTRZWINMPX","created_at":"2026-07-05T04:48:40.463626+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLPZMKKT","created_at":"2026-07-05T04:48:40.463626+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05586","citing_title":"PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY","json":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY.json","graph_json":"https://pith.science/api/pith-number/ZLPZMKKTRZWINMPXCWH74LCXFY/graph.json","events_json":"https://pith.science/api/pith-number/ZLPZMKKTRZWINMPXCWH74LCXFY/events.json","paper":"https://pith.science/paper/ZLPZMKKT"},"agent_actions":{"view_html":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY","download_json":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY.json","view_paper":"https://pith.science/paper/ZLPZMKKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.13169&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLPZMKKTRZWINMPXCWH74LCXFY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLPZMKKTRZWINMPXCWH74LCXFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY/action/storage_attestation","attest_author":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY/action/author_attestation","sign_citation":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY/action/citation_signature","submit_replication":"https://pith.science/pith/ZLPZMKKTRZWINMPXCWH74LCXFY/action/replication_record"}},"created_at":"2026-07-05T04:48:40.463626+00:00","updated_at":"2026-07-05T04:48:40.463626+00:00"}