{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KXDEZ3QXPCW3PBCGAMQQICPODD","short_pith_number":"pith:KXDEZ3QX","schema_version":"1.0","canonical_sha256":"55c64cee1778adb7844603210409ee18c8a0d65a856b82ef9e90e2c23c5e0f25","source":{"kind":"arxiv","id":"1810.10044","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Benny Sudakov, Charles Carlson, Luca Trevisan, Nitya Mani, Ray Li","submitted_at":"2018-10-23T18:43:35Z","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."},"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":"1810.10044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-23T18:43:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"26b2c0421d5b399235df5e8e7aae29f9a90a579a86dcc0f1c8f37c2ea5c1b6e9","abstract_canon_sha256":"b3bbe9201f169981947042aa8ace344986f679636b74ea11d48fb5db6f7b38f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:01.411740Z","signature_b64":"hsR4GmcqV87oom/bbo4I+ZrNW+y1Ns/GCrpRr0vO9JjMe3wgo2aYN7xB/Y957dImvOf4bcQdmKx0cpWMw929Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c64cee1778adb7844603210409ee18c8a0d65a856b82ef9e90e2c23c5e0f25","last_reissued_at":"2026-07-05T00:58:01.411281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:01.411281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Alexandra Kolla, Benny Sudakov, Charles Carlson, Luca Trevisan, Nitya Mani, Ray Li","submitted_at":"2018-10-23T18:43:35Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10044","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.10044/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":"1810.10044","created_at":"2026-07-05T00:58:01.411340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10044v2","created_at":"2026-07-05T00:58:01.411340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10044","created_at":"2026-07-05T00:58:01.411340+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXDEZ3QXPCW3","created_at":"2026-07-05T00:58:01.411340+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXDEZ3QXPCW3PBCG","created_at":"2026-07-05T00:58:01.411340+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXDEZ3QX","created_at":"2026-07-05T00:58:01.411340+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/KXDEZ3QXPCW3PBCGAMQQICPODD","json":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD.json","graph_json":"https://pith.science/api/pith-number/KXDEZ3QXPCW3PBCGAMQQICPODD/graph.json","events_json":"https://pith.science/api/pith-number/KXDEZ3QXPCW3PBCGAMQQICPODD/events.json","paper":"https://pith.science/paper/KXDEZ3QX"},"agent_actions":{"view_html":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD","download_json":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD.json","view_paper":"https://pith.science/paper/KXDEZ3QX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10044&json=true","fetch_graph":"https://pith.science/api/pith-number/KXDEZ3QXPCW3PBCGAMQQICPODD/graph.json","fetch_events":"https://pith.science/api/pith-number/KXDEZ3QXPCW3PBCGAMQQICPODD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD/action/storage_attestation","attest_author":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD/action/author_attestation","sign_citation":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD/action/citation_signature","submit_replication":"https://pith.science/pith/KXDEZ3QXPCW3PBCGAMQQICPODD/action/replication_record"}},"created_at":"2026-07-05T00:58:01.411340+00:00","updated_at":"2026-07-05T00:58:01.411340+00:00"}