{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CVOYW7BFYP5LG7HBJPBRYQHFRL","short_pith_number":"pith:CVOYW7BF","schema_version":"1.0","canonical_sha256":"155d8b7c25c3fab37ce14bc31c40e58ae8e17a80ab0747c045bc4f0d8178fc1e","source":{"kind":"arxiv","id":"2607.06497","version":1},"attestation_state":"computed","paper":{"title":"EntroPath: Maximum Entropy Path Ensemble Embedding for Manifold Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Przemys{\\l}aw Rola","submitted_at":"2026-07-07T16:58:00Z","abstract_excerpt":"We introduce EntroPath, a manifold learning method that recovers geodesic geometry from data graphs through ensembles of diffusion paths. Many existing graph-based embeddings rely either on locally normalised random walks or on shortest-path distances. The former can concentrate diffusion in densely sampled regions, while the latter are sensitive to spurious shortcut edges in the graph. EntroPath instead builds its dissimilarities from the maximum entropy random walk (MERW), which aggregates the full ensemble of k-step paths between points rather than relying on any single trajectory. We show "},"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":"2607.06497","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-07T16:58:00Z","cross_cats_sorted":["q-bio.QM","stat.ML"],"title_canon_sha256":"5e55936a008b3d920d7df8f91a97f1997c0e7b473128cfca48df22353a475861","abstract_canon_sha256":"91e069638b4d8c3d53250c1fb4a9dffcbbd1fdd7a4b947be7747d7cdad88b727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:19:28.075030Z","signature_b64":"9WvtLk0xGPCqQ//DA04246NKW2zd3aZcyIM9jUt15oyd3XJRYz5wPUQPBCFS8GJ+oad6ZG5Ex0Lw2UbLzDC4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155d8b7c25c3fab37ce14bc31c40e58ae8e17a80ab0747c045bc4f0d8178fc1e","last_reissued_at":"2026-07-08T01:19:28.074588Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:19:28.074588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EntroPath: Maximum Entropy Path Ensemble Embedding for Manifold Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Przemys{\\l}aw Rola","submitted_at":"2026-07-07T16:58:00Z","abstract_excerpt":"We introduce EntroPath, a manifold learning method that recovers geodesic geometry from data graphs through ensembles of diffusion paths. Many existing graph-based embeddings rely either on locally normalised random walks or on shortest-path distances. The former can concentrate diffusion in densely sampled regions, while the latter are sensitive to spurious shortcut edges in the graph. EntroPath instead builds its dissimilarities from the maximum entropy random walk (MERW), which aggregates the full ensemble of k-step paths between points rather than relying on any single trajectory. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06497","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/2607.06497/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.06497","created_at":"2026-07-08T01:19:28.074653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06497v1","created_at":"2026-07-08T01:19:28.074653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06497","created_at":"2026-07-08T01:19:28.074653+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVOYW7BFYP5L","created_at":"2026-07-08T01:19:28.074653+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVOYW7BFYP5LG7HB","created_at":"2026-07-08T01:19:28.074653+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVOYW7BF","created_at":"2026-07-08T01:19:28.074653+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/CVOYW7BFYP5LG7HBJPBRYQHFRL","json":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL.json","graph_json":"https://pith.science/api/pith-number/CVOYW7BFYP5LG7HBJPBRYQHFRL/graph.json","events_json":"https://pith.science/api/pith-number/CVOYW7BFYP5LG7HBJPBRYQHFRL/events.json","paper":"https://pith.science/paper/CVOYW7BF"},"agent_actions":{"view_html":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL","download_json":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL.json","view_paper":"https://pith.science/paper/CVOYW7BF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06497&json=true","fetch_graph":"https://pith.science/api/pith-number/CVOYW7BFYP5LG7HBJPBRYQHFRL/graph.json","fetch_events":"https://pith.science/api/pith-number/CVOYW7BFYP5LG7HBJPBRYQHFRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL/action/storage_attestation","attest_author":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL/action/author_attestation","sign_citation":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL/action/citation_signature","submit_replication":"https://pith.science/pith/CVOYW7BFYP5LG7HBJPBRYQHFRL/action/replication_record"}},"created_at":"2026-07-08T01:19:28.074653+00:00","updated_at":"2026-07-08T01:19:28.074653+00:00"}