{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DYBBFN7XKQMDVMRWPVTFYNJWDG","short_pith_number":"pith:DYBBFN7X","schema_version":"1.0","canonical_sha256":"1e0212b7f754183ab2367d665c35361994b787d90d74fbdff008306699bff559","source":{"kind":"arxiv","id":"1806.01173","version":1},"attestation_state":"computed","paper":{"title":"Strict Complementarity in MaxCut SDP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tun\\c{c}el, Marcel K. de Carli Silva","submitted_at":"2018-06-04T16:13:50Z","abstract_excerpt":"The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of a graph, as proved by Laurent and Poljak in 1995. Recall that a boundary point $x$ of a convex set $C$ is called a vertex of $C$ if the normal cone of $C$ at $x$ is full-dimensional.\n  We study how often strict complementarity holds or fails for the MaxCut SDP when a vertex of the feasible region is optimal, i.e., when the SDP relaxation is tight. While stri"},"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":"1806.01173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-04T16:13:50Z","cross_cats_sorted":[],"title_canon_sha256":"999e73a54de5bb48a500e038650f4588870382f669501122d9f7f6e97d72babf","abstract_canon_sha256":"62120bae9904f9415264e3a7a6e5ecacb2562a548adcc3603cc3400cadd5ae75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:17.222640Z","signature_b64":"cU8jLdbHYMx4zM0kOoLDR1CwXbaW6OCm9FxyAwXLvyATb/WaVCBLiKA4Jqo1jkhjXUUrPNVDBk+ZleHcsp9aCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e0212b7f754183ab2367d665c35361994b787d90d74fbdff008306699bff559","last_reissued_at":"2026-05-18T00:14:17.222129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:17.222129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strict Complementarity in MaxCut SDP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Levent Tun\\c{c}el, Marcel K. de Carli Silva","submitted_at":"2018-06-04T16:13:50Z","abstract_excerpt":"The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of a graph, as proved by Laurent and Poljak in 1995. Recall that a boundary point $x$ of a convex set $C$ is called a vertex of $C$ if the normal cone of $C$ at $x$ is full-dimensional.\n  We study how often strict complementarity holds or fails for the MaxCut SDP when a vertex of the feasible region is optimal, i.e., when the SDP relaxation is tight. While stri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01173","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":""},"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":"1806.01173","created_at":"2026-05-18T00:14:17.222208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01173v1","created_at":"2026-05-18T00:14:17.222208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01173","created_at":"2026-05-18T00:14:17.222208+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYBBFN7XKQMD","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYBBFN7XKQMDVMRW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYBBFN7X","created_at":"2026-05-18T12:32:19.392346+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/DYBBFN7XKQMDVMRWPVTFYNJWDG","json":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG.json","graph_json":"https://pith.science/api/pith-number/DYBBFN7XKQMDVMRWPVTFYNJWDG/graph.json","events_json":"https://pith.science/api/pith-number/DYBBFN7XKQMDVMRWPVTFYNJWDG/events.json","paper":"https://pith.science/paper/DYBBFN7X"},"agent_actions":{"view_html":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG","download_json":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG.json","view_paper":"https://pith.science/paper/DYBBFN7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01173&json=true","fetch_graph":"https://pith.science/api/pith-number/DYBBFN7XKQMDVMRWPVTFYNJWDG/graph.json","fetch_events":"https://pith.science/api/pith-number/DYBBFN7XKQMDVMRWPVTFYNJWDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG/action/storage_attestation","attest_author":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG/action/author_attestation","sign_citation":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG/action/citation_signature","submit_replication":"https://pith.science/pith/DYBBFN7XKQMDVMRWPVTFYNJWDG/action/replication_record"}},"created_at":"2026-05-18T00:14:17.222208+00:00","updated_at":"2026-05-18T00:14:17.222208+00:00"}