{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MLIOM6WI2GXRI2MC2UIJ4AF4QL","short_pith_number":"pith:MLIOM6WI","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"},"canonical_sha256":"62d0e67ac8d1af146982d5109e00bc82fafecc2c8d4f47ff41126afa1341944e","source":{"kind":"arxiv","id":"2406.19819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19819","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19819v1","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19819","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"MLIOM6WI2GXR","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"pith_short_16","alias_value":"MLIOM6WI2GXRI2MC","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"pith_short_8","alias_value":"MLIOM6WI","created_at":"2026-07-05T08:37:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MLIOM6WI2GXRI2MC2UIJ4AF4QL","target":"record","payload":{"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"},"canonical_sha256":"62d0e67ac8d1af146982d5109e00bc82fafecc2c8d4f47ff41126afa1341944e","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"},"source_kind":"arxiv","source_id":"2406.19819","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-07-05T08:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRNlVnsA3eyM16AiRwZy4d3fsscyVeaFtBB9bqYiJvDxlQTiQiZDcLonzDNxm6UYpxKmOcB6AEEoB6fV685BCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:15:52.774950Z"},"content_sha256":"9f5622b2cfdc4ca03012f98e8c6ddde744eeaceefd421195fe9eedcde871d52a","schema_version":"1.0","event_id":"sha256:9f5622b2cfdc4ca03012f98e8c6ddde744eeaceefd421195fe9eedcde871d52a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MLIOM6WI2GXRI2MC2UIJ4AF4QL","target":"graph","payload":{"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"},"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-07-05T08:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzJSzslLNr8s0fFzn5zu++OQDwKHQzbPYh/CPHqMJpNtp6S+6EKcP8TuKmMGf/kisRyiqoeHxppoPd09f8qcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:15:52.775437Z"},"content_sha256":"f6e20dd6f6450bf1835cccac4ecc417e3f9583c26514867fccb7060849e87967","schema_version":"1.0","event_id":"sha256:f6e20dd6f6450bf1835cccac4ecc417e3f9583c26514867fccb7060849e87967"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/bundle.json","state_url":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/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-08-12T21:15:52Z","links":{"resolver":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL","bundle":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/bundle.json","state":"https://pith.science/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLIOM6WI2GXRI2MC2UIJ4AF4QL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MLIOM6WI2GXRI2MC2UIJ4AF4QL","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":"d9313d1d2f1e559012a89132953e08313ce860f6491ca78cbc6c50aa3ee3ae7c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-28T10:49:43Z","title_canon_sha256":"13429853e43849777077a3266e82970aeb24d4de1f6cc7341b9b2aaed65533f3"},"schema_version":"1.0","source":{"id":"2406.19819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19819","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19819v1","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19819","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"MLIOM6WI2GXR","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"pith_short_16","alias_value":"MLIOM6WI2GXRI2MC","created_at":"2026-07-05T08:37:55Z"},{"alias_kind":"pith_short_8","alias_value":"MLIOM6WI","created_at":"2026-07-05T08:37:55Z"}],"graph_snapshots":[{"event_id":"sha256:f6e20dd6f6450bf1835cccac4ecc417e3f9583c26514867fccb7060849e87967","target":"graph","created_at":"2026-07-05T08:37:55Z","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/2406.19819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bart M.P. Jansen, C\\'eline M.F. Swennenhuis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-28T10:49:43Z","title":"Steiner Tree Parameterized by Multiway Cut and Even Less"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19819","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:9f5622b2cfdc4ca03012f98e8c6ddde744eeaceefd421195fe9eedcde871d52a","target":"record","created_at":"2026-07-05T08:37:55Z","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":"d9313d1d2f1e559012a89132953e08313ce860f6491ca78cbc6c50aa3ee3ae7c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-28T10:49:43Z","title_canon_sha256":"13429853e43849777077a3266e82970aeb24d4de1f6cc7341b9b2aaed65533f3"},"schema_version":"1.0","source":{"id":"2406.19819","kind":"arxiv","version":1}},"canonical_sha256":"62d0e67ac8d1af146982d5109e00bc82fafecc2c8d4f47ff41126afa1341944e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62d0e67ac8d1af146982d5109e00bc82fafecc2c8d4f47ff41126afa1341944e","first_computed_at":"2026-07-05T08:37:55.468646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:55.468646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuS6L5YmXEkRW0b683RE2Hm35GIpKxok4bLywuHrDDqc2Nu3nJx+bcmPjkao/hOrrkhrmXpAq8Oe9S6bArg+CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:55.469043Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.19819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f5622b2cfdc4ca03012f98e8c6ddde744eeaceefd421195fe9eedcde871d52a","sha256:f6e20dd6f6450bf1835cccac4ecc417e3f9583c26514867fccb7060849e87967"],"state_sha256":"4618ac846da57c5ceecef8adccae08c93899a795237078f8ddb3448e94c888ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zY4a6fJmRi44+dG7i+upgp6doEk7GXAkBSiXJRA5V5WbpeNg1DsHreHdi3iQg8yR1SicSH5vlcXaG3CNVqhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:15:52.780023Z","bundle_sha256":"094286b8983aed5c0ca86e7d681edc16b4a290e8fcba9de3ca62764c562ebfca"}}