{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FEKNWIHGQG5BBKRGEQVMFXK2FL","short_pith_number":"pith:FEKNWIHG","canonical_record":{"source":{"id":"2509.08531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T12:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"f4969326e364d851fd5985c780e856f11680009bf79a05fec80eef89f1cdada3","abstract_canon_sha256":"fad67015aabc9307fdf0971023aaebd2c1807d7cf9ed74778196c1e1d3673e60"},"schema_version":"1.0"},"canonical_sha256":"2914db20e681ba10aa26242ac2dd5a2ad2d589dc4c26cfe9afb452cec5cb9442","source":{"kind":"arxiv","id":"2509.08531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08531","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08531v1","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08531","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"FEKNWIHGQG5B","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_16","alias_value":"FEKNWIHGQG5BBKRG","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_8","alias_value":"FEKNWIHG","created_at":"2026-07-05T12:08:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FEKNWIHGQG5BBKRGEQVMFXK2FL","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T12:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"f4969326e364d851fd5985c780e856f11680009bf79a05fec80eef89f1cdada3","abstract_canon_sha256":"fad67015aabc9307fdf0971023aaebd2c1807d7cf9ed74778196c1e1d3673e60"},"schema_version":"1.0"},"canonical_sha256":"2914db20e681ba10aa26242ac2dd5a2ad2d589dc4c26cfe9afb452cec5cb9442","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:31.912488Z","signature_b64":"qxfD9s81zfm65PzYQl7uc0aPfUps+F94LDmNcBnvhTldogNDCvgufp5iFMVCs6cO6ox1hfHjv7y5cuL5pFFUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2914db20e681ba10aa26242ac2dd5a2ad2d589dc4c26cfe9afb452cec5cb9442","last_reissued_at":"2026-07-05T12:08:31.912103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:31.912103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08531","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-05T12:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvaUpwB8TxYyUwMft93ve9ySoRRJN7ponQt0L4Qozwjox8Jzw+xqKLDB0vjlcuoU8e/cQoxzYepBQqQ49HzYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T14:33:32.444841Z"},"content_sha256":"84f3b6baf72561bf7485b61e9306af06116cc0465f6b56d052353bc7d3a25a67","schema_version":"1.0","event_id":"sha256:84f3b6baf72561bf7485b61e9306af06116cc0465f6b56d052353bc7d3a25a67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FEKNWIHGQG5BBKRGEQVMFXK2FL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bisection width, max-cut and internal partitions of 5-regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Cs\\'oka, Levente Szemer\\'edi, Panna T\\'imea Fekete, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2025-09-10T12:19:32Z","abstract_excerpt":"In this paper, we present a new factor of IID process based on the local algorithm introduced by D\\'iaz, Serna, and Wormald (2007). This new approach allows us to improve the previously known upper bounds on the minimum and maximum bisection width and the maximum cut of random d-regular graphs for d > 4 by introducing a new recoloring phase after the termination of the original algorithm. As an application, we show that random 5-regular graphs asymptotically almost surely admit an internal partition, i.e., a partition of the vertex set into two nonempty classes so that every vertex has at leas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08531","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/2509.08531/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-05T12:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75bnckhr6Ss1DETPziy+v/R/vYB5GrKpvquOGr1xVXTmAme0idGV3NJMLd/IzeaIPddLxwt8TzjdA5RNHf8BBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T14:33:32.445356Z"},"content_sha256":"4b4f3e69c595e63516b596794e52d3bfa2f265d742d48c61d3e3213c67bd1d93","schema_version":"1.0","event_id":"sha256:4b4f3e69c595e63516b596794e52d3bfa2f265d742d48c61d3e3213c67bd1d93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL/bundle.json","state_url":"https://pith.science/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL/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-19T14:33:32Z","links":{"resolver":"https://pith.science/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL","bundle":"https://pith.science/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL/bundle.json","state":"https://pith.science/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEKNWIHGQG5BBKRGEQVMFXK2FL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FEKNWIHGQG5BBKRGEQVMFXK2FL","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":"fad67015aabc9307fdf0971023aaebd2c1807d7cf9ed74778196c1e1d3673e60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T12:19:32Z","title_canon_sha256":"f4969326e364d851fd5985c780e856f11680009bf79a05fec80eef89f1cdada3"},"schema_version":"1.0","source":{"id":"2509.08531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08531","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08531v1","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08531","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"FEKNWIHGQG5B","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_16","alias_value":"FEKNWIHGQG5BBKRG","created_at":"2026-07-05T12:08:31Z"},{"alias_kind":"pith_short_8","alias_value":"FEKNWIHG","created_at":"2026-07-05T12:08:31Z"}],"graph_snapshots":[{"event_id":"sha256:4b4f3e69c595e63516b596794e52d3bfa2f265d742d48c61d3e3213c67bd1d93","target":"graph","created_at":"2026-07-05T12:08:31Z","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/2509.08531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present a new factor of IID process based on the local algorithm introduced by D\\'iaz, Serna, and Wormald (2007). This new approach allows us to improve the previously known upper bounds on the minimum and maximum bisection width and the maximum cut of random d-regular graphs for d > 4 by introducing a new recoloring phase after the termination of the original algorithm. As an application, we show that random 5-regular graphs asymptotically almost surely admit an internal partition, i.e., a partition of the vertex set into two nonempty classes so that every vertex has at leas","authors_text":"Endre Cs\\'oka, Levente Szemer\\'edi, Panna T\\'imea Fekete, Zolt\\'an L\\'or\\'ant Nagy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T12:19:32Z","title":"Bisection width, max-cut and internal partitions of 5-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08531","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:84f3b6baf72561bf7485b61e9306af06116cc0465f6b56d052353bc7d3a25a67","target":"record","created_at":"2026-07-05T12:08:31Z","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":"fad67015aabc9307fdf0971023aaebd2c1807d7cf9ed74778196c1e1d3673e60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-10T12:19:32Z","title_canon_sha256":"f4969326e364d851fd5985c780e856f11680009bf79a05fec80eef89f1cdada3"},"schema_version":"1.0","source":{"id":"2509.08531","kind":"arxiv","version":1}},"canonical_sha256":"2914db20e681ba10aa26242ac2dd5a2ad2d589dc4c26cfe9afb452cec5cb9442","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2914db20e681ba10aa26242ac2dd5a2ad2d589dc4c26cfe9afb452cec5cb9442","first_computed_at":"2026-07-05T12:08:31.912103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:08:31.912103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qxfD9s81zfm65PzYQl7uc0aPfUps+F94LDmNcBnvhTldogNDCvgufp5iFMVCs6cO6ox1hfHjv7y5cuL5pFFUDw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:08:31.912488Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84f3b6baf72561bf7485b61e9306af06116cc0465f6b56d052353bc7d3a25a67","sha256:4b4f3e69c595e63516b596794e52d3bfa2f265d742d48c61d3e3213c67bd1d93"],"state_sha256":"a1b611173dc65ad6078237cdd2baec45102cb2ded6dae6a8bd011524db7abe96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFTUAl+Rz9kxsVhbedflHVyEht5Z/OAaysPyvqH1L/ou2gSdwajRakH+AX1FD/ZrvnJY127YYO7GZoNBrAuMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T14:33:32.452528Z","bundle_sha256":"4d79a6d37463bfcc00a75c8fd065674e3dfe3ec3b71160458efb73d97b1a31b5"}}