{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NDMF77R7PIBKIJBY6UN5XFY6LQ","short_pith_number":"pith:NDMF77R7","schema_version":"1.0","canonical_sha256":"68d85ffe3f7a02a42438f51bdb971e5c0a4a020fee6a74ea2a391eaafbfabb6d","source":{"kind":"arxiv","id":"1611.02147","version":1},"attestation_state":"computed","paper":{"title":"Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Bedrich Benes, David Bommes, Dong-Ming Yan, Kaimo Hu, Pierre Alliez","submitted_at":"2016-11-07T16:12:08Z","abstract_excerpt":"The typical goal of surface remeshing consists in finding a mesh that is (1) geometrically faithful to the original geometry, (2) as coarse as possible to obtain a low-complexity representation and (3) free of bad elements that would hamper the desired application. In this paper, we design an algorithm to address all three optimization goals simultaneously. The user specifies desired bounds on approximation error {\\delta}, minimal interior angle {\\theta} and maximum mesh complexity N (number of vertices). Since such a desired mesh might not even exist, our optimization framework treats only th"},"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":"1611.02147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2016-11-07T16:12:08Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"62e36c5bd46ce03673a30dba84a834a80b6c9f69a7f2e9f0600c6659133b76bf","abstract_canon_sha256":"ea7a504b855e160f347116307fa48028b001696d10a2ec3d122352bd9442538a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:03.585777Z","signature_b64":"IljRf2Wud3BH2SKTLKc+887J1D2Xv9BekvGUC7WfUHpWcCpgrZwyQyRsQg+HPb6TDfXkVrwrOTn42F9vMgfNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68d85ffe3f7a02a42438f51bdb971e5c0a4a020fee6a74ea2a391eaafbfabb6d","last_reissued_at":"2026-05-18T01:00:03.585198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:03.585198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GR","authors_text":"Bedrich Benes, David Bommes, Dong-Ming Yan, Kaimo Hu, Pierre Alliez","submitted_at":"2016-11-07T16:12:08Z","abstract_excerpt":"The typical goal of surface remeshing consists in finding a mesh that is (1) geometrically faithful to the original geometry, (2) as coarse as possible to obtain a low-complexity representation and (3) free of bad elements that would hamper the desired application. In this paper, we design an algorithm to address all three optimization goals simultaneously. The user specifies desired bounds on approximation error {\\delta}, minimal interior angle {\\theta} and maximum mesh complexity N (number of vertices). Since such a desired mesh might not even exist, our optimization framework treats only th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02147","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":"1611.02147","created_at":"2026-05-18T01:00:03.585286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02147v1","created_at":"2026-05-18T01:00:03.585286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02147","created_at":"2026-05-18T01:00:03.585286+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDMF77R7PIBK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDMF77R7PIBKIJBY","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDMF77R7","created_at":"2026-05-18T12:30:32.724797+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/NDMF77R7PIBKIJBY6UN5XFY6LQ","json":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ.json","graph_json":"https://pith.science/api/pith-number/NDMF77R7PIBKIJBY6UN5XFY6LQ/graph.json","events_json":"https://pith.science/api/pith-number/NDMF77R7PIBKIJBY6UN5XFY6LQ/events.json","paper":"https://pith.science/paper/NDMF77R7"},"agent_actions":{"view_html":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ","download_json":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ.json","view_paper":"https://pith.science/paper/NDMF77R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02147&json=true","fetch_graph":"https://pith.science/api/pith-number/NDMF77R7PIBKIJBY6UN5XFY6LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NDMF77R7PIBKIJBY6UN5XFY6LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ/action/storage_attestation","attest_author":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ/action/author_attestation","sign_citation":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ/action/citation_signature","submit_replication":"https://pith.science/pith/NDMF77R7PIBKIJBY6UN5XFY6LQ/action/replication_record"}},"created_at":"2026-05-18T01:00:03.585286+00:00","updated_at":"2026-05-18T01:00:03.585286+00:00"}