{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YJTJ5ZFSARFF7FM64J2A7NDKHX","short_pith_number":"pith:YJTJ5ZFS","canonical_record":{"source":{"id":"1603.04044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-13T16:20:35Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"089decdddc553b2ea88540dd412cd8d736b030dd8a19c7f82dee54808e54db73","abstract_canon_sha256":"797882b8ccda1214c42e80e89ac55bf8517ac7ed3264d0ed9d8b46043480a603"},"schema_version":"1.0"},"canonical_sha256":"c2669ee4b2044a5f959ee2740fb46a3dd67e914af7b6166fc176420a739e672e","source":{"kind":"arxiv","id":"1603.04044","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04044","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04044v2","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04044","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"pith_short_12","alias_value":"YJTJ5ZFSARFF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YJTJ5ZFSARFF7FM6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YJTJ5ZFS","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YJTJ5ZFSARFF7FM64J2A7NDKHX","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-13T16:20:35Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"089decdddc553b2ea88540dd412cd8d736b030dd8a19c7f82dee54808e54db73","abstract_canon_sha256":"797882b8ccda1214c42e80e89ac55bf8517ac7ed3264d0ed9d8b46043480a603"},"schema_version":"1.0"},"canonical_sha256":"c2669ee4b2044a5f959ee2740fb46a3dd67e914af7b6166fc176420a739e672e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:37.432761Z","signature_b64":"Nf589iTfCgBVlV4rBOX6olj0yGimRAzPKGnAYQ/4t85D7F3kOzYpYNvMVnmQSFE2kYxoDwW0NZuIkWFagl++Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2669ee4b2044a5f959ee2740fb46a3dd67e914af7b6166fc176420a739e672e","last_reissued_at":"2026-05-18T00:48:37.432107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:37.432107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04044","source_version":2,"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-05-18T00:48:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLi5xM1791+Vqbfwj0oT3dJbw2dvJe8bNFPj0S/iU+AckylTp4g5lq4bvzsDXtnb2rRiYToS+82qHcst1kq5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:37:13.784510Z"},"content_sha256":"661cb9d1769bd9593f695b9e918ca24dc533477595206c5ec70b615c975543f6","schema_version":"1.0","event_id":"sha256:661cb9d1769bd9593f695b9e918ca24dc533477595206c5ec70b615c975543f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YJTJ5ZFSARFF7FM64J2A7NDKHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Gal Kronenberg, Lior Gishboliner, Michael Krivelevich","submitted_at":"2016-03-13T16:20:35Z","abstract_excerpt":"We use a theorem by Ding, Lubetzky and Peres describing the structure of the giant component of random graphs in the strictly supercritical regime, in order to determine the typical size of MAXCUT of $G\\sim G\\left(n,\\frac {1+\\varepsilon}n\\right)$ in terms of $\\varepsilon$. We then apply this result to prove the following conjecture by Frieze and Pegden. For every $\\varepsilon>0$ there exists $\\ell_\\varepsilon$ such that \\whp $G\\sim G(n,\\frac {1+\\varepsilon}n)$ is not homomorphic to the cycle on $2\\ell_\\varepsilon+1$ vertices. We also consider the coloring properties of biased random tournament"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04044","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:48:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdo7b6bUF4ylRGDnoL/P6xwRY7xUOhZ169TL8zYpEwbk4nQ/AM2CqXBfraR8DLrMAHIpZHMmFIfed3c8g2I4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:37:13.785047Z"},"content_sha256":"6026161820eb1629fdc1b08020b667537da3b18bcfb1911894ad48bd5ee2611e","schema_version":"1.0","event_id":"sha256:6026161820eb1629fdc1b08020b667537da3b18bcfb1911894ad48bd5ee2611e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX/bundle.json","state_url":"https://pith.science/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX/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-05-25T19:37:13Z","links":{"resolver":"https://pith.science/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX","bundle":"https://pith.science/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX/bundle.json","state":"https://pith.science/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJTJ5ZFSARFF7FM64J2A7NDKHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YJTJ5ZFSARFF7FM64J2A7NDKHX","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":"797882b8ccda1214c42e80e89ac55bf8517ac7ed3264d0ed9d8b46043480a603","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-13T16:20:35Z","title_canon_sha256":"089decdddc553b2ea88540dd412cd8d736b030dd8a19c7f82dee54808e54db73"},"schema_version":"1.0","source":{"id":"1603.04044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04044","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04044v2","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04044","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"pith_short_12","alias_value":"YJTJ5ZFSARFF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YJTJ5ZFSARFF7FM6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YJTJ5ZFS","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:6026161820eb1629fdc1b08020b667537da3b18bcfb1911894ad48bd5ee2611e","target":"graph","created_at":"2026-05-18T00:48:37Z","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 use a theorem by Ding, Lubetzky and Peres describing the structure of the giant component of random graphs in the strictly supercritical regime, in order to determine the typical size of MAXCUT of $G\\sim G\\left(n,\\frac {1+\\varepsilon}n\\right)$ in terms of $\\varepsilon$. We then apply this result to prove the following conjecture by Frieze and Pegden. For every $\\varepsilon>0$ there exists $\\ell_\\varepsilon$ such that \\whp $G\\sim G(n,\\frac {1+\\varepsilon}n)$ is not homomorphic to the cycle on $2\\ell_\\varepsilon+1$ vertices. We also consider the coloring properties of biased random tournament","authors_text":"Gal Kronenberg, Lior Gishboliner, Michael Krivelevich","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-13T16:20:35Z","title":"On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04044","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:661cb9d1769bd9593f695b9e918ca24dc533477595206c5ec70b615c975543f6","target":"record","created_at":"2026-05-18T00:48:37Z","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":"797882b8ccda1214c42e80e89ac55bf8517ac7ed3264d0ed9d8b46043480a603","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-13T16:20:35Z","title_canon_sha256":"089decdddc553b2ea88540dd412cd8d736b030dd8a19c7f82dee54808e54db73"},"schema_version":"1.0","source":{"id":"1603.04044","kind":"arxiv","version":2}},"canonical_sha256":"c2669ee4b2044a5f959ee2740fb46a3dd67e914af7b6166fc176420a739e672e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2669ee4b2044a5f959ee2740fb46a3dd67e914af7b6166fc176420a739e672e","first_computed_at":"2026-05-18T00:48:37.432107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:37.432107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nf589iTfCgBVlV4rBOX6olj0yGimRAzPKGnAYQ/4t85D7F3kOzYpYNvMVnmQSFE2kYxoDwW0NZuIkWFagl++Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:37.432761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:661cb9d1769bd9593f695b9e918ca24dc533477595206c5ec70b615c975543f6","sha256:6026161820eb1629fdc1b08020b667537da3b18bcfb1911894ad48bd5ee2611e"],"state_sha256":"0ffe99656cf57bf827978da997b62f549590a09c7b7cea64ee2e99cb238bd585"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFnCwFeU+oa6gFdLi2zz1Hgj4NYOFyUMzMBvBBbhf/2rzgTl7nuYz7ee72wEWU7EiscIDe+A6KnFKl/fzmm7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:37:13.788203Z","bundle_sha256":"b6b6f58f10160422c0339dffc6f7e8cdbb5f44e418768c33a53e825076ddcff4"}}