{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H3ZSO7GKE24TLXIV6BRLSPUEZ2","short_pith_number":"pith:H3ZSO7GK","schema_version":"1.0","canonical_sha256":"3ef3277cca26b935dd15f062b93e84cebde023bba2f254ce6c63d8e3fcee6a1e","source":{"kind":"arxiv","id":"1606.00803","version":1},"attestation_state":"computed","paper":{"title":"Locality-Aware Laplacian Mesh Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Guillaume Aupy, JeongHyung Park, Padma Raghavan","submitted_at":"2016-06-02T18:58:53Z","abstract_excerpt":"In this paper, we propose a novel reordering scheme to improve the performance of a Laplacian Mesh Smoothing (LMS). While the Laplacian smoothing algorithm is well optimized and studied, we show how a simple reordering of the vertices of the mesh can greatly improve the execution time of the smoothing algorithm. The idea of our reordering is based on (i) the postulate that cache misses are a very time consuming part of the execution of LMS, and (ii) the study of the reuse distance patterns of various executions of the LMS algorithm.\n  Our reordering algorithm is very simple but allows for huge"},"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":"1606.00803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-06-02T18:58:53Z","cross_cats_sorted":[],"title_canon_sha256":"7c411df2ab7826b8b02832b6ccba441697f0b4582eadc89fb0765b2cb79d99e7","abstract_canon_sha256":"d749ca8686a396927ee65d786a952ed3140f25411ecf1f4845e15c882482357e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:00.578994Z","signature_b64":"eG2+tAEtkdHl/3bkYzfz5P8zHjAkchf3lY2aVMFjRT4cMl6B7fg4+zi8T84+Is4QGK9LWZOglM3d9nRkWpuBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ef3277cca26b935dd15f062b93e84cebde023bba2f254ce6c63d8e3fcee6a1e","last_reissued_at":"2026-05-18T01:13:00.578300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:00.578300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality-Aware Laplacian Mesh Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Guillaume Aupy, JeongHyung Park, Padma Raghavan","submitted_at":"2016-06-02T18:58:53Z","abstract_excerpt":"In this paper, we propose a novel reordering scheme to improve the performance of a Laplacian Mesh Smoothing (LMS). While the Laplacian smoothing algorithm is well optimized and studied, we show how a simple reordering of the vertices of the mesh can greatly improve the execution time of the smoothing algorithm. The idea of our reordering is based on (i) the postulate that cache misses are a very time consuming part of the execution of LMS, and (ii) the study of the reuse distance patterns of various executions of the LMS algorithm.\n  Our reordering algorithm is very simple but allows for huge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00803","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":"1606.00803","created_at":"2026-05-18T01:13:00.578425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00803v1","created_at":"2026-05-18T01:13:00.578425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00803","created_at":"2026-05-18T01:13:00.578425+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3ZSO7GKE24T","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3ZSO7GKE24TLXIV","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3ZSO7GK","created_at":"2026-05-18T12:30:19.053100+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/H3ZSO7GKE24TLXIV6BRLSPUEZ2","json":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2.json","graph_json":"https://pith.science/api/pith-number/H3ZSO7GKE24TLXIV6BRLSPUEZ2/graph.json","events_json":"https://pith.science/api/pith-number/H3ZSO7GKE24TLXIV6BRLSPUEZ2/events.json","paper":"https://pith.science/paper/H3ZSO7GK"},"agent_actions":{"view_html":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2","download_json":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2.json","view_paper":"https://pith.science/paper/H3ZSO7GK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00803&json=true","fetch_graph":"https://pith.science/api/pith-number/H3ZSO7GKE24TLXIV6BRLSPUEZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/H3ZSO7GKE24TLXIV6BRLSPUEZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2/action/storage_attestation","attest_author":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2/action/author_attestation","sign_citation":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2/action/citation_signature","submit_replication":"https://pith.science/pith/H3ZSO7GKE24TLXIV6BRLSPUEZ2/action/replication_record"}},"created_at":"2026-05-18T01:13:00.578425+00:00","updated_at":"2026-05-18T01:13:00.578425+00:00"}