{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KXDEZ3QXPCW3PBCGAMQQICPODD","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":"b3bbe9201f169981947042aa8ace344986f679636b74ea11d48fb5db6f7b38f6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T18:43:35Z","title_canon_sha256":"26b2c0421d5b399235df5e8e7aae29f9a90a579a86dcc0f1c8f37c2ea5c1b6e9"},"schema_version":"1.0","source":{"id":"1810.10044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10044","created_at":"2026-07-05T00:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10044v2","created_at":"2026-07-05T00:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10044","created_at":"2026-07-05T00:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"KXDEZ3QXPCW3","created_at":"2026-07-05T00:58:01Z"},{"alias_kind":"pith_short_16","alias_value":"KXDEZ3QXPCW3PBCG","created_at":"2026-07-05T00:58:01Z"},{"alias_kind":"pith_short_8","alias_value":"KXDEZ3QX","created_at":"2026-07-05T00:58:01Z"}],"graph_snapshots":[{"event_id":"sha256:edc9074d9289dde524a02da457859e2e835d885b42ef8685b6229ce06c6c9246","target":"graph","created_at":"2026-07-05T00:58:01Z","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/1810.10044/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a graph $G$, let $f(G)$ denote the size of the maximum cut in $G$. The problem of estimating $f(G)$ as a function of the number of vertices and edges of $G$ has a long history and was extensively studied in the last fifty years. In this paper we propose an approach, based on semidefinite programming (SDP), to prove lower bounds on $f(G)$. We use this approach to find large cuts in graphs with few triangles and in $K_r$-free graphs.","authors_text":"Alexandra Kolla, Benny Sudakov, Charles Carlson, Luca Trevisan, Nitya Mani, Ray Li","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T18:43:35Z","title":"Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10044","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:86d28a8584934ca3bef46dc99d1be174cc2045183c134c4983b68b00df0b5303","target":"record","created_at":"2026-07-05T00:58:01Z","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":"b3bbe9201f169981947042aa8ace344986f679636b74ea11d48fb5db6f7b38f6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T18:43:35Z","title_canon_sha256":"26b2c0421d5b399235df5e8e7aae29f9a90a579a86dcc0f1c8f37c2ea5c1b6e9"},"schema_version":"1.0","source":{"id":"1810.10044","kind":"arxiv","version":2}},"canonical_sha256":"55c64cee1778adb7844603210409ee18c8a0d65a856b82ef9e90e2c23c5e0f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c64cee1778adb7844603210409ee18c8a0d65a856b82ef9e90e2c23c5e0f25","first_computed_at":"2026-07-05T00:58:01.411281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:01.411281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsR4GmcqV87oom/bbo4I+ZrNW+y1Ns/GCrpRr0vO9JjMe3wgo2aYN7xB/Y957dImvOf4bcQdmKx0cpWMw929Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:01.411740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86d28a8584934ca3bef46dc99d1be174cc2045183c134c4983b68b00df0b5303","sha256:edc9074d9289dde524a02da457859e2e835d885b42ef8685b6229ce06c6c9246"],"state_sha256":"957584f824720d1f2060fd8725596aa8204f05de26b112fe3a90e77943f0eaf9"}