{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7J4QCGVVZKSYDWPZ5BE5KSDFBX","short_pith_number":"pith:7J4QCGVV","schema_version":"1.0","canonical_sha256":"fa79011ab5caa581d9f9e849d548650ded17c7aeac605df36f4994062d151ee9","source":{"kind":"arxiv","id":"1511.03999","version":2},"attestation_state":"computed","paper":{"title":"Efficient Penetration Depth Computation between Rigid Models using Contact Space Propagation Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Danwei Li, Dinesh Manocha, Jia Pan, Liang He","submitted_at":"2015-11-12T18:44:38Z","abstract_excerpt":"We present a novel method to compute the approximate global penetration depth (PD) between two non-convex geometric models. Our approach consists of two phases: offline precomputation and run-time queries. In the first phase, our formulation uses a novel sampling algorithm to precompute an approximation of the high-dimensional contact space between the pair of models. As compared with prior random sampling algorithms for contact space approximation, our propagation sampling considerably speeds up the precomputation and yields a high quality approximation. At run-time, we perform a nearest-neig"},"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":"1511.03999","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-12T18:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"791cff4770f76858901089c7c0b7748ef80950f54c75e09983c807c13228b8a2","abstract_canon_sha256":"88b59cd9e462ae706b3c90478b3b9eb8c7280f2aced9e5819ad17eec1da9cbd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:59.736708Z","signature_b64":"DeJ6Tl3SJ1JL7LxZkz6Ym5hF4oJiOaAJJC73MaXYHfKacU9LzesNqUvfEne1z/00K4urI8D40Rypck726xzvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa79011ab5caa581d9f9e849d548650ded17c7aeac605df36f4994062d151ee9","last_reissued_at":"2026-05-18T01:26:59.736018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:59.736018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Penetration Depth Computation between Rigid Models using Contact Space Propagation Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Danwei Li, Dinesh Manocha, Jia Pan, Liang He","submitted_at":"2015-11-12T18:44:38Z","abstract_excerpt":"We present a novel method to compute the approximate global penetration depth (PD) between two non-convex geometric models. Our approach consists of two phases: offline precomputation and run-time queries. In the first phase, our formulation uses a novel sampling algorithm to precompute an approximation of the high-dimensional contact space between the pair of models. As compared with prior random sampling algorithms for contact space approximation, our propagation sampling considerably speeds up the precomputation and yields a high quality approximation. At run-time, we perform a nearest-neig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03999","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":""},"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":"1511.03999","created_at":"2026-05-18T01:26:59.736134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03999v2","created_at":"2026-05-18T01:26:59.736134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03999","created_at":"2026-05-18T01:26:59.736134+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J4QCGVVZKSY","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J4QCGVVZKSYDWPZ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J4QCGVV","created_at":"2026-05-18T12:29:10.953037+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/7J4QCGVVZKSYDWPZ5BE5KSDFBX","json":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX.json","graph_json":"https://pith.science/api/pith-number/7J4QCGVVZKSYDWPZ5BE5KSDFBX/graph.json","events_json":"https://pith.science/api/pith-number/7J4QCGVVZKSYDWPZ5BE5KSDFBX/events.json","paper":"https://pith.science/paper/7J4QCGVV"},"agent_actions":{"view_html":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX","download_json":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX.json","view_paper":"https://pith.science/paper/7J4QCGVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03999&json=true","fetch_graph":"https://pith.science/api/pith-number/7J4QCGVVZKSYDWPZ5BE5KSDFBX/graph.json","fetch_events":"https://pith.science/api/pith-number/7J4QCGVVZKSYDWPZ5BE5KSDFBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/action/storage_attestation","attest_author":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/action/author_attestation","sign_citation":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/action/citation_signature","submit_replication":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/action/replication_record"}},"created_at":"2026-05-18T01:26:59.736134+00:00","updated_at":"2026-05-18T01:26:59.736134+00:00"}