{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KGGGLYPKQ7VAM4LX7BZFY2BAFU","short_pith_number":"pith:KGGGLYPK","schema_version":"1.0","canonical_sha256":"518c65e1ea87ea067177f8725c68202d0d3b5e48cec7f64a78a7245de2909dc6","source":{"kind":"arxiv","id":"1902.08767","version":3},"attestation_state":"computed","paper":{"title":"VoroCrust: Voronoi Meshing Without Clipping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Ahmad A. Rushdi, Ahmed Abdelkader, Ahmed H. Mahmoud, Chandrajit L. Bajaj, John D. Owens, Mohamed S. Ebeida, Scott A. Mitchell","submitted_at":"2019-02-23T09:48:34Z","abstract_excerpt":"Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-m"},"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":"1902.08767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2019-02-23T09:48:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"ac6eec0c04874f74bcd6907dbd30f3910300c04a5b589647ca97d700044704ce","abstract_canon_sha256":"487f10219d1661bc95d4d3faa72b0fd6a1da1bdbaf531f1ab35cfb3b3dd22172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:41.292892Z","signature_b64":"a/T4rKC1Dw20exhXtHSUsrMgzeVrjp2pCB8671meA253uRo3iR9qj4X/FFeB+kHacYlkmCUYX14Y6N4MTU0OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"518c65e1ea87ea067177f8725c68202d0d3b5e48cec7f64a78a7245de2909dc6","last_reissued_at":"2026-07-05T07:15:41.292390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:41.292390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VoroCrust: Voronoi Meshing Without Clipping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Ahmad A. Rushdi, Ahmed Abdelkader, Ahmed H. Mahmoud, Chandrajit L. Bajaj, John D. Owens, Mohamed S. Ebeida, Scott A. Mitchell","submitted_at":"2019-02-23T09:48:34Z","abstract_excerpt":"Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably-correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08767","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/1902.08767/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":"1902.08767","created_at":"2026-07-05T07:15:41.292448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08767v3","created_at":"2026-07-05T07:15:41.292448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08767","created_at":"2026-07-05T07:15:41.292448+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGGGLYPKQ7VA","created_at":"2026-07-05T07:15:41.292448+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGGGLYPKQ7VAM4LX","created_at":"2026-07-05T07:15:41.292448+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGGGLYPK","created_at":"2026-07-05T07:15:41.292448+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/KGGGLYPKQ7VAM4LX7BZFY2BAFU","json":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU.json","graph_json":"https://pith.science/api/pith-number/KGGGLYPKQ7VAM4LX7BZFY2BAFU/graph.json","events_json":"https://pith.science/api/pith-number/KGGGLYPKQ7VAM4LX7BZFY2BAFU/events.json","paper":"https://pith.science/paper/KGGGLYPK"},"agent_actions":{"view_html":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU","download_json":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU.json","view_paper":"https://pith.science/paper/KGGGLYPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08767&json=true","fetch_graph":"https://pith.science/api/pith-number/KGGGLYPKQ7VAM4LX7BZFY2BAFU/graph.json","fetch_events":"https://pith.science/api/pith-number/KGGGLYPKQ7VAM4LX7BZFY2BAFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU/action/storage_attestation","attest_author":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU/action/author_attestation","sign_citation":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU/action/citation_signature","submit_replication":"https://pith.science/pith/KGGGLYPKQ7VAM4LX7BZFY2BAFU/action/replication_record"}},"created_at":"2026-07-05T07:15:41.292448+00:00","updated_at":"2026-07-05T07:15:41.292448+00:00"}