{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MIYDGYR45GBIK2BKFMIWSOAWRA","short_pith_number":"pith:MIYDGYR4","schema_version":"1.0","canonical_sha256":"623033623ce98285682a2b1169381688297d203db02be4d91d6c7a56a1b9affb","source":{"kind":"arxiv","id":"1204.5113","version":1},"attestation_state":"computed","paper":{"title":"Obtaining Planarity by Contracting Few Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Petr A. Golovach, Pim van 't Hof","submitted_at":"2012-04-23T17:12:35Z","abstract_excerpt":"The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k."},"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":"1204.5113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T17:12:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"794ed4820cab97d85e2efb323c2d3473bf966285e1f176afb5b7ca5399daf4f0","abstract_canon_sha256":"8837c04c62b595c6404ee974c318b97652b173aadb13bd025f677843ad45eec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.753981Z","signature_b64":"9OPn7cWYAG2rjSmzRsyAcXnULUP5vXluo4n+4AA5UGdmAXGKcYOPirj0llYPepLZRNVUZWtq7i3wIKlxKGKaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"623033623ce98285682a2b1169381688297d203db02be4d91d6c7a56a1b9affb","last_reissued_at":"2026-05-18T03:57:14.753513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.753513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Obtaining Planarity by Contracting Few Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Petr A. Golovach, Pim van 't Hof","submitted_at":"2012-04-23T17:12:35Z","abstract_excerpt":"The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5113","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":"1204.5113","created_at":"2026-05-18T03:57:14.753585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5113v1","created_at":"2026-05-18T03:57:14.753585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5113","created_at":"2026-05-18T03:57:14.753585+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIYDGYR45GBI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIYDGYR45GBIK2BK","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIYDGYR4","created_at":"2026-05-18T12:27:14.488303+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/MIYDGYR45GBIK2BKFMIWSOAWRA","json":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA.json","graph_json":"https://pith.science/api/pith-number/MIYDGYR45GBIK2BKFMIWSOAWRA/graph.json","events_json":"https://pith.science/api/pith-number/MIYDGYR45GBIK2BKFMIWSOAWRA/events.json","paper":"https://pith.science/paper/MIYDGYR4"},"agent_actions":{"view_html":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA","download_json":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA.json","view_paper":"https://pith.science/paper/MIYDGYR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5113&json=true","fetch_graph":"https://pith.science/api/pith-number/MIYDGYR45GBIK2BKFMIWSOAWRA/graph.json","fetch_events":"https://pith.science/api/pith-number/MIYDGYR45GBIK2BKFMIWSOAWRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA/action/storage_attestation","attest_author":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA/action/author_attestation","sign_citation":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA/action/citation_signature","submit_replication":"https://pith.science/pith/MIYDGYR45GBIK2BKFMIWSOAWRA/action/replication_record"}},"created_at":"2026-05-18T03:57:14.753585+00:00","updated_at":"2026-05-18T03:57:14.753585+00:00"}