{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CIWOX4JO4JE6J5QPRU5QI5X553","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":"8cd3ceeaf4121ebd43cef87ec09d79a65fdb10c0b4b77d041950090fc052b0fd","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T15:07:48Z","title_canon_sha256":"42a746c99de5422b1a3b6c9d4d0ef9aadff8ec176e0ef77bf5ad8964335315e9"},"schema_version":"1.0","source":{"id":"2402.14620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14620","created_at":"2026-07-05T07:48:12Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14620v1","created_at":"2026-07-05T07:48:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14620","created_at":"2026-07-05T07:48:12Z"},{"alias_kind":"pith_short_12","alias_value":"CIWOX4JO4JE6","created_at":"2026-07-05T07:48:12Z"},{"alias_kind":"pith_short_16","alias_value":"CIWOX4JO4JE6J5QP","created_at":"2026-07-05T07:48:12Z"},{"alias_kind":"pith_short_8","alias_value":"CIWOX4JO","created_at":"2026-07-05T07:48:12Z"}],"graph_snapshots":[{"event_id":"sha256:098a9fb01819501d4c5ea1d0d2530461d160f34067988f03c629ccfdec4660f1","target":"graph","created_at":"2026-07-05T07:48:12Z","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/2402.14620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \\ll p = 1-\\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the same manner by all maximum cuts of $G_{n,p}$. Moreover, the analogous statement remains true when one replaces maximum cuts with nearly-maximum cuts.\n  We then demonstrate how one can use this statement as a tool for showing that certain properties of $G_{n,p}$ that hold in a fixed balanced cut hold simultaneously in all maximum cuts. We provide two example app","authors_text":"Ilay Hoshen, Maksim Zhukovskii, Wojciech Samotij","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T15:07:48Z","title":"Stability of large cuts in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14620","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:ba4f19676bef83b977786092034b31202b3e7965d0264c892fc6d076038b1f9c","target":"record","created_at":"2026-07-05T07:48:12Z","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":"8cd3ceeaf4121ebd43cef87ec09d79a65fdb10c0b4b77d041950090fc052b0fd","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T15:07:48Z","title_canon_sha256":"42a746c99de5422b1a3b6c9d4d0ef9aadff8ec176e0ef77bf5ad8964335315e9"},"schema_version":"1.0","source":{"id":"2402.14620","kind":"arxiv","version":1}},"canonical_sha256":"122cebf12ee249e4f60f8d3b0476fdeef9e02a01cd4dad19dfd96c274b20bc65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"122cebf12ee249e4f60f8d3b0476fdeef9e02a01cd4dad19dfd96c274b20bc65","first_computed_at":"2026-07-05T07:48:12.933785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:48:12.933785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVpJO/5QSmGMxlF/vjL3S6/Z4XdyHdXYA/z1Kc43xMAeVGkrVkGb2khMcqMtIH/ZYOlr8OqIy+2QmCXDHtG/BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:48:12.934269Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.14620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba4f19676bef83b977786092034b31202b3e7965d0264c892fc6d076038b1f9c","sha256:098a9fb01819501d4c5ea1d0d2530461d160f34067988f03c629ccfdec4660f1"],"state_sha256":"fc26190658af4ae598aebd43a4b018a5a0c593ca03349a50c79d7806c9102104"}