{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UIQYRH3U63ZK2G5CF6AMCVRYOV","short_pith_number":"pith:UIQYRH3U","schema_version":"1.0","canonical_sha256":"a221889f74f6f2ad1ba22f80c156387563b1e08edbe5ac869546ef79e12ec4a0","source":{"kind":"arxiv","id":"1704.05896","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Tree Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ge Xia, Iyad Kanj, Qilong Feng, Zhao An","submitted_at":"2017-04-19T19:00:40Z","abstract_excerpt":"Given a tree $T$ on $n$ vertices, and $k, b, s_1, \\ldots, s_b \\in N$, the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting components can be grouped into $b$ groups such that the number of vertices in group $i$ is $s_i$, for $i =1, \\ldots, b$. The case when $s_1=\\cdots =s_b =n/b$, referred to as the Balanced Tree Partitioning problem, was shown to be NP-complete for trees of maximum degree at most 5, and the complexity of the problem for trees of maximum degree 4 and 3 was posed as an open question. The parameterized complexity of Balanced Tree "},"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":"1704.05896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-19T19:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"2e8920e0d8f78ef1d67d60c8d8ed793d48f1be1925f76451d373430fcb1b9437","abstract_canon_sha256":"77543e33a75062c3e821885e5ec0333dcdef4fabd03868e7155ce2d6d6c07de4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.828712Z","signature_b64":"1O6S4JalS3thlkKbAWBmHMvv/YPgAu76kqd0kxwdvTu9D1gsR6AYMIShyNdBg/9J0uBJNMoxclzNT2VkyFvtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a221889f74f6f2ad1ba22f80c156387563b1e08edbe5ac869546ef79e12ec4a0","last_reissued_at":"2026-05-18T00:46:03.828181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.828181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Tree Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ge Xia, Iyad Kanj, Qilong Feng, Zhao An","submitted_at":"2017-04-19T19:00:40Z","abstract_excerpt":"Given a tree $T$ on $n$ vertices, and $k, b, s_1, \\ldots, s_b \\in N$, the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting components can be grouped into $b$ groups such that the number of vertices in group $i$ is $s_i$, for $i =1, \\ldots, b$. The case when $s_1=\\cdots =s_b =n/b$, referred to as the Balanced Tree Partitioning problem, was shown to be NP-complete for trees of maximum degree at most 5, and the complexity of the problem for trees of maximum degree 4 and 3 was posed as an open question. The parameterized complexity of Balanced Tree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05896","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":""},"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":"1704.05896","created_at":"2026-05-18T00:46:03.828279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05896v1","created_at":"2026-05-18T00:46:03.828279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05896","created_at":"2026-05-18T00:46:03.828279+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIQYRH3U63ZK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIQYRH3U63ZK2G5C","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIQYRH3U","created_at":"2026-05-18T12:31:46.661854+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/UIQYRH3U63ZK2G5CF6AMCVRYOV","json":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV.json","graph_json":"https://pith.science/api/pith-number/UIQYRH3U63ZK2G5CF6AMCVRYOV/graph.json","events_json":"https://pith.science/api/pith-number/UIQYRH3U63ZK2G5CF6AMCVRYOV/events.json","paper":"https://pith.science/paper/UIQYRH3U"},"agent_actions":{"view_html":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV","download_json":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV.json","view_paper":"https://pith.science/paper/UIQYRH3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/UIQYRH3U63ZK2G5CF6AMCVRYOV/graph.json","fetch_events":"https://pith.science/api/pith-number/UIQYRH3U63ZK2G5CF6AMCVRYOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/action/storage_attestation","attest_author":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/action/author_attestation","sign_citation":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/action/citation_signature","submit_replication":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/action/replication_record"}},"created_at":"2026-05-18T00:46:03.828279+00:00","updated_at":"2026-05-18T00:46:03.828279+00:00"}