{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YCK6X5BN3B6XCG2CWJMKCY6YWB","short_pith_number":"pith:YCK6X5BN","schema_version":"1.0","canonical_sha256":"c095ebf42dd87d711b42b258a163d8b057d2d4c6a3de9dd121a3213d2f1cc7a1","source":{"kind":"arxiv","id":"1505.04072","version":1},"attestation_state":"computed","paper":{"title":"Characterizing N+-perfect line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Wagler, G. Nasini, M. Escalante","submitted_at":"2015-05-15T14:24:34Z","abstract_excerpt":"The subject of this contribution is the study of the Lov\\'asz-Schrijver PSD-operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set polytope in one step, called N+-perfect graphs. It is conjectured that the only N+-perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving "},"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":"1505.04072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-15T14:24:34Z","cross_cats_sorted":[],"title_canon_sha256":"80d434b0fb3f2021860417861f5b6cbe153c56e4c70cc01b1a458bc4102f7a06","abstract_canon_sha256":"ba34e3bdf9c19a0abe26e1d52db08fe916b9872c606f966909fef7f76dd1e902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:40.216921Z","signature_b64":"wrM1R35UsfsqsDYuuD3xj6adGi7G3YHpSjxImtb9IFImITO4fzpBeazECWEpo4NShCSJrXqwiwM8d6pCq9wGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c095ebf42dd87d711b42b258a163d8b057d2d4c6a3de9dd121a3213d2f1cc7a1","last_reissued_at":"2026-05-18T02:09:40.216218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:40.216218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing N+-perfect line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Wagler, G. Nasini, M. Escalante","submitted_at":"2015-05-15T14:24:34Z","abstract_excerpt":"The subject of this contribution is the study of the Lov\\'asz-Schrijver PSD-operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which N+ generates the stable set polytope in one step, called N+-perfect graphs. It is conjectured that the only N+-perfect graphs are those whose stable set polytope is described by inequalities with near-bipartite support. So far, this conjecture has been proved for near-perfect graphs, fs-perfect graphs, and webs. Here, we verify it for line graphs, by proving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04072","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":"1505.04072","created_at":"2026-05-18T02:09:40.216338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04072v1","created_at":"2026-05-18T02:09:40.216338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04072","created_at":"2026-05-18T02:09:40.216338+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCK6X5BN3B6X","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCK6X5BN3B6XCG2C","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCK6X5BN","created_at":"2026-05-18T12:29:50.041715+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/YCK6X5BN3B6XCG2CWJMKCY6YWB","json":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB.json","graph_json":"https://pith.science/api/pith-number/YCK6X5BN3B6XCG2CWJMKCY6YWB/graph.json","events_json":"https://pith.science/api/pith-number/YCK6X5BN3B6XCG2CWJMKCY6YWB/events.json","paper":"https://pith.science/paper/YCK6X5BN"},"agent_actions":{"view_html":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB","download_json":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB.json","view_paper":"https://pith.science/paper/YCK6X5BN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04072&json=true","fetch_graph":"https://pith.science/api/pith-number/YCK6X5BN3B6XCG2CWJMKCY6YWB/graph.json","fetch_events":"https://pith.science/api/pith-number/YCK6X5BN3B6XCG2CWJMKCY6YWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB/action/storage_attestation","attest_author":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB/action/author_attestation","sign_citation":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB/action/citation_signature","submit_replication":"https://pith.science/pith/YCK6X5BN3B6XCG2CWJMKCY6YWB/action/replication_record"}},"created_at":"2026-05-18T02:09:40.216338+00:00","updated_at":"2026-05-18T02:09:40.216338+00:00"}