{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DEP3VTXG5CVAZFAIAH626FUGTS","short_pith_number":"pith:DEP3VTXG","schema_version":"1.0","canonical_sha256":"191fbacee6e8aa0c940801fdaf16869c880a3263f2b52577601fca23f0545612","source":{"kind":"arxiv","id":"2404.05879","version":3},"attestation_state":"computed","paper":{"title":"Rapid and Precise Topological Comparison with Merge Tree Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Brian Summa, Brittany Terese Fasy, Carola Wenk, Yu Qin","submitted_at":"2024-04-08T21:26:04Z","abstract_excerpt":"Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due to the exhaustive matching between tree nodes. To address this challenge, we introduce the Merge Tree Neural Network (MTNN), a learned neural network model designed for merge tree comparison. The MTNN enables rapid and high-quality similarity computation. We first demonstrate how to train graph neural networks, which emerged as effective encoders for graphs, in order to produce embeddings of merge trees in vector spac"},"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":"2404.05879","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-08T21:26:04Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"064c9da3fca8c773f3c1962aa183e544cf6445cf6a703375b1d281e2aa50e0fd","abstract_canon_sha256":"eedc0e2b51608aafd469c75b5c5759c683e2fc0d1abb2c9ed4797165197a136c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:55.436422Z","signature_b64":"1QJaG75wWTc8ETpIdo+9cnpQB0iWjAHVPCfU0M58zW/x406kCLT+jgX3kV8fwbRVRVeOQTIeo69ByUOWUNeiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"191fbacee6e8aa0c940801fdaf16869c880a3263f2b52577601fca23f0545612","last_reissued_at":"2026-07-05T09:15:55.435900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:55.435900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rapid and Precise Topological Comparison with Merge Tree Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Brian Summa, Brittany Terese Fasy, Carola Wenk, Yu Qin","submitted_at":"2024-04-08T21:26:04Z","abstract_excerpt":"Merge trees are a valuable tool in the scientific visualization of scalar fields; however, current methods for merge tree comparisons are computationally expensive, primarily due to the exhaustive matching between tree nodes. To address this challenge, we introduce the Merge Tree Neural Network (MTNN), a learned neural network model designed for merge tree comparison. The MTNN enables rapid and high-quality similarity computation. We first demonstrate how to train graph neural networks, which emerged as effective encoders for graphs, in order to produce embeddings of merge trees in vector spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05879","kind":"arxiv","version":3},"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/2404.05879/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":"2404.05879","created_at":"2026-07-05T09:15:55.435958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05879v3","created_at":"2026-07-05T09:15:55.435958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05879","created_at":"2026-07-05T09:15:55.435958+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEP3VTXG5CVA","created_at":"2026-07-05T09:15:55.435958+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEP3VTXG5CVAZFAI","created_at":"2026-07-05T09:15:55.435958+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEP3VTXG","created_at":"2026-07-05T09:15:55.435958+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/DEP3VTXG5CVAZFAIAH626FUGTS","json":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS.json","graph_json":"https://pith.science/api/pith-number/DEP3VTXG5CVAZFAIAH626FUGTS/graph.json","events_json":"https://pith.science/api/pith-number/DEP3VTXG5CVAZFAIAH626FUGTS/events.json","paper":"https://pith.science/paper/DEP3VTXG"},"agent_actions":{"view_html":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS","download_json":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS.json","view_paper":"https://pith.science/paper/DEP3VTXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05879&json=true","fetch_graph":"https://pith.science/api/pith-number/DEP3VTXG5CVAZFAIAH626FUGTS/graph.json","fetch_events":"https://pith.science/api/pith-number/DEP3VTXG5CVAZFAIAH626FUGTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/action/storage_attestation","attest_author":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/action/author_attestation","sign_citation":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/action/citation_signature","submit_replication":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/action/replication_record"}},"created_at":"2026-07-05T09:15:55.435958+00:00","updated_at":"2026-07-05T09:15:55.435958+00:00"}