{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CVOUKEBMRWIX2FPFTBRFLZ3UXG","short_pith_number":"pith:CVOUKEBM","schema_version":"1.0","canonical_sha256":"155d45102c8d917d15e5986255e774b9ba133bbfe768baf1611dacfe641831ca","source":{"kind":"arxiv","id":"1303.5156","version":2},"attestation_state":"computed","paper":{"title":"Choosability of the square of a planar graph with maximum degree four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Riste \\v{S}krekovski, Rok Erman","submitted_at":"2013-03-21T03:59:00Z","abstract_excerpt":"We study squares of planar graphs with the aim to determine their list chromatic number. We present new upper bounds for the square of a planar graph with maximum degree $\\Delta \\leq 4$. In particular $G^2$ is 5-, 6-, 7-, 8-, 12-, 14-choosable if the girth of $G$ is at least 16, 11, 9, 7, 5, 3 respectively. In fact we prove more general results, in terms of maximum average degree, that imply the results above."},"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":"1303.5156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T03:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"afbb9cef2c7ead571856ad78313e5736ccbd57d8019ac4cb180121dfecd8b4c9","abstract_canon_sha256":"9756704f640e0caac2e652c6840e80051274c5eede33430617245037ff3a5980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:52.992792Z","signature_b64":"LnLGTPDOTyM0588xWSkHJh1hshzM3RnOPckVpbu8r08s6WYyS2Lefp0Vut9MqfeFmXPV1nxwm0JTnIhgjLFtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155d45102c8d917d15e5986255e774b9ba133bbfe768baf1611dacfe641831ca","last_reissued_at":"2026-05-18T01:35:52.992037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:52.992037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Choosability of the square of a planar graph with maximum degree four","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel W. Cranston, Riste \\v{S}krekovski, Rok Erman","submitted_at":"2013-03-21T03:59:00Z","abstract_excerpt":"We study squares of planar graphs with the aim to determine their list chromatic number. We present new upper bounds for the square of a planar graph with maximum degree $\\Delta \\leq 4$. In particular $G^2$ is 5-, 6-, 7-, 8-, 12-, 14-choosable if the girth of $G$ is at least 16, 11, 9, 7, 5, 3 respectively. In fact we prove more general results, in terms of maximum average degree, that imply the results above."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5156","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":"1303.5156","created_at":"2026-05-18T01:35:52.992185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5156v2","created_at":"2026-05-18T01:35:52.992185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5156","created_at":"2026-05-18T01:35:52.992185+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVOUKEBMRWIX","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVOUKEBMRWIX2FPF","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVOUKEBM","created_at":"2026-05-18T12:27:40.988391+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":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG","json":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG.json","graph_json":"https://pith.science/api/pith-number/CVOUKEBMRWIX2FPFTBRFLZ3UXG/graph.json","events_json":"https://pith.science/api/pith-number/CVOUKEBMRWIX2FPFTBRFLZ3UXG/events.json","paper":"https://pith.science/paper/CVOUKEBM"},"agent_actions":{"view_html":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG","download_json":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG.json","view_paper":"https://pith.science/paper/CVOUKEBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5156&json=true","fetch_graph":"https://pith.science/api/pith-number/CVOUKEBMRWIX2FPFTBRFLZ3UXG/graph.json","fetch_events":"https://pith.science/api/pith-number/CVOUKEBMRWIX2FPFTBRFLZ3UXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG/action/storage_attestation","attest_author":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG/action/author_attestation","sign_citation":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG/action/citation_signature","submit_replication":"https://pith.science/pith/CVOUKEBMRWIX2FPFTBRFLZ3UXG/action/replication_record"}},"created_at":"2026-05-18T01:35:52.992185+00:00","updated_at":"2026-05-18T01:35:52.992185+00:00"}