{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NRCQUIGS2SV73UDIRHKEZA4JRF","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":"5851383126f86c204433d23f9120c3e7ad667bb84d7101548418f10186586da6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T22:46:55Z","title_canon_sha256":"62862b64dd459ae1e50b270d6d6b45717427d59486d5bc436e3ee92017f27ff0"},"schema_version":"1.0","source":{"id":"1204.6070","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6070","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6070v3","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6070","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"pith_short_12","alias_value":"NRCQUIGS2SV7","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NRCQUIGS2SV73UDI","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NRCQUIGS","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:2f9e6990f463964394d441479daa30e5c90f46556d886c2ae7eb1f15619dd399","target":"graph","created_at":"2026-05-18T00:45:01Z","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 computational complexity of graph planarization via edge contraction. The problem CONTRACT asks whether there exists a set $S$ of at most $k$ edges that when contracted produces a planar graph. We work with a more general problem called $P$-RESTRICTEDCONTRACT in which $S$, in addition, is required to satisfy a fixed MSOL formula $P(S,G)$. We give an FPT algorithm in time $O(n^2 f(k))$ which solves $P$-RESTRICTEDCONTRACT, where $P(S,G)$ is (i) inclusion-closed and (ii) inert contraction-closed (where inert edges are the edges non-incident to any inclusion minimal solution $S$).\n  A","authors_text":"James Abello, Jan Kratochv\\'il, Pavel Klav\\'ik, Tom\\'a\\v{s} Vysko\\v{c}il","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T22:46:55Z","title":"MSOL Restricted Contractibility to Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6070","kind":"arxiv","version":3},"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:1bd7a72f7fb54f381f51444b03858a4e0e51f8f17527d912e1d1a5803ef380a7","target":"record","created_at":"2026-05-18T00:45:01Z","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":"5851383126f86c204433d23f9120c3e7ad667bb84d7101548418f10186586da6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T22:46:55Z","title_canon_sha256":"62862b64dd459ae1e50b270d6d6b45717427d59486d5bc436e3ee92017f27ff0"},"schema_version":"1.0","source":{"id":"1204.6070","kind":"arxiv","version":3}},"canonical_sha256":"6c450a20d2d4abfdd06889d44c8389894dac4777ee0e88632e21eef97cf18a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c450a20d2d4abfdd06889d44c8389894dac4777ee0e88632e21eef97cf18a96","first_computed_at":"2026-05-18T00:45:01.981635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:01.981635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C6h3PheT0JMqi+cRuR9vfjVIwjaNkE6kXeTao1X2pvNST4EphyKJxmmdVHewTeQCZ12l6Ci/HV3PJ8Fvln+PCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:01.982032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6070","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bd7a72f7fb54f381f51444b03858a4e0e51f8f17527d912e1d1a5803ef380a7","sha256:2f9e6990f463964394d441479daa30e5c90f46556d886c2ae7eb1f15619dd399"],"state_sha256":"09e56e91782683a60326057fe2b68ef85c559f42cd2a90e30cb0787d6408e24e"}