{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DEP3VTXG5CVAZFAIAH626FUGTS","short_pith_number":"pith:DEP3VTXG","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"},"canonical_sha256":"191fbacee6e8aa0c940801fdaf16869c880a3263f2b52577601fca23f0545612","source":{"kind":"arxiv","id":"2404.05879","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05879","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05879v3","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05879","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"DEP3VTXG5CVA","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"DEP3VTXG5CVAZFAI","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"DEP3VTXG","created_at":"2026-07-05T09:15:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DEP3VTXG5CVAZFAIAH626FUGTS","target":"record","payload":{"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"},"canonical_sha256":"191fbacee6e8aa0c940801fdaf16869c880a3263f2b52577601fca23f0545612","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"},"source_kind":"arxiv","source_id":"2404.05879","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YlLS9n/K9NQzLLf/GJiNnS+N//IwyeCE3LmGbzM9r/CQFJ94/mDNRX/wp3FOeCCScsCrwK0wV3kQB9Y5rLnwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:49:17.137227Z"},"content_sha256":"f79efa1acc2e9d09cd8f497704be79c246e4050d8d3eaf00382edb509ad7d9ce","schema_version":"1.0","event_id":"sha256:f79efa1acc2e9d09cd8f497704be79c246e4050d8d3eaf00382edb509ad7d9ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DEP3VTXG5CVAZFAIAH626FUGTS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:15:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukV7HVJoSpSPHf5FuNjPpacQ9mao1y9RosPodAGGig/Fk+lc+mW0V98frQVzyepRyN9mTXzd7TCDaIau7X4sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T21:49:17.137617Z"},"content_sha256":"bd43b3d8b303178f9d2047a0687c461445b03099d73edd8c0e1239a46af8a55a","schema_version":"1.0","event_id":"sha256:bd43b3d8b303178f9d2047a0687c461445b03099d73edd8c0e1239a46af8a55a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/bundle.json","state_url":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEP3VTXG5CVAZFAIAH626FUGTS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T21:49:17Z","links":{"resolver":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS","bundle":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/bundle.json","state":"https://pith.science/pith/DEP3VTXG5CVAZFAIAH626FUGTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEP3VTXG5CVAZFAIAH626FUGTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DEP3VTXG5CVAZFAIAH626FUGTS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eedc0e2b51608aafd469c75b5c5759c683e2fc0d1abb2c9ed4797165197a136c","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-08T21:26:04Z","title_canon_sha256":"064c9da3fca8c773f3c1962aa183e544cf6445cf6a703375b1d281e2aa50e0fd"},"schema_version":"1.0","source":{"id":"2404.05879","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.05879","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"arxiv_version","alias_value":"2404.05879v3","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05879","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"pith_short_12","alias_value":"DEP3VTXG5CVA","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"pith_short_16","alias_value":"DEP3VTXG5CVAZFAI","created_at":"2026-07-05T09:15:55Z"},{"alias_kind":"pith_short_8","alias_value":"DEP3VTXG","created_at":"2026-07-05T09:15:55Z"}],"graph_snapshots":[{"event_id":"sha256:bd43b3d8b303178f9d2047a0687c461445b03099d73edd8c0e1239a46af8a55a","target":"graph","created_at":"2026-07-05T09:15:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.05879/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Brian Summa, Brittany Terese Fasy, Carola Wenk, Yu Qin","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-08T21:26:04Z","title":"Rapid and Precise Topological Comparison with Merge Tree Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05879","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f79efa1acc2e9d09cd8f497704be79c246e4050d8d3eaf00382edb509ad7d9ce","target":"record","created_at":"2026-07-05T09:15:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eedc0e2b51608aafd469c75b5c5759c683e2fc0d1abb2c9ed4797165197a136c","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-08T21:26:04Z","title_canon_sha256":"064c9da3fca8c773f3c1962aa183e544cf6445cf6a703375b1d281e2aa50e0fd"},"schema_version":"1.0","source":{"id":"2404.05879","kind":"arxiv","version":3}},"canonical_sha256":"191fbacee6e8aa0c940801fdaf16869c880a3263f2b52577601fca23f0545612","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"191fbacee6e8aa0c940801fdaf16869c880a3263f2b52577601fca23f0545612","first_computed_at":"2026-07-05T09:15:55.435900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:55.435900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1QJaG75wWTc8ETpIdo+9cnpQB0iWjAHVPCfU0M58zW/x406kCLT+jgX3kV8fwbRVRVeOQTIeo69ByUOWUNeiBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:55.436422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.05879","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f79efa1acc2e9d09cd8f497704be79c246e4050d8d3eaf00382edb509ad7d9ce","sha256:bd43b3d8b303178f9d2047a0687c461445b03099d73edd8c0e1239a46af8a55a"],"state_sha256":"4a4f5bbd5d93b86483f00d78af03ee9eb13b14bcd2f74493bcbecf529b600359"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeSbLPHJatZba1JzzQmCq4HMRUMsipF23+Escb2AIpbzq0NQe5vdF6FZ0QyuNeihh6cFbRZugPMShMDEuooWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T21:49:17.140763Z","bundle_sha256":"3e590dfd3182900217354eee86d0dc31ac8d8c5f91201b1d3f2d05290d890d13"}}