{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GH7CMZMXVLJIO6KYM2AA6IWML7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"51033d7b07551ab43b2621601141ac894f97451a852c54f1d3836f73af958c9e","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T21:16:25Z","title_canon_sha256":"1f735406f11cef91d6f11b8247199e93c2c56fb7ec3bb342b7f85e07c5130487"},"schema_version":"1.0","source":{"id":"1706.09052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09052","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09052v1","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09052","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"GH7CMZMXVLJI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GH7CMZMXVLJIO6KY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GH7CMZMX","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:98ed0cce2b16cb111f4c17562f8585686b58fa0df95af4609c6566f408e7aa93","target":"graph","created_at":"2026-05-18T00:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bernard Ries, Christophe Picouleau, Dani\\\"el Paulusma, \\\"Oznur Ya\\c{s}ar Diner","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T21:16:25Z","title":"Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09052","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61d9da6eaeabd69b6c4d037949eee27b6b594b4991691fa89f44787a9cd32f88","target":"record","created_at":"2026-05-18T00:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"51033d7b07551ab43b2621601141ac894f97451a852c54f1d3836f73af958c9e","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T21:16:25Z","title_canon_sha256":"1f735406f11cef91d6f11b8247199e93c2c56fb7ec3bb342b7f85e07c5130487"},"schema_version":"1.0","source":{"id":"1706.09052","kind":"arxiv","version":1}},"canonical_sha256":"31fe266597aad287795866800f22cc5fd10a5c68edc8c44683007bd457ecc200","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31fe266597aad287795866800f22cc5fd10a5c68edc8c44683007bd457ecc200","first_computed_at":"2026-05-18T00:41:20.033210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:20.033210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JA3nV7YsP62969FtMUxgIVCqZLCWGqtgJZqvXltMXK12L8oS/dl0xzytOreCR0+z/Dju3h5wNLuqxsnxWfu+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:20.033939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61d9da6eaeabd69b6c4d037949eee27b6b594b4991691fa89f44787a9cd32f88","sha256:98ed0cce2b16cb111f4c17562f8585686b58fa0df95af4609c6566f408e7aa93"],"state_sha256":"6c4ddec677b1dcba34ee19ce3178b0d6cf1f5049cec81cb6405eea768d64d222"}