{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XB7HICBUE2ADH4ROCM7JC6DUN6","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":"4032abfc01c7e7ae478f32b070bad5a11ef305043a8b2921c0019d631b7533ce","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.GN"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-03-05T17:32:04Z","title_canon_sha256":"74ae94894c703e85ac8ab4ae4f1739a35a7f692acaa8a4ba8b8bfad75b4892af"},"schema_version":"1.0","source":{"id":"2603.05406","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.05406","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"2603.05406v2","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05406","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"XB7HICBUE2AD","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_16","alias_value":"XB7HICBUE2ADH4RO","created_at":"2026-06-03T01:05:49Z"},{"alias_kind":"pith_short_8","alias_value":"XB7HICBU","created_at":"2026-06-03T01:05:49Z"}],"graph_snapshots":[{"event_id":"sha256:f04a33eeb5ea0429db3201d033445ab9ca5f571a7f3fedb3d0f4b8d229c0bc85","target":"graph","created_at":"2026-06-03T01:05:49Z","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/2603.05406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Erlend Raa V{\\aa}gset, Geevarghese Philip","cross_cats":["cs.CC","cs.DM","cs.DS","math.GN"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-03-05T17:32:04Z","title":"ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.05406","kind":"arxiv","version":2},"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:42ed32f57292e4ab276b657bf7c2a122f6f1c3c4a49a92868a96db0df4ab3802","target":"record","created_at":"2026-06-03T01:05:49Z","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":"4032abfc01c7e7ae478f32b070bad5a11ef305043a8b2921c0019d631b7533ce","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.GN"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-03-05T17:32:04Z","title_canon_sha256":"74ae94894c703e85ac8ab4ae4f1739a35a7f692acaa8a4ba8b8bfad75b4892af"},"schema_version":"1.0","source":{"id":"2603.05406","kind":"arxiv","version":2}},"canonical_sha256":"b87e740834268033f22e133e9178746f9e20b22a624b24efb8daf92ed632d725","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b87e740834268033f22e133e9178746f9e20b22a624b24efb8daf92ed632d725","first_computed_at":"2026-06-03T01:05:49.570288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:49.570288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWNzYfKmUspPwWkVA7t1FeQva1fBoCALaRojvqTe9vgcXPSFWWX9ddaQxp4TxzOo9fwTUY6gz3vYaJFvt0w/Ag==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:49.570862Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.05406","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42ed32f57292e4ab276b657bf7c2a122f6f1c3c4a49a92868a96db0df4ab3802","sha256:f04a33eeb5ea0429db3201d033445ab9ca5f571a7f3fedb3d0f4b8d229c0bc85"],"state_sha256":"de7520ab31d14ffed8282fe61dc0ce8d93bfc6e33b71c92a17d9e9690bd24edf"}