{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MLIOM6WI2GXRI2MC2UIJ4AF4QL","short_pith_number":"pith:MLIOM6WI","schema_version":"1.0","canonical_sha256":"62d0e67ac8d1af146982d5109e00bc82fafecc2c8d4f47ff41126afa1341944e","source":{"kind":"arxiv","id":"2406.19819","version":1},"attestation_state":"computed","paper":{"title":"Steiner Tree Parameterized by Multiway Cut and Even Less","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart M.P. Jansen, C\\'eline M.F. Swennenhuis","submitted_at":"2024-06-28T10:49:43Z","abstract_excerpt":"In the Steiner Tree problem we are given an undirected edge-weighted graph as input, along with a set $K$ of vertices called terminals. The task is to output a minimum-weight connected subgraph that spans all the terminals. The famous Dreyfus-Wagner algorithm running in $3^{|K|} \\mathsf{poly}(n)$ time shows that the problem is fixed-parameter tractable parameterized by the number of terminals. We present fixed-parameter tractable algorithms for Steiner Tree using structurally smaller parameterizations.\n  Our first result concerns the parameterization by a multiway cut $S$ of the terminals, whi"},"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":"2406.19819","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-28T10:49:43Z","cross_cats_sorted":[],"title_canon_sha256":"13429853e43849777077a3266e82970aeb24d4de1f6cc7341b9b2aaed65533f3","abstract_canon_sha256":"d9313d1d2f1e559012a89132953e08313ce860f6491ca78cbc6c50aa3ee3ae7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:55.469043Z","signature_b64":"UuS6L5YmXEkRW0b683RE2Hm35GIpKxok4bLywuHrDDqc2Nu3nJx+bcmPjkao/hOrrkhrmXpAq8Oe9S6bArg+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62d0e67ac8d1af146982d5109e00bc82fafecc2c8d4f47ff41126afa1341944e","last_reissued_at":"2026-07-05T08:37:55.468646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:55.468646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Steiner Tree Parameterized by Multiway Cut and Even Less","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart M.P. Jansen, C\\'eline M.F. Swennenhuis","submitted_at":"2024-06-28T10:49:43Z","abstract_excerpt":"In the Steiner Tree problem we are given an undirected edge-weighted graph as input, along with a set $K$ of vertices called terminals. The task is to output a minimum-weight connected subgraph that spans all the terminals. The famous Dreyfus-Wagner algorithm running in $3^{|K|} \\mathsf{poly}(n)$ time shows that the problem is fixed-parameter tractable parameterized by the number of terminals. We present fixed-parameter tractable algorithms for Steiner Tree using structurally smaller parameterizations.\n  Our first result concerns the parameterization by a multiway cut $S$ of the terminals, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.19819/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":"2406.19819","created_at":"2026-07-05T08:37:55.468699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19819v1","created_at":"2026-07-05T08:37:55.468699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19819","created_at":"2026-07-05T08:37:55.468699+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLIOM6WI2GXR","created_at":"2026-07-05T08:37:55.468699+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLIOM6WI2GXRI2MC","created_at":"2026-07-05T08:37:55.468699+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLIOM6WI","created_at":"2026-07-05T08:37:55.468699+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/MLIOM6WI2GXRI2MC2UIJ4AF4QL","json":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL.json","graph_json":"https://pith.science/api/pith-number/MLIOM6WI2GXRI2MC2UIJ4AF4QL/graph.json","events_json":"https://pith.science/api/pith-number/MLIOM6WI2GXRI2MC2UIJ4AF4QL/events.json","paper":"https://pith.science/paper/MLIOM6WI"},"agent_actions":{"view_html":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL","download_json":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL.json","view_paper":"https://pith.science/paper/MLIOM6WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19819&json=true","fetch_graph":"https://pith.science/api/pith-number/MLIOM6WI2GXRI2MC2UIJ4AF4QL/graph.json","fetch_events":"https://pith.science/api/pith-number/MLIOM6WI2GXRI2MC2UIJ4AF4QL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/action/storage_attestation","attest_author":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/action/author_attestation","sign_citation":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/action/citation_signature","submit_replication":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/action/replication_record"}},"created_at":"2026-07-05T08:37:55.468699+00:00","updated_at":"2026-07-05T08:37:55.468699+00:00"}