{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:G473JKC6KEFX7NCZLW4SLYCGL7","short_pith_number":"pith:G473JKC6","schema_version":"1.0","canonical_sha256":"373fb4a85e510b7fb4595db925e0465fe53154e4ed793d4131549d43d8b67d03","source":{"kind":"arxiv","id":"0912.4778","version":2},"attestation_state":"computed","paper":{"title":"Large Non-Planar Graphs and an Application to Crossing-Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bogdan Oporowski, Dirk Vertigan, Guoli Ding, Robin Thomas","submitted_at":"2009-12-24T04:20:08Z","abstract_excerpt":"We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K_{4,k}, the graph obtained from a cycle of length 2k+1 by adding an edge joining every pair of vertices at distance exactly k, or the graph obtained from a cycle of length k by adding two vertices adjacent to each other and to every vertex on the cycle. We also prove a version of this for subdivisions rather than minors, and relax the connectivity to allow 3-cuts with one side planar and of bounded size. We deduce that for every int"},"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":"0912.4778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-24T04:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"c7a7b1766aab7bb9f3b50bd435189988c9518df877224e2bce05453dad11b234","abstract_canon_sha256":"dad85608102b1998eda06ed0c61f370ebf6a45ade757bceef3cebebff3890075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:33.953867Z","signature_b64":"ki6bV6rDs1hu+5aJa70ickTsUUksgFHrf1wat3PT3tYsy79XTaDCDfB5RUsJQ1LCFlYufavPYuz7njjXQIlCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"373fb4a85e510b7fb4595db925e0465fe53154e4ed793d4131549d43d8b67d03","last_reissued_at":"2026-05-18T04:36:33.953464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:33.953464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Non-Planar Graphs and an Application to Crossing-Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bogdan Oporowski, Dirk Vertigan, Guoli Ding, Robin Thomas","submitted_at":"2009-12-24T04:20:08Z","abstract_excerpt":"We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K_{4,k}, the graph obtained from a cycle of length 2k+1 by adding an edge joining every pair of vertices at distance exactly k, or the graph obtained from a cycle of length k by adding two vertices adjacent to each other and to every vertex on the cycle. We also prove a version of this for subdivisions rather than minors, and relax the connectivity to allow 3-cuts with one side planar and of bounded size. We deduce that for every int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.4778","kind":"arxiv","version":2},"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":"0912.4778","created_at":"2026-05-18T04:36:33.953519+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.4778v2","created_at":"2026-05-18T04:36:33.953519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.4778","created_at":"2026-05-18T04:36:33.953519+00:00"},{"alias_kind":"pith_short_12","alias_value":"G473JKC6KEFX","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"G473JKC6KEFX7NCZ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"G473JKC6","created_at":"2026-05-18T12:25:59.703012+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/G473JKC6KEFX7NCZLW4SLYCGL7","json":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7.json","graph_json":"https://pith.science/api/pith-number/G473JKC6KEFX7NCZLW4SLYCGL7/graph.json","events_json":"https://pith.science/api/pith-number/G473JKC6KEFX7NCZLW4SLYCGL7/events.json","paper":"https://pith.science/paper/G473JKC6"},"agent_actions":{"view_html":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7","download_json":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7.json","view_paper":"https://pith.science/paper/G473JKC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.4778&json=true","fetch_graph":"https://pith.science/api/pith-number/G473JKC6KEFX7NCZLW4SLYCGL7/graph.json","fetch_events":"https://pith.science/api/pith-number/G473JKC6KEFX7NCZLW4SLYCGL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7/action/storage_attestation","attest_author":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7/action/author_attestation","sign_citation":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7/action/citation_signature","submit_replication":"https://pith.science/pith/G473JKC6KEFX7NCZLW4SLYCGL7/action/replication_record"}},"created_at":"2026-05-18T04:36:33.953519+00:00","updated_at":"2026-05-18T04:36:33.953519+00:00"}