{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UIQYRH3U63ZK2G5CF6AMCVRYOV","short_pith_number":"pith:UIQYRH3U","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"},"canonical_sha256":"a221889f74f6f2ad1ba22f80c156387563b1e08edbe5ac869546ef79e12ec4a0","source":{"kind":"arxiv","id":"1704.05896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05896","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05896v1","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05896","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"UIQYRH3U63ZK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UIQYRH3U63ZK2G5C","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UIQYRH3U","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UIQYRH3U63ZK2G5CF6AMCVRYOV","target":"record","payload":{"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"},"canonical_sha256":"a221889f74f6f2ad1ba22f80c156387563b1e08edbe5ac869546ef79e12ec4a0","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"},"source_kind":"arxiv","source_id":"1704.05896","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-05-18T00:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1PLkVk2+S7HnPVbhTTs+Q1v5MOWNzfy15qXJvLwfBQTJuADcv0uMJoXeVwkDsfe+t/SIe55+vNxot3XrKRbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:34:16.763166Z"},"content_sha256":"8a46c4ce7d5b6e459352024bb27a3eb41bf78ec7b9f220febb00ca35533f1d65","schema_version":"1.0","event_id":"sha256:8a46c4ce7d5b6e459352024bb27a3eb41bf78ec7b9f220febb00ca35533f1d65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UIQYRH3U63ZK2G5CF6AMCVRYOV","target":"graph","payload":{"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"},"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-05-18T00:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVfsS6fOsD6fUENgUsXv88idp3c1fCZY0vIklI8glFFSRymX7bZXOQp8HFJiHXq25OG7kjyxJx8Q1mbeIO4vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:34:16.763869Z"},"content_sha256":"59d25fc98e3dccb6ff641c4ced83172b87ca007d891a5e1aab8e85554f3a8220","schema_version":"1.0","event_id":"sha256:59d25fc98e3dccb6ff641c4ced83172b87ca007d891a5e1aab8e85554f3a8220"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/bundle.json","state_url":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/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-05-25T03:34:16Z","links":{"resolver":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV","bundle":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/bundle.json","state":"https://pith.science/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIQYRH3U63ZK2G5CF6AMCVRYOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UIQYRH3U63ZK2G5CF6AMCVRYOV","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":"77543e33a75062c3e821885e5ec0333dcdef4fabd03868e7155ce2d6d6c07de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-19T19:00:40Z","title_canon_sha256":"2e8920e0d8f78ef1d67d60c8d8ed793d48f1be1925f76451d373430fcb1b9437"},"schema_version":"1.0","source":{"id":"1704.05896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05896","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05896v1","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05896","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"UIQYRH3U63ZK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UIQYRH3U63ZK2G5C","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UIQYRH3U","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:59d25fc98e3dccb6ff641c4ced83172b87ca007d891a5e1aab8e85554f3a8220","target":"graph","created_at":"2026-05-18T00:46:03Z","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"},"paper":{"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 ","authors_text":"Ge Xia, Iyad Kanj, Qilong Feng, Zhao An","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-19T19:00:40Z","title":"The Complexity of Tree Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05896","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:8a46c4ce7d5b6e459352024bb27a3eb41bf78ec7b9f220febb00ca35533f1d65","target":"record","created_at":"2026-05-18T00:46:03Z","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":"77543e33a75062c3e821885e5ec0333dcdef4fabd03868e7155ce2d6d6c07de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-19T19:00:40Z","title_canon_sha256":"2e8920e0d8f78ef1d67d60c8d8ed793d48f1be1925f76451d373430fcb1b9437"},"schema_version":"1.0","source":{"id":"1704.05896","kind":"arxiv","version":1}},"canonical_sha256":"a221889f74f6f2ad1ba22f80c156387563b1e08edbe5ac869546ef79e12ec4a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a221889f74f6f2ad1ba22f80c156387563b1e08edbe5ac869546ef79e12ec4a0","first_computed_at":"2026-05-18T00:46:03.828181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:03.828181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1O6S4JalS3thlkKbAWBmHMvv/YPgAu76kqd0kxwdvTu9D1gsR6AYMIShyNdBg/9J0uBJNMoxclzNT2VkyFvtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:03.828712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a46c4ce7d5b6e459352024bb27a3eb41bf78ec7b9f220febb00ca35533f1d65","sha256:59d25fc98e3dccb6ff641c4ced83172b87ca007d891a5e1aab8e85554f3a8220"],"state_sha256":"bb1b98743b6e84da52bee5f80dae200b058ad715031ed2aefd2b754e9b90f558"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YY8+XZRy0UUIPAPtg51jKl3p/K7uxAiQAaRxCqKe5YBnpHpenVqFRyzARqTbqIw7Rh1hM3sX3usG2HV1Ok6sAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:34:16.767825Z","bundle_sha256":"c8ae157cccb0a18ee7c6b8ba45f43944e86257e4bc32eb3cddbaf564f09966db"}}