{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SRF6EQRJLFXCSD6WCDW6ABG5R2","short_pith_number":"pith:SRF6EQRJ","schema_version":"1.0","canonical_sha256":"944be24229596e290fd610ede004dd8ea638ae4ece920598d6a34c36d60bf647","source":{"kind":"arxiv","id":"2501.05529","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christoph Garth, Florian Wetzels, Heike Leitte","submitted_at":"2025-01-09T19:08:18Z","abstract_excerpt":"In this paper, we present a novel heuristic algorithm for the stable but NP-complete deformation-based edit distance on merge trees. Our key contribution is the introduction of a user-controlled look-ahead parameter that allows to trade off accuracy and computational cost. We achieve a fixed parameter tractable running time that is polynomial in the size of the input but exponential in the look-ahead value. This extension unlocks the potential of the deformation-based edit distance in handling saddle swaps, while maintaining feasible computation times. Experimental results demonstrate the comp"},"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":"2501.05529","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-01-09T19:08:18Z","cross_cats_sorted":[],"title_canon_sha256":"2ebbd69a18c6cc4ac7e022108bdcd9ce6ccc02710bbbb3f43d409e853f8981e0","abstract_canon_sha256":"87ebf8aa0785a448dda73fe6da8d2acb89caf69271d3f0a951477c1fccc4f1e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:24.720752Z","signature_b64":"TZIi5+rjViyYuQBjqQRbkyMWklAB7oXHyPIqfAgSaXHFm+iIdFHIRwHPgaoYEqkcrfX6G1entSChgy9HgTXPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"944be24229596e290fd610ede004dd8ea638ae4ece920598d6a34c36d60bf647","last_reissued_at":"2026-07-05T09:59:24.720320Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:24.720320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christoph Garth, Florian Wetzels, Heike Leitte","submitted_at":"2025-01-09T19:08:18Z","abstract_excerpt":"In this paper, we present a novel heuristic algorithm for the stable but NP-complete deformation-based edit distance on merge trees. Our key contribution is the introduction of a user-controlled look-ahead parameter that allows to trade off accuracy and computational cost. We achieve a fixed parameter tractable running time that is polynomial in the size of the input but exponential in the look-ahead value. This extension unlocks the potential of the deformation-based edit distance in handling saddle swaps, while maintaining feasible computation times. Experimental results demonstrate the comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05529","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/2501.05529/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":"2501.05529","created_at":"2026-07-05T09:59:24.720378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05529v1","created_at":"2026-07-05T09:59:24.720378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05529","created_at":"2026-07-05T09:59:24.720378+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRF6EQRJLFXC","created_at":"2026-07-05T09:59:24.720378+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRF6EQRJLFXCSD6W","created_at":"2026-07-05T09:59:24.720378+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRF6EQRJ","created_at":"2026-07-05T09:59:24.720378+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/SRF6EQRJLFXCSD6WCDW6ABG5R2","json":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2.json","graph_json":"https://pith.science/api/pith-number/SRF6EQRJLFXCSD6WCDW6ABG5R2/graph.json","events_json":"https://pith.science/api/pith-number/SRF6EQRJLFXCSD6WCDW6ABG5R2/events.json","paper":"https://pith.science/paper/SRF6EQRJ"},"agent_actions":{"view_html":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2","download_json":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2.json","view_paper":"https://pith.science/paper/SRF6EQRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05529&json=true","fetch_graph":"https://pith.science/api/pith-number/SRF6EQRJLFXCSD6WCDW6ABG5R2/graph.json","fetch_events":"https://pith.science/api/pith-number/SRF6EQRJLFXCSD6WCDW6ABG5R2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2/action/storage_attestation","attest_author":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2/action/author_attestation","sign_citation":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2/action/citation_signature","submit_replication":"https://pith.science/pith/SRF6EQRJLFXCSD6WCDW6ABG5R2/action/replication_record"}},"created_at":"2026-07-05T09:59:24.720378+00:00","updated_at":"2026-07-05T09:59:24.720378+00:00"}