{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WSTJU5FYQ7TLRXVY5NMIJ5347D","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":"e78567e59bef4e644441e5ae4f1631d0ced084e61c7c16e879463d3c242db7ed","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-10T19:06:15Z","title_canon_sha256":"cb1053cab15cd2c233770ddfb15b229ba83334002bfadd6472e1b95aed208aea"},"schema_version":"1.0","source":{"id":"2410.08314","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08314","created_at":"2026-05-28T01:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08314v6","created_at":"2026-05-28T01:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08314","created_at":"2026-05-28T01:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"WSTJU5FYQ7TL","created_at":"2026-05-28T01:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"WSTJU5FYQ7TLRXVY","created_at":"2026-05-28T01:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"WSTJU5FY","created_at":"2026-05-28T01:05:10Z"}],"graph_snapshots":[{"event_id":"sha256:e9b41412c531ea8bad9971d8d9c83fb90f89b462f8142f5a6378befb82f0d64b","target":"graph","created_at":"2026-05-28T01:05:10Z","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/2410.08314/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study the Spanning Tree Congestion problem, where we are given a graph $G=(V,E)$ and are asked to find a spanning tree $T$ of minimum maximum congestion. Here, the congestion of an edge $e\\in T$ is the number of edges $uv\\in E$ such that the (unique) path from $u$ to $v$ in $T$ traverses $e$. We consider this well-studied NP-hard problem from the point of view of (structural) parameterized complexity and obtain the following results.\n  We resolve a natural open problem by showing that Spanning Tree Congestion is not FPT parameterized by treewidth (under standard assumptions). ","authors_text":"Daniel Vaz, Edouard Nemery, Manolis Vasilakis, Michael Lampis, Valia Mitsou, Yota Otachi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-10T19:06:15Z","title":"Parameterized Spanning Tree Congestion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08314","kind":"arxiv","version":6},"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:df98c4662d2ad9f9d5f9589ebbc0f16b5aee885d8c7b1f48e92fa70e8616ada6","target":"record","created_at":"2026-05-28T01:05:10Z","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":"e78567e59bef4e644441e5ae4f1631d0ced084e61c7c16e879463d3c242db7ed","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-10T19:06:15Z","title_canon_sha256":"cb1053cab15cd2c233770ddfb15b229ba83334002bfadd6472e1b95aed208aea"},"schema_version":"1.0","source":{"id":"2410.08314","kind":"arxiv","version":6}},"canonical_sha256":"b4a69a74b887e6b8deb8eb5884f77cf8e166ddd3de29c9bff500687770a7c8a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4a69a74b887e6b8deb8eb5884f77cf8e166ddd3de29c9bff500687770a7c8a4","first_computed_at":"2026-05-28T01:05:10.117188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:10.117188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sPYzUsJvBL+V1yTpJZxxPUBToyFBkgQ5xi7Uj2zJ1yxSz6Fn4YnnDbbj56037BxPJmvT7GmBi1zZ8dPwpeK9DA==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:10.117679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.08314","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df98c4662d2ad9f9d5f9589ebbc0f16b5aee885d8c7b1f48e92fa70e8616ada6","sha256:e9b41412c531ea8bad9971d8d9c83fb90f89b462f8142f5a6378befb82f0d64b"],"state_sha256":"0e93ffea4ce2ac0a2aa99b5536391ef59f3b12ab8a2faeb7c43539c60ceebf09"}