{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7ZXZ2RYQIJHDHRBUX5VCKBIXFB","short_pith_number":"pith:7ZXZ2RYQ","schema_version":"1.0","canonical_sha256":"fe6f9d4710424e33c434bf6a250517287105432c9edaeba2c3cbbef3f39d6fc3","source":{"kind":"arxiv","id":"1305.1293","version":1},"attestation_state":"computed","paper":{"title":"Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Shi-Qing Xin, Xiang Ying, Ying He","submitted_at":"2013-05-07T14:09:16Z","abstract_excerpt":"In many graphics applications, the computation of exact geodesic distance is very important. However, the high computational cost of the existing geodesic algorithms means that they are not practical for large-scale models or time-critical applications. To tackle this challenge, we propose the parallel Chen-Han (or PCH) algorithm, which extends the classic Chen-Han (CH) discrete geodesic algorithm to the parallel setting. The original CH algorithm and its variant both lack a parallel solution because the windows (a key data structure that carries the shortest distance in the wavefront propagat"},"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":"1305.1293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2013-05-07T14:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"78b26c9858a6847311460f0ed044a0f784a983dd27996564c92e1ac71add7b21","abstract_canon_sha256":"866643e8454500d9c71e21d2f442ac6cd43217aca1f398eb5bea286a5ec6b21b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:22.099251Z","signature_b64":"Z4HIW+z4X8ZsRuJo5UFSQ4bw6kGJQUw9/co0+2aCFrQ1IMr0dtvNNSuGzyJuxzo6oHiOMpFAJ7lMh9Cs/BSfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe6f9d4710424e33c434bf6a250517287105432c9edaeba2c3cbbef3f39d6fc3","last_reissued_at":"2026-05-18T03:26:22.098519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:22.098519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Shi-Qing Xin, Xiang Ying, Ying He","submitted_at":"2013-05-07T14:09:16Z","abstract_excerpt":"In many graphics applications, the computation of exact geodesic distance is very important. However, the high computational cost of the existing geodesic algorithms means that they are not practical for large-scale models or time-critical applications. To tackle this challenge, we propose the parallel Chen-Han (or PCH) algorithm, which extends the classic Chen-Han (CH) discrete geodesic algorithm to the parallel setting. The original CH algorithm and its variant both lack a parallel solution because the windows (a key data structure that carries the shortest distance in the wavefront propagat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1293","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":""},"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":"1305.1293","created_at":"2026-05-18T03:26:22.098653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1293v1","created_at":"2026-05-18T03:26:22.098653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1293","created_at":"2026-05-18T03:26:22.098653+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZXZ2RYQIJHD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZXZ2RYQIJHDHRBU","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZXZ2RYQ","created_at":"2026-05-18T12:27:38.830355+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/7ZXZ2RYQIJHDHRBUX5VCKBIXFB","json":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB.json","graph_json":"https://pith.science/api/pith-number/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/graph.json","events_json":"https://pith.science/api/pith-number/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/events.json","paper":"https://pith.science/paper/7ZXZ2RYQ"},"agent_actions":{"view_html":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB","download_json":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB.json","view_paper":"https://pith.science/paper/7ZXZ2RYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1293&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/action/storage_attestation","attest_author":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/action/author_attestation","sign_citation":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/action/citation_signature","submit_replication":"https://pith.science/pith/7ZXZ2RYQIJHDHRBUX5VCKBIXFB/action/replication_record"}},"created_at":"2026-05-18T03:26:22.098653+00:00","updated_at":"2026-05-18T03:26:22.098653+00:00"}