{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:H5MDW7PVUHUCJ2LM4FLBRWGLFE","short_pith_number":"pith:H5MDW7PV","schema_version":"1.0","canonical_sha256":"3f583b7df5a1e824e96ce15618d8cb2903d4b7a19e24621f917e2be49878e766","source":{"kind":"arxiv","id":"2505.18005","version":1},"attestation_state":"computed","paper":{"title":"Distances for Markov chains from sample streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anders Jonsson, Gergely Neu, Javier Segovia-Aguas, Ludovic Schwartz, Sergio Calo","submitted_at":"2025-05-23T15:09:04Z","abstract_excerpt":"Bisimulation metrics are powerful tools for measuring similarities between stochastic processes, and specifically Markov chains. Recent advances have uncovered that bisimulation metrics are, in fact, optimal-transport distances, which has enabled the development of fast algorithms for computing such metrics with provable accuracy and runtime guarantees. However, these recent methods, as well as all previously known methods, assume full knowledge of the transition dynamics. This is often an impractical assumption in most real-world scenarios, where typically only sample trajectories are availab"},"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":"2505.18005","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T15:09:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"57cbf62530ecb7f7d109decbdd737f97050245b1431f590a8c13f9a99ccfa0a0","abstract_canon_sha256":"9191ccd021d1062710805e1648b7bf8b498e0d92a8e6d8b1b56a31a702da0d5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:35.139945Z","signature_b64":"QCw/aZecgbxZmOBnSQHE7Uvi55131LzVD6Iy1efm5VTFyt8P4PuaNvJ0EUSXNV5CfunBujR6HsHLzmOl7w8hDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f583b7df5a1e824e96ce15618d8cb2903d4b7a19e24621f917e2be49878e766","last_reissued_at":"2026-07-05T11:08:35.139495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:35.139495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distances for Markov chains from sample streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anders Jonsson, Gergely Neu, Javier Segovia-Aguas, Ludovic Schwartz, Sergio Calo","submitted_at":"2025-05-23T15:09:04Z","abstract_excerpt":"Bisimulation metrics are powerful tools for measuring similarities between stochastic processes, and specifically Markov chains. Recent advances have uncovered that bisimulation metrics are, in fact, optimal-transport distances, which has enabled the development of fast algorithms for computing such metrics with provable accuracy and runtime guarantees. However, these recent methods, as well as all previously known methods, assume full knowledge of the transition dynamics. This is often an impractical assumption in most real-world scenarios, where typically only sample trajectories are availab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18005","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/2505.18005/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":"2505.18005","created_at":"2026-07-05T11:08:35.139555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18005v1","created_at":"2026-07-05T11:08:35.139555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18005","created_at":"2026-07-05T11:08:35.139555+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5MDW7PVUHUC","created_at":"2026-07-05T11:08:35.139555+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5MDW7PVUHUCJ2LM","created_at":"2026-07-05T11:08:35.139555+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5MDW7PV","created_at":"2026-07-05T11:08:35.139555+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00665","citing_title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28973","citing_title":"Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE","json":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE.json","graph_json":"https://pith.science/api/pith-number/H5MDW7PVUHUCJ2LM4FLBRWGLFE/graph.json","events_json":"https://pith.science/api/pith-number/H5MDW7PVUHUCJ2LM4FLBRWGLFE/events.json","paper":"https://pith.science/paper/H5MDW7PV"},"agent_actions":{"view_html":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE","download_json":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE.json","view_paper":"https://pith.science/paper/H5MDW7PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18005&json=true","fetch_graph":"https://pith.science/api/pith-number/H5MDW7PVUHUCJ2LM4FLBRWGLFE/graph.json","fetch_events":"https://pith.science/api/pith-number/H5MDW7PVUHUCJ2LM4FLBRWGLFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE/action/storage_attestation","attest_author":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE/action/author_attestation","sign_citation":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE/action/citation_signature","submit_replication":"https://pith.science/pith/H5MDW7PVUHUCJ2LM4FLBRWGLFE/action/replication_record"}},"created_at":"2026-07-05T11:08:35.139555+00:00","updated_at":"2026-07-05T11:08:35.139555+00:00"}