{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PTEMTNXJQPSNKMEH47IPAMCRYF","short_pith_number":"pith:PTEMTNXJ","canonical_record":{"source":{"id":"1312.7014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-25T20:10:09Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fd51273393b46f8fd5f357afcbb7ef3c9408869f709fede7cb0581969e70b3c9","abstract_canon_sha256":"2c4ca97bbc9840983146da2a734eb73eec1e295aae678301191e9d2f98e7e768"},"schema_version":"1.0"},"canonical_sha256":"7cc8c9b6e983e4d53087e7d0f03051c173c62cff9a23d62fef10b33342d97419","source":{"kind":"arxiv","id":"1312.7014","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PTEMTNXJQPSNKMEH47IPAMCRYF","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-25T20:10:09Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fd51273393b46f8fd5f357afcbb7ef3c9408869f709fede7cb0581969e70b3c9","abstract_canon_sha256":"2c4ca97bbc9840983146da2a734eb73eec1e295aae678301191e9d2f98e7e768"},"schema_version":"1.0"},"canonical_sha256":"7cc8c9b6e983e4d53087e7d0f03051c173c62cff9a23d62fef10b33342d97419","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:09.047264Z","signature_b64":"qYTb2ii6lzJYGL8+HoboZJe/DrmV5epHm6F+SnyI5inPfHe12i+mgX4ezd7S7ooTOTTlORK7cLtyKdyA1GGADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cc8c9b6e983e4d53087e7d0f03051c173c62cff9a23d62fef10b33342d97419","last_reissued_at":"2026-05-18T01:23:09.046716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:09.046716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7014","source_version":2,"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-18T01:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zB42Yyyl8lyulwwrc8Dp5FztrUSPqgYZW+dp/ADJIbtO3GjPMzzuZY44L1UcTF0QunR55u/4GbeJkn8Iwk37BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:17:36.523267Z"},"content_sha256":"c7285ed05c490c61469f2612e1210bb7a3b5fbbbb8a505a8eded39912ab41ff6","schema_version":"1.0","event_id":"sha256:c7285ed05c490c61469f2612e1210bb7a3b5fbbbb8a505a8eded39912ab41ff6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PTEMTNXJQPSNKMEH47IPAMCRYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Emil Feldmann, Manuel Sorge, Ond\\v{r}ej Such\\'y, Ren\\'e van Bevern","submitted_at":"2013-12-25T20:10:09Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7014","kind":"arxiv","version":2},"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-18T01:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFj+bRikh8e3lyfT0z3imLyxK46eifoogPXiKcbRjQJlIBSMZHr+HQ/hgBF7oomgYG92I5/yuqbYHoVF3abxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:17:36.523629Z"},"content_sha256":"8e07dfe05667fe2819cb9ec17eb5d4bf5700b7e2d3af8c0c6aec4b4f4d2f8951","schema_version":"1.0","event_id":"sha256:8e07dfe05667fe2819cb9ec17eb5d4bf5700b7e2d3af8c0c6aec4b4f4d2f8951"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTEMTNXJQPSNKMEH47IPAMCRYF/bundle.json","state_url":"https://pith.science/pith/PTEMTNXJQPSNKMEH47IPAMCRYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTEMTNXJQPSNKMEH47IPAMCRYF/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-06-01T16:17:36Z","links":{"resolver":"https://pith.science/pith/PTEMTNXJQPSNKMEH47IPAMCRYF","bundle":"https://pith.science/pith/PTEMTNXJQPSNKMEH47IPAMCRYF/bundle.json","state":"https://pith.science/pith/PTEMTNXJQPSNKMEH47IPAMCRYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTEMTNXJQPSNKMEH47IPAMCRYF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ko6DCB9bKE+BtJjQxKJm99Gek7z0uO2zLG7ufX1LRXCDugFhdB0qvrSPqCXwKSuDfAMV2921dff04V3TiX0oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:17:36.525540Z","bundle_sha256":"968dfbf00fee40a5862f0d71d30926037bd8b103e6f13e1937c4de392e8a1b4f"}}