{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4CAGY7CGX6ARVMZJ5E3UAYGX67","short_pith_number":"pith:4CAGY7CG","schema_version":"1.0","canonical_sha256":"e0806c7c46bf811ab329e9374060d7f7e3feb560b20ef804489e263d5acee829","source":{"kind":"arxiv","id":"2311.00626","version":2},"attestation_state":"computed","paper":{"title":"nvblox: GPU-Accelerated Incremental Signed Distance Field Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Millane, David Tingdahl, Emilie Wirbel, Helen Oleynikova, Remo Steiner, Roland Siegwart, Vikram Ramasamy","submitted_at":"2023-11-01T16:23:59Z","abstract_excerpt":"Dense, volumetric maps are essential to enable robot navigation and interaction with the environment. To achieve low latency, dense maps are typically computed onboard the robot, often on computationally constrained hardware. Previous works leave a gap between CPU-based systems for robotic mapping which, due to computation constraints, limit map resolution or scale, and GPU-based reconstruction systems which omit features that are critical to robotic path planning, such as computation of the Euclidean Signed Distance Field (ESDF). We introduce a library, nvblox, that aims to fill this gap, by "},"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":"2311.00626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-11-01T16:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"b52bee4d6e2ebab771abedcf54bea92d741f7a8b2ddbfcc4eb89102cc2db47d0","abstract_canon_sha256":"acb0d8ff4d426bdcd25ff4297f10d364962fe65b86a21b2f07bc95feefc7dbe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:40.902943Z","signature_b64":"IH8Q6WLwayk0GqqRqESqDIju0m1pvXCHViAmsOjo9NSOTD1gJApVEYgJ8i6t1vUDeEXB7BYnGQGL/7HZ/0rKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0806c7c46bf811ab329e9374060d7f7e3feb560b20ef804489e263d5acee829","last_reissued_at":"2026-07-05T07:56:40.902448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:40.902448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"nvblox: GPU-Accelerated Incremental Signed Distance Field Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Millane, David Tingdahl, Emilie Wirbel, Helen Oleynikova, Remo Steiner, Roland Siegwart, Vikram Ramasamy","submitted_at":"2023-11-01T16:23:59Z","abstract_excerpt":"Dense, volumetric maps are essential to enable robot navigation and interaction with the environment. To achieve low latency, dense maps are typically computed onboard the robot, often on computationally constrained hardware. Previous works leave a gap between CPU-based systems for robotic mapping which, due to computation constraints, limit map resolution or scale, and GPU-based reconstruction systems which omit features that are critical to robotic path planning, such as computation of the Euclidean Signed Distance Field (ESDF). We introduce a library, nvblox, that aims to fill this gap, by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00626","kind":"arxiv","version":2},"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/2311.00626/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":"2311.00626","created_at":"2026-07-05T07:56:40.902509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.00626v2","created_at":"2026-07-05T07:56:40.902509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00626","created_at":"2026-07-05T07:56:40.902509+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CAGY7CGX6AR","created_at":"2026-07-05T07:56:40.902509+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CAGY7CGX6ARVMZJ","created_at":"2026-07-05T07:56:40.902509+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CAGY7CG","created_at":"2026-07-05T07:56:40.902509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21014","citing_title":"BayesFP: Posterior Estimation for Flow-Based Policies via Feynman-Kac Sampling","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21680","citing_title":"Flying Together: Human-Guided Immersive Shared Control for Aerial Robot Teams in Unknown Environments","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2409.01652","citing_title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","ref_index":149,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67","json":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67.json","graph_json":"https://pith.science/api/pith-number/4CAGY7CGX6ARVMZJ5E3UAYGX67/graph.json","events_json":"https://pith.science/api/pith-number/4CAGY7CGX6ARVMZJ5E3UAYGX67/events.json","paper":"https://pith.science/paper/4CAGY7CG"},"agent_actions":{"view_html":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67","download_json":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67.json","view_paper":"https://pith.science/paper/4CAGY7CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.00626&json=true","fetch_graph":"https://pith.science/api/pith-number/4CAGY7CGX6ARVMZJ5E3UAYGX67/graph.json","fetch_events":"https://pith.science/api/pith-number/4CAGY7CGX6ARVMZJ5E3UAYGX67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67/action/storage_attestation","attest_author":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67/action/author_attestation","sign_citation":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67/action/citation_signature","submit_replication":"https://pith.science/pith/4CAGY7CGX6ARVMZJ5E3UAYGX67/action/replication_record"}},"created_at":"2026-07-05T07:56:40.902509+00:00","updated_at":"2026-07-05T07:56:40.902509+00:00"}