{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZYQ27JIC5IVEMYPQZB533RFITH","short_pith_number":"pith:ZYQ27JIC","schema_version":"1.0","canonical_sha256":"ce21afa502ea2a4661f0c87bbdc4a899d054ea184351d668e17814c27950f670","source":{"kind":"arxiv","id":"1411.2069","version":1},"attestation_state":"computed","paper":{"title":"Lov\\'asz-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"G. Nasini, L. Tun\\c{c}el, M. Escalante, S. Bianchi","submitted_at":"2014-11-08T01:56:11Z","abstract_excerpt":"We study the Lov\\'asz-Schrijver lift-and-project operator ($LS_+$) based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial characterization of graphs for which the $LS_+$-operator generates the stable set polytope in one step has been open since 1990. We call these graphs $LS_+$-perfect. In the current contribution, we pursue a full combinatorial characterization of $LS_+$-perfect graphs and make progress towards such a characterization by establishing a new, close relationship among $LS_+"},"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":"1411.2069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-08T01:56:11Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"388606430d0d47aea78dcbc9daa5a42b8d4041dd24539f13e3d745c16f15f2a7","abstract_canon_sha256":"bba3d8f1d78492b9a983b5676c4bfb16ea46d4a15b117f2512adc341c73759df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:19.543431Z","signature_b64":"OvcPS9SZ0JK0aUYoA/QAAbSRh0RSNB+7cNRiK9Ah+y0yIbsBf+m24xiW0oT8V46t4zs1CAf4HwCLQn3fhiHHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce21afa502ea2a4661f0c87bbdc4a899d054ea184351d668e17814c27950f670","last_reissued_at":"2026-05-18T02:38:19.542926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:19.542926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lov\\'asz-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"G. Nasini, L. Tun\\c{c}el, M. Escalante, S. Bianchi","submitted_at":"2014-11-08T01:56:11Z","abstract_excerpt":"We study the Lov\\'asz-Schrijver lift-and-project operator ($LS_+$) based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial characterization of graphs for which the $LS_+$-operator generates the stable set polytope in one step has been open since 1990. We call these graphs $LS_+$-perfect. In the current contribution, we pursue a full combinatorial characterization of $LS_+$-perfect graphs and make progress towards such a characterization by establishing a new, close relationship among $LS_+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2069","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":"1411.2069","created_at":"2026-05-18T02:38:19.543010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2069v1","created_at":"2026-05-18T02:38:19.543010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2069","created_at":"2026-05-18T02:38:19.543010+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYQ27JIC5IVE","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYQ27JIC5IVEMYPQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYQ27JIC","created_at":"2026-05-18T12:28:59.999130+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/ZYQ27JIC5IVEMYPQZB533RFITH","json":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH.json","graph_json":"https://pith.science/api/pith-number/ZYQ27JIC5IVEMYPQZB533RFITH/graph.json","events_json":"https://pith.science/api/pith-number/ZYQ27JIC5IVEMYPQZB533RFITH/events.json","paper":"https://pith.science/paper/ZYQ27JIC"},"agent_actions":{"view_html":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH","download_json":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH.json","view_paper":"https://pith.science/paper/ZYQ27JIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2069&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYQ27JIC5IVEMYPQZB533RFITH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYQ27JIC5IVEMYPQZB533RFITH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH/action/storage_attestation","attest_author":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH/action/author_attestation","sign_citation":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH/action/citation_signature","submit_replication":"https://pith.science/pith/ZYQ27JIC5IVEMYPQZB533RFITH/action/replication_record"}},"created_at":"2026-05-18T02:38:19.543010+00:00","updated_at":"2026-05-18T02:38:19.543010+00:00"}