{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B5YRVX4RZ4TFJMZKIIZAGVMXU7","short_pith_number":"pith:B5YRVX4R","canonical_record":{"source":{"id":"1303.7037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-28T04:49:25Z","cross_cats_sorted":["cs.CC","math.GT"],"title_canon_sha256":"d765d86c87d1a134a336b4b5d27518c17ce814c27f8a5637297805497736570b","abstract_canon_sha256":"8e57ccd2aacdc82f8ee00d66e9fd128b95bf4cd93d3cd4f1137c6003df78b351"},"schema_version":"1.0"},"canonical_sha256":"0f711adf91cf2654b32a4232035597a7ce223776e1128010c50fbfc339554cb1","source":{"kind":"arxiv","id":"1303.7037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7037","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7037v1","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7037","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"B5YRVX4RZ4TF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5YRVX4RZ4TFJMZK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5YRVX4R","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B5YRVX4RZ4TFJMZKIIZAGVMXU7","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-28T04:49:25Z","cross_cats_sorted":["cs.CC","math.GT"],"title_canon_sha256":"d765d86c87d1a134a336b4b5d27518c17ce814c27f8a5637297805497736570b","abstract_canon_sha256":"8e57ccd2aacdc82f8ee00d66e9fd128b95bf4cd93d3cd4f1137c6003df78b351"},"schema_version":"1.0"},"canonical_sha256":"0f711adf91cf2654b32a4232035597a7ce223776e1128010c50fbfc339554cb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:36.984090Z","signature_b64":"fb/IE4JWVMUbLFrDkdAehh3GzjhDk4ouF5Rqr11ksFyiERUNt3x/+wLnmRL4TME2TJN4V6FU1CEefQeP9u1RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f711adf91cf2654b32a4232035597a7ce223776e1128010c50fbfc339554cb1","last_reissued_at":"2026-05-18T00:02:36.983492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:36.983492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7037","source_version":1,"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-05-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5852fFFxdPWxn/QbDDg1x6Ci5gwW0elNgmGqj3sGm3wEPA4XukcPO+9F6dc6vZfePwBK5+QqJTww1U8tuqaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:59.199127Z"},"content_sha256":"3140ba96281287f6bc5c7b502e34606cc749d73f35d78cb490f83a13fbd193b2","schema_version":"1.0","event_id":"sha256:3140ba96281287f6bc5c7b502e34606cc749d73f35d78cb490f83a13fbd193b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B5YRVX4RZ4TFJMZKIIZAGVMXU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Discrete Morse Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.GT"],"primary_cat":"cs.CG","authors_text":"Benjamin A. Burton, Jo\\~ao Paix\\~ao, Jonathan Spreer, Thomas Lewiner","submitted_at":"2013-03-28T04:49:25Z","abstract_excerpt":"Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds, through a reduction to the erasability problem.\n  Here, we refine the study of the complexity of problems related to discrete Morse theory in terms of parameterized complexity. On the one hand we prove that the erasability problem is W[P]-complete on the natural parameter. On the other hand we propose an algorithm for computing optimal Morse matchin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7037","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":""},"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-05-18T00:02:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2BGkiELzDFeFImRwArDtj/hH02F3zQ+CcBf62uEFZXsMRxjTDI85G7eLZcyKxWyau3qawEHCm1gBxUaOY3zAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:59.199575Z"},"content_sha256":"770c80ab01b036adf55e378f399dad33e12eb39d91b2f749ed1c36c973accc95","schema_version":"1.0","event_id":"sha256:770c80ab01b036adf55e378f399dad33e12eb39d91b2f749ed1c36c973accc95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7/bundle.json","state_url":"https://pith.science/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7/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-05-31T23:07:59Z","links":{"resolver":"https://pith.science/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7","bundle":"https://pith.science/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7/bundle.json","state":"https://pith.science/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5YRVX4RZ4TFJMZKIIZAGVMXU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B5YRVX4RZ4TFJMZKIIZAGVMXU7","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":"8e57ccd2aacdc82f8ee00d66e9fd128b95bf4cd93d3cd4f1137c6003df78b351","cross_cats_sorted":["cs.CC","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-28T04:49:25Z","title_canon_sha256":"d765d86c87d1a134a336b4b5d27518c17ce814c27f8a5637297805497736570b"},"schema_version":"1.0","source":{"id":"1303.7037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7037","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7037v1","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7037","created_at":"2026-05-18T00:02:36Z"},{"alias_kind":"pith_short_12","alias_value":"B5YRVX4RZ4TF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5YRVX4RZ4TFJMZK","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5YRVX4R","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:770c80ab01b036adf55e378f399dad33e12eb39d91b2f749ed1c36c973accc95","target":"graph","created_at":"2026-05-18T00:02:36Z","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"},"paper":{"abstract_excerpt":"Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds, through a reduction to the erasability problem.\n  Here, we refine the study of the complexity of problems related to discrete Morse theory in terms of parameterized complexity. On the one hand we prove that the erasability problem is W[P]-complete on the natural parameter. On the other hand we propose an algorithm for computing optimal Morse matchin","authors_text":"Benjamin A. Burton, Jo\\~ao Paix\\~ao, Jonathan Spreer, Thomas Lewiner","cross_cats":["cs.CC","math.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-28T04:49:25Z","title":"Parameterized Complexity of Discrete Morse Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7037","kind":"arxiv","version":1},"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:3140ba96281287f6bc5c7b502e34606cc749d73f35d78cb490f83a13fbd193b2","target":"record","created_at":"2026-05-18T00:02:36Z","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":"8e57ccd2aacdc82f8ee00d66e9fd128b95bf4cd93d3cd4f1137c6003df78b351","cross_cats_sorted":["cs.CC","math.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-28T04:49:25Z","title_canon_sha256":"d765d86c87d1a134a336b4b5d27518c17ce814c27f8a5637297805497736570b"},"schema_version":"1.0","source":{"id":"1303.7037","kind":"arxiv","version":1}},"canonical_sha256":"0f711adf91cf2654b32a4232035597a7ce223776e1128010c50fbfc339554cb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f711adf91cf2654b32a4232035597a7ce223776e1128010c50fbfc339554cb1","first_computed_at":"2026-05-18T00:02:36.983492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:36.983492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fb/IE4JWVMUbLFrDkdAehh3GzjhDk4ouF5Rqr11ksFyiERUNt3x/+wLnmRL4TME2TJN4V6FU1CEefQeP9u1RDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:36.984090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3140ba96281287f6bc5c7b502e34606cc749d73f35d78cb490f83a13fbd193b2","sha256:770c80ab01b036adf55e378f399dad33e12eb39d91b2f749ed1c36c973accc95"],"state_sha256":"40a9fc2de69c7489a47397a7f20e4a7b22f13c3c31f1f7b620d16889875d1924"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idtQjC5Q2GHoIqF2XOA0zxAPmu2ULzYuTNwm7sDAp4iPvOIOfmwQXBkR2wDdCh2Xpo34ROS4n7JJQjpGek4CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:07:59.202912Z","bundle_sha256":"c38ac76627ac25a60cc8ca3b477e06ed136fdb29dacc4bd77e220cdd6bdb0056"}}