{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5RMPGGJ6EGOBY5LFIRK45TJCDL","short_pith_number":"pith:5RMPGGJ6","schema_version":"1.0","canonical_sha256":"ec58f3193e219c1c75654455cecd221ae5f9ebfc94df7b6609541e95d0f5f1ff","source":{"kind":"arxiv","id":"2505.21694","version":2},"attestation_state":"computed","paper":{"title":"Max-Bisections of graphs without even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianfeng Hou, Qinghou Zeng, Siwei Lin","submitted_at":"2025-05-27T19:31:03Z","abstract_excerpt":"For an integer $k\\ge 2$, let $G$ be a graph with $m$ edges and without cycles of length $2k$. The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a bipartite subgraph with at least $m/2+\\Omega(m^{(2k+1)/(2k+2)})$ edges. In this paper, we present a bisection variant of it by showing that if $G$ has minimum degree at least $k$, then $G$ has a balanced bipartite subgraph with at least $m/2+\\Omega(m^{(2k+1)/(2k+2)})$ edges. It not only answers a problem of Fan, Hou and Yu in full generality but also enhances a recent result given by Hou, Wu and Zhong.\n  Our approach hinges"},"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":"2505.21694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T19:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"30bafaac80e49c0873ea7801dd0240fa38ac478167eda8e4cac9ab21588c1bfe","abstract_canon_sha256":"e88c2b0a9e9fc4f6c85caba6a15e8a83ba0c3a1ac98cf42537439a28aaefa11d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:54.441170Z","signature_b64":"yLAdDBAtkvrELEHgnlfqRZWTpsKofm+g6XUBM3nowiwwSkZmmRUPBSL9PD/jmjI46kkgnk4FW03+QQGbEnDcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec58f3193e219c1c75654455cecd221ae5f9ebfc94df7b6609541e95d0f5f1ff","last_reissued_at":"2026-07-05T11:39:54.440648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:54.440648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Bisections of graphs without even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianfeng Hou, Qinghou Zeng, Siwei Lin","submitted_at":"2025-05-27T19:31:03Z","abstract_excerpt":"For an integer $k\\ge 2$, let $G$ be a graph with $m$ edges and without cycles of length $2k$. The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a bipartite subgraph with at least $m/2+\\Omega(m^{(2k+1)/(2k+2)})$ edges. In this paper, we present a bisection variant of it by showing that if $G$ has minimum degree at least $k$, then $G$ has a balanced bipartite subgraph with at least $m/2+\\Omega(m^{(2k+1)/(2k+2)})$ edges. It not only answers a problem of Fan, Hou and Yu in full generality but also enhances a recent result given by Hou, Wu and Zhong.\n  Our approach hinges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21694","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.21694/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.21694","created_at":"2026-07-05T11:39:54.440706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21694v2","created_at":"2026-07-05T11:39:54.440706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21694","created_at":"2026-07-05T11:39:54.440706+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RMPGGJ6EGOB","created_at":"2026-07-05T11:39:54.440706+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RMPGGJ6EGOBY5LF","created_at":"2026-07-05T11:39:54.440706+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RMPGGJ6","created_at":"2026-07-05T11:39:54.440706+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/5RMPGGJ6EGOBY5LFIRK45TJCDL","json":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL.json","graph_json":"https://pith.science/api/pith-number/5RMPGGJ6EGOBY5LFIRK45TJCDL/graph.json","events_json":"https://pith.science/api/pith-number/5RMPGGJ6EGOBY5LFIRK45TJCDL/events.json","paper":"https://pith.science/paper/5RMPGGJ6"},"agent_actions":{"view_html":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL","download_json":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL.json","view_paper":"https://pith.science/paper/5RMPGGJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21694&json=true","fetch_graph":"https://pith.science/api/pith-number/5RMPGGJ6EGOBY5LFIRK45TJCDL/graph.json","fetch_events":"https://pith.science/api/pith-number/5RMPGGJ6EGOBY5LFIRK45TJCDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL/action/storage_attestation","attest_author":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL/action/author_attestation","sign_citation":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL/action/citation_signature","submit_replication":"https://pith.science/pith/5RMPGGJ6EGOBY5LFIRK45TJCDL/action/replication_record"}},"created_at":"2026-07-05T11:39:54.440706+00:00","updated_at":"2026-07-05T11:39:54.440706+00:00"}