{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5PP5WM57ZP4AEAK5YRCG6I3VLM","short_pith_number":"pith:5PP5WM57","schema_version":"1.0","canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","source":{"kind":"arxiv","id":"1012.2460","version":1},"attestation_state":"computed","paper":{"title":"Contracting planar graphs to contractions of triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Marcin Kaminski","submitted_at":"2010-12-11T14:38:41Z","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 "},"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":"1012.2460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-11T14:38:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ac1b412374182ce659ad084f390fbe588b063235de93daaf7eb0b942be5213a9","abstract_canon_sha256":"642afce97c53edc1062944835471e2a3f7103e9cfecb8038ab5f07fd1d22064f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:28.587049Z","signature_b64":"6u7fepA/DYzq/i496n7/4YS8VCPdLpHmnJrRYw1qruMdwIKQK6kDs6hDdZY+Aqks/NrHzOxUQjYD//RS0LnQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebdfdb33bfcbf802015dc4446f23755b19c1ccb9dffae3948111b2a9efef4ee8","last_reissued_at":"2026-05-18T04:33:28.586568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:28.586568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contracting planar graphs to contractions of triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Paulusma, Dimitrios M. Thilikos, Marcin Kaminski","submitted_at":"2010-12-11T14:38:41Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2460","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":"1012.2460","created_at":"2026-05-18T04:33:28.586632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2460v1","created_at":"2026-05-18T04:33:28.586632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2460","created_at":"2026-05-18T04:33:28.586632+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PP5WM57ZP4A","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PP5WM57ZP4AEAK5","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PP5WM57","created_at":"2026-05-18T12:26:04.259169+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/5PP5WM57ZP4AEAK5YRCG6I3VLM","json":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM.json","graph_json":"https://pith.science/api/pith-number/5PP5WM57ZP4AEAK5YRCG6I3VLM/graph.json","events_json":"https://pith.science/api/pith-number/5PP5WM57ZP4AEAK5YRCG6I3VLM/events.json","paper":"https://pith.science/paper/5PP5WM57"},"agent_actions":{"view_html":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM","download_json":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM.json","view_paper":"https://pith.science/paper/5PP5WM57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2460&json=true","fetch_graph":"https://pith.science/api/pith-number/5PP5WM57ZP4AEAK5YRCG6I3VLM/graph.json","fetch_events":"https://pith.science/api/pith-number/5PP5WM57ZP4AEAK5YRCG6I3VLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/action/storage_attestation","attest_author":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/action/author_attestation","sign_citation":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/action/citation_signature","submit_replication":"https://pith.science/pith/5PP5WM57ZP4AEAK5YRCG6I3VLM/action/replication_record"}},"created_at":"2026-05-18T04:33:28.586632+00:00","updated_at":"2026-05-18T04:33:28.586632+00:00"}