{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OLXZ3KKBIWZPEHFRSLFTIIZ4EX","short_pith_number":"pith:OLXZ3KKB","schema_version":"1.0","canonical_sha256":"72ef9da94145b2f21cb192cb34233c25e8acd874a060c8edc9fa073445605d3d","source":{"kind":"arxiv","id":"2404.13445","version":3},"attestation_state":"computed","paper":{"title":"DMesh: A Differentiable Mesh Representation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Matheus Gadelha, Ming C. Lin, Sanghyun Son, Yang Zhou, Yi Zhou, Zexiang Xu","submitted_at":"2024-04-20T18:52:51Z","abstract_excerpt":"We present a differentiable representation, DMesh, for general 3D triangular meshes. DMesh considers both the geometry and connectivity information of a mesh. In our design, we first get a set of convex tetrahedra that compactly tessellates the domain based on Weighted Delaunay Triangulation (WDT), and select triangular faces on the tetrahedra to define the final mesh. We formulate probability of faces to exist on the actual surface in a differentiable manner based on the WDT. This enables DMesh to represent meshes of various topology in a differentiable way, and allows us to reconstruct the 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":"2404.13445","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-04-20T18:52:51Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"7b0c24845489e6ce9f32b225a379dd505039b84a12519a4e56dadfc5e020ef6a","abstract_canon_sha256":"cbaa9357b1c114d3bd7b0565a4188397ff263f840e3bf33b885616c9d8a52591"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:15.043355Z","signature_b64":"GGM9+eg/ewmihdkEXNjZGzly/BPZGhxOI38Vz7MMAgx7roI4z3na7pfxQwyLKr6WW5Zixcu7AKUiyV7ZUdeFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ef9da94145b2f21cb192cb34233c25e8acd874a060c8edc9fa073445605d3d","last_reissued_at":"2026-07-05T11:32:15.042823Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:15.042823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DMesh: A Differentiable Mesh Representation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Matheus Gadelha, Ming C. Lin, Sanghyun Son, Yang Zhou, Yi Zhou, Zexiang Xu","submitted_at":"2024-04-20T18:52:51Z","abstract_excerpt":"We present a differentiable representation, DMesh, for general 3D triangular meshes. DMesh considers both the geometry and connectivity information of a mesh. In our design, we first get a set of convex tetrahedra that compactly tessellates the domain based on Weighted Delaunay Triangulation (WDT), and select triangular faces on the tetrahedra to define the final mesh. We formulate probability of faces to exist on the actual surface in a differentiable manner based on the WDT. This enables DMesh to represent meshes of various topology in a differentiable way, and allows us to reconstruct the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.13445","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/2404.13445/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":"2404.13445","created_at":"2026-07-05T11:32:15.042881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.13445v3","created_at":"2026-07-05T11:32:15.042881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.13445","created_at":"2026-07-05T11:32:15.042881+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLXZ3KKBIWZP","created_at":"2026-07-05T11:32:15.042881+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLXZ3KKBIWZPEHFR","created_at":"2026-07-05T11:32:15.042881+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLXZ3KKB","created_at":"2026-07-05T11:32:15.042881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07288","citing_title":"ExMesh: EXplicit Mesh Reconstruction with Topology Adaptation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04621","citing_title":"MeshFlow: Efficient Artistic Mesh Generation via MeshVAE and Flow-based Diffusion Transformer","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30673","citing_title":"PolyFlow: Continuous Topology Embedding Flow Matching for Artist-style Mesh Generation","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX","json":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX.json","graph_json":"https://pith.science/api/pith-number/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/graph.json","events_json":"https://pith.science/api/pith-number/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/events.json","paper":"https://pith.science/paper/OLXZ3KKB"},"agent_actions":{"view_html":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX","download_json":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX.json","view_paper":"https://pith.science/paper/OLXZ3KKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.13445&json=true","fetch_graph":"https://pith.science/api/pith-number/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/graph.json","fetch_events":"https://pith.science/api/pith-number/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/action/storage_attestation","attest_author":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/action/author_attestation","sign_citation":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/action/citation_signature","submit_replication":"https://pith.science/pith/OLXZ3KKBIWZPEHFRSLFTIIZ4EX/action/replication_record"}},"created_at":"2026-07-05T11:32:15.042881+00:00","updated_at":"2026-07-05T11:32:15.042881+00:00"}