{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SGHA7VTLXIXPSQ62Y7LKZTIPKG","short_pith_number":"pith:SGHA7VTL","schema_version":"1.0","canonical_sha256":"918e0fd66bba2ef943dac7d6accd0f5184cd96804d992bd9e81d66f079de988d","source":{"kind":"arxiv","id":"1204.2915","version":1},"attestation_state":"computed","paper":{"title":"A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ignaz Rutter, Jan Kratochv\\'il, V\\'it Jel\\'inek","submitted_at":"2012-04-13T08:28:11Z","abstract_excerpt":"A partially embedded graph (or PEG) is a triple (G,H,\\H), where G is a graph, H is a subgraph of G, and \\H is a planar embedding of H. We say that a PEG (G,H,\\H) is planar if the graph G has a planar embedding that extends the embedding \\H.\n  We introduce a containment relation of PEGs analogous to graph minor containment, and characterize the minimal non-planar PEGs with respect to this relation. We show that all the minimal non-planar PEGs except for finitely many belong to a single easily recognizable and explicitly described infinite family. We also describe a more complicated containment "},"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.2915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-13T08:28:11Z","cross_cats_sorted":[],"title_canon_sha256":"7c1a000638e3796803ce885b097b66f4ada1ca5ef64800080ddeb1b9b2a6fb92","abstract_canon_sha256":"df6c2090cb753dcce9305153c69de1a649f9a4a87bc49fee9dc0708482528746"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:02.539926Z","signature_b64":"3olQnq59gc6DF9XmBsyQbe1ZkCdGfSszAZqRfht3K2Gg6mnlTNbw0FRuKMm3bKsLCibqe4R6zOg6E73wncZCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"918e0fd66bba2ef943dac7d6accd0f5184cd96804d992bd9e81d66f079de988d","last_reissued_at":"2026-05-18T03:58:02.539301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:02.539301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ignaz Rutter, Jan Kratochv\\'il, V\\'it Jel\\'inek","submitted_at":"2012-04-13T08:28:11Z","abstract_excerpt":"A partially embedded graph (or PEG) is a triple (G,H,\\H), where G is a graph, H is a subgraph of G, and \\H is a planar embedding of H. We say that a PEG (G,H,\\H) is planar if the graph G has a planar embedding that extends the embedding \\H.\n  We introduce a containment relation of PEGs analogous to graph minor containment, and characterize the minimal non-planar PEGs with respect to this relation. We show that all the minimal non-planar PEGs except for finitely many belong to a single easily recognizable and explicitly described infinite family. We also describe a more complicated containment "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2915","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.2915","created_at":"2026-05-18T03:58:02.539379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2915v1","created_at":"2026-05-18T03:58:02.539379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2915","created_at":"2026-05-18T03:58:02.539379+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGHA7VTLXIXP","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGHA7VTLXIXPSQ62","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGHA7VTL","created_at":"2026-05-18T12:27:20.899486+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/SGHA7VTLXIXPSQ62Y7LKZTIPKG","json":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG.json","graph_json":"https://pith.science/api/pith-number/SGHA7VTLXIXPSQ62Y7LKZTIPKG/graph.json","events_json":"https://pith.science/api/pith-number/SGHA7VTLXIXPSQ62Y7LKZTIPKG/events.json","paper":"https://pith.science/paper/SGHA7VTL"},"agent_actions":{"view_html":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG","download_json":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG.json","view_paper":"https://pith.science/paper/SGHA7VTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2915&json=true","fetch_graph":"https://pith.science/api/pith-number/SGHA7VTLXIXPSQ62Y7LKZTIPKG/graph.json","fetch_events":"https://pith.science/api/pith-number/SGHA7VTLXIXPSQ62Y7LKZTIPKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/action/storage_attestation","attest_author":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/action/author_attestation","sign_citation":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/action/citation_signature","submit_replication":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/action/replication_record"}},"created_at":"2026-05-18T03:58:02.539379+00:00","updated_at":"2026-05-18T03:58:02.539379+00:00"}