{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5ESUXW4GHNADV4AWXHIJGRJTGE","short_pith_number":"pith:5ESUXW4G","schema_version":"1.0","canonical_sha256":"e9254bdb863b403af016b9d0934533311128f21320ecc5089b02da93ccc8eaa4","source":{"kind":"arxiv","id":"1901.07229","version":1},"attestation_state":"computed","paper":{"title":"Fast and Robust Shortest Paths on Manifolds Learned from Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Georgios Arvanitidis, Michael Schober, Philipp Hennig, S{\\o}ren Hauberg","submitted_at":"2019-01-22T09:44:07Z","abstract_excerpt":"We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions. Here standard solvers perform poorly because they require well-behaved Jacobians of the ODE, and usually, manifolds learned from data imply unstable and ill-conditioned Jacobians. Instead, we propose a fixed-point iteration scheme for solving the ODE that avoids Jacobians. This enhances the stability of the solver, while reduces the computational cost. In ex"},"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":"1901.07229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-22T09:44:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b1235a3a0fa145f0e9c1e50bc3c6ddf58f8643fdb037723f90deb54ef5ae62f7","abstract_canon_sha256":"e22a601d9017a33c3cc217a9f9b3fb5fb0391cb8aff69a5c824e91e8ef42e5e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:47.727678Z","signature_b64":"5OYCFi9O3eCzNiEJ7e0qS3/X4GlSdF3LkLiCEsA0otFJFewQpGAK3GYlQy0hJX4X87G6VGySturnPbCB3X6ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9254bdb863b403af016b9d0934533311128f21320ecc5089b02da93ccc8eaa4","last_reissued_at":"2026-05-17T23:55:47.727070Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:47.727070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Robust Shortest Paths on Manifolds Learned from Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Georgios Arvanitidis, Michael Schober, Philipp Hennig, S{\\o}ren Hauberg","submitted_at":"2019-01-22T09:44:07Z","abstract_excerpt":"We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary differential equations (ODEs) subject to boundary conditions. Here standard solvers perform poorly because they require well-behaved Jacobians of the ODE, and usually, manifolds learned from data imply unstable and ill-conditioned Jacobians. Instead, we propose a fixed-point iteration scheme for solving the ODE that avoids Jacobians. This enhances the stability of the solver, while reduces the computational cost. In ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07229","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":"1901.07229","created_at":"2026-05-17T23:55:47.727189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07229v1","created_at":"2026-05-17T23:55:47.727189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07229","created_at":"2026-05-17T23:55:47.727189+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ESUXW4GHNAD","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ESUXW4GHNADV4AW","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ESUXW4G","created_at":"2026-05-18T12:33:10.108867+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/5ESUXW4GHNADV4AWXHIJGRJTGE","json":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE.json","graph_json":"https://pith.science/api/pith-number/5ESUXW4GHNADV4AWXHIJGRJTGE/graph.json","events_json":"https://pith.science/api/pith-number/5ESUXW4GHNADV4AWXHIJGRJTGE/events.json","paper":"https://pith.science/paper/5ESUXW4G"},"agent_actions":{"view_html":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE","download_json":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE.json","view_paper":"https://pith.science/paper/5ESUXW4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07229&json=true","fetch_graph":"https://pith.science/api/pith-number/5ESUXW4GHNADV4AWXHIJGRJTGE/graph.json","fetch_events":"https://pith.science/api/pith-number/5ESUXW4GHNADV4AWXHIJGRJTGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/action/storage_attestation","attest_author":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/action/author_attestation","sign_citation":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/action/citation_signature","submit_replication":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/action/replication_record"}},"created_at":"2026-05-17T23:55:47.727189+00:00","updated_at":"2026-05-17T23:55:47.727189+00:00"}