{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:L4FTXUO2LVF75EB5VV7YKLDNXO","short_pith_number":"pith:L4FTXUO2","canonical_record":{"source":{"id":"1311.2563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T20:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"f7835ffccbe3c23b6eb8ffb37737b42fab5fc1496814a8ed320eaa19d7d1cb01","abstract_canon_sha256":"7e490849e1dacb2c9f54a799f565a0cdb08aa87bf8dcc4133840d0b528091e29"},"schema_version":"1.0"},"canonical_sha256":"5f0b3bd1da5d4bfe903dad7f852c6dbb830987ab9b6427a26636301be91d860d","source":{"kind":"arxiv","id":"1311.2563","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2563","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2563v2","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2563","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"L4FTXUO2LVF7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L4FTXUO2LVF75EB5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L4FTXUO2","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:L4FTXUO2LVF75EB5VV7YKLDNXO","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T20:21:32Z","cross_cats_sorted":[],"title_canon_sha256":"f7835ffccbe3c23b6eb8ffb37737b42fab5fc1496814a8ed320eaa19d7d1cb01","abstract_canon_sha256":"7e490849e1dacb2c9f54a799f565a0cdb08aa87bf8dcc4133840d0b528091e29"},"schema_version":"1.0"},"canonical_sha256":"5f0b3bd1da5d4bfe903dad7f852c6dbb830987ab9b6427a26636301be91d860d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:11.306376Z","signature_b64":"ZwV5arrOIBqBoBcgU7a3YePblEvfbCbjMI0JqQbHsDIVW7y4aCmA6azRB2v5rsHi7ESGitrXzux/CMiSnaNAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0b3bd1da5d4bfe903dad7f852c6dbb830987ab9b6427a26636301be91d860d","last_reissued_at":"2026-05-18T02:56:11.305979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:11.305979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2563","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-18T02:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwzBrStM9LHFLBieeKGvpUOu/qvRCeAJX8Colx2w7ThlGIwD0dSMPwaVBII8r/7NzPvu4EEp432VODGJGN99Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:47:54.252673Z"},"content_sha256":"9578c3d7eedf79ddfe1dda69ad77b8b5b9834af7582a956f12ca22db359e9e41","schema_version":"1.0","event_id":"sha256:9578c3d7eedf79ddfe1dda69ad77b8b5b9834af7582a956f12ca22db359e9e41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:L4FTXUO2LVF75EB5VV7YKLDNXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Bisection is fixed parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2013-11-11T20:21:32Z","abstract_excerpt":"In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \\leq 1$ and there are at most $k$ edges with one endpoint in $A$ and the other in $B$. In this paper we give an algorithm for Minimum Bisection with running time $O(2^{O(k^{3})}n^3 \\log^3 n)$. This is the first fixed parameter tractable algorithm for Minimum Bisection. At the core of our algorithm lies a new decomposition theorem that states that every graph $G$ can be decomposed by small s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2563","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-18T02:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAsaaXTzWEY9UzjgLKdRnMCLXXl6458Wzuaw/tn4WgyhbVs3tb7IvJWLxAlYHyNpOf7kLCknyQ8oVeUuab0VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:47:54.253363Z"},"content_sha256":"6e586e3b277cdd1879ad3d15455fc2ef845f7e42d8f7fe136bbeaded158087bf","schema_version":"1.0","event_id":"sha256:6e586e3b277cdd1879ad3d15455fc2ef845f7e42d8f7fe136bbeaded158087bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/bundle.json","state_url":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/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-18T16:47:54Z","links":{"resolver":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO","bundle":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/bundle.json","state":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:L4FTXUO2LVF75EB5VV7YKLDNXO","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":"7e490849e1dacb2c9f54a799f565a0cdb08aa87bf8dcc4133840d0b528091e29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T20:21:32Z","title_canon_sha256":"f7835ffccbe3c23b6eb8ffb37737b42fab5fc1496814a8ed320eaa19d7d1cb01"},"schema_version":"1.0","source":{"id":"1311.2563","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2563","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2563v2","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2563","created_at":"2026-05-18T02:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"L4FTXUO2LVF7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L4FTXUO2LVF75EB5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L4FTXUO2","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:6e586e3b277cdd1879ad3d15455fc2ef845f7e42d8f7fe136bbeaded158087bf","target":"graph","created_at":"2026-05-18T02:56:11Z","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":"In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \\leq 1$ and there are at most $k$ edges with one endpoint in $A$ and the other in $B$. In this paper we give an algorithm for Minimum Bisection with running time $O(2^{O(k^{3})}n^3 \\log^3 n)$. This is the first fixed parameter tractable algorithm for Minimum Bisection. At the core of our algorithm lies a new decomposition theorem that states that every graph $G$ can be decomposed by small s","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T20:21:32Z","title":"Minimum Bisection is fixed parameter tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2563","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:9578c3d7eedf79ddfe1dda69ad77b8b5b9834af7582a956f12ca22db359e9e41","target":"record","created_at":"2026-05-18T02:56:11Z","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":"7e490849e1dacb2c9f54a799f565a0cdb08aa87bf8dcc4133840d0b528091e29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-11T20:21:32Z","title_canon_sha256":"f7835ffccbe3c23b6eb8ffb37737b42fab5fc1496814a8ed320eaa19d7d1cb01"},"schema_version":"1.0","source":{"id":"1311.2563","kind":"arxiv","version":2}},"canonical_sha256":"5f0b3bd1da5d4bfe903dad7f852c6dbb830987ab9b6427a26636301be91d860d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0b3bd1da5d4bfe903dad7f852c6dbb830987ab9b6427a26636301be91d860d","first_computed_at":"2026-05-18T02:56:11.305979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:11.305979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZwV5arrOIBqBoBcgU7a3YePblEvfbCbjMI0JqQbHsDIVW7y4aCmA6azRB2v5rsHi7ESGitrXzux/CMiSnaNAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:11.306376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2563","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9578c3d7eedf79ddfe1dda69ad77b8b5b9834af7582a956f12ca22db359e9e41","sha256:6e586e3b277cdd1879ad3d15455fc2ef845f7e42d8f7fe136bbeaded158087bf"],"state_sha256":"3322493698cf8f47ada1f16ff0b576d19149c9ca91e5406346e765b429924331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt3lNHezKTGuDHoq3I/wStEAB2otkg7dfKKjKWsElbirvkUBtP1jBORONnsj3Fiy3QJqEPzrhFvKi2gWUKnhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T16:47:54.255507Z","bundle_sha256":"8660104780a7c0f3c21d4e2e18525178506b1f091854851c7d2259c814f90116"}}