{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6GOR3VLGPD7EWTWW42NVSO5CKE","short_pith_number":"pith:6GOR3VLG","schema_version":"1.0","canonical_sha256":"f19d1dd56678fe4b4ed6e69b593ba2510434fde37bd19023d464012ce143f4ad","source":{"kind":"arxiv","id":"2304.07357","version":2},"attestation_state":"computed","paper":{"title":"Efficient Incremental Penetration Depth Estimation between Convex Geometries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Wei Gao","submitted_at":"2023-04-14T19:33:44Z","abstract_excerpt":"Penetration depth (PD) is essential for robotics due to its extensive applications in dynamic simulation, motion planning, haptic rendering, etc. The Expanding Polytope Algorithm (EPA) is the de facto standard for this problem, which estimates PD by expanding an inner polyhedral approximation of an implicit set. In this paper, we propose a novel optimization-based algorithm that incrementally estimates minimum penetration depth and its direction. One major advantage of our method is that it can be warm-started by exploiting the spatial and temporal coherence, which emerges naturally in many ro"},"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":"2304.07357","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-04-14T19:33:44Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b55022a3eb1a152ed72a8e2daae8992b47e9fcc433bb1ed142311c7b6039b5ad","abstract_canon_sha256":"4376bf9bfd2a9598c0dc3fa05636fbc6d9ff49b7d075458cb184551187733e61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:14.302868Z","signature_b64":"VG6Rm6Wkq4FDK4POJVxw/kXAcR6lKsa3+389fDp2rU6h7Hio0YAwcrGyv4LJgcCB0U4EtCFKWr90iMwgoL/NAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19d1dd56678fe4b4ed6e69b593ba2510434fde37bd19023d464012ce143f4ad","last_reissued_at":"2026-07-05T09:03:14.302380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:14.302380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Incremental Penetration Depth Estimation between Convex Geometries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.RO","authors_text":"Wei Gao","submitted_at":"2023-04-14T19:33:44Z","abstract_excerpt":"Penetration depth (PD) is essential for robotics due to its extensive applications in dynamic simulation, motion planning, haptic rendering, etc. The Expanding Polytope Algorithm (EPA) is the de facto standard for this problem, which estimates PD by expanding an inner polyhedral approximation of an implicit set. In this paper, we propose a novel optimization-based algorithm that incrementally estimates minimum penetration depth and its direction. One major advantage of our method is that it can be warm-started by exploiting the spatial and temporal coherence, which emerges naturally in many ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07357","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/2304.07357/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":"2304.07357","created_at":"2026-07-05T09:03:14.302439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.07357v2","created_at":"2026-07-05T09:03:14.302439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07357","created_at":"2026-07-05T09:03:14.302439+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GOR3VLGPD7E","created_at":"2026-07-05T09:03:14.302439+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GOR3VLGPD7EWTWW","created_at":"2026-07-05T09:03:14.302439+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GOR3VLG","created_at":"2026-07-05T09:03:14.302439+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE","json":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE.json","graph_json":"https://pith.science/api/pith-number/6GOR3VLGPD7EWTWW42NVSO5CKE/graph.json","events_json":"https://pith.science/api/pith-number/6GOR3VLGPD7EWTWW42NVSO5CKE/events.json","paper":"https://pith.science/paper/6GOR3VLG"},"agent_actions":{"view_html":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE","download_json":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE.json","view_paper":"https://pith.science/paper/6GOR3VLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.07357&json=true","fetch_graph":"https://pith.science/api/pith-number/6GOR3VLGPD7EWTWW42NVSO5CKE/graph.json","fetch_events":"https://pith.science/api/pith-number/6GOR3VLGPD7EWTWW42NVSO5CKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE/action/storage_attestation","attest_author":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE/action/author_attestation","sign_citation":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE/action/citation_signature","submit_replication":"https://pith.science/pith/6GOR3VLGPD7EWTWW42NVSO5CKE/action/replication_record"}},"created_at":"2026-07-05T09:03:14.302439+00:00","updated_at":"2026-07-05T09:03:14.302439+00:00"}