{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UFLERFMPOENPU2HEQS6EPHJWPK","short_pith_number":"pith:UFLERFMP","schema_version":"1.0","canonical_sha256":"a15648958f711afa68e484bc479d367aac15c8c609a20e692109bbb47f2cd7c6","source":{"kind":"arxiv","id":"2302.02895","version":4},"attestation_state":"computed","paper":{"title":"Flexible and Probabilistic Topology Tracking with Partial Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.CG","authors_text":"Bei Wang, Lin Yan, Mingzhe Li, Tom Needham, Xinyuan Yan","submitted_at":"2023-02-06T16:02:32Z","abstract_excerpt":"In this paper, we present a flexible and probabilistic framework for tracking topological features in time-varying scalar fields using merge trees and partial optimal transport. Merge trees are topological descriptors that record the evolution of connected components in the sublevel sets of scalar fields. We present a new technique for modeling and comparing merge trees using tools from partial optimal transport. In particular, we model a merge tree as a measure network, that is, a network equipped with a probability distribution, and define a notion of distance on the space of merge trees ins"},"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":"2302.02895","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-02-06T16:02:32Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"fc67e77fcf046449d975214f5f396ada5cd2b4ba1bc171e8ae5051b46b6b1e58","abstract_canon_sha256":"6ed38ff40745ddb08d87642b2410624d9e1aa438f72282e98b56aa7d8e820b03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:15.772615Z","signature_b64":"UkYnevlySfdzdqEX5dStNcFjy4Hoc0max3QRJeuXTEYzofEBPwEmIA7VuGr3g05IUCPG1UMas4XB/qkZxFZxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a15648958f711afa68e484bc479d367aac15c8c609a20e692109bbb47f2cd7c6","last_reissued_at":"2026-07-05T11:58:15.772139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:15.772139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible and Probabilistic Topology Tracking with Partial Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.CG","authors_text":"Bei Wang, Lin Yan, Mingzhe Li, Tom Needham, Xinyuan Yan","submitted_at":"2023-02-06T16:02:32Z","abstract_excerpt":"In this paper, we present a flexible and probabilistic framework for tracking topological features in time-varying scalar fields using merge trees and partial optimal transport. Merge trees are topological descriptors that record the evolution of connected components in the sublevel sets of scalar fields. We present a new technique for modeling and comparing merge trees using tools from partial optimal transport. In particular, we model a merge tree as a measure network, that is, a network equipped with a probability distribution, and define a notion of distance on the space of merge trees ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02895","kind":"arxiv","version":4},"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/2302.02895/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":"2302.02895","created_at":"2026-07-05T11:58:15.772195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02895v4","created_at":"2026-07-05T11:58:15.772195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02895","created_at":"2026-07-05T11:58:15.772195+00:00"},{"alias_kind":"pith_short_12","alias_value":"UFLERFMPOENP","created_at":"2026-07-05T11:58:15.772195+00:00"},{"alias_kind":"pith_short_16","alias_value":"UFLERFMPOENPU2HE","created_at":"2026-07-05T11:58:15.772195+00:00"},{"alias_kind":"pith_short_8","alias_value":"UFLERFMP","created_at":"2026-07-05T11:58:15.772195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01171","citing_title":"A Stable and Theoretically Grounded Gromov-Wasserstein Distance for Reeb Graph Comparison using Persistence Images","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK","json":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK.json","graph_json":"https://pith.science/api/pith-number/UFLERFMPOENPU2HEQS6EPHJWPK/graph.json","events_json":"https://pith.science/api/pith-number/UFLERFMPOENPU2HEQS6EPHJWPK/events.json","paper":"https://pith.science/paper/UFLERFMP"},"agent_actions":{"view_html":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK","download_json":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK.json","view_paper":"https://pith.science/paper/UFLERFMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02895&json=true","fetch_graph":"https://pith.science/api/pith-number/UFLERFMPOENPU2HEQS6EPHJWPK/graph.json","fetch_events":"https://pith.science/api/pith-number/UFLERFMPOENPU2HEQS6EPHJWPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK/action/storage_attestation","attest_author":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK/action/author_attestation","sign_citation":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK/action/citation_signature","submit_replication":"https://pith.science/pith/UFLERFMPOENPU2HEQS6EPHJWPK/action/replication_record"}},"created_at":"2026-07-05T11:58:15.772195+00:00","updated_at":"2026-07-05T11:58:15.772195+00:00"}