{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:US7FVX4C36EKRGXZEU6XMBYOBW","short_pith_number":"pith:US7FVX4C","canonical_record":{"source":{"id":"2406.02807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-04T22:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"086b3fb855bef0fe386b7e70fdfbcee8bd8c4104122e2c9f57cfb73a7bec487a","abstract_canon_sha256":"1968f74e06f78f962f8cad069757d900dcefd52470232234180bc0d0b9b2fdcf"},"schema_version":"1.0"},"canonical_sha256":"a4be5adf82df88a89af9253d76070e0d8b1bc34c4c55dd47628bd400dec4ef11","source":{"kind":"arxiv","id":"2406.02807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02807","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02807v1","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02807","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"US7FVX4C36EK","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"US7FVX4C36EKRGXZ","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"US7FVX4C","created_at":"2026-07-05T08:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:US7FVX4C36EKRGXZEU6XMBYOBW","target":"record","payload":{"canonical_record":{"source":{"id":"2406.02807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-04T22:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"086b3fb855bef0fe386b7e70fdfbcee8bd8c4104122e2c9f57cfb73a7bec487a","abstract_canon_sha256":"1968f74e06f78f962f8cad069757d900dcefd52470232234180bc0d0b9b2fdcf"},"schema_version":"1.0"},"canonical_sha256":"a4be5adf82df88a89af9253d76070e0d8b1bc34c4c55dd47628bd400dec4ef11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:30.664312Z","signature_b64":"VkxP7UHI0p8X0pxv3B4oqBgdJNGBaGLKn+17Vz6bmSjovo7bEGbtDu7d3Vy/+HW0PYs8QfsbfP054Qc8ccahDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4be5adf82df88a89af9253d76070e0d8b1bc34c4c55dd47628bd400dec4ef11","last_reissued_at":"2026-07-05T08:27:30.663853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:30.663853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.02807","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SV8Zy0oHk7oThLAv4XtUnKOjaYHz1wz3dsb3Ge7GDIhgvVD7vAnfLWWQbVwntBeiOCIXzlejG7Xo54tjZvsKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:26:04.083994Z"},"content_sha256":"90aa045f903c2409178ff2a9a69451733ebf483d3618b8c26fc39689c802ed74","schema_version":"1.0","event_id":"sha256:90aa045f903c2409178ff2a9a69451733ebf483d3618b8c26fc39689c802ed74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:US7FVX4C36EKRGXZEU6XMBYOBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collision-Affording Point Trees: SIMD-Amenable Nearest Neighbors for Fast Collision Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Clayton W. Ramsey, Lydia E. Kavraki, Wil Thomason, Zachary Kingston","submitted_at":"2024-06-04T22:22:41Z","abstract_excerpt":"Motion planning against sensor data is often a critical bottleneck in real-time robot control. For sampling-based motion planners, which are effective for high-dimensional systems such as manipulators, the most time-intensive component is collision checking. We present a novel spatial data structure, the collision-affording point tree (CAPT): an exact representation of point clouds that accelerates collision-checking queries between robots and point clouds by an order of magnitude, with an average query time of less than 10 nanoseconds on 3D scenes comprising thousands of points. With the CAPT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02807","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/2406.02807/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syhVNgqAozrG2/S7RUwrUBFwvkVrLJpLWVO1XsyQ0/KdJAaW7rBdAAFGz4vji9L03hPIlpt9Y8cS5Fo5A/VbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:26:04.084394Z"},"content_sha256":"7e370e2d08994aa8e49cd736199edc277b37b285d994a9e073a983d345c5e99d","schema_version":"1.0","event_id":"sha256:7e370e2d08994aa8e49cd736199edc277b37b285d994a9e073a983d345c5e99d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/US7FVX4C36EKRGXZEU6XMBYOBW/bundle.json","state_url":"https://pith.science/pith/US7FVX4C36EKRGXZEU6XMBYOBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/US7FVX4C36EKRGXZEU6XMBYOBW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T07:26:04Z","links":{"resolver":"https://pith.science/pith/US7FVX4C36EKRGXZEU6XMBYOBW","bundle":"https://pith.science/pith/US7FVX4C36EKRGXZEU6XMBYOBW/bundle.json","state":"https://pith.science/pith/US7FVX4C36EKRGXZEU6XMBYOBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/US7FVX4C36EKRGXZEU6XMBYOBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:US7FVX4C36EKRGXZEU6XMBYOBW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1968f74e06f78f962f8cad069757d900dcefd52470232234180bc0d0b9b2fdcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-04T22:22:41Z","title_canon_sha256":"086b3fb855bef0fe386b7e70fdfbcee8bd8c4104122e2c9f57cfb73a7bec487a"},"schema_version":"1.0","source":{"id":"2406.02807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02807","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02807v1","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02807","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"US7FVX4C36EK","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"US7FVX4C36EKRGXZ","created_at":"2026-07-05T08:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"US7FVX4C","created_at":"2026-07-05T08:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:7e370e2d08994aa8e49cd736199edc277b37b285d994a9e073a983d345c5e99d","target":"graph","created_at":"2026-07-05T08:27:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.02807/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motion planning against sensor data is often a critical bottleneck in real-time robot control. For sampling-based motion planners, which are effective for high-dimensional systems such as manipulators, the most time-intensive component is collision checking. We present a novel spatial data structure, the collision-affording point tree (CAPT): an exact representation of point clouds that accelerates collision-checking queries between robots and point clouds by an order of magnitude, with an average query time of less than 10 nanoseconds on 3D scenes comprising thousands of points. With the CAPT","authors_text":"Clayton W. Ramsey, Lydia E. Kavraki, Wil Thomason, Zachary Kingston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-04T22:22:41Z","title":"Collision-Affording Point Trees: SIMD-Amenable Nearest Neighbors for Fast Collision Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02807","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90aa045f903c2409178ff2a9a69451733ebf483d3618b8c26fc39689c802ed74","target":"record","created_at":"2026-07-05T08:27:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1968f74e06f78f962f8cad069757d900dcefd52470232234180bc0d0b9b2fdcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-04T22:22:41Z","title_canon_sha256":"086b3fb855bef0fe386b7e70fdfbcee8bd8c4104122e2c9f57cfb73a7bec487a"},"schema_version":"1.0","source":{"id":"2406.02807","kind":"arxiv","version":1}},"canonical_sha256":"a4be5adf82df88a89af9253d76070e0d8b1bc34c4c55dd47628bd400dec4ef11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4be5adf82df88a89af9253d76070e0d8b1bc34c4c55dd47628bd400dec4ef11","first_computed_at":"2026-07-05T08:27:30.663853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:30.663853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VkxP7UHI0p8X0pxv3B4oqBgdJNGBaGLKn+17Vz6bmSjovo7bEGbtDu7d3Vy/+HW0PYs8QfsbfP054Qc8ccahDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:30.664312Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.02807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90aa045f903c2409178ff2a9a69451733ebf483d3618b8c26fc39689c802ed74","sha256:7e370e2d08994aa8e49cd736199edc277b37b285d994a9e073a983d345c5e99d"],"state_sha256":"a19037c78b4fa74c84b763d2c3b84314c7f8e34c0ee3df8329a50b8278d71db9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VHvF/IYcDvsykeqI+QfOzcnsTRwUP2OwLGR2M/rR2uE4XHItzP7g6bnCiUrpeUFFiwXLz+NkTn0UUyhyFweCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:26:04.088127Z","bundle_sha256":"6e5a4401e8ded4a3d3d2f232149fd75904b11325fb0d0102df7c5ca418ecb07d"}}