{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SGHA7VTLXIXPSQ62Y7LKZTIPKG","short_pith_number":"pith:SGHA7VTL","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"},"canonical_sha256":"918e0fd66bba2ef943dac7d6accd0f5184cd96804d992bd9e81d66f079de988d","source":{"kind":"arxiv","id":"1204.2915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2915","created_at":"2026-05-18T03:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2915v1","created_at":"2026-05-18T03:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2915","created_at":"2026-05-18T03:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"SGHA7VTLXIXP","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SGHA7VTLXIXPSQ62","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SGHA7VTL","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SGHA7VTLXIXPSQ62Y7LKZTIPKG","target":"record","payload":{"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"},"canonical_sha256":"918e0fd66bba2ef943dac7d6accd0f5184cd96804d992bd9e81d66f079de988d","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"},"source_kind":"arxiv","source_id":"1204.2915","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkv0bjLHicfnUvMn9PzgR6Af9bF1JIWOytZtwZ0Q41T7NgjChgk9RiX9WDwlmpGOTylryebpHWPkMFcgBTzZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:21:49.532301Z"},"content_sha256":"2a7e89becca203467b930a0eee1b31e4d17d9ca0f97d21edd4f373a80dde200e","schema_version":"1.0","event_id":"sha256:2a7e89becca203467b930a0eee1b31e4d17d9ca0f97d21edd4f373a80dde200e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SGHA7VTLXIXPSQ62Y7LKZTIPKG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rlo6CPwLhxZXbRnCcYYOts0EExGmyXIl0Be13Tyl+n9orbvZLaQw0iPW+0zL4MMBndNmdFRI2kN68JCVpvCdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:21:49.532658Z"},"content_sha256":"f6be1248f3f12fa909e3e1549ffd39a30fb848fc93dc66b1692083697610fa4b","schema_version":"1.0","event_id":"sha256:f6be1248f3f12fa909e3e1549ffd39a30fb848fc93dc66b1692083697610fa4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/bundle.json","state_url":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T05:21:49Z","links":{"resolver":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG","bundle":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/bundle.json","state":"https://pith.science/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGHA7VTLXIXPSQ62Y7LKZTIPKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SGHA7VTLXIXPSQ62Y7LKZTIPKG","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":"df6c2090cb753dcce9305153c69de1a649f9a4a87bc49fee9dc0708482528746","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-13T08:28:11Z","title_canon_sha256":"7c1a000638e3796803ce885b097b66f4ada1ca5ef64800080ddeb1b9b2a6fb92"},"schema_version":"1.0","source":{"id":"1204.2915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2915","created_at":"2026-05-18T03:58:02Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2915v1","created_at":"2026-05-18T03:58:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2915","created_at":"2026-05-18T03:58:02Z"},{"alias_kind":"pith_short_12","alias_value":"SGHA7VTLXIXP","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SGHA7VTLXIXPSQ62","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SGHA7VTL","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:f6be1248f3f12fa909e3e1549ffd39a30fb848fc93dc66b1692083697610fa4b","target":"graph","created_at":"2026-05-18T03:58:02Z","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":"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 ","authors_text":"Ignaz Rutter, Jan Kratochv\\'il, V\\'it Jel\\'inek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-13T08:28:11Z","title":"A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2915","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:2a7e89becca203467b930a0eee1b31e4d17d9ca0f97d21edd4f373a80dde200e","target":"record","created_at":"2026-05-18T03:58:02Z","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":"df6c2090cb753dcce9305153c69de1a649f9a4a87bc49fee9dc0708482528746","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-13T08:28:11Z","title_canon_sha256":"7c1a000638e3796803ce885b097b66f4ada1ca5ef64800080ddeb1b9b2a6fb92"},"schema_version":"1.0","source":{"id":"1204.2915","kind":"arxiv","version":1}},"canonical_sha256":"918e0fd66bba2ef943dac7d6accd0f5184cd96804d992bd9e81d66f079de988d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"918e0fd66bba2ef943dac7d6accd0f5184cd96804d992bd9e81d66f079de988d","first_computed_at":"2026-05-18T03:58:02.539301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:02.539301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3olQnq59gc6DF9XmBsyQbe1ZkCdGfSszAZqRfht3K2Gg6mnlTNbw0FRuKMm3bKsLCibqe4R6zOg6E73wncZCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:02.539926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a7e89becca203467b930a0eee1b31e4d17d9ca0f97d21edd4f373a80dde200e","sha256:f6be1248f3f12fa909e3e1549ffd39a30fb848fc93dc66b1692083697610fa4b"],"state_sha256":"f628fc68ff8bca4a48ebb7380609dd2f083418b1073026d0fd96b7f7d03f6ced"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNDC4oSk3VYnjJBNkTRm4swS96nG2JO6X03deeVs6sj03NOqALszsbajMqo1+j/vpKIUAg3eoaqSd+SjB5xaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:21:49.534464Z","bundle_sha256":"ec6bb07b9da5cdb64cd0420d617f1688235a0054b980d147e5e2f5b94c6a969e"}}