{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XGPEND4JN6CB43AYQN5SLRGV4N","short_pith_number":"pith:XGPEND4J","schema_version":"1.0","canonical_sha256":"b99e468f896f841e6c18837b25c4d5e3424db3d724e4c5487e68f00f1f5147d0","source":{"kind":"arxiv","id":"1402.1999","version":3},"attestation_state":"computed","paper":{"title":"Non-planar extensions of subdivisions of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robin Thomas, Sergey Norin","submitted_at":"2014-02-09T22:29:34Z","abstract_excerpt":"Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost $4$-connected non-planar graph such that $H$ has a subgraph isomorphic to a subdivision of $G$. Then there exists a graph $G'$ such that $G'$ is isomorphic to a minor of $H$, and either\n  (i) $G'=G+uv$ for some vertices $u,v\\in V(G)$ such that no facial cycle of $G$ contains both $u$ and $v$, or\n  (ii) $G'=G+u_1v_1+u_2v_2$ for some distinct vertices $u_1,u_2,v_1"},"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":"1402.1999","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-09T22:29:34Z","cross_cats_sorted":[],"title_canon_sha256":"df1f6a3ff3f4d1b7a2f0de765b4c78274461f53949589aae8628bc7bdd3dac07","abstract_canon_sha256":"cb5d600c42e0f21c94db5eba027d37b7b7a0d51ce6ef0c13ce7318c3c5981275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:26.362428Z","signature_b64":"3qGGBZSrTXD1IDqn9EUXDCrL0rH7Qu1kB7Mk2WRn8CjzkI8E0zDCBNrnfsedx8GP+mWZ1K3KZnvsCRxwUMeZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b99e468f896f841e6c18837b25c4d5e3424db3d724e4c5487e68f00f1f5147d0","last_reissued_at":"2026-05-17T23:45:26.361910Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:26.361910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-planar extensions of subdivisions of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Robin Thomas, Sergey Norin","submitted_at":"2014-02-09T22:29:34Z","abstract_excerpt":"Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost $4$-connected non-planar graph such that $H$ has a subgraph isomorphic to a subdivision of $G$. Then there exists a graph $G'$ such that $G'$ is isomorphic to a minor of $H$, and either\n  (i) $G'=G+uv$ for some vertices $u,v\\in V(G)$ such that no facial cycle of $G$ contains both $u$ and $v$, or\n  (ii) $G'=G+u_1v_1+u_2v_2$ for some distinct vertices $u_1,u_2,v_1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1999","kind":"arxiv","version":3},"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":"1402.1999","created_at":"2026-05-17T23:45:26.361984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1999v3","created_at":"2026-05-17T23:45:26.361984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1999","created_at":"2026-05-17T23:45:26.361984+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGPEND4JN6CB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGPEND4JN6CB43AY","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGPEND4J","created_at":"2026-05-18T12:28:57.508820+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/XGPEND4JN6CB43AYQN5SLRGV4N","json":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N.json","graph_json":"https://pith.science/api/pith-number/XGPEND4JN6CB43AYQN5SLRGV4N/graph.json","events_json":"https://pith.science/api/pith-number/XGPEND4JN6CB43AYQN5SLRGV4N/events.json","paper":"https://pith.science/paper/XGPEND4J"},"agent_actions":{"view_html":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N","download_json":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N.json","view_paper":"https://pith.science/paper/XGPEND4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1999&json=true","fetch_graph":"https://pith.science/api/pith-number/XGPEND4JN6CB43AYQN5SLRGV4N/graph.json","fetch_events":"https://pith.science/api/pith-number/XGPEND4JN6CB43AYQN5SLRGV4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N/action/storage_attestation","attest_author":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N/action/author_attestation","sign_citation":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N/action/citation_signature","submit_replication":"https://pith.science/pith/XGPEND4JN6CB43AYQN5SLRGV4N/action/replication_record"}},"created_at":"2026-05-17T23:45:26.361984+00:00","updated_at":"2026-05-17T23:45:26.361984+00:00"}