{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HGGRF3IYMDK7BAUAUH3ZMATBMG","short_pith_number":"pith:HGGRF3IY","schema_version":"1.0","canonical_sha256":"398d12ed1860d5f08280a1f796026161a32003721be595ebf1e04791276694c3","source":{"kind":"arxiv","id":"1812.08284","version":2},"attestation_state":"computed","paper":{"title":"Fast Approximate Geodesics for Deep Generative Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandros Paraschos, Alexej Klushyn, Francesco Ferroni, Justin Bayer, Nutan Chen, Patrick van der Smagt","submitted_at":"2018-12-19T23:06:32Z","abstract_excerpt":"The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the computational complexity of solving a non-convex optimisation problem. We propose finding shortest paths in a finite graph of samples from the aggregate approximate posterior, that can be solved exactly, at greatly reduced runtime, and without a notable loss in quality. Our approach, therefore, is hence applicable to high-dimensional problems, e.g., in the visual"},"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":"1812.08284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-12-19T23:06:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"eb4dcaf94ada29f0706e2ec32f112e3f71122a429c79a6ad861f26d0ae5d5412","abstract_canon_sha256":"22ab7e53b8cca0330fb440900e26723450af71acf42f0307ec5ba38db2f4ac59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:20.421401Z","signature_b64":"d9iFEfHY3ZpWNp6JBba4v5vk0aI2lEBnv76azopzTIE0pAAcXoSJwg+0Ap5z+VZDiPfK5kjLkXkIKAt6BnsiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398d12ed1860d5f08280a1f796026161a32003721be595ebf1e04791276694c3","last_reissued_at":"2026-05-17T23:45:20.420788Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:20.420788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximate Geodesics for Deep Generative Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandros Paraschos, Alexej Klushyn, Francesco Ferroni, Justin Bayer, Nutan Chen, Patrick van der Smagt","submitted_at":"2018-12-19T23:06:32Z","abstract_excerpt":"The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the computational complexity of solving a non-convex optimisation problem. We propose finding shortest paths in a finite graph of samples from the aggregate approximate posterior, that can be solved exactly, at greatly reduced runtime, and without a notable loss in quality. Our approach, therefore, is hence applicable to high-dimensional problems, e.g., in the visual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08284","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":""},"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":"1812.08284","created_at":"2026-05-17T23:45:20.420858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08284v2","created_at":"2026-05-17T23:45:20.420858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08284","created_at":"2026-05-17T23:45:20.420858+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGGRF3IYMDK7","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGGRF3IYMDK7BAUA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGGRF3IY","created_at":"2026-05-18T12:32:28.185984+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/HGGRF3IYMDK7BAUAUH3ZMATBMG","json":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG.json","graph_json":"https://pith.science/api/pith-number/HGGRF3IYMDK7BAUAUH3ZMATBMG/graph.json","events_json":"https://pith.science/api/pith-number/HGGRF3IYMDK7BAUAUH3ZMATBMG/events.json","paper":"https://pith.science/paper/HGGRF3IY"},"agent_actions":{"view_html":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG","download_json":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG.json","view_paper":"https://pith.science/paper/HGGRF3IY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08284&json=true","fetch_graph":"https://pith.science/api/pith-number/HGGRF3IYMDK7BAUAUH3ZMATBMG/graph.json","fetch_events":"https://pith.science/api/pith-number/HGGRF3IYMDK7BAUAUH3ZMATBMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG/action/storage_attestation","attest_author":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG/action/author_attestation","sign_citation":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG/action/citation_signature","submit_replication":"https://pith.science/pith/HGGRF3IYMDK7BAUAUH3ZMATBMG/action/replication_record"}},"created_at":"2026-05-17T23:45:20.420858+00:00","updated_at":"2026-05-17T23:45:20.420858+00:00"}