{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KQ7R2P42AZLMWTSYXNSRZ4LVKN","short_pith_number":"pith:KQ7R2P42","schema_version":"1.0","canonical_sha256":"543f1d3f9a0656cb4e58bb651cf175536cd37cc6d17adcb341fe6e82bf1ac1cd","source":{"kind":"arxiv","id":"1603.02310","version":1},"attestation_state":"computed","paper":{"title":"On almost-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emily Marshall, Guoli Ding, Joshua Fallon","submitted_at":"2016-03-07T21:53:53Z","abstract_excerpt":"A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small portion of it was published. The main purpose of this paper is to provide a short proof of this result. We also discuss the structure of almost-planar graphs that are not 3-connected."},"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":"1603.02310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-07T21:53:53Z","cross_cats_sorted":[],"title_canon_sha256":"8d32d51b2efce31e3494bce98ee3254178d8d6ebc0d9217885f4d97cc61f0885","abstract_canon_sha256":"ac7e2a299eecd69af38c066b0412d23b9355ccf46734b1f2b9b19df9b5de4dc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:23.762208Z","signature_b64":"Bm+wU3lzRXAAzcyHy/JMW49VAiPEzEndEUpTrVeWE+LdGdtbEVUgj1jy93o/Z2VJ7lc/A6tixl3Rx+9mBWIDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543f1d3f9a0656cb4e58bb651cf175536cd37cc6d17adcb341fe6e82bf1ac1cd","last_reissued_at":"2026-05-18T01:19:23.761341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:23.761341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On almost-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emily Marshall, Guoli Ding, Joshua Fallon","submitted_at":"2016-03-07T21:53:53Z","abstract_excerpt":"A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small portion of it was published. The main purpose of this paper is to provide a short proof of this result. We also discuss the structure of almost-planar graphs that are not 3-connected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02310","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":"1603.02310","created_at":"2026-05-18T01:19:23.761503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02310v1","created_at":"2026-05-18T01:19:23.761503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02310","created_at":"2026-05-18T01:19:23.761503+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQ7R2P42AZLM","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQ7R2P42AZLMWTSY","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQ7R2P42","created_at":"2026-05-18T12:30:25.849896+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/KQ7R2P42AZLMWTSYXNSRZ4LVKN","json":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN.json","graph_json":"https://pith.science/api/pith-number/KQ7R2P42AZLMWTSYXNSRZ4LVKN/graph.json","events_json":"https://pith.science/api/pith-number/KQ7R2P42AZLMWTSYXNSRZ4LVKN/events.json","paper":"https://pith.science/paper/KQ7R2P42"},"agent_actions":{"view_html":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN","download_json":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN.json","view_paper":"https://pith.science/paper/KQ7R2P42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02310&json=true","fetch_graph":"https://pith.science/api/pith-number/KQ7R2P42AZLMWTSYXNSRZ4LVKN/graph.json","fetch_events":"https://pith.science/api/pith-number/KQ7R2P42AZLMWTSYXNSRZ4LVKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN/action/storage_attestation","attest_author":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN/action/author_attestation","sign_citation":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN/action/citation_signature","submit_replication":"https://pith.science/pith/KQ7R2P42AZLMWTSYXNSRZ4LVKN/action/replication_record"}},"created_at":"2026-05-18T01:19:23.761503+00:00","updated_at":"2026-05-18T01:19:23.761503+00:00"}