{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GDCC464HVXTKLBVJNMI5JDFUO2","short_pith_number":"pith:GDCC464H","schema_version":"1.0","canonical_sha256":"30c42e7b87ade6a586a96b11d48cb4769bfb334f55335affb6266ca7dffcb6ae","source":{"kind":"arxiv","id":"1512.08757","version":2},"attestation_state":"computed","paper":{"title":"General Cut-Generating Procedures for the Stable Set Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Diego Delle Donne, Ivo Koch, Javier Marenco, Ricardo C. Corr\\^ea","submitted_at":"2015-12-29T19:16:41Z","abstract_excerpt":"We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Camp\\^{e}lo. In contrast to existing cut-generating procedures, ours generate both rank and non-rank valid inequalities, hence they are of a more general nature than existing methods. This is accomplished by iteratively solving a lifting problem, which consists of a maximum weighted stable set problem on a smaller graph. Computational experience on DIMACS benchmark instances shows that the proposed approach may be a "},"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":"1512.08757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-29T19:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"dc7deecb36d7497a981045c537fc949a0c7404270e19f0f5496675ab1f39b72b","abstract_canon_sha256":"8b96a77ec36b8da86dae6f34b5fb6a32289c3291a790ca617ce544b680d9f491"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:10.196996Z","signature_b64":"8tu1qSY+NxyrntmIhDP7YkMt1c9RVzE0ZgmfupiQaXXkH9TwjoSVa3l6pOMrrxIyr952pwQk42Au0oylRkMQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c42e7b87ade6a586a96b11d48cb4769bfb334f55335affb6266ca7dffcb6ae","last_reissued_at":"2026-05-18T00:27:10.196262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:10.196262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Cut-Generating Procedures for the Stable Set Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Diego Delle Donne, Ivo Koch, Javier Marenco, Ricardo C. Corr\\^ea","submitted_at":"2015-12-29T19:16:41Z","abstract_excerpt":"We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Camp\\^{e}lo. In contrast to existing cut-generating procedures, ours generate both rank and non-rank valid inequalities, hence they are of a more general nature than existing methods. This is accomplished by iteratively solving a lifting problem, which consists of a maximum weighted stable set problem on a smaller graph. Computational experience on DIMACS benchmark instances shows that the proposed approach may be a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08757","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":""},"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":"1512.08757","created_at":"2026-05-18T00:27:10.196388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08757v2","created_at":"2026-05-18T00:27:10.196388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08757","created_at":"2026-05-18T00:27:10.196388+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDCC464HVXTK","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDCC464HVXTKLBVJ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDCC464H","created_at":"2026-05-18T12:29:22.688609+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/GDCC464HVXTKLBVJNMI5JDFUO2","json":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2.json","graph_json":"https://pith.science/api/pith-number/GDCC464HVXTKLBVJNMI5JDFUO2/graph.json","events_json":"https://pith.science/api/pith-number/GDCC464HVXTKLBVJNMI5JDFUO2/events.json","paper":"https://pith.science/paper/GDCC464H"},"agent_actions":{"view_html":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2","download_json":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2.json","view_paper":"https://pith.science/paper/GDCC464H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08757&json=true","fetch_graph":"https://pith.science/api/pith-number/GDCC464HVXTKLBVJNMI5JDFUO2/graph.json","fetch_events":"https://pith.science/api/pith-number/GDCC464HVXTKLBVJNMI5JDFUO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2/action/storage_attestation","attest_author":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2/action/author_attestation","sign_citation":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2/action/citation_signature","submit_replication":"https://pith.science/pith/GDCC464HVXTKLBVJNMI5JDFUO2/action/replication_record"}},"created_at":"2026-05-18T00:27:10.196388+00:00","updated_at":"2026-05-18T00:27:10.196388+00:00"}