{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZNDA3DKPYTXXKBGNZ3WYPM4HGY","short_pith_number":"pith:ZNDA3DKP","schema_version":"1.0","canonical_sha256":"cb460d8d4fc4ef7504cdceed87b38736350451d2e121b2dca245c7dd3663b6e7","source":{"kind":"arxiv","id":"1907.02844","version":1},"attestation_state":"computed","paper":{"title":"Geodesic Learning via Unsupervised Decision Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, James Browne, Joshua T. Vogelstein, Meghana Madhyastha, Percy Li, Randal Burns, Veronika Strnadova-Neeley","submitted_at":"2019-07-05T14:15:07Z","abstract_excerpt":"Geodesic distance is the shortest path between two points in a Riemannian manifold. Manifold learning algorithms, such as Isomap, seek to learn a manifold that preserves geodesic distances. However, such methods operate on the ambient dimensionality, and are therefore fragile to noise dimensions. We developed an unsupervised random forest method (URerF) to approximately learn geodesic distances in linear and nonlinear manifolds with noise. URerF operates on low-dimensional sparse linear combinations of features, rather than the full observed dimensionality. To choose the optimal split in a com"},"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":"1907.02844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-05T14:15:07Z","cross_cats_sorted":["cs.IR","cs.LG","stat.ME"],"title_canon_sha256":"4be34be7c444cb998cc92547a434e88299e347d5e5a93ea967a776bf142c5423","abstract_canon_sha256":"9be51a98d4677c6bbcebf259e006b69dc84197168464212229efd89e7265a2bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.883380Z","signature_b64":"YzHVwaQv7Cm9YYYKOC0vD/F3GuRhJ+lW/V6XdpcjqZ7UUoM2hB312cC3mXlZBtnQx7zB+4vOCIGJ9+/KttofBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb460d8d4fc4ef7504cdceed87b38736350451d2e121b2dca245c7dd3663b6e7","last_reissued_at":"2026-05-17T23:41:22.882678Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.882678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geodesic Learning via Unsupervised Decision Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, James Browne, Joshua T. Vogelstein, Meghana Madhyastha, Percy Li, Randal Burns, Veronika Strnadova-Neeley","submitted_at":"2019-07-05T14:15:07Z","abstract_excerpt":"Geodesic distance is the shortest path between two points in a Riemannian manifold. Manifold learning algorithms, such as Isomap, seek to learn a manifold that preserves geodesic distances. However, such methods operate on the ambient dimensionality, and are therefore fragile to noise dimensions. We developed an unsupervised random forest method (URerF) to approximately learn geodesic distances in linear and nonlinear manifolds with noise. URerF operates on low-dimensional sparse linear combinations of features, rather than the full observed dimensionality. To choose the optimal split in a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02844","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":"1907.02844","created_at":"2026-05-17T23:41:22.882784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02844v1","created_at":"2026-05-17T23:41:22.882784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02844","created_at":"2026-05-17T23:41:22.882784+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNDA3DKPYTXX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNDA3DKPYTXXKBGN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNDA3DKP","created_at":"2026-05-18T12:33:33.725879+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/ZNDA3DKPYTXXKBGNZ3WYPM4HGY","json":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY.json","graph_json":"https://pith.science/api/pith-number/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/graph.json","events_json":"https://pith.science/api/pith-number/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/events.json","paper":"https://pith.science/paper/ZNDA3DKP"},"agent_actions":{"view_html":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY","download_json":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY.json","view_paper":"https://pith.science/paper/ZNDA3DKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02844&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/action/storage_attestation","attest_author":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/action/author_attestation","sign_citation":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/action/citation_signature","submit_replication":"https://pith.science/pith/ZNDA3DKPYTXXKBGNZ3WYPM4HGY/action/replication_record"}},"created_at":"2026-05-17T23:41:22.882784+00:00","updated_at":"2026-05-17T23:41:22.882784+00:00"}