{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XB7HICBUE2ADH4ROCM7JC6DUN6","short_pith_number":"pith:XB7HICBU","schema_version":"1.0","canonical_sha256":"b87e740834268033f22e133e9178746f9e20b22a624b24efb8daf92ed632d725","source":{"kind":"arxiv","id":"2603.05406","version":2},"attestation_state":"computed","paper":{"title":"ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.GN"],"primary_cat":"cs.CG","authors_text":"Erlend Raa V{\\aa}gset, Geevarghese Philip","submitted_at":"2026-03-05T17:32:04Z","abstract_excerpt":"The Optimal Morse Matching (OMM) problem asks for a discrete gradient vector field on a simplicial complex that minimizes the number of critical simplices. It is NP-hard and has been studied extensively in heuristic, approximation, and parameterized complexity settings. Parameterized by treewidth $k$, OMM has long been known to be solvable on triangulations of $3$-manifolds in $2^{O(k^2)} n^{O(1)}$ time and in FPT time for triangulations of arbitrary manifolds, but the exact dependence on $k$ has remained an open question. We resolve this by giving a new $2^{O(k \\log k)} n$-time algorithm for "},"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":"2603.05406","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-03-05T17:32:04Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.GN"],"title_canon_sha256":"74ae94894c703e85ac8ab4ae4f1739a35a7f692acaa8a4ba8b8bfad75b4892af","abstract_canon_sha256":"4032abfc01c7e7ae478f32b070bad5a11ef305043a8b2921c0019d631b7533ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:49.570862Z","signature_b64":"aWNzYfKmUspPwWkVA7t1FeQva1fBoCALaRojvqTe9vgcXPSFWWX9ddaQxp4TxzOo9fwTUY6gz3vYaJFvt0w/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b87e740834268033f22e133e9178746f9e20b22a624b24efb8daf92ed632d725","last_reissued_at":"2026-06-03T01:05:49.570288Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:49.570288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.GN"],"primary_cat":"cs.CG","authors_text":"Erlend Raa V{\\aa}gset, Geevarghese Philip","submitted_at":"2026-03-05T17:32:04Z","abstract_excerpt":"The Optimal Morse Matching (OMM) problem asks for a discrete gradient vector field on a simplicial complex that minimizes the number of critical simplices. It is NP-hard and has been studied extensively in heuristic, approximation, and parameterized complexity settings. Parameterized by treewidth $k$, OMM has long been known to be solvable on triangulations of $3$-manifolds in $2^{O(k^2)} n^{O(1)}$ time and in FPT time for triangulations of arbitrary manifolds, but the exact dependence on $k$ has remained an open question. We resolve this by giving a new $2^{O(k \\log k)} n$-time algorithm for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.05406","kind":"arxiv","version":2},"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/2603.05406/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":"2603.05406","created_at":"2026-06-03T01:05:49.570350+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.05406v2","created_at":"2026-06-03T01:05:49.570350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05406","created_at":"2026-06-03T01:05:49.570350+00:00"},{"alias_kind":"pith_short_12","alias_value":"XB7HICBUE2AD","created_at":"2026-06-03T01:05:49.570350+00:00"},{"alias_kind":"pith_short_16","alias_value":"XB7HICBUE2ADH4RO","created_at":"2026-06-03T01:05:49.570350+00:00"},{"alias_kind":"pith_short_8","alias_value":"XB7HICBU","created_at":"2026-06-03T01:05:49.570350+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/XB7HICBUE2ADH4ROCM7JC6DUN6","json":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6.json","graph_json":"https://pith.science/api/pith-number/XB7HICBUE2ADH4ROCM7JC6DUN6/graph.json","events_json":"https://pith.science/api/pith-number/XB7HICBUE2ADH4ROCM7JC6DUN6/events.json","paper":"https://pith.science/paper/XB7HICBU"},"agent_actions":{"view_html":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6","download_json":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6.json","view_paper":"https://pith.science/paper/XB7HICBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.05406&json=true","fetch_graph":"https://pith.science/api/pith-number/XB7HICBUE2ADH4ROCM7JC6DUN6/graph.json","fetch_events":"https://pith.science/api/pith-number/XB7HICBUE2ADH4ROCM7JC6DUN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/action/storage_attestation","attest_author":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/action/author_attestation","sign_citation":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/action/citation_signature","submit_replication":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/action/replication_record"}},"created_at":"2026-06-03T01:05:49.570350+00:00","updated_at":"2026-06-03T01:05:49.570350+00:00"}