{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WSTJU5FYQ7TLRXVY5NMIJ5347D","short_pith_number":"pith:WSTJU5FY","schema_version":"1.0","canonical_sha256":"b4a69a74b887e6b8deb8eb5884f77cf8e166ddd3de29c9bff500687770a7c8a4","source":{"kind":"arxiv","id":"2410.08314","version":6},"attestation_state":"computed","paper":{"title":"Parameterized Spanning Tree Congestion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Vaz, Edouard Nemery, Manolis Vasilakis, Michael Lampis, Valia Mitsou, Yota Otachi","submitted_at":"2024-10-10T19:06:15Z","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). "},"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":"2410.08314","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-10T19:06:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cb1053cab15cd2c233770ddfb15b229ba83334002bfadd6472e1b95aed208aea","abstract_canon_sha256":"e78567e59bef4e644441e5ae4f1631d0ced084e61c7c16e879463d3c242db7ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:10.117679Z","signature_b64":"sPYzUsJvBL+V1yTpJZxxPUBToyFBkgQ5xi7Uj2zJ1yxSz6Fn4YnnDbbj56037BxPJmvT7GmBi1zZ8dPwpeK9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4a69a74b887e6b8deb8eb5884f77cf8e166ddd3de29c9bff500687770a7c8a4","last_reissued_at":"2026-05-28T01:05:10.117188Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:10.117188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Spanning Tree Congestion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Vaz, Edouard Nemery, Manolis Vasilakis, Michael Lampis, Valia Mitsou, Yota Otachi","submitted_at":"2024-10-10T19:06:15Z","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). "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08314","kind":"arxiv","version":6},"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/2410.08314/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":"2410.08314","created_at":"2026-05-28T01:05:10.117257+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08314v6","created_at":"2026-05-28T01:05:10.117257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08314","created_at":"2026-05-28T01:05:10.117257+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSTJU5FYQ7TL","created_at":"2026-05-28T01:05:10.117257+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSTJU5FYQ7TLRXVY","created_at":"2026-05-28T01:05:10.117257+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSTJU5FY","created_at":"2026-05-28T01:05:10.117257+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2410.00568","citing_title":"Approximation of Spanning Tree Congestion using Hereditary Bisection","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D","json":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D.json","graph_json":"https://pith.science/api/pith-number/WSTJU5FYQ7TLRXVY5NMIJ5347D/graph.json","events_json":"https://pith.science/api/pith-number/WSTJU5FYQ7TLRXVY5NMIJ5347D/events.json","paper":"https://pith.science/paper/WSTJU5FY"},"agent_actions":{"view_html":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D","download_json":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D.json","view_paper":"https://pith.science/paper/WSTJU5FY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08314&json=true","fetch_graph":"https://pith.science/api/pith-number/WSTJU5FYQ7TLRXVY5NMIJ5347D/graph.json","fetch_events":"https://pith.science/api/pith-number/WSTJU5FYQ7TLRXVY5NMIJ5347D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D/action/storage_attestation","attest_author":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D/action/author_attestation","sign_citation":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D/action/citation_signature","submit_replication":"https://pith.science/pith/WSTJU5FYQ7TLRXVY5NMIJ5347D/action/replication_record"}},"created_at":"2026-05-28T01:05:10.117257+00:00","updated_at":"2026-05-28T01:05:10.117257+00:00"}