{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:T4ETNTRJNJ2TZN6CGRRVDI4Q5N","short_pith_number":"pith:T4ETNTRJ","schema_version":"1.0","canonical_sha256":"9f0936ce296a753cb7c2346351a390eb676eb9b07bbacc5618c22f1aee1f406f","source":{"kind":"arxiv","id":"1108.0064","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Planar Covering of Small Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Volec, Jozef Jir\\'asek, Martin Tancer, Ond\\v{r}ej B\\'ilka, Pavel Klav\\'ik","submitted_at":"2011-07-30T12:27:50Z","abstract_excerpt":"The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied. In this paper, we consider the problem PlanarCover(H) which restricts the input graph G to be planar.\n  PlanarCover(H) is polynomially solvable if Cover(H) belongs to P, and it is even trivially solvable if H has no planar cover. Thus the interesting cases are when H admits a planar cover, but Cover(H) is NP-complete. This also relates the problem to the long-sta"},"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":"1108.0064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-30T12:27:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"77296a26968b5ce50a63ae9a8e87d76c9c986bfdae26d58e15f6fd82c31c3f2e","abstract_canon_sha256":"8a244839bca7f426b36feca82a003e3a1d438bad870e83b884b20a1327bba17c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:07.029952Z","signature_b64":"MllQsg+BNH6WzWSILtNeoyh9k8HrJFBT8DOM4fE/BxnUVA67oZTwDV6H85rkjCiJQ55P/u8m8WGetCgBkFM+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f0936ce296a753cb7c2346351a390eb676eb9b07bbacc5618c22f1aee1f406f","last_reissued_at":"2026-05-18T04:15:07.029288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:07.029288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Planar Covering of Small Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Volec, Jozef Jir\\'asek, Martin Tancer, Ond\\v{r}ej B\\'ilka, Pavel Klav\\'ik","submitted_at":"2011-07-30T12:27:50Z","abstract_excerpt":"The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Complexity of this problem has been intensively studied. In this paper, we consider the problem PlanarCover(H) which restricts the input graph G to be planar.\n  PlanarCover(H) is polynomially solvable if Cover(H) belongs to P, and it is even trivially solvable if H has no planar cover. Thus the interesting cases are when H admits a planar cover, but Cover(H) is NP-complete. This also relates the problem to the long-sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0064","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":"1108.0064","created_at":"2026-05-18T04:15:07.029407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0064v1","created_at":"2026-05-18T04:15:07.029407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0064","created_at":"2026-05-18T04:15:07.029407+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4ETNTRJNJ2T","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4ETNTRJNJ2TZN6C","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4ETNTRJ","created_at":"2026-05-18T12:26:41.206345+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/T4ETNTRJNJ2TZN6CGRRVDI4Q5N","json":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N.json","graph_json":"https://pith.science/api/pith-number/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/graph.json","events_json":"https://pith.science/api/pith-number/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/events.json","paper":"https://pith.science/paper/T4ETNTRJ"},"agent_actions":{"view_html":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N","download_json":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N.json","view_paper":"https://pith.science/paper/T4ETNTRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0064&json=true","fetch_graph":"https://pith.science/api/pith-number/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/graph.json","fetch_events":"https://pith.science/api/pith-number/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/action/storage_attestation","attest_author":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/action/author_attestation","sign_citation":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/action/citation_signature","submit_replication":"https://pith.science/pith/T4ETNTRJNJ2TZN6CGRRVDI4Q5N/action/replication_record"}},"created_at":"2026-05-18T04:15:07.029407+00:00","updated_at":"2026-05-18T04:15:07.029407+00:00"}