{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XDGOEIBRHQVAYKUEYEVHVR6HDE","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":"a3bb2a3822787ebb239300a247c05f883128a8ecbad217a5fc1353c73b32ec7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T14:41:45Z","title_canon_sha256":"3a1ed2587c18491622b77125f566986b5b67119cc1697408f40cfc0a4904929c"},"schema_version":"1.0","source":{"id":"1808.01487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01487","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01487v1","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01487","created_at":"2026-05-18T00:08:52Z"},{"alias_kind":"pith_short_12","alias_value":"XDGOEIBRHQVA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XDGOEIBRHQVAYKUE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XDGOEIBR","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:78f9f1f12ad9b4c9d16c9c0465ca61feb52db0a68a346c449f83002fac238840","target":"graph","created_at":"2026-05-18T00:08:52Z","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":"Given a graph $H$, a graph is $H$-free if it does not contain $H$ as a subgraph. We continue to study the topic of \"extremal\" planar graphs, that is, how many edges can an $H$-free planar graph on $n$ vertices have? We define $ex_{_\\mathcal{P}}(n,H)$ to be the maximum number of edges in an $H$-free planar graph on $n $ vertices. We first obtain several sufficient conditions on $H$ which yield $ex_{_\\mathcal{P}}(n,H)=3n-6$ for all $n\\ge |V(H)|$. We discover that the chromatic number of $H$ does not play a role, as in the celebrated Erd\\H{o}s-Stone Theorem. We then completely determine $ex_{_\\ma","authors_text":"Yongtang Shi, Yongxin Lan, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T14:41:45Z","title":"Extremal $H$-free planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01487","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:fe996d6ca5b722785728ba0bfb517a59e353ea73ed4cdfd3ce5e7ee6931c746d","target":"record","created_at":"2026-05-18T00:08:52Z","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":"a3bb2a3822787ebb239300a247c05f883128a8ecbad217a5fc1353c73b32ec7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T14:41:45Z","title_canon_sha256":"3a1ed2587c18491622b77125f566986b5b67119cc1697408f40cfc0a4904929c"},"schema_version":"1.0","source":{"id":"1808.01487","kind":"arxiv","version":1}},"canonical_sha256":"b8cce220313c2a0c2a84c12a7ac7c71906412c5ffc6de8369dcccc372c94c661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8cce220313c2a0c2a84c12a7ac7c71906412c5ffc6de8369dcccc372c94c661","first_computed_at":"2026-05-18T00:08:52.811449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:52.811449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jgT3F8kkJie/l8++38gkHXr0u0hQX/YF9GP/QmCwD+UY1tKWCSXVJ2o8uV8xYciE79bukmgnf/A+uc7Jod8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:52.812303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe996d6ca5b722785728ba0bfb517a59e353ea73ed4cdfd3ce5e7ee6931c746d","sha256:78f9f1f12ad9b4c9d16c9c0465ca61feb52db0a68a346c449f83002fac238840"],"state_sha256":"3a4b3370c78cd8b10033187fcc71af8d97287b5b6a0849fc5d224c9cac940e52"}