{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GH7CMZMXVLJIO6KYM2AA6IWML7","short_pith_number":"pith:GH7CMZMX","schema_version":"1.0","canonical_sha256":"31fe266597aad287795866800f22cc5fd10a5c68edc8c44683007bd457ecc200","source":{"kind":"arxiv","id":"1706.09052","version":1},"attestation_state":"computed","paper":{"title":"Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bernard Ries, Christophe Picouleau, Dani\\\"el Paulusma, \\\"Oznur Ya\\c{s}ar Diner","submitted_at":"2017-06-27T21:16:25Z","abstract_excerpt":"We study the following problem: for given integers $d$, $k$ and graph $G$, can we reduce some fixed graph parameter $\\pi$ of $G$ by at least $d$ via at most $k$ graph operations from some fixed set $S$? As parameters we take the chromatic number $\\chi$, clique number $\\omega$ and independence number $\\alpha$, and as operations we choose the edge contraction ec and vertex deletion vd. We determine the complexity of this problem for $S=\\{\\mbox{ec}\\}$ and $S=\\{\\mbox{vd}\\}$ and $\\pi\\in \\{\\chi,\\omega,\\alpha\\}$ for a number of subclasses of perfect graphs. We use these results to determine the compl"},"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":"1706.09052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T21:16:25Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"1f735406f11cef91d6f11b8247199e93c2c56fb7ec3bb342b7f85e07c5130487","abstract_canon_sha256":"51033d7b07551ab43b2621601141ac894f97451a852c54f1d3836f73af958c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:20.033939Z","signature_b64":"JA3nV7YsP62969FtMUxgIVCqZLCWGqtgJZqvXltMXK12L8oS/dl0xzytOreCR0+z/Dju3h5wNLuqxsnxWfu+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31fe266597aad287795866800f22cc5fd10a5c68edc8c44683007bd457ecc200","last_reissued_at":"2026-05-18T00:41:20.033210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:20.033210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bernard Ries, Christophe Picouleau, Dani\\\"el Paulusma, \\\"Oznur Ya\\c{s}ar Diner","submitted_at":"2017-06-27T21:16:25Z","abstract_excerpt":"We study the following problem: for given integers $d$, $k$ and graph $G$, can we reduce some fixed graph parameter $\\pi$ of $G$ by at least $d$ via at most $k$ graph operations from some fixed set $S$? As parameters we take the chromatic number $\\chi$, clique number $\\omega$ and independence number $\\alpha$, and as operations we choose the edge contraction ec and vertex deletion vd. We determine the complexity of this problem for $S=\\{\\mbox{ec}\\}$ and $S=\\{\\mbox{vd}\\}$ and $\\pi\\in \\{\\chi,\\omega,\\alpha\\}$ for a number of subclasses of perfect graphs. We use these results to determine the compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09052","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":"1706.09052","created_at":"2026-05-18T00:41:20.033349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09052v1","created_at":"2026-05-18T00:41:20.033349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09052","created_at":"2026-05-18T00:41:20.033349+00:00"},{"alias_kind":"pith_short_12","alias_value":"GH7CMZMXVLJI","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GH7CMZMXVLJIO6KY","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GH7CMZMX","created_at":"2026-05-18T12:31:15.632608+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/GH7CMZMXVLJIO6KYM2AA6IWML7","json":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7.json","graph_json":"https://pith.science/api/pith-number/GH7CMZMXVLJIO6KYM2AA6IWML7/graph.json","events_json":"https://pith.science/api/pith-number/GH7CMZMXVLJIO6KYM2AA6IWML7/events.json","paper":"https://pith.science/paper/GH7CMZMX"},"agent_actions":{"view_html":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7","download_json":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7.json","view_paper":"https://pith.science/paper/GH7CMZMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09052&json=true","fetch_graph":"https://pith.science/api/pith-number/GH7CMZMXVLJIO6KYM2AA6IWML7/graph.json","fetch_events":"https://pith.science/api/pith-number/GH7CMZMXVLJIO6KYM2AA6IWML7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7/action/storage_attestation","attest_author":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7/action/author_attestation","sign_citation":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7/action/citation_signature","submit_replication":"https://pith.science/pith/GH7CMZMXVLJIO6KYM2AA6IWML7/action/replication_record"}},"created_at":"2026-05-18T00:41:20.033349+00:00","updated_at":"2026-05-18T00:41:20.033349+00:00"}