{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XHXPLKAMC7NRCK4TOJQL2PSAXE","short_pith_number":"pith:XHXPLKAM","schema_version":"1.0","canonical_sha256":"b9eef5a80c17db112b937260bd3e40b935094b2fa109a79332f711390ce147e1","source":{"kind":"arxiv","id":"2305.08174","version":1},"attestation_state":"computed","paper":{"title":"ReSDF: Redistancing Implicit Surfaces using Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Chang hoon Song, Jooyoung Hahn, Myungjoo Kang, Yesom Park","submitted_at":"2023-05-14T14:54:19Z","abstract_excerpt":"This paper proposes a deep-learning-based method for recovering a signed distance function (SDF) of a given hypersurface represented by an implicit level set function. Using the flexibility of constructing a neural network, we use an augmented network by defining an auxiliary output to represent the gradient of the SDF. There are three advantages of the augmented network; (i) the target interface is accurately captured, (ii) the gradient has a unit norm, and (iii) two outputs are approximated by a single network. Moreover, unlike a conventional loss term which uses a residual of the eikonal eq"},"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":"2305.08174","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2023-05-14T14:54:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"92de6a7452fad104110a3e43661ce284d0cce8078519843c290ec77d3402b465","abstract_canon_sha256":"fccf2b4a1a82cd35fb9201c98f4b8f14529cf067349e9e114e1f85578cb55242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:58.441714Z","signature_b64":"5lyvEeBhYQcdyK06H+dRZRRP6DvxCbt4uZNAOpIbZ79/WePDEFcg5ogXCmCnr6661/b2H486hSp3wcvGXN7NCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9eef5a80c17db112b937260bd3e40b935094b2fa109a79332f711390ce147e1","last_reissued_at":"2026-07-05T06:09:58.441326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:58.441326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReSDF: Redistancing Implicit Surfaces using Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Chang hoon Song, Jooyoung Hahn, Myungjoo Kang, Yesom Park","submitted_at":"2023-05-14T14:54:19Z","abstract_excerpt":"This paper proposes a deep-learning-based method for recovering a signed distance function (SDF) of a given hypersurface represented by an implicit level set function. Using the flexibility of constructing a neural network, we use an augmented network by defining an auxiliary output to represent the gradient of the SDF. There are three advantages of the augmented network; (i) the target interface is accurately captured, (ii) the gradient has a unit norm, and (iii) two outputs are approximated by a single network. Moreover, unlike a conventional loss term which uses a residual of the eikonal eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08174","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.08174/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":"2305.08174","created_at":"2026-07-05T06:09:58.441383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08174v1","created_at":"2026-07-05T06:09:58.441383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08174","created_at":"2026-07-05T06:09:58.441383+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHXPLKAMC7NR","created_at":"2026-07-05T06:09:58.441383+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHXPLKAMC7NRCK4T","created_at":"2026-07-05T06:09:58.441383+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHXPLKAM","created_at":"2026-07-05T06:09:58.441383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06047","citing_title":"Neural Shortest Path for Surface Reconstruction from Point Clouds","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE","json":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE.json","graph_json":"https://pith.science/api/pith-number/XHXPLKAMC7NRCK4TOJQL2PSAXE/graph.json","events_json":"https://pith.science/api/pith-number/XHXPLKAMC7NRCK4TOJQL2PSAXE/events.json","paper":"https://pith.science/paper/XHXPLKAM"},"agent_actions":{"view_html":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE","download_json":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE.json","view_paper":"https://pith.science/paper/XHXPLKAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08174&json=true","fetch_graph":"https://pith.science/api/pith-number/XHXPLKAMC7NRCK4TOJQL2PSAXE/graph.json","fetch_events":"https://pith.science/api/pith-number/XHXPLKAMC7NRCK4TOJQL2PSAXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE/action/storage_attestation","attest_author":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE/action/author_attestation","sign_citation":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE/action/citation_signature","submit_replication":"https://pith.science/pith/XHXPLKAMC7NRCK4TOJQL2PSAXE/action/replication_record"}},"created_at":"2026-07-05T06:09:58.441383+00:00","updated_at":"2026-07-05T06:09:58.441383+00:00"}