{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XB7HICBUE2ADH4ROCM7JC6DUN6","short_pith_number":"pith:XB7HICBU","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"},"canonical_sha256":"b87e740834268033f22e133e9178746f9e20b22a624b24efb8daf92ed632d725","source":{"kind":"arxiv","id":"2603.05406","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XB7HICBUE2ADH4ROCM7JC6DUN6","target":"record","payload":{"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"},"canonical_sha256":"b87e740834268033f22e133e9178746f9e20b22a624b24efb8daf92ed632d725","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"},"source_kind":"arxiv","source_id":"2603.05406","source_version":2,"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-06-03T01:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0YskPeOpnwlI4cV8QWw561T+7NL/ZGGJy6vxMpbVOGsGAKnP0Q3wCFEg1UklgacG54C0f4QkwqQGIIQgwvKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:33:58.656904Z"},"content_sha256":"42ed32f57292e4ab276b657bf7c2a122f6f1c3c4a49a92868a96db0df4ab3802","schema_version":"1.0","event_id":"sha256:42ed32f57292e4ab276b657bf7c2a122f6f1c3c4a49a92868a96db0df4ab3802"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XB7HICBUE2ADH4ROCM7JC6DUN6","target":"graph","payload":{"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"},"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-06-03T01:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+T+kYGIg7UCLTeEgZRPu98h3t70utJU6ZMrLYhEUhbhsTJ69JoTiCwsivXGyoDvSzXxDcKDXw/4PnDNDjaoMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:33:58.657283Z"},"content_sha256":"f04a33eeb5ea0429db3201d033445ab9ca5f571a7f3fedb3d0f4b8d229c0bc85","schema_version":"1.0","event_id":"sha256:f04a33eeb5ea0429db3201d033445ab9ca5f571a7f3fedb3d0f4b8d229c0bc85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/bundle.json","state_url":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/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-06-21T10:33:58Z","links":{"resolver":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6","bundle":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/bundle.json","state":"https://pith.science/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XB7HICBUE2ADH4ROCM7JC6DUN6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ruiOAN/5BAQxPDC8nFzNr3ZDZPQAE0nMiNOc+QmxIjsne1G2dAwQwaii1nIJJ5C/mBCQUZcPFXxDQ8xL4iuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:33:58.659357Z","bundle_sha256":"73d48a6a906a97e54bbe0fc97038022e3520f7a2184bccfdafb50a1cb8fc8833"}}