{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:QFQ5E2NQTY5GBM7SGY4N5SPTC2","short_pith_number":"pith:QFQ5E2NQ","schema_version":"1.0","canonical_sha256":"8161d269b09e3a60b3f23638dec9f3169a3ce1de9cae7808e9abefc9f451815a","source":{"kind":"arxiv","id":"0807.3233","version":2},"attestation_state":"computed","paper":{"title":"List Colouring Squares of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Reed, Colin McDiarmid, Fr\\'ed\\'eric Havet, Jan van den Heuvel","submitted_at":"2008-07-21T10:39:56Z","abstract_excerpt":"In 1977, Wegner conjectured that the chromatic number of the square of every planar graph $G$ with maximum degree $\\Delta\\ge8$ is at most $\\bigl\\lfloor\\frac32\\Delta\\bigr\\rfloor+1$. We show that it is at most $\\frac32 \\Delta (1+o(1))$ (where the $o(1)$ is as $\\Delta\\to+\\infty$), and indeed that this is true for the list chromatic number and for more general classes of graphs."},"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":"0807.3233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-07-21T10:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"21e22d08b5a2e5f8863c0ac1f394985d58e039d208182e89dba03ecd2270d007","abstract_canon_sha256":"8d84f7d3a3d6cc2f76d45f3820d6f8e6c9dc48acc6b27c9c67c76a68f539e652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:34.081205Z","signature_b64":"s9Fi4ObKX5/SeWXwzFVJFMxsQiY3/7kE3B7riG8xDYAEgfXcpm0izXCUemKoQgNPq8pnv94yxC0Lbex2Cpi/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8161d269b09e3a60b3f23638dec9f3169a3ce1de9cae7808e9abefc9f451815a","last_reissued_at":"2026-05-18T00:44:34.080812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:34.080812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List Colouring Squares of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruce Reed, Colin McDiarmid, Fr\\'ed\\'eric Havet, Jan van den Heuvel","submitted_at":"2008-07-21T10:39:56Z","abstract_excerpt":"In 1977, Wegner conjectured that the chromatic number of the square of every planar graph $G$ with maximum degree $\\Delta\\ge8$ is at most $\\bigl\\lfloor\\frac32\\Delta\\bigr\\rfloor+1$. We show that it is at most $\\frac32 \\Delta (1+o(1))$ (where the $o(1)$ is as $\\Delta\\to+\\infty$), and indeed that this is true for the list chromatic number and for more general classes of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.3233","kind":"arxiv","version":2},"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":"0807.3233","created_at":"2026-05-18T00:44:34.080879+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.3233v2","created_at":"2026-05-18T00:44:34.080879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.3233","created_at":"2026-05-18T00:44:34.080879+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFQ5E2NQTY5G","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFQ5E2NQTY5GBM7S","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFQ5E2NQ","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":92,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14006","citing_title":"Coloring powers of random graphs","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2","json":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2.json","graph_json":"https://pith.science/api/pith-number/QFQ5E2NQTY5GBM7SGY4N5SPTC2/graph.json","events_json":"https://pith.science/api/pith-number/QFQ5E2NQTY5GBM7SGY4N5SPTC2/events.json","paper":"https://pith.science/paper/QFQ5E2NQ"},"agent_actions":{"view_html":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2","download_json":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2.json","view_paper":"https://pith.science/paper/QFQ5E2NQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.3233&json=true","fetch_graph":"https://pith.science/api/pith-number/QFQ5E2NQTY5GBM7SGY4N5SPTC2/graph.json","fetch_events":"https://pith.science/api/pith-number/QFQ5E2NQTY5GBM7SGY4N5SPTC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2/action/storage_attestation","attest_author":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2/action/author_attestation","sign_citation":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2/action/citation_signature","submit_replication":"https://pith.science/pith/QFQ5E2NQTY5GBM7SGY4N5SPTC2/action/replication_record"}},"created_at":"2026-05-18T00:44:34.080879+00:00","updated_at":"2026-05-18T00:44:34.080879+00:00"}