{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L4FTXUO2LVF75EB5VV7YKLDNXO","short_pith_number":"pith:L4FTXUO2","schema_version":"1.0","canonical_sha256":"5f0b3bd1da5d4bfe903dad7f852c6dbb830987ab9b6427a26636301be91d860d","source":{"kind":"arxiv","id":"1311.2563","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.2563","created_at":"2026-05-18T02:56:11.306043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2563v2","created_at":"2026-05-18T02:56:11.306043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2563","created_at":"2026-05-18T02:56:11.306043+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4FTXUO2LVF7","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4FTXUO2LVF75EB5","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4FTXUO2","created_at":"2026-05-18T12:27:51.066281+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/L4FTXUO2LVF75EB5VV7YKLDNXO","json":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO.json","graph_json":"https://pith.science/api/pith-number/L4FTXUO2LVF75EB5VV7YKLDNXO/graph.json","events_json":"https://pith.science/api/pith-number/L4FTXUO2LVF75EB5VV7YKLDNXO/events.json","paper":"https://pith.science/paper/L4FTXUO2"},"agent_actions":{"view_html":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO","download_json":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO.json","view_paper":"https://pith.science/paper/L4FTXUO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2563&json=true","fetch_graph":"https://pith.science/api/pith-number/L4FTXUO2LVF75EB5VV7YKLDNXO/graph.json","fetch_events":"https://pith.science/api/pith-number/L4FTXUO2LVF75EB5VV7YKLDNXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/action/storage_attestation","attest_author":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/action/author_attestation","sign_citation":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/action/citation_signature","submit_replication":"https://pith.science/pith/L4FTXUO2LVF75EB5VV7YKLDNXO/action/replication_record"}},"created_at":"2026-05-18T02:56:11.306043+00:00","updated_at":"2026-05-18T02:56:11.306043+00:00"}