{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UBZZIY5GCISZLKFZV3QD4Z6JGI","short_pith_number":"pith:UBZZIY5G","canonical_record":{"source":{"id":"2502.06047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-09T22:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"2d2578dc4ff01f50070d775cf8ac0af4a25387fbbf57bb1b87b194d05ff1f9f9","abstract_canon_sha256":"318e2e64040fdf94e0a8c5bd0d80bc36cef744758708bf08663cf52262f4ae60"},"schema_version":"1.0"},"canonical_sha256":"a0739463a6122595a8b9aee03e67c932071c8e4f8c5788a49d59813ec35d25da","source":{"kind":"arxiv","id":"2502.06047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06047","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06047v1","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06047","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"UBZZIY5GCISZ","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"UBZZIY5GCISZLKFZ","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"UBZZIY5G","created_at":"2026-07-05T10:11:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UBZZIY5GCISZLKFZV3QD4Z6JGI","target":"record","payload":{"canonical_record":{"source":{"id":"2502.06047","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-09T22:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"2d2578dc4ff01f50070d775cf8ac0af4a25387fbbf57bb1b87b194d05ff1f9f9","abstract_canon_sha256":"318e2e64040fdf94e0a8c5bd0d80bc36cef744758708bf08663cf52262f4ae60"},"schema_version":"1.0"},"canonical_sha256":"a0739463a6122595a8b9aee03e67c932071c8e4f8c5788a49d59813ec35d25da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:46.890608Z","signature_b64":"u9RFsW7xRhGzONveEbroL+fPpckYlQSNLuWXnS4jRW8tUPtQ0Fvu9bUBMJVBzAtzrBLtEL5n5oEMVDFJ+AL/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0739463a6122595a8b9aee03e67c932071c8e4f8c5788a49d59813ec35d25da","last_reissued_at":"2026-07-05T10:11:46.890084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:46.890084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.06047","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFhypE7PPE5v6LiJaHS8ecmucWjUmMNPDc80NM4OwexnTxJQKXjv3YQ2762iNEf7pMvII3F6Ykl2W+L3Jn5EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:59:07.054460Z"},"content_sha256":"a0a9385ec7a68bed7e4f6624dbe71aecb1e529b44a784cd09e1d30ec6f5a5617","schema_version":"1.0","event_id":"sha256:a0a9385ec7a68bed7e4f6624dbe71aecb1e529b44a784cd09e1d30ec6f5a5617"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UBZZIY5GCISZLKFZV3QD4Z6JGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Shortest Path for Surface Reconstruction from Point Clouds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Imseong Park, Jooyoung Hahn, Myungjoo Kang, Yesom Park","submitted_at":"2025-02-09T22:01:16Z","abstract_excerpt":"In this paper, we propose the neural shortest path (NSP), a vector-valued implicit neural representation (INR) that approximates a distance function and its gradient. The key feature of NSP is to learn the exact shortest path (ESP), which directs an arbitrary point to its nearest point on the target surface. The NSP is decomposed into its magnitude and direction, and a variable splitting method is used that each decomposed component approximates a distance function and its gradient, respectively. Unlike to existing methods of learning the distance function itself, the NSP ensures the simultane"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06047","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/2502.06047/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORM5V9k9/LkJ1drZ3sZP12NH+c0skkQgTwerrahonHYjWTWyQS0fuogEA+ILAlt/BN2qB40O4YnNlwsjRWQ/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:59:07.055010Z"},"content_sha256":"fa08724e685c79105cfcab08cab631a875ffd0769193c9241e892a98c9abea30","schema_version":"1.0","event_id":"sha256:fa08724e685c79105cfcab08cab631a875ffd0769193c9241e892a98c9abea30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI/bundle.json","state_url":"https://pith.science/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T23:59:07Z","links":{"resolver":"https://pith.science/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI","bundle":"https://pith.science/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI/bundle.json","state":"https://pith.science/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBZZIY5GCISZLKFZV3QD4Z6JGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UBZZIY5GCISZLKFZV3QD4Z6JGI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"318e2e64040fdf94e0a8c5bd0d80bc36cef744758708bf08663cf52262f4ae60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-09T22:01:16Z","title_canon_sha256":"2d2578dc4ff01f50070d775cf8ac0af4a25387fbbf57bb1b87b194d05ff1f9f9"},"schema_version":"1.0","source":{"id":"2502.06047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06047","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06047v1","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06047","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"UBZZIY5GCISZ","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"UBZZIY5GCISZLKFZ","created_at":"2026-07-05T10:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"UBZZIY5G","created_at":"2026-07-05T10:11:46Z"}],"graph_snapshots":[{"event_id":"sha256:fa08724e685c79105cfcab08cab631a875ffd0769193c9241e892a98c9abea30","target":"graph","created_at":"2026-07-05T10:11:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.06047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose the neural shortest path (NSP), a vector-valued implicit neural representation (INR) that approximates a distance function and its gradient. The key feature of NSP is to learn the exact shortest path (ESP), which directs an arbitrary point to its nearest point on the target surface. The NSP is decomposed into its magnitude and direction, and a variable splitting method is used that each decomposed component approximates a distance function and its gradient, respectively. Unlike to existing methods of learning the distance function itself, the NSP ensures the simultane","authors_text":"Imseong Park, Jooyoung Hahn, Myungjoo Kang, Yesom Park","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-09T22:01:16Z","title":"Neural Shortest Path for Surface Reconstruction from Point Clouds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06047","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0a9385ec7a68bed7e4f6624dbe71aecb1e529b44a784cd09e1d30ec6f5a5617","target":"record","created_at":"2026-07-05T10:11:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"318e2e64040fdf94e0a8c5bd0d80bc36cef744758708bf08663cf52262f4ae60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-09T22:01:16Z","title_canon_sha256":"2d2578dc4ff01f50070d775cf8ac0af4a25387fbbf57bb1b87b194d05ff1f9f9"},"schema_version":"1.0","source":{"id":"2502.06047","kind":"arxiv","version":1}},"canonical_sha256":"a0739463a6122595a8b9aee03e67c932071c8e4f8c5788a49d59813ec35d25da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0739463a6122595a8b9aee03e67c932071c8e4f8c5788a49d59813ec35d25da","first_computed_at":"2026-07-05T10:11:46.890084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:46.890084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u9RFsW7xRhGzONveEbroL+fPpckYlQSNLuWXnS4jRW8tUPtQ0Fvu9bUBMJVBzAtzrBLtEL5n5oEMVDFJ+AL/AA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:46.890608Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.06047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0a9385ec7a68bed7e4f6624dbe71aecb1e529b44a784cd09e1d30ec6f5a5617","sha256:fa08724e685c79105cfcab08cab631a875ffd0769193c9241e892a98c9abea30"],"state_sha256":"0287b3e42ddafeafce75ed5cdbba510b612f0393e219a0f43be6c184c8f2b205"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YM2WGurAkeH+YGaBUG1K9EPps2B4FIswDOm/+JJG+GPkbjp1TPRZiCIm+OKuVF3ozKK2Lm8llNmcapaE5v9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:59:07.059322Z","bundle_sha256":"fba2327aa5fc3a555c99a34b8926f6c904866fe556fe4522ca64ee319d469033"}}