{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PTEMTNXJQPSNKMEH47IPAMCRYF","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":"2c4ca97bbc9840983146da2a734eb73eec1e295aae678301191e9d2f98e7e768","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-25T20:10:09Z","title_canon_sha256":"fd51273393b46f8fd5f357afcbb7ef3c9408869f709fede7cb0581969e70b3c9"},"schema_version":"1.0","source":{"id":"1312.7014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7014","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7014v2","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7014","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"PTEMTNXJQPSN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PTEMTNXJQPSNKMEH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PTEMTNXJ","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:8e07dfe05667fe2819cb9ec17eb5d4bf5700b7e2d3af8c0c6aec4b4f4d2f8951","target":"graph","created_at":"2026-05-18T01:23:09Z","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":"A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that Bisection is FPT for the distance to constant cliquewidth if we are given the deletion set. This implies FPT algorithms for some well-studied parameters such as cluster vertex deletion number and feedback vertex set. However, we show that Bisection does not admit polynomial-size kernels for these parameters.\n  For the Vertex Bisection problem, vertices need to be ","authors_text":"Andreas Emil Feldmann, Manuel Sorge, Ond\\v{r}ej Such\\'y, Ren\\'e van Bevern","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-25T20:10:09Z","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7014","kind":"arxiv","version":2},"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:c7285ed05c490c61469f2612e1210bb7a3b5fbbbb8a505a8eded39912ab41ff6","target":"record","created_at":"2026-05-18T01:23:09Z","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":"2c4ca97bbc9840983146da2a734eb73eec1e295aae678301191e9d2f98e7e768","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-25T20:10:09Z","title_canon_sha256":"fd51273393b46f8fd5f357afcbb7ef3c9408869f709fede7cb0581969e70b3c9"},"schema_version":"1.0","source":{"id":"1312.7014","kind":"arxiv","version":2}},"canonical_sha256":"7cc8c9b6e983e4d53087e7d0f03051c173c62cff9a23d62fef10b33342d97419","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cc8c9b6e983e4d53087e7d0f03051c173c62cff9a23d62fef10b33342d97419","first_computed_at":"2026-05-18T01:23:09.046716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:09.046716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qYTb2ii6lzJYGL8+HoboZJe/DrmV5epHm6F+SnyI5inPfHe12i+mgX4ezd7S7ooTOTTlORK7cLtyKdyA1GGADA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:09.047264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7285ed05c490c61469f2612e1210bb7a3b5fbbbb8a505a8eded39912ab41ff6","sha256:8e07dfe05667fe2819cb9ec17eb5d4bf5700b7e2d3af8c0c6aec4b4f4d2f8951"],"state_sha256":"d85f018d6aa792d1077b6c2d4527282cc1e6729e69d90fe2f74c694a90a51246"}