{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7J4QCGVVZKSYDWPZ5BE5KSDFBX","short_pith_number":"pith:7J4QCGVV","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"},"canonical_sha256":"fa79011ab5caa581d9f9e849d548650ded17c7aeac605df36f4994062d151ee9","source":{"kind":"arxiv","id":"1511.03999","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03999","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03999v2","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03999","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"7J4QCGVVZKSY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7J4QCGVVZKSYDWPZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7J4QCGVV","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7J4QCGVVZKSYDWPZ5BE5KSDFBX","target":"record","payload":{"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"},"canonical_sha256":"fa79011ab5caa581d9f9e849d548650ded17c7aeac605df36f4994062d151ee9","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"},"source_kind":"arxiv","source_id":"1511.03999","source_version":2,"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-05-18T01:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnOH3yyxxjh7xneU6xhO1hEkYsgr+tmN85udewiqVlSgo23goYf/uS1AFvXbne1E5Xj1XDfKW0H9q3IH28WDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T20:14:22.077991Z"},"content_sha256":"a918b836606efa8de9f071c3a346cc7fba222dea45bbf294b84b05938bdaa42b","schema_version":"1.0","event_id":"sha256:a918b836606efa8de9f071c3a346cc7fba222dea45bbf294b84b05938bdaa42b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7J4QCGVVZKSYDWPZ5BE5KSDFBX","target":"graph","payload":{"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"},"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-05-18T01:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhePDPDaZ0nBjNNGKV6o9NnnKnyz8ZevDBkaPXRaqZEnekOAqCsB+Glg7I95PskU5riaT04YKX5HD/AkPE7xAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T20:14:22.078358Z"},"content_sha256":"21a79e5379a07c3066871058b9bb5c8440e501e38ad7e352fc71f74175a3fabb","schema_version":"1.0","event_id":"sha256:21a79e5379a07c3066871058b9bb5c8440e501e38ad7e352fc71f74175a3fabb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/bundle.json","state_url":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/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-05-21T20:14:22Z","links":{"resolver":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX","bundle":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/bundle.json","state":"https://pith.science/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7J4QCGVVZKSYDWPZ5BE5KSDFBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7J4QCGVVZKSYDWPZ5BE5KSDFBX","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":"88b59cd9e462ae706b3c90478b3b9eb8c7280f2aced9e5819ad17eec1da9cbd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-12T18:44:38Z","title_canon_sha256":"791cff4770f76858901089c7c0b7748ef80950f54c75e09983c807c13228b8a2"},"schema_version":"1.0","source":{"id":"1511.03999","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03999","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03999v2","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03999","created_at":"2026-05-18T01:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"7J4QCGVVZKSY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7J4QCGVVZKSYDWPZ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7J4QCGVV","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:21a79e5379a07c3066871058b9bb5c8440e501e38ad7e352fc71f74175a3fabb","target":"graph","created_at":"2026-05-18T01:26:59Z","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"},"paper":{"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","authors_text":"Danwei Li, Dinesh Manocha, Jia Pan, Liang He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-12T18:44:38Z","title":"Efficient Penetration Depth Computation between Rigid Models using Contact Space Propagation Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03999","kind":"arxiv","version":2},"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:a918b836606efa8de9f071c3a346cc7fba222dea45bbf294b84b05938bdaa42b","target":"record","created_at":"2026-05-18T01:26:59Z","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":"88b59cd9e462ae706b3c90478b3b9eb8c7280f2aced9e5819ad17eec1da9cbd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-11-12T18:44:38Z","title_canon_sha256":"791cff4770f76858901089c7c0b7748ef80950f54c75e09983c807c13228b8a2"},"schema_version":"1.0","source":{"id":"1511.03999","kind":"arxiv","version":2}},"canonical_sha256":"fa79011ab5caa581d9f9e849d548650ded17c7aeac605df36f4994062d151ee9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa79011ab5caa581d9f9e849d548650ded17c7aeac605df36f4994062d151ee9","first_computed_at":"2026-05-18T01:26:59.736018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:59.736018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DeJ6Tl3SJ1JL7LxZkz6Ym5hF4oJiOaAJJC73MaXYHfKacU9LzesNqUvfEne1z/00K4urI8D40Rypck726xzvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:59.736708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03999","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a918b836606efa8de9f071c3a346cc7fba222dea45bbf294b84b05938bdaa42b","sha256:21a79e5379a07c3066871058b9bb5c8440e501e38ad7e352fc71f74175a3fabb"],"state_sha256":"0d7f9a16f4f5b5fa68f44fbe373ff8f2f1741cb129a751dc69061a331ac0fbfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+M9enz0K+IE/tiJeo/UXD+0SqqmDA1u56ka0CJqbiY3s2JHHE79BLRELbdPCsh6l4kTS/CMolDAr9/5N/w87DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T20:14:22.080703Z","bundle_sha256":"684e6fa00320e868b3cb2405bc26d696e0a04f64f0115bd9410f49aecb7d2cdf"}}