{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6GLM3OB3P5YWDGGNYGXLHDIIVN","short_pith_number":"pith:6GLM3OB3","schema_version":"1.0","canonical_sha256":"f196cdb83b7f716198cdc1aeb38d08ab6474c85e5e490b108c6c5416855d81a7","source":{"kind":"arxiv","id":"2607.16103","version":1},"attestation_state":"computed","paper":{"title":"An improved upper bound for the planar Tur\\'an number of $C_8$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Weichan Liu, Xiangxiang Nie, Xin Zhang, Xuqing Bai","submitted_at":"2026-07-17T16:38:27Z","abstract_excerpt":"We prove that every $n$-vertex simple planar graph with no copy of $C_8$ has at most \\[\n  \\frac{69}{25}(n-2) \\] edges, for every $n\\ge 8$. This improves the best known bound \\[\n  \\frac{323}{108}n-6\n  \\qquad \\text{for every } n\\ge 27. \\]"},"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":"2607.16103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:38:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fcc53017600ef87a6f1762fbec2f54c6f5d8d01660a6d94449c55d5188340baa","abstract_canon_sha256":"aacb910d7bd4091322aaf16b228c340809e8605f3d1444331aaabbe09f5ace8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T02:19:31.021656Z","signature_b64":"6tzAhPgHKD61fZ1g4WWI3uDYzPEmI8DWwZ6cCcHBHSMenJhcVD/+m4FyqaMLZNDvYk5gdr94YL6+D3Nwn4m/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f196cdb83b7f716198cdc1aeb38d08ab6474c85e5e490b108c6c5416855d81a7","last_reissued_at":"2026-07-20T02:19:31.020801Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T02:19:31.020801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved upper bound for the planar Tur\\'an number of $C_8$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Weichan Liu, Xiangxiang Nie, Xin Zhang, Xuqing Bai","submitted_at":"2026-07-17T16:38:27Z","abstract_excerpt":"We prove that every $n$-vertex simple planar graph with no copy of $C_8$ has at most \\[\n  \\frac{69}{25}(n-2) \\] edges, for every $n\\ge 8$. This improves the best known bound \\[\n  \\frac{323}{108}n-6\n  \\qquad \\text{for every } n\\ge 27. \\]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16103","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.16103/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.16103","created_at":"2026-07-20T02:19:31.021245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16103v1","created_at":"2026-07-20T02:19:31.021245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16103","created_at":"2026-07-20T02:19:31.021245+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GLM3OB3P5YW","created_at":"2026-07-20T02:19:31.021245+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GLM3OB3P5YWDGGN","created_at":"2026-07-20T02:19:31.021245+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GLM3OB3","created_at":"2026-07-20T02:19:31.021245+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/6GLM3OB3P5YWDGGNYGXLHDIIVN","json":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN.json","graph_json":"https://pith.science/api/pith-number/6GLM3OB3P5YWDGGNYGXLHDIIVN/graph.json","events_json":"https://pith.science/api/pith-number/6GLM3OB3P5YWDGGNYGXLHDIIVN/events.json","paper":"https://pith.science/paper/6GLM3OB3"},"agent_actions":{"view_html":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN","download_json":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN.json","view_paper":"https://pith.science/paper/6GLM3OB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16103&json=true","fetch_graph":"https://pith.science/api/pith-number/6GLM3OB3P5YWDGGNYGXLHDIIVN/graph.json","fetch_events":"https://pith.science/api/pith-number/6GLM3OB3P5YWDGGNYGXLHDIIVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/action/storage_attestation","attest_author":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/action/author_attestation","sign_citation":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/action/citation_signature","submit_replication":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/action/replication_record"}},"created_at":"2026-07-20T02:19:31.021245+00:00","updated_at":"2026-07-20T02:19:31.021245+00:00"}