{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CV7BSTUWKFUGPCM2N6Y7MVGMYW","short_pith_number":"pith:CV7BSTUW","canonical_record":{"source":{"id":"2507.13298","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"4851128744d535f2dd53b755b46eb90040f40661eb6ec116165cdb3ae5acf297","abstract_canon_sha256":"e8007358481bdc981d827de669f31d9aac0fcdbe91a21fa2cc7bb0b08136fa3a"},"schema_version":"1.0"},"canonical_sha256":"157e194e96516867899a6fb1f654ccc5aa28cbe762866d8b5778719b21359937","source":{"kind":"arxiv","id":"2507.13298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13298","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13298v1","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13298","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"CV7BSTUWKFUG","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"pith_short_16","alias_value":"CV7BSTUWKFUGPCM2","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"pith_short_8","alias_value":"CV7BSTUW","created_at":"2026-07-05T11:38:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CV7BSTUWKFUGPCM2N6Y7MVGMYW","target":"record","payload":{"canonical_record":{"source":{"id":"2507.13298","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:06:37Z","cross_cats_sorted":[],"title_canon_sha256":"4851128744d535f2dd53b755b46eb90040f40661eb6ec116165cdb3ae5acf297","abstract_canon_sha256":"e8007358481bdc981d827de669f31d9aac0fcdbe91a21fa2cc7bb0b08136fa3a"},"schema_version":"1.0"},"canonical_sha256":"157e194e96516867899a6fb1f654ccc5aa28cbe762866d8b5778719b21359937","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:58.674825Z","signature_b64":"WPbLXV9eGHfbHuVCnhNaw+upaMVpHbBwjyN5hZf3JVmWokNvM1lLQdxB09cYsPgdotStbxeoekX3ote9q5PUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"157e194e96516867899a6fb1f654ccc5aa28cbe762866d8b5778719b21359937","last_reissued_at":"2026-07-05T11:38:58.674399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:58.674399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.13298","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-05T11:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RhchO6tJCPNuo4prWZ2v8+Qfo7cJotHRFL8/f9FRbBOvjNQnw138syMDvqWHa8kO/ftB33e/6y0A3OVdnuyRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:49:03.277667Z"},"content_sha256":"181512dde4576f8b3901b99a86da1130c07eeddb86d1f84f6f9083479333ae6b","schema_version":"1.0","event_id":"sha256:181512dde4576f8b3901b99a86da1130c07eeddb86d1f84f6f9083479333ae6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CV7BSTUWKFUGPCM2N6Y7MVGMYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond the MaxCut problem in $H$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Istv\\'an Tomon, Zhihan Jin","submitted_at":"2025-07-17T17:06:37Z","abstract_excerpt":"In a recent breakthrough, Zhang proves that if $G$ is an $H$-free graph with $m$ edges, then $G$ has a cut of size at least $m/2+c_Hm^{0.5001}$, making a significant step towards a well known conjecture of Alon, Bollob\\'as, Krivelevich and Sudakov. We show that the methods of Zhang can be further boosted, and prove the following strengthening. If $G$ is a graph with $m$ edges and no clique of size $m^{1/2-\\delta}$, then $G$ has a cut of size at least $m/2+m^{1/2+\\varepsilon}$ for some $\\varepsilon=\\varepsilon(\\delta)>0$.\n  In addition, we sharpen another result of Zhang by proving that if $G$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13298","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/2507.13298/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-05T11:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5IrTmxJ3lzScD8DqSV+CSOhediHGXu3xUP/IX5D2zN9l0hbOC7FCssjBbg42LEB7/8MZhwuDZYtNjM+vavWJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:49:03.278198Z"},"content_sha256":"488332c6c7d02369fe7a4354d152584dcf8e9b507ccd59046413bc0467410f56","schema_version":"1.0","event_id":"sha256:488332c6c7d02369fe7a4354d152584dcf8e9b507ccd59046413bc0467410f56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW/bundle.json","state_url":"https://pith.science/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW/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-09T08:49:03Z","links":{"resolver":"https://pith.science/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW","bundle":"https://pith.science/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW/bundle.json","state":"https://pith.science/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CV7BSTUWKFUGPCM2N6Y7MVGMYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CV7BSTUWKFUGPCM2N6Y7MVGMYW","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":"e8007358481bdc981d827de669f31d9aac0fcdbe91a21fa2cc7bb0b08136fa3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:06:37Z","title_canon_sha256":"4851128744d535f2dd53b755b46eb90040f40661eb6ec116165cdb3ae5acf297"},"schema_version":"1.0","source":{"id":"2507.13298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13298","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13298v1","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13298","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"CV7BSTUWKFUG","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"pith_short_16","alias_value":"CV7BSTUWKFUGPCM2","created_at":"2026-07-05T11:38:58Z"},{"alias_kind":"pith_short_8","alias_value":"CV7BSTUW","created_at":"2026-07-05T11:38:58Z"}],"graph_snapshots":[{"event_id":"sha256:488332c6c7d02369fe7a4354d152584dcf8e9b507ccd59046413bc0467410f56","target":"graph","created_at":"2026-07-05T11:38:58Z","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/2507.13298/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In a recent breakthrough, Zhang proves that if $G$ is an $H$-free graph with $m$ edges, then $G$ has a cut of size at least $m/2+c_Hm^{0.5001}$, making a significant step towards a well known conjecture of Alon, Bollob\\'as, Krivelevich and Sudakov. We show that the methods of Zhang can be further boosted, and prove the following strengthening. If $G$ is a graph with $m$ edges and no clique of size $m^{1/2-\\delta}$, then $G$ has a cut of size at least $m/2+m^{1/2+\\varepsilon}$ for some $\\varepsilon=\\varepsilon(\\delta)>0$.\n  In addition, we sharpen another result of Zhang by proving that if $G$ ","authors_text":"Aleksa Milojevi\\'c, Istv\\'an Tomon, Zhihan Jin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:06:37Z","title":"Beyond the MaxCut problem in $H$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13298","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:181512dde4576f8b3901b99a86da1130c07eeddb86d1f84f6f9083479333ae6b","target":"record","created_at":"2026-07-05T11:38:58Z","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":"e8007358481bdc981d827de669f31d9aac0fcdbe91a21fa2cc7bb0b08136fa3a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-17T17:06:37Z","title_canon_sha256":"4851128744d535f2dd53b755b46eb90040f40661eb6ec116165cdb3ae5acf297"},"schema_version":"1.0","source":{"id":"2507.13298","kind":"arxiv","version":1}},"canonical_sha256":"157e194e96516867899a6fb1f654ccc5aa28cbe762866d8b5778719b21359937","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"157e194e96516867899a6fb1f654ccc5aa28cbe762866d8b5778719b21359937","first_computed_at":"2026-07-05T11:38:58.674399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:58.674399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WPbLXV9eGHfbHuVCnhNaw+upaMVpHbBwjyN5hZf3JVmWokNvM1lLQdxB09cYsPgdotStbxeoekX3ote9q5PUBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:58.674825Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.13298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:181512dde4576f8b3901b99a86da1130c07eeddb86d1f84f6f9083479333ae6b","sha256:488332c6c7d02369fe7a4354d152584dcf8e9b507ccd59046413bc0467410f56"],"state_sha256":"7f13cd8d99aae93598ae3169bd3c95edfc13482f541ddbda55ea1e41990e9adf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oY+cab5KgZuogpfdGDrfLrebYYJnZJBxz7wCkTDYxypkD4ha4RXZ/Atuy6pULNmwgECuMpDZGDk/t9nrL4ESDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:49:03.281730Z","bundle_sha256":"40d4df36e9b5640c25fd94fa2709320bbc1519a00503282d671eecfb1c5b871a"}}