{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ES44FLDL3CEGA7ILTHQX6OP2RW","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":"6ff2add9d8dd20f602d8a4ffc21c7155fb32dd974409ab2e5b13af080761b93f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T06:27:51Z","title_canon_sha256":"8a78549db95032d73237aea844b2de6ffbd97ee268857f1054257e8c6a0bf9a4"},"schema_version":"1.0","source":{"id":"2606.17578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17578","created_at":"2026-06-19T16:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17578v1","created_at":"2026-06-19T16:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17578","created_at":"2026-06-19T16:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"ES44FLDL3CEG","created_at":"2026-06-19T16:10:16Z"},{"alias_kind":"pith_short_16","alias_value":"ES44FLDL3CEGA7IL","created_at":"2026-06-19T16:10:16Z"},{"alias_kind":"pith_short_8","alias_value":"ES44FLDL","created_at":"2026-06-19T16:10:16Z"}],"graph_snapshots":[{"event_id":"sha256:e7490df6421657cfd073ba67cec3c0125db96b7ed3e187c791e0ba46ffb4760f","target":"graph","created_at":"2026-06-19T16:10:16Z","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/2606.17578/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study exact exponential-time algorithms for Edge Deletion to Cactus. Given a connected graph $G$, the task is to delete a minimum number of edges so that the remaining spanning graph is a connected cactus. Akhtar and Philip (IWOCA 2026) gave an $O^*(3^n)$-time algorithm for the unweighted problem, where $n$ is the number of vertices in the input graph and the $O^*(\\cdot)$ notation hides polynomial factors.\n  We improve this bound to $O^*(2^n)$ time and space. More generally, if the deletion costs take at most $q$ distinct nonnegative real values, then the weighted problem can be solved in $","authors_text":"Wenhao Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T06:27:51Z","title":"Exact Algorithms for Edge Deletion to Cactus Graphs and Weighted Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17578","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:566273af7becd089d5fc492ad514690d4f461d83362a0847f74e6b9571d475a7","target":"record","created_at":"2026-06-19T16:10:16Z","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":"6ff2add9d8dd20f602d8a4ffc21c7155fb32dd974409ab2e5b13af080761b93f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T06:27:51Z","title_canon_sha256":"8a78549db95032d73237aea844b2de6ffbd97ee268857f1054257e8c6a0bf9a4"},"schema_version":"1.0","source":{"id":"2606.17578","kind":"arxiv","version":1}},"canonical_sha256":"24b9c2ac6bd888607d0b99e17f39fa8db181a8ac1acbabe1510b7ee5fbd1ede6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24b9c2ac6bd888607d0b99e17f39fa8db181a8ac1acbabe1510b7ee5fbd1ede6","first_computed_at":"2026-06-19T16:10:16.456860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:16.456860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zq+XfcxHeSmlyPVt1eeROIYcyU2NzStvuttoL0wfrCVQeaCXJvfRMctCEGklrENWfquaQuyZawAjlkbJwxIYCg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:16.457185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:566273af7becd089d5fc492ad514690d4f461d83362a0847f74e6b9571d475a7","sha256:e7490df6421657cfd073ba67cec3c0125db96b7ed3e187c791e0ba46ffb4760f"],"state_sha256":"df38b8596b92dd5ce057c0baa32239cb1f7a4213d50cee0e7b03945dedfddeaf"}