{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EI477JOOTZGFJIOTYMBR33HDL6","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":"bd7449223549a08491bd25f4283496f5260dd05b5d549dcde98c91fa18ac7bc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-06T18:42:41Z","title_canon_sha256":"812799748fd77989954baa5ae23561290e69ddf291777fd23226011a67fd290a"},"schema_version":"1.0","source":{"id":"1411.1698","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1698","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1698v2","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1698","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"EI477JOOTZGF","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EI477JOOTZGFJIOT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EI477JOO","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:45909695829c9c4b87d6e379b1439a8a150042bb7dcc38ab31cb4674b93ec552","target":"graph","created_at":"2026-05-18T00:50:57Z","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"},"paper":{"abstract_excerpt":"We consider the problem of estimating the size of a maximum cut (Max-Cut problem) in a random Erd\\H{o}s-R\\'{e}nyi graph on $n$ nodes and $\\lfloor cn \\rfloor$ edges. It is shown in Coppersmith et al. ~\\cite{Coppersmith2004} that the size of the maximum cut in this graph normalized by the number of nodes belongs to the asymptotic region $[c/2+0.37613\\sqrt{c},c/2+0.58870\\sqrt{c}]$ with high probability (w.h.p.) as $n$ increases, for all sufficiently large $c$.\n  In this paper we improve both upper and lower bounds by introducing a novel bounding technique. Specifically, we establish that the size","authors_text":"David Gamarnik, Quan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-06T18:42:41Z","title":"On the Max-Cut of Sparse Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1698","kind":"arxiv","version":2},"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:7b23c27c78bd5c076125f7cc96d85eb2c61530ade28d0460e8c12a3290d39154","target":"record","created_at":"2026-05-18T00:50:57Z","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":"bd7449223549a08491bd25f4283496f5260dd05b5d549dcde98c91fa18ac7bc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-06T18:42:41Z","title_canon_sha256":"812799748fd77989954baa5ae23561290e69ddf291777fd23226011a67fd290a"},"schema_version":"1.0","source":{"id":"1411.1698","kind":"arxiv","version":2}},"canonical_sha256":"2239ffa5ce9e4c54a1d3c3031dece35f94bb8c533bbacc9b963e1fcd021458fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2239ffa5ce9e4c54a1d3c3031dece35f94bb8c533bbacc9b963e1fcd021458fc","first_computed_at":"2026-05-18T00:50:57.959856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:57.959856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+zXkSF/P8/l7hwPZ6X7liAZzgYIgZ7DQQcNX5DjfmS677CIOSRJDjGDuyWCxePXR1oxeMrri8hyvZnl9cxiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:57.960240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1698","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b23c27c78bd5c076125f7cc96d85eb2c61530ade28d0460e8c12a3290d39154","sha256:45909695829c9c4b87d6e379b1439a8a150042bb7dcc38ab31cb4674b93ec552"],"state_sha256":"70e7c91ed2f0b6b479c1ea625bd0278e9f7938a08c9eea97d4c760bbe4885fdc"}