{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FGGDOVNUHZXH7KAXALZGULARUK","short_pith_number":"pith:FGGDOVNU","schema_version":"1.0","canonical_sha256":"298c3755b43e6e7fa81702f26a2c11a2bede7375861426d4a8079553acde943f","source":{"kind":"arxiv","id":"1509.00760","version":1},"attestation_state":"computed","paper":{"title":"Constructing a Family of 4-Critical Planar Graphs with High Edge-Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yao Tianxing, Zhou Guofei","submitted_at":"2015-09-02T15:54:40Z","abstract_excerpt":"A graph $G=(V,E)$ is a $k$-critical graph if $G$ is not $(k -1)$-colorable but $G-e$ is $(k-1)$-colorable for every $e\\in E(G)$. In this paper, we construct a family of 4-critical planar graphs with $n$ vertices and $\\frac{7n-13}{3}$ edges. As a consequence, this improved the bound for the maximum edge density obtained by Abbott and Zhou. We conjecture that this is the largest edge density for a 4-critical planar graph."},"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":"1509.00760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T15:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"c550c9587fdd45ebc93c61939fd67bd954af9cec694b847c43cac93f2ac7838c","abstract_canon_sha256":"8c24024ee895da9d888ed15347ac9ed26b625c390b87d2e5e950b3587cc07ff6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:06.111393Z","signature_b64":"RCAFb8ypB2HunPUVToFX0MUHzEixwTDm7zWERK6DmNA06EOUjZ9KDWOh7ug3TAZ4z8X87qcS1SB11GICGqZsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"298c3755b43e6e7fa81702f26a2c11a2bede7375861426d4a8079553acde943f","last_reissued_at":"2026-05-18T01:34:06.110840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:06.110840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing a Family of 4-Critical Planar Graphs with High Edge-Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yao Tianxing, Zhou Guofei","submitted_at":"2015-09-02T15:54:40Z","abstract_excerpt":"A graph $G=(V,E)$ is a $k$-critical graph if $G$ is not $(k -1)$-colorable but $G-e$ is $(k-1)$-colorable for every $e\\in E(G)$. In this paper, we construct a family of 4-critical planar graphs with $n$ vertices and $\\frac{7n-13}{3}$ edges. As a consequence, this improved the bound for the maximum edge density obtained by Abbott and Zhou. We conjecture that this is the largest edge density for a 4-critical planar graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00760","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":"1509.00760","created_at":"2026-05-18T01:34:06.110932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00760v1","created_at":"2026-05-18T01:34:06.110932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00760","created_at":"2026-05-18T01:34:06.110932+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGGDOVNUHZXH","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGGDOVNUHZXH7KAX","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGGDOVNU","created_at":"2026-05-18T12:29:19.899920+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/FGGDOVNUHZXH7KAXALZGULARUK","json":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK.json","graph_json":"https://pith.science/api/pith-number/FGGDOVNUHZXH7KAXALZGULARUK/graph.json","events_json":"https://pith.science/api/pith-number/FGGDOVNUHZXH7KAXALZGULARUK/events.json","paper":"https://pith.science/paper/FGGDOVNU"},"agent_actions":{"view_html":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK","download_json":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK.json","view_paper":"https://pith.science/paper/FGGDOVNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00760&json=true","fetch_graph":"https://pith.science/api/pith-number/FGGDOVNUHZXH7KAXALZGULARUK/graph.json","fetch_events":"https://pith.science/api/pith-number/FGGDOVNUHZXH7KAXALZGULARUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK/action/storage_attestation","attest_author":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK/action/author_attestation","sign_citation":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK/action/citation_signature","submit_replication":"https://pith.science/pith/FGGDOVNUHZXH7KAXALZGULARUK/action/replication_record"}},"created_at":"2026-05-18T01:34:06.110932+00:00","updated_at":"2026-05-18T01:34:06.110932+00:00"}