{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HTYAFHIMOKVCEXW6RXCXPSXQH6","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":"4a95920d804c2bb95b9f3320353787aeeb15d15213bba10b7a55e52a4231a142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-23T16:59:40Z","title_canon_sha256":"0ca96f85170f72a941c975dacbc5fb3e9936e95be3a39a25cd0e71b596033d72"},"schema_version":"1.0","source":{"id":"2206.11832","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.11832","created_at":"2026-07-05T10:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"2206.11832v6","created_at":"2026-07-05T10:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.11832","created_at":"2026-07-05T10:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"HTYAFHIMOKVC","created_at":"2026-07-05T10:16:04Z"},{"alias_kind":"pith_short_16","alias_value":"HTYAFHIMOKVCEXW6","created_at":"2026-07-05T10:16:04Z"},{"alias_kind":"pith_short_8","alias_value":"HTYAFHIM","created_at":"2026-07-05T10:16:04Z"}],"graph_snapshots":[{"event_id":"sha256:fe0c08452480fedbacdc8d6f533e3db0228e47a26a8ef2e18a766c5927d2eb63","target":"graph","created_at":"2026-07-05T10:16:04Z","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/2206.11832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand, we can obtain approximations of the tree-partition-width efficiently: we show that there is an algorithm that, given an $n$-vertex graph $G$ and an integer $k$, constructs a tree-partition of width $O(k^7)$ for $G$ or reports that $G$ has tree-partition-width more than $k$, in time $k^{O(1)}n^2$. We can improve slightly on the approximation factor by sacrificing the dependence on $k$, or on $n$. On the other hand, we show the p","authors_text":"Carla Groenland, Hans L. Bodlaender, Hugo Jacob","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-23T16:59:40Z","title":"On the parameterized complexity of computing tree-partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.11832","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:c4ecad1720ad2f3f7f16b6f114c660ead16d04e86a3ca8770eeaeceab8233981","target":"record","created_at":"2026-07-05T10:16:04Z","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":"4a95920d804c2bb95b9f3320353787aeeb15d15213bba10b7a55e52a4231a142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2022-06-23T16:59:40Z","title_canon_sha256":"0ca96f85170f72a941c975dacbc5fb3e9936e95be3a39a25cd0e71b596033d72"},"schema_version":"1.0","source":{"id":"2206.11832","kind":"arxiv","version":6}},"canonical_sha256":"3cf0029d0c72aa225ede8dc577caf03f83fd4852e7b5d79fa0a338a05cb856a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cf0029d0c72aa225ede8dc577caf03f83fd4852e7b5d79fa0a338a05cb856a1","first_computed_at":"2026-07-05T10:16:04.830112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:04.830112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ph8bTbAKYTHZkvQGUtRzfqonQBUHOzp38qebeorohAGv4QJ67RDPToGy6KK2zemVZY0cu9TI3nNjgtObCDkPBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:04.830553Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.11832","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4ecad1720ad2f3f7f16b6f114c660ead16d04e86a3ca8770eeaeceab8233981","sha256:fe0c08452480fedbacdc8d6f533e3db0228e47a26a8ef2e18a766c5927d2eb63"],"state_sha256":"2286398ea073608b284638d29739fad434b658d46eb7dddac56d953f1343ac9f"}