{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GCIM6JSCAZKD2CHVRPBOLP6C5U","short_pith_number":"pith:GCIM6JSC","schema_version":"1.0","canonical_sha256":"3090cf264206543d08f58bc2e5bfc2ed17c2bdbf6f07258855fa27a5e730b622","source":{"kind":"arxiv","id":"1505.03197","version":1},"attestation_state":"computed","paper":{"title":"List-coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bobby Jaeger, Daniel W. Cranston","submitted_at":"2015-05-13T00:14:51Z","abstract_excerpt":"Let $G$ be a planar graph without 4-cycles and 5-cycles and with maximum degree $\\Delta\\ge 32$. We prove that $\\chi_{\\ell}(G^2)\\le \\Delta+3$. For arbitrarily large maximum degree $\\Delta$, there exist planar graphs $G_{\\Delta}$ of girth 6 with $\\chi(G_{\\Delta}^2)=\\Delta+2$. Thus, our bound is within 1 of being optimal. Further, our bound comes from coloring greedily in a good order, so the bound immediately extends to online list-coloring. In addition, we prove bounds for $L(p,q)$-labeling. Specifically, $\\lambda_{2,1}(G)\\le \\Delta+8$ and, more generally, $\\lambda_{p,q}(G)\\le (2q-1)\\Delta+6p-2"},"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":"1505.03197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-13T00:14:51Z","cross_cats_sorted":[],"title_canon_sha256":"245e2fd228d513d7b52d95e799addafd9c33c726d1fca271ba47fbd882056eca","abstract_canon_sha256":"5a50d8ca31c30acf8526a548147e5a4254888a8a6255603533fc9f22d6743f0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.481097Z","signature_b64":"l20p9KDhyUDLKIJMQtAjNHVOjBZi+exE4icQ4pd4Fp3/LbuXS3lEbJzv+EhQrKWByGgLjyiheF7Ar1qD6HlRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3090cf264206543d08f58bc2e5bfc2ed17c2bdbf6f07258855fa27a5e730b622","last_reissued_at":"2026-05-18T00:42:33.480544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.480544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bobby Jaeger, Daniel W. Cranston","submitted_at":"2015-05-13T00:14:51Z","abstract_excerpt":"Let $G$ be a planar graph without 4-cycles and 5-cycles and with maximum degree $\\Delta\\ge 32$. We prove that $\\chi_{\\ell}(G^2)\\le \\Delta+3$. For arbitrarily large maximum degree $\\Delta$, there exist planar graphs $G_{\\Delta}$ of girth 6 with $\\chi(G_{\\Delta}^2)=\\Delta+2$. Thus, our bound is within 1 of being optimal. Further, our bound comes from coloring greedily in a good order, so the bound immediately extends to online list-coloring. In addition, we prove bounds for $L(p,q)$-labeling. Specifically, $\\lambda_{2,1}(G)\\le \\Delta+8$ and, more generally, $\\lambda_{p,q}(G)\\le (2q-1)\\Delta+6p-2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03197","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":"1505.03197","created_at":"2026-05-18T00:42:33.480638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03197v1","created_at":"2026-05-18T00:42:33.480638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03197","created_at":"2026-05-18T00:42:33.480638+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCIM6JSCAZKD","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCIM6JSCAZKD2CHV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCIM6JSC","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U","json":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U.json","graph_json":"https://pith.science/api/pith-number/GCIM6JSCAZKD2CHVRPBOLP6C5U/graph.json","events_json":"https://pith.science/api/pith-number/GCIM6JSCAZKD2CHVRPBOLP6C5U/events.json","paper":"https://pith.science/paper/GCIM6JSC"},"agent_actions":{"view_html":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U","download_json":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U.json","view_paper":"https://pith.science/paper/GCIM6JSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03197&json=true","fetch_graph":"https://pith.science/api/pith-number/GCIM6JSCAZKD2CHVRPBOLP6C5U/graph.json","fetch_events":"https://pith.science/api/pith-number/GCIM6JSCAZKD2CHVRPBOLP6C5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U/action/storage_attestation","attest_author":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U/action/author_attestation","sign_citation":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U/action/citation_signature","submit_replication":"https://pith.science/pith/GCIM6JSCAZKD2CHVRPBOLP6C5U/action/replication_record"}},"created_at":"2026-05-18T00:42:33.480638+00:00","updated_at":"2026-05-18T00:42:33.480638+00:00"}