{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5PP5WM57ZP4AEAK5YRCG6I3VLM","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":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9"},"schema_version":"1.0","source":{"id":"1012.2460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2460","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2460v1","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2460","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"5PP5WM57ZP4A","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5PP5WM57ZP4AEAK5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5PP5WM57","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:de569d3ea41c761626f5ce8de58a0a0cf988d96e561918f51bfa2fde0f6ded69","target":"graph","created_at":"2026-05-18T04:33:28Z","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":"For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs $\\cal C$ such that for every $H \\in \\cal C$, there exists an algorithm deciding in time $f(|V(H)|) \\cdot |V(G)|^{\\bigO{1}}$ whether a planar graph $G$ can be contracted to~$H$. (The function $f(\\cdot)$ does not depend on $G$.) The class $\\cal C$ is the closure of planar triangulated graphs under taking of contractions. In fact, we prove that a graph $H \\in \\cal ","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Marcin Kaminski","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","title":"Contracting planar graphs to contractions of triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2460","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:e6b1e743b7506c262a56a10b4ef656ab840860a784a408620574dfeb871160f4","target":"record","created_at":"2026-05-18T04:33:28Z","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":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9"},"schema_version":"1.0","source":{"id":"1012.2460","kind":"arxiv","version":1}},"canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","first_computed_at":"2026-05-18T04:33:28.586568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:28.586568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6u7fepA/DYzq/i496n7/4YS8VCPdLpHmnJrRYw1qruMdwIKQK6kDs6hDdZY+Aqks/NrHzOxUQjYD//RS0LnQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:28.587049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6b1e743b7506c262a56a10b4ef656ab840860a784a408620574dfeb871160f4","sha256:de569d3ea41c761626f5ce8de58a0a0cf988d96e561918f51bfa2fde0f6ded69"],"state_sha256":"f2a7b2847d066b882c7134c0fa0b856399e528427627c6622479f9d46a427bc9"}