{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SKIJ4D74B7JSZ4XKXCWUGWAPIW","short_pith_number":"pith:SKIJ4D74","schema_version":"1.0","canonical_sha256":"92909e0ffc0fd32cf2eab8ad43580f45bc59a66ef7c9a0b62453a1a38c510e68","source":{"kind":"arxiv","id":"2401.17069","version":3},"attestation_state":"computed","paper":{"title":"Practical Experience with Stable Set and Coloring Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dunja Pucher, Franz Rendl","submitted_at":"2024-01-30T14:52:01Z","abstract_excerpt":"The stable set problem and the graph coloring problem are classes of NP-hard optimization problems on graphs. It is well known that even near-optimal solutions for these problems are difficult to find in polynomial time. The Lov\\'asz theta function, introduced by Lov\\'asz in the late 1970s, provides a powerful tool in the study of these problems. It can be expressed as the optimal value of a semidefinite program and serves as a relaxation for both problems. Over the years, considerable effort has been devoted to investigating additional cutting planes to strengthen these relaxations. In our wo"},"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":"2401.17069","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-30T14:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"fd9563ead1db85ca85e50e455de84d89ac421044ea4d760f923f77e5d7932abc","abstract_canon_sha256":"e96c73d0114977c37e634b31113d8a4977621363d4a7629aa09a514a3df5b8c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:59.640920Z","signature_b64":"XlyHX6YjADy2rMZosVTMtVFNCLuB0w/hzNcp5ba7vb6vfeH6eH4fkIkVOLKs3wIayi6kxB0iEM1OmzWsru8lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92909e0ffc0fd32cf2eab8ad43580f45bc59a66ef7c9a0b62453a1a38c510e68","last_reissued_at":"2026-07-05T11:37:59.640433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:59.640433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Experience with Stable Set and Coloring Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dunja Pucher, Franz Rendl","submitted_at":"2024-01-30T14:52:01Z","abstract_excerpt":"The stable set problem and the graph coloring problem are classes of NP-hard optimization problems on graphs. It is well known that even near-optimal solutions for these problems are difficult to find in polynomial time. The Lov\\'asz theta function, introduced by Lov\\'asz in the late 1970s, provides a powerful tool in the study of these problems. It can be expressed as the optimal value of a semidefinite program and serves as a relaxation for both problems. Over the years, considerable effort has been devoted to investigating additional cutting planes to strengthen these relaxations. In our wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.17069","kind":"arxiv","version":3},"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/2401.17069/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":"2401.17069","created_at":"2026-07-05T11:37:59.640491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.17069v3","created_at":"2026-07-05T11:37:59.640491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.17069","created_at":"2026-07-05T11:37:59.640491+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKIJ4D74B7JS","created_at":"2026-07-05T11:37:59.640491+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKIJ4D74B7JSZ4XK","created_at":"2026-07-05T11:37:59.640491+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKIJ4D74","created_at":"2026-07-05T11:37:59.640491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02456","citing_title":"Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW","json":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW.json","graph_json":"https://pith.science/api/pith-number/SKIJ4D74B7JSZ4XKXCWUGWAPIW/graph.json","events_json":"https://pith.science/api/pith-number/SKIJ4D74B7JSZ4XKXCWUGWAPIW/events.json","paper":"https://pith.science/paper/SKIJ4D74"},"agent_actions":{"view_html":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW","download_json":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW.json","view_paper":"https://pith.science/paper/SKIJ4D74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.17069&json=true","fetch_graph":"https://pith.science/api/pith-number/SKIJ4D74B7JSZ4XKXCWUGWAPIW/graph.json","fetch_events":"https://pith.science/api/pith-number/SKIJ4D74B7JSZ4XKXCWUGWAPIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW/action/storage_attestation","attest_author":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW/action/author_attestation","sign_citation":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW/action/citation_signature","submit_replication":"https://pith.science/pith/SKIJ4D74B7JSZ4XKXCWUGWAPIW/action/replication_record"}},"created_at":"2026-07-05T11:37:59.640491+00:00","updated_at":"2026-07-05T11:37:59.640491+00:00"}