{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XZPRIODOIOX5FTCIPX5OVRG2FW","short_pith_number":"pith:XZPRIODO","canonical_record":{"source":{"id":"2411.11013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T09:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"e94e8d468316b6066bb95da0c4ea1b2264ff4eceead0c7f8d54d5290002dc66d","abstract_canon_sha256":"f513c19adf1c927828d831384d1e52a0a082fcab08384f4c567046ed77ab4769"},"schema_version":"1.0"},"canonical_sha256":"be5f14386e43afd2cc487dfaeac4da2dad988196a8c580518d96ea4ba5a6e27f","source":{"kind":"arxiv","id":"2411.11013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11013","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11013v1","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11013","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"XZPRIODOIOX5","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"pith_short_16","alias_value":"XZPRIODOIOX5FTCI","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"pith_short_8","alias_value":"XZPRIODO","created_at":"2026-07-05T09:36:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XZPRIODOIOX5FTCIPX5OVRG2FW","target":"record","payload":{"canonical_record":{"source":{"id":"2411.11013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T09:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"e94e8d468316b6066bb95da0c4ea1b2264ff4eceead0c7f8d54d5290002dc66d","abstract_canon_sha256":"f513c19adf1c927828d831384d1e52a0a082fcab08384f4c567046ed77ab4769"},"schema_version":"1.0"},"canonical_sha256":"be5f14386e43afd2cc487dfaeac4da2dad988196a8c580518d96ea4ba5a6e27f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:27.383548Z","signature_b64":"rU4LoBKB1dL1Vf1WgyxmB1YbhQ6nCtJRxPNfugsDwXj72zhOUBdU8ZcncodZhE9xtxOlmvY57suk3YrxMF01DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be5f14386e43afd2cc487dfaeac4da2dad988196a8c580518d96ea4ba5a6e27f","last_reissued_at":"2026-07-05T09:36:27.382932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:27.382932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.11013","source_version":1,"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-07-05T09:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vRc7xRWfqXtcTHPgNxRycVR4LY93ynV+K9AcFHSIMoK2W0kXmNwNqKIGvu9zYTqgdFP3iesh9ZRA7P+pxMLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:43:22.354649Z"},"content_sha256":"35c979752e19ff182ad6dea49238629bf1d8d5d810045b04b0ce6cb3cbe0dc1a","schema_version":"1.0","event_id":"sha256:35c979752e19ff182ad6dea49238629bf1d8d5d810045b04b0ce6cb3cbe0dc1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XZPRIODOIOX5FTCIPX5OVRG2FW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Bisections of graphs without perfect matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianfeng Hou, Shufei Wu, Yuanyuan Zhong","submitted_at":"2024-11-17T09:33:10Z","abstract_excerpt":"A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and forbidden even cycles subgraphs are essential in finding large bisections of graphs. In this paper, we show that the perfect matching condition can be replaced by the minimum degree condition. Let $C_{\\ell}$ be a cycle of length $\\ell$ for $\\ell\\ge 3$, and let $G$ be a $\\{C_4, C_6\\}$-free graph with $m$ edges and minimum degree at least 2. We prove that $G$ has a bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11013","kind":"arxiv","version":1},"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/2411.11013/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"},"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-07-05T09:36:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lu3t5RRQrdfXm7ze0HBLSlE1wLh5bMgTiTBa4aL9Q5yPWNiTGDuW4QyCtYS3lSkAIa9Ud7OsXeQCpRc4J/36Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:43:22.355173Z"},"content_sha256":"d500e10a3d31fce240a2af725ebe846a399e83124a0f876ac865c1cdd200168e","schema_version":"1.0","event_id":"sha256:d500e10a3d31fce240a2af725ebe846a399e83124a0f876ac865c1cdd200168e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZPRIODOIOX5FTCIPX5OVRG2FW/bundle.json","state_url":"https://pith.science/pith/XZPRIODOIOX5FTCIPX5OVRG2FW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZPRIODOIOX5FTCIPX5OVRG2FW/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-08-08T15:43:22Z","links":{"resolver":"https://pith.science/pith/XZPRIODOIOX5FTCIPX5OVRG2FW","bundle":"https://pith.science/pith/XZPRIODOIOX5FTCIPX5OVRG2FW/bundle.json","state":"https://pith.science/pith/XZPRIODOIOX5FTCIPX5OVRG2FW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZPRIODOIOX5FTCIPX5OVRG2FW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XZPRIODOIOX5FTCIPX5OVRG2FW","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":"f513c19adf1c927828d831384d1e52a0a082fcab08384f4c567046ed77ab4769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T09:33:10Z","title_canon_sha256":"e94e8d468316b6066bb95da0c4ea1b2264ff4eceead0c7f8d54d5290002dc66d"},"schema_version":"1.0","source":{"id":"2411.11013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11013","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11013v1","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11013","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"pith_short_12","alias_value":"XZPRIODOIOX5","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"pith_short_16","alias_value":"XZPRIODOIOX5FTCI","created_at":"2026-07-05T09:36:27Z"},{"alias_kind":"pith_short_8","alias_value":"XZPRIODO","created_at":"2026-07-05T09:36:27Z"}],"graph_snapshots":[{"event_id":"sha256:d500e10a3d31fce240a2af725ebe846a399e83124a0f876ac865c1cdd200168e","target":"graph","created_at":"2026-07-05T09:36:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.11013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and forbidden even cycles subgraphs are essential in finding large bisections of graphs. In this paper, we show that the perfect matching condition can be replaced by the minimum degree condition. Let $C_{\\ell}$ be a cycle of length $\\ell$ for $\\ell\\ge 3$, and let $G$ be a $\\{C_4, C_6\\}$-free graph with $m$ edges and minimum degree at least 2. We prove that $G$ has a bi","authors_text":"Jianfeng Hou, Shufei Wu, Yuanyuan Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11013","kind":"arxiv","version":1},"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:35c979752e19ff182ad6dea49238629bf1d8d5d810045b04b0ce6cb3cbe0dc1a","target":"record","created_at":"2026-07-05T09:36:27Z","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":"f513c19adf1c927828d831384d1e52a0a082fcab08384f4c567046ed77ab4769","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-17T09:33:10Z","title_canon_sha256":"e94e8d468316b6066bb95da0c4ea1b2264ff4eceead0c7f8d54d5290002dc66d"},"schema_version":"1.0","source":{"id":"2411.11013","kind":"arxiv","version":1}},"canonical_sha256":"be5f14386e43afd2cc487dfaeac4da2dad988196a8c580518d96ea4ba5a6e27f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be5f14386e43afd2cc487dfaeac4da2dad988196a8c580518d96ea4ba5a6e27f","first_computed_at":"2026-07-05T09:36:27.382932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:27.382932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rU4LoBKB1dL1Vf1WgyxmB1YbhQ6nCtJRxPNfugsDwXj72zhOUBdU8ZcncodZhE9xtxOlmvY57suk3YrxMF01DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:27.383548Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35c979752e19ff182ad6dea49238629bf1d8d5d810045b04b0ce6cb3cbe0dc1a","sha256:d500e10a3d31fce240a2af725ebe846a399e83124a0f876ac865c1cdd200168e"],"state_sha256":"0d30dcd8f1d6035465b14b466ff5675be12abc7a070c1694a6cb3e7f0a9fac7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hoz8Lu376CbaTxNc3y4hUje0L4N+2QXyNFnwYbubpbM805UDHEueETxSCYsHKLDDhY3OHUE9Es2/Ioi/O7hPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:43:22.359350Z","bundle_sha256":"0ff9795d507429189a57079d0ebb8422d7d1e5233342ab355ac2fba449f125b9"}}