{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WA6YPUHYIS7JCG5HCBF3NRK5LW","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":"cb7f476f1f431983ba79b3405d2f2f8dc86c0323950e7053a3dc0bc70d22f17e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-03T02:34:37Z","title_canon_sha256":"919027f996b8afada4af90d0bb1b1f4e770125f908fb495ae5291a1eb6b679e6"},"schema_version":"1.0","source":{"id":"2209.01312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.01312","created_at":"2026-07-05T04:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"2209.01312v1","created_at":"2026-07-05T04:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.01312","created_at":"2026-07-05T04:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"WA6YPUHYIS7J","created_at":"2026-07-05T04:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"WA6YPUHYIS7JCG5H","created_at":"2026-07-05T04:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"WA6YPUHY","created_at":"2026-07-05T04:54:27Z"}],"graph_snapshots":[{"event_id":"sha256:e794ee79a38a8944a25996d91ff7fd4d6543fca60fbdccf9737a3a998ba11ebd","target":"graph","created_at":"2026-07-05T04:54:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.01312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The planar Tur\\'an number of a graph $H$, denoted by $ex_{_\\mathcal{P}}(n,H)$, is the largest number of edges in a planar graph on $n $ vertices without containing $H$ as a subgraph. In this paper, we continue to study the topic of \"extremal\" planar graphs initiated by Dowden [J. Graph Theory 83 (2016) 213--230]. We first obtain an improved lower bound for $ex_{_\\mathcal{P}}(n,C_k)$ for all $k\\ge 13$ and $n\\ge 5(k-6+\\lfloor{(k-1)}/2\\rfloor)(k-1)/2$; the construction for each $k$ and $n$ provides a simpler counterexample to a conjecture of Ghosh, Gy\\H{o}ri, Martin, Paulos and Xiao [arxiv:2004.1","authors_text":"Yongxin Lan, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-03T02:34:37Z","title":"An improved lower bound for the planar Tur\\'an number of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.01312","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:b311c3194e7a1eaa1bad8831738b9327644105dbed22c5dcd02dbeab66936b46","target":"record","created_at":"2026-07-05T04:54:27Z","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":"cb7f476f1f431983ba79b3405d2f2f8dc86c0323950e7053a3dc0bc70d22f17e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-03T02:34:37Z","title_canon_sha256":"919027f996b8afada4af90d0bb1b1f4e770125f908fb495ae5291a1eb6b679e6"},"schema_version":"1.0","source":{"id":"2209.01312","kind":"arxiv","version":1}},"canonical_sha256":"b03d87d0f844be911ba7104bb6c55d5daea265a62d37f0d546092469c6f1909b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b03d87d0f844be911ba7104bb6c55d5daea265a62d37f0d546092469c6f1909b","first_computed_at":"2026-07-05T04:54:27.861925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:54:27.861925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bt3JX4DamSHbxqLW6drm8bx0h3t7OOfE7YOrlMwk/5vDimpyGFuhCxMETPuN0GSDwgR+IuFpKrnE5FLoqg5OAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:54:27.862305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.01312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b311c3194e7a1eaa1bad8831738b9327644105dbed22c5dcd02dbeab66936b46","sha256:e794ee79a38a8944a25996d91ff7fd4d6543fca60fbdccf9737a3a998ba11ebd"],"state_sha256":"ddb5f05fab642b78b7d173fc24a2fcad22b075a8eb09def5c0c320c6ee20b665"}