{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ABUFBCOVB4OSLJ5NFKLARSIGG2","short_pith_number":"pith:ABUFBCOV","canonical_record":{"source":{"id":"2201.04314","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-12T05:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"922d8285121fcda4e195d5239ba0112b23df0179da7dca548bf2f7f48c20829e","abstract_canon_sha256":"fc293edde63ae3d5b4cb552d1d92e49a9b82f0d416b18408f0f77a4a1df4c8f9"},"schema_version":"1.0"},"canonical_sha256":"00685089d50f1d25a7ad2a9608c90636bdf6324194f7617d9a3d421a48e61cbb","source":{"kind":"arxiv","id":"2201.04314","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.04314","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.04314v3","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04314","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"ABUFBCOVB4OS","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"pith_short_16","alias_value":"ABUFBCOVB4OSLJ5N","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"pith_short_8","alias_value":"ABUFBCOV","created_at":"2026-07-05T04:30:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ABUFBCOVB4OSLJ5NFKLARSIGG2","target":"record","payload":{"canonical_record":{"source":{"id":"2201.04314","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-12T05:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"922d8285121fcda4e195d5239ba0112b23df0179da7dca548bf2f7f48c20829e","abstract_canon_sha256":"fc293edde63ae3d5b4cb552d1d92e49a9b82f0d416b18408f0f77a4a1df4c8f9"},"schema_version":"1.0"},"canonical_sha256":"00685089d50f1d25a7ad2a9608c90636bdf6324194f7617d9a3d421a48e61cbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:40.086752Z","signature_b64":"7hoY3YxkO5fvspRhVcfac6f1D0UUhcPhSpMz1TYn6zFXB/pEucnIhBWr3gw/5TASqGanfl70mKPkHt+Ja77TCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00685089d50f1d25a7ad2a9608c90636bdf6324194f7617d9a3d421a48e61cbb","last_reissued_at":"2026-07-05T04:30:40.086254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:40.086254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.04314","source_version":3,"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-05T04:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aC6dFwpgSTS/z3A9B4ljzjuZhN7l0nZwL/vt3T5aAdKkZdfO6gefRdfYkEqUgUZiQJN29eNkGLs1i9OzIQTVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:41:06.912720Z"},"content_sha256":"a8937152454778906ff6d144ab4ceebd8bfe5c2536af74eeb6890ff57d43194c","schema_version":"1.0","event_id":"sha256:a8937152454778906ff6d144ab4ceebd8bfe5c2536af74eeb6890ff57d43194c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ABUFBCOVB4OSLJ5NFKLARSIGG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Configuration Space Decomposition for Scalable Proxy Collision Checking in Robot Planning and Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Michael Yip, Mrinal Verghese, Nikhil Das, Yuheng Zhi","submitted_at":"2022-01-12T05:38:57Z","abstract_excerpt":"Real-time robot motion planning in complex high-dimensional environments remains an open problem. Motion planning algorithms, and their underlying collision checkers, are crucial to any robot control stack. Collision checking takes up a large portion of the computational time in robot motion planning. Existing collision checkers make trade-offs between speed and accuracy and scale poorly to high-dimensional, complex environments. We present a novel space decomposition method using K-Means clustering in the Forward Kinematics space to accelerate proxy collision checking. We train individual con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04314","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/2201.04314/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-05T04:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F8so9hazbhoLh+psDNAXCv1Eq1M1po6coLQ5lMgFqDj/lweaAzt3i56D2GtqHqjYigPxhjlnFaJEDSeCuKvqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:41:06.913380Z"},"content_sha256":"69a5efbc6e91d22785e32fd741a1e134259abd7c00a4b8b2fd6139bb69b89fe3","schema_version":"1.0","event_id":"sha256:69a5efbc6e91d22785e32fd741a1e134259abd7c00a4b8b2fd6139bb69b89fe3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2/bundle.json","state_url":"https://pith.science/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2/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-07-09T05:41:06Z","links":{"resolver":"https://pith.science/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2","bundle":"https://pith.science/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2/bundle.json","state":"https://pith.science/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABUFBCOVB4OSLJ5NFKLARSIGG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ABUFBCOVB4OSLJ5NFKLARSIGG2","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":"fc293edde63ae3d5b4cb552d1d92e49a9b82f0d416b18408f0f77a4a1df4c8f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-12T05:38:57Z","title_canon_sha256":"922d8285121fcda4e195d5239ba0112b23df0179da7dca548bf2f7f48c20829e"},"schema_version":"1.0","source":{"id":"2201.04314","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.04314","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.04314v3","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04314","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"ABUFBCOVB4OS","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"pith_short_16","alias_value":"ABUFBCOVB4OSLJ5N","created_at":"2026-07-05T04:30:40Z"},{"alias_kind":"pith_short_8","alias_value":"ABUFBCOV","created_at":"2026-07-05T04:30:40Z"}],"graph_snapshots":[{"event_id":"sha256:69a5efbc6e91d22785e32fd741a1e134259abd7c00a4b8b2fd6139bb69b89fe3","target":"graph","created_at":"2026-07-05T04:30:40Z","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/2201.04314/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real-time robot motion planning in complex high-dimensional environments remains an open problem. Motion planning algorithms, and their underlying collision checkers, are crucial to any robot control stack. Collision checking takes up a large portion of the computational time in robot motion planning. Existing collision checkers make trade-offs between speed and accuracy and scale poorly to high-dimensional, complex environments. We present a novel space decomposition method using K-Means clustering in the Forward Kinematics space to accelerate proxy collision checking. We train individual con","authors_text":"Michael Yip, Mrinal Verghese, Nikhil Das, Yuheng Zhi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-12T05:38:57Z","title":"Configuration Space Decomposition for Scalable Proxy Collision Checking in Robot Planning and Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04314","kind":"arxiv","version":3},"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:a8937152454778906ff6d144ab4ceebd8bfe5c2536af74eeb6890ff57d43194c","target":"record","created_at":"2026-07-05T04:30:40Z","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":"fc293edde63ae3d5b4cb552d1d92e49a9b82f0d416b18408f0f77a4a1df4c8f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-12T05:38:57Z","title_canon_sha256":"922d8285121fcda4e195d5239ba0112b23df0179da7dca548bf2f7f48c20829e"},"schema_version":"1.0","source":{"id":"2201.04314","kind":"arxiv","version":3}},"canonical_sha256":"00685089d50f1d25a7ad2a9608c90636bdf6324194f7617d9a3d421a48e61cbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00685089d50f1d25a7ad2a9608c90636bdf6324194f7617d9a3d421a48e61cbb","first_computed_at":"2026-07-05T04:30:40.086254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:30:40.086254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hoY3YxkO5fvspRhVcfac6f1D0UUhcPhSpMz1TYn6zFXB/pEucnIhBWr3gw/5TASqGanfl70mKPkHt+Ja77TCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:30:40.086752Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.04314","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8937152454778906ff6d144ab4ceebd8bfe5c2536af74eeb6890ff57d43194c","sha256:69a5efbc6e91d22785e32fd741a1e134259abd7c00a4b8b2fd6139bb69b89fe3"],"state_sha256":"e500fa88bbb8f19d01879deeaac0d29b51bf686f365a9497b608d8369f650ec8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rsNlc19P1no9Ze0KOMqeKLBeXQmXoI87yOMXiq5WY5bxrzkKZksXsSLtisFBuiyDtl6+82g76cOPJfAREifCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:41:06.916762Z","bundle_sha256":"102d12df9d5616f751f01390527f04c9dab718884afee0c6af91d2705eb9d8e9"}}