{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7IZB4TPEQDDDUV7UHGDKBQ4RL5","short_pith_number":"pith:7IZB4TPE","schema_version":"1.0","canonical_sha256":"fa321e4de480c63a57f43986a0c3915f78a2f4716bc4407a1b21a3a135602309","source":{"kind":"arxiv","id":"1205.0458","version":2},"attestation_state":"computed","paper":{"title":"Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantinos Georgiou, Per Austrin, Siavosh Benabbas","submitted_at":"2012-05-02T15:19:29Z","abstract_excerpt":"Recently Raghavendra and Tan (SODA 2012) gave a 0.85-approximation algorithm for the Max Bisection problem. We improve their algorithm to a 0.8776-approximation. As Max Bisection is hard to approximate within $\\alpha_{GW} + \\epsilon \\approx 0.8786$ under the Unique Games Conjecture (UGC), our algorithm is nearly optimal. We conjecture that Max Bisection is approximable within $\\alpha_{GW}-\\epsilon$, i.e., the bisection constraint (essentially) does not make Max Cut harder.\n  We also obtain an optimal algorithm (assuming the UGC) for the analogous variant of Max 2-Sat. Our approximation ratio f"},"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":"1205.0458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-02T15:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"ba8295fcdfa7e8186f39a7f13dcefd9189535cba76125d2a82d657532ee40505","abstract_canon_sha256":"08b0279bec9a9203e752daffcb4096ea074864919505299409ea347a51f20446"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.915789Z","signature_b64":"wwRzZLd4UWlf2Apcc9golXVnK2QlouQEjmOndozlPNZB1Yr9dUZURm3m//wn6zfxPSpDkc3fDeiBEErVSm3GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa321e4de480c63a57f43986a0c3915f78a2f4716bc4407a1b21a3a135602309","last_reissued_at":"2026-05-18T03:51:37.914955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.914955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantinos Georgiou, Per Austrin, Siavosh Benabbas","submitted_at":"2012-05-02T15:19:29Z","abstract_excerpt":"Recently Raghavendra and Tan (SODA 2012) gave a 0.85-approximation algorithm for the Max Bisection problem. We improve their algorithm to a 0.8776-approximation. As Max Bisection is hard to approximate within $\\alpha_{GW} + \\epsilon \\approx 0.8786$ under the Unique Games Conjecture (UGC), our algorithm is nearly optimal. We conjecture that Max Bisection is approximable within $\\alpha_{GW}-\\epsilon$, i.e., the bisection constraint (essentially) does not make Max Cut harder.\n  We also obtain an optimal algorithm (assuming the UGC) for the analogous variant of Max 2-Sat. Our approximation ratio f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0458","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":"1205.0458","created_at":"2026-05-18T03:51:37.915083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0458v2","created_at":"2026-05-18T03:51:37.915083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0458","created_at":"2026-05-18T03:51:37.915083+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IZB4TPEQDDD","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IZB4TPEQDDDUV7U","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IZB4TPE","created_at":"2026-05-18T12:26:56.085431+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/7IZB4TPEQDDDUV7UHGDKBQ4RL5","json":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5.json","graph_json":"https://pith.science/api/pith-number/7IZB4TPEQDDDUV7UHGDKBQ4RL5/graph.json","events_json":"https://pith.science/api/pith-number/7IZB4TPEQDDDUV7UHGDKBQ4RL5/events.json","paper":"https://pith.science/paper/7IZB4TPE"},"agent_actions":{"view_html":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5","download_json":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5.json","view_paper":"https://pith.science/paper/7IZB4TPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0458&json=true","fetch_graph":"https://pith.science/api/pith-number/7IZB4TPEQDDDUV7UHGDKBQ4RL5/graph.json","fetch_events":"https://pith.science/api/pith-number/7IZB4TPEQDDDUV7UHGDKBQ4RL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5/action/storage_attestation","attest_author":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5/action/author_attestation","sign_citation":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5/action/citation_signature","submit_replication":"https://pith.science/pith/7IZB4TPEQDDDUV7UHGDKBQ4RL5/action/replication_record"}},"created_at":"2026-05-18T03:51:37.915083+00:00","updated_at":"2026-05-18T03:51:37.915083+00:00"}