{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6GLM3OB3P5YWDGGNYGXLHDIIVN","short_pith_number":"pith:6GLM3OB3","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"},"canonical_sha256":"f196cdb83b7f716198cdc1aeb38d08ab6474c85e5e490b108c6c5416855d81a7","source":{"kind":"arxiv","id":"2607.16103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16103","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16103v1","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16103","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"6GLM3OB3P5YW","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"6GLM3OB3P5YWDGGN","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"6GLM3OB3","created_at":"2026-07-20T02:19:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6GLM3OB3P5YWDGGNYGXLHDIIVN","target":"record","payload":{"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"},"canonical_sha256":"f196cdb83b7f716198cdc1aeb38d08ab6474c85e5e490b108c6c5416855d81a7","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"},"source_kind":"arxiv","source_id":"2607.16103","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-20T02:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfNpDx6ImSGvhMI0fPzDOYFFRi0EiKTczAnDPkd7Ls8DzJyGQGbc/iefuRDifeHgkDc2oMW8z4KCuWKkXqZ1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:48:24.070531Z"},"content_sha256":"36e9d7226d3556c3804ca0c63ff74bfd50708c4d90747cdf7a0ada60ceb2fe3a","schema_version":"1.0","event_id":"sha256:36e9d7226d3556c3804ca0c63ff74bfd50708c4d90747cdf7a0ada60ceb2fe3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6GLM3OB3P5YWDGGNYGXLHDIIVN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-20T02:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBjAm0H2hfk24BwVKWzDCDQRZ6uYd9K3++VM9dvfRYVkPXD4sEKPX9kalWBhzsmOz3BgtFq86j1u3MYQ1pK5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:48:24.075652Z"},"content_sha256":"a416d11b43a5b75fd06dfc64322e4160c4a8f5585638d2af7cc737f3135cc8e7","schema_version":"1.0","event_id":"sha256:a416d11b43a5b75fd06dfc64322e4160c4a8f5585638d2af7cc737f3135cc8e7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:6GLM3OB3P5YWDGGNYGXLHDIIVN","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.15960/j.cnki.issn.1007-6093.2021.03.013) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Y. Lan, Y. Shi, and Z.-X. Song. Planar Turán number and planar anti-Ramsey number of graphs.Oper. Res. Trans., 25(3):201–216, 2021.doi:10.15960/j.cnki.issn.1007-6093. 2021.03.013","arxiv_id":"2607.16103","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.15960/j.cnki.issn.1007-6093","reconstructed_doi":"10.15960/j.cnki.issn.1007-6093.2021.03.013"},"severity":"advisory","ref_index":6,"audited_at":"2026-08-01T21:29:56.012206Z","event_type":"pith.integrity.v1","detected_doi":"10.15960/j.cnki.issn.1007-6093.2021.03.013","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"bc5851ef35757f015d2f429bfeb4f7fec3a572d746ce0b15ed2e6af5d6340d15","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":16655,"payload_sha256":"fe65c065e701f1514cdfe2fe1d910f7a983a923a259b95ec95a4ec0e059e0340","signature_b64":"DIXfOyMylXgTVGBlEAAJfASpETGt7Swc6wtWWUavfELdOCPrlPi3H4tdjV8idztKvDZ/uoQLsOchmqr//SYsCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T21:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ihcey9S/xFUjToQ3pZPyg+SRwGBv61smLmfBUpSJWKbqUVXgQPEY0qP9vHkvIHZnNo9O4g7KhlmWVwzm3paRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:48:24.112949Z"},"content_sha256":"f47dfab29e9b02913a79e3d1496b9b5e5a75fb598493cce45d979c20420bac87","schema_version":"1.0","event_id":"sha256:f47dfab29e9b02913a79e3d1496b9b5e5a75fb598493cce45d979c20420bac87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/bundle.json","state_url":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T14:48:24Z","links":{"resolver":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN","bundle":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/bundle.json","state":"https://pith.science/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GLM3OB3P5YWDGGNYGXLHDIIVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6GLM3OB3P5YWDGGNYGXLHDIIVN","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aacb910d7bd4091322aaf16b228c340809e8605f3d1444331aaabbe09f5ace8f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:38:27Z","title_canon_sha256":"fcc53017600ef87a6f1762fbec2f54c6f5d8d01660a6d94449c55d5188340baa"},"schema_version":"1.0","source":{"id":"2607.16103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16103","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16103v1","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16103","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"6GLM3OB3P5YW","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"6GLM3OB3P5YWDGGN","created_at":"2026-07-20T02:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"6GLM3OB3","created_at":"2026-07-20T02:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:a416d11b43a5b75fd06dfc64322e4160c4a8f5585638d2af7cc737f3135cc8e7","target":"graph","created_at":"2026-07-20T02:19:31Z","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/2607.16103/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. \\]","authors_text":"Weichan Liu, Xiangxiang Nie, Xin Zhang, Xuqing Bai","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:38:27Z","title":"An improved upper bound for the planar Tur\\'an number of $C_8$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16103","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:36e9d7226d3556c3804ca0c63ff74bfd50708c4d90747cdf7a0ada60ceb2fe3a","target":"record","created_at":"2026-07-20T02:19:31Z","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":"aacb910d7bd4091322aaf16b228c340809e8605f3d1444331aaabbe09f5ace8f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T16:38:27Z","title_canon_sha256":"fcc53017600ef87a6f1762fbec2f54c6f5d8d01660a6d94449c55d5188340baa"},"schema_version":"1.0","source":{"id":"2607.16103","kind":"arxiv","version":1}},"canonical_sha256":"f196cdb83b7f716198cdc1aeb38d08ab6474c85e5e490b108c6c5416855d81a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f196cdb83b7f716198cdc1aeb38d08ab6474c85e5e490b108c6c5416855d81a7","first_computed_at":"2026-07-20T02:19:31.020801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-20T02:19:31.020801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6tzAhPgHKD61fZ1g4WWI3uDYzPEmI8DWwZ6cCcHBHSMenJhcVD/+m4FyqaMLZNDvYk5gdr94YL6+D3Nwn4m/BQ==","signature_status":"signed_v1","signed_at":"2026-07-20T02:19:31.021656Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.16103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e9d7226d3556c3804ca0c63ff74bfd50708c4d90747cdf7a0ada60ceb2fe3a","sha256:a416d11b43a5b75fd06dfc64322e4160c4a8f5585638d2af7cc737f3135cc8e7","sha256:f47dfab29e9b02913a79e3d1496b9b5e5a75fb598493cce45d979c20420bac87"],"state_sha256":"2f291b3a6e4f96dd5c888a539de9e56ef5b83a3e43a365040a8375478109014e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJneRYbqQ3LJeX9JHYKbO6syQxTPHYmFrd5lMzdLXtygFqPrAlHz40UqIT/Pg4zP0triYCMK41qx5kljkOFfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:48:24.199610Z","bundle_sha256":"2154c5f8f679e31d1fecc58ab9359d9496b6d189e937a13ab8ca6ed7cafa1cc3"}}