{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FR6KGQIFYQI3EQ6CQY4KP7J2BI","short_pith_number":"pith:FR6KGQIF","schema_version":"1.0","canonical_sha256":"2c7ca34105c411b243c28638a7fd3a0a361a4beb88092a5d34ad6be229dfa57f","source":{"kind":"arxiv","id":"2504.15096","version":2},"attestation_state":"computed","paper":{"title":"Bisections of graphs under degree constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jie Ma","submitted_at":"2025-04-21T13:31:27Z","abstract_excerpt":"In this paper, we investigate the problem of finding {\\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 - o(1))d_G(v)$ neighbors in its own part; (2). $G$ also has a bisection where each vertex $v$ has at least $(1/4 - o(1))d_G(v)$ neighbors in the opposite part. These results are asymptotically optimal up to a factor of $1/2$, aligning with what is expected from random constructions, and provide the first systematic understanding of bisections in general graphs"},"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":"2504.15096","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T13:31:27Z","cross_cats_sorted":[],"title_canon_sha256":"bb619d93af1b8a94bba53cd252b877a4015101986e730a840bdc4e88dcda884f","abstract_canon_sha256":"aa073bc6ef257f7af5ecaa05f24295b58ab219b5baf8ddadba3477c6563cc173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:10.649663Z","signature_b64":"YrSuV0Z/czwsPU4vMz5WHghbKEfbFzHQjjkZHsWRYyI6wVINOJWkdMgzfSuObKkvjg923TGIedSWxYi7rV+jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c7ca34105c411b243c28638a7fd3a0a361a4beb88092a5d34ad6be229dfa57f","last_reissued_at":"2026-06-19T16:11:10.649263Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:10.649263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bisections of graphs under degree constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jie Ma","submitted_at":"2025-04-21T13:31:27Z","abstract_excerpt":"In this paper, we investigate the problem of finding {\\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 - o(1))d_G(v)$ neighbors in its own part; (2). $G$ also has a bisection where each vertex $v$ has at least $(1/4 - o(1))d_G(v)$ neighbors in the opposite part. These results are asymptotically optimal up to a factor of $1/2$, aligning with what is expected from random constructions, and provide the first systematic understanding of bisections in general graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15096","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/2504.15096/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":"2504.15096","created_at":"2026-06-19T16:11:10.649326+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15096v2","created_at":"2026-06-19T16:11:10.649326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15096","created_at":"2026-06-19T16:11:10.649326+00:00"},{"alias_kind":"pith_short_12","alias_value":"FR6KGQIFYQI3","created_at":"2026-06-19T16:11:10.649326+00:00"},{"alias_kind":"pith_short_16","alias_value":"FR6KGQIFYQI3EQ6C","created_at":"2026-06-19T16:11:10.649326+00:00"},{"alias_kind":"pith_short_8","alias_value":"FR6KGQIF","created_at":"2026-06-19T16:11:10.649326+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/FR6KGQIFYQI3EQ6CQY4KP7J2BI","json":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI.json","graph_json":"https://pith.science/api/pith-number/FR6KGQIFYQI3EQ6CQY4KP7J2BI/graph.json","events_json":"https://pith.science/api/pith-number/FR6KGQIFYQI3EQ6CQY4KP7J2BI/events.json","paper":"https://pith.science/paper/FR6KGQIF"},"agent_actions":{"view_html":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI","download_json":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI.json","view_paper":"https://pith.science/paper/FR6KGQIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15096&json=true","fetch_graph":"https://pith.science/api/pith-number/FR6KGQIFYQI3EQ6CQY4KP7J2BI/graph.json","fetch_events":"https://pith.science/api/pith-number/FR6KGQIFYQI3EQ6CQY4KP7J2BI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI/action/storage_attestation","attest_author":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI/action/author_attestation","sign_citation":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI/action/citation_signature","submit_replication":"https://pith.science/pith/FR6KGQIFYQI3EQ6CQY4KP7J2BI/action/replication_record"}},"created_at":"2026-06-19T16:11:10.649326+00:00","updated_at":"2026-06-19T16:11:10.649326+00:00"}