{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CIWOX4JO4JE6J5QPRU5QI5X553","short_pith_number":"pith:CIWOX4JO","schema_version":"1.0","canonical_sha256":"122cebf12ee249e4f60f8d3b0476fdeef9e02a01cd4dad19dfd96c274b20bc65","source":{"kind":"arxiv","id":"2402.14620","version":1},"attestation_state":"computed","paper":{"title":"Stability of large cuts in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen, Maksim Zhukovskii, Wojciech Samotij","submitted_at":"2024-02-22T15:07:48Z","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"},"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":"2402.14620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T15:07:48Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"42a746c99de5422b1a3b6c9d4d0ef9aadff8ec176e0ef77bf5ad8964335315e9","abstract_canon_sha256":"8cd3ceeaf4121ebd43cef87ec09d79a65fdb10c0b4b77d041950090fc052b0fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:12.934269Z","signature_b64":"RVpJO/5QSmGMxlF/vjL3S6/Z4XdyHdXYA/z1Kc43xMAeVGkrVkGb2khMcqMtIH/ZYOlr8OqIy+2QmCXDHtG/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122cebf12ee249e4f60f8d3b0476fdeef9e02a01cd4dad19dfd96c274b20bc65","last_reissued_at":"2026-07-05T07:48:12.933785Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:12.933785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability of large cuts in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ilay Hoshen, Maksim Zhukovskii, Wojciech Samotij","submitted_at":"2024-02-22T15:07:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14620","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/2402.14620/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":"2402.14620","created_at":"2026-07-05T07:48:12.933843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.14620v1","created_at":"2026-07-05T07:48:12.933843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14620","created_at":"2026-07-05T07:48:12.933843+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIWOX4JO4JE6","created_at":"2026-07-05T07:48:12.933843+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIWOX4JO4JE6J5QP","created_at":"2026-07-05T07:48:12.933843+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIWOX4JO","created_at":"2026-07-05T07:48:12.933843+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/CIWOX4JO4JE6J5QPRU5QI5X553","json":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553.json","graph_json":"https://pith.science/api/pith-number/CIWOX4JO4JE6J5QPRU5QI5X553/graph.json","events_json":"https://pith.science/api/pith-number/CIWOX4JO4JE6J5QPRU5QI5X553/events.json","paper":"https://pith.science/paper/CIWOX4JO"},"agent_actions":{"view_html":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553","download_json":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553.json","view_paper":"https://pith.science/paper/CIWOX4JO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.14620&json=true","fetch_graph":"https://pith.science/api/pith-number/CIWOX4JO4JE6J5QPRU5QI5X553/graph.json","fetch_events":"https://pith.science/api/pith-number/CIWOX4JO4JE6J5QPRU5QI5X553/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553/action/storage_attestation","attest_author":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553/action/author_attestation","sign_citation":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553/action/citation_signature","submit_replication":"https://pith.science/pith/CIWOX4JO4JE6J5QPRU5QI5X553/action/replication_record"}},"created_at":"2026-07-05T07:48:12.933843+00:00","updated_at":"2026-07-05T07:48:12.933843+00:00"}