{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ESUXW4GHNADV4AWXHIJGRJTGE","short_pith_number":"pith:5ESUXW4G","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"},"canonical_sha256":"e9254bdb863b403af016b9d0934533311128f21320ecc5089b02da93ccc8eaa4","source":{"kind":"arxiv","id":"1901.07229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07229","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07229v1","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07229","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"5ESUXW4GHNAD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ESUXW4GHNADV4AW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ESUXW4G","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ESUXW4GHNADV4AWXHIJGRJTGE","target":"record","payload":{"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"},"canonical_sha256":"e9254bdb863b403af016b9d0934533311128f21320ecc5089b02da93ccc8eaa4","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"},"source_kind":"arxiv","source_id":"1901.07229","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-05-17T23:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/suH1nLUbr5wO00AKUeai1Vw7SkbCtc0wDLlv8kZBr18Z46RqPLfpebo3gZ1L3APPZ7HdbJaFGJGXFn5FwUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:12:23.849985Z"},"content_sha256":"79511976a5e210d693cf6f3e9fc5785c44c28b22933d7dc4b892a377cbe41321","schema_version":"1.0","event_id":"sha256:79511976a5e210d693cf6f3e9fc5785c44c28b22933d7dc4b892a377cbe41321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ESUXW4GHNADV4AWXHIJGRJTGE","target":"graph","payload":{"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"},"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-05-17T23:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTSB57Xp9mZgFbFNhhba8Ey2p0fGAQGSVlrC34pD6L6R/7pq31ZErUr/uTMRSMkTMtLSIv2yQsWrEbdjDVwcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:12:23.850356Z"},"content_sha256":"28a4e43be583b231423054b6e2d161dcc8236037756e62ff9bf6482b7197bfd6","schema_version":"1.0","event_id":"sha256:28a4e43be583b231423054b6e2d161dcc8236037756e62ff9bf6482b7197bfd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/bundle.json","state_url":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/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-06-01T12:12:23Z","links":{"resolver":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE","bundle":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/bundle.json","state":"https://pith.science/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ESUXW4GHNADV4AWXHIJGRJTGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ESUXW4GHNADV4AWXHIJGRJTGE","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":"e22a601d9017a33c3cc217a9f9b3fb5fb0391cb8aff69a5c824e91e8ef42e5e2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-22T09:44:07Z","title_canon_sha256":"b1235a3a0fa145f0e9c1e50bc3c6ddf58f8643fdb037723f90deb54ef5ae62f7"},"schema_version":"1.0","source":{"id":"1901.07229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07229","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07229v1","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07229","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"5ESUXW4GHNAD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ESUXW4GHNADV4AW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ESUXW4G","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:28a4e43be583b231423054b6e2d161dcc8236037756e62ff9bf6482b7197bfd6","target":"graph","created_at":"2026-05-17T23:55:47Z","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"},"paper":{"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","authors_text":"Georgios Arvanitidis, Michael Schober, Philipp Hennig, S{\\o}ren Hauberg","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-22T09:44:07Z","title":"Fast and Robust Shortest Paths on Manifolds Learned from Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07229","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:79511976a5e210d693cf6f3e9fc5785c44c28b22933d7dc4b892a377cbe41321","target":"record","created_at":"2026-05-17T23:55:47Z","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":"e22a601d9017a33c3cc217a9f9b3fb5fb0391cb8aff69a5c824e91e8ef42e5e2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-22T09:44:07Z","title_canon_sha256":"b1235a3a0fa145f0e9c1e50bc3c6ddf58f8643fdb037723f90deb54ef5ae62f7"},"schema_version":"1.0","source":{"id":"1901.07229","kind":"arxiv","version":1}},"canonical_sha256":"e9254bdb863b403af016b9d0934533311128f21320ecc5089b02da93ccc8eaa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9254bdb863b403af016b9d0934533311128f21320ecc5089b02da93ccc8eaa4","first_computed_at":"2026-05-17T23:55:47.727070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:47.727070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5OYCFi9O3eCzNiEJ7e0qS3/X4GlSdF3LkLiCEsA0otFJFewQpGAK3GYlQy0hJX4X87G6VGySturnPbCB3X6ZBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:47.727678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79511976a5e210d693cf6f3e9fc5785c44c28b22933d7dc4b892a377cbe41321","sha256:28a4e43be583b231423054b6e2d161dcc8236037756e62ff9bf6482b7197bfd6"],"state_sha256":"dc206d8fb21eccee1617bc75d128b46cfc4b92781e4c540043fdae6e29db8d6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpcqYeJAFGV4a2HCF0AYjQWxDF+lqG35CbwnvyfyxojBRMeIyo+J5o5G9w21EzNjcuwjF4m6V0ZDeDISlCH4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:12:23.852739Z","bundle_sha256":"a8ffb36b30a30949867553cb7127a2709238dd7839b84546043fa348a0ae81a7"}}