{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CPHA7PNW74PD6TW6VKKPPCNUYV","short_pith_number":"pith:CPHA7PNW","schema_version":"1.0","canonical_sha256":"13ce0fbdb6ff1e3f4edeaa94f789b4c56c966903a4aceccbada6d30a168fdb2b","source":{"kind":"arxiv","id":"2006.03997","version":2},"attestation_state":"computed","paper":{"title":"MeshSDF: Differentiable Iso-Surface Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artem Lukoianov, Beno\\^it Guillard, Edoardo Remelli, Pascal Fua, Pierre Baque, Stephan R. Richter, Timur Bagautdinov","submitted_at":"2020-06-06T23:44:05Z","abstract_excerpt":"Geometric Deep Learning has recently made striking progress with the advent of continuous Deep Implicit Fields. They allow for detailed modeling of watertight surfaces of arbitrary topology while not relying on a 3D Euclidean grid, resulting in a learnable parameterization that is not limited in resolution.\n  Unfortunately, these methods are often not suitable for applications that require an explicit mesh-based surface representation because converting an implicit field to such a representation relies on the Marching Cubes algorithm, which cannot be differentiated with respect to the underlyi"},"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":"2006.03997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-06-06T23:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"fa8fbf59e12d90c614db54e63ddfcc9eecac0239d1d62db849ee9514eff6db00","abstract_canon_sha256":"4d158bdd1f1eefbc1225fd7e5935767e0192b3cda31b7aa1be119cd370c85311"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:10.147864Z","signature_b64":"guYPwUULsSuzSvldmifjPcQsJk71QxwFVq94xJw1p8wAeB0yuEzY0HsNFlgP1Mzj3tYC8a8I33HVFEUTibWiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ce0fbdb6ff1e3f4edeaa94f789b4c56c966903a4aceccbada6d30a168fdb2b","last_reissued_at":"2026-07-05T01:48:10.147377Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:10.147377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MeshSDF: Differentiable Iso-Surface Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Artem Lukoianov, Beno\\^it Guillard, Edoardo Remelli, Pascal Fua, Pierre Baque, Stephan R. Richter, Timur Bagautdinov","submitted_at":"2020-06-06T23:44:05Z","abstract_excerpt":"Geometric Deep Learning has recently made striking progress with the advent of continuous Deep Implicit Fields. They allow for detailed modeling of watertight surfaces of arbitrary topology while not relying on a 3D Euclidean grid, resulting in a learnable parameterization that is not limited in resolution.\n  Unfortunately, these methods are often not suitable for applications that require an explicit mesh-based surface representation because converting an implicit field to such a representation relies on the Marching Cubes algorithm, which cannot be differentiated with respect to the underlyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03997","kind":"arxiv","version":2},"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/2006.03997/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":"2006.03997","created_at":"2026-07-05T01:48:10.147437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.03997v2","created_at":"2026-07-05T01:48:10.147437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03997","created_at":"2026-07-05T01:48:10.147437+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPHA7PNW74PD","created_at":"2026-07-05T01:48:10.147437+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPHA7PNW74PD6TW6","created_at":"2026-07-05T01:48:10.147437+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPHA7PNW","created_at":"2026-07-05T01:48:10.147437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21271","citing_title":"Generating Highly Structured Test Inputs Leveraging Constraint-Guided Graph Refinement","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV","json":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV.json","graph_json":"https://pith.science/api/pith-number/CPHA7PNW74PD6TW6VKKPPCNUYV/graph.json","events_json":"https://pith.science/api/pith-number/CPHA7PNW74PD6TW6VKKPPCNUYV/events.json","paper":"https://pith.science/paper/CPHA7PNW"},"agent_actions":{"view_html":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV","download_json":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV.json","view_paper":"https://pith.science/paper/CPHA7PNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.03997&json=true","fetch_graph":"https://pith.science/api/pith-number/CPHA7PNW74PD6TW6VKKPPCNUYV/graph.json","fetch_events":"https://pith.science/api/pith-number/CPHA7PNW74PD6TW6VKKPPCNUYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV/action/storage_attestation","attest_author":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV/action/author_attestation","sign_citation":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV/action/citation_signature","submit_replication":"https://pith.science/pith/CPHA7PNW74PD6TW6VKKPPCNUYV/action/replication_record"}},"created_at":"2026-07-05T01:48:10.147437+00:00","updated_at":"2026-07-05T01:48:10.147437+00:00"}