{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S67JAVSYLDMBUJSSSZSC6NRD27","short_pith_number":"pith:S67JAVSY","schema_version":"1.0","canonical_sha256":"97be90565858d81a265296642f3623d7dbbe4d70d6e7b3cad465f555ff29e757","source":{"kind":"arxiv","id":"1301.7090","version":1},"attestation_state":"computed","paper":{"title":"Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Benjamin L\\'ev\\^eque, Marthe Bonamy","submitted_at":"2013-01-29T22:44:52Z","abstract_excerpt":"For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbor receive different colors. It is already known that planar graphs of girth at least 6 and of maximum degree D are list 2-distance (D+2)-colorable when D>=24 (Borodin and Ivanova (2009)) and 2-distance (D+2)-colorable when D>=18 (Borodin and Ivanova (2009)). We prove here that D>=17 suffices in both cases. More generally, we show that graphs with maximum average degree less than 3 an"},"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":"1301.7090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-29T22:44:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"612de04bd7692ef687cf3c22cca82f24a67cc297b3f1a62349721aac08fe6a33","abstract_canon_sha256":"ba87d86fc2847da8b5f67bf6f7a4fac62578eb04e5d0f20a78cabf2ca495371f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:01.325656Z","signature_b64":"R6iCfoe90oE5QrG8NI/TuAdhyy4lVnn7pTnhFpH+7bp+fsItp/wg8ORI0WrGF5pqAMLCyoMs8vpLd0QmgSfjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97be90565858d81a265296642f3623d7dbbe4d70d6e7b3cad465f555ff29e757","last_reissued_at":"2026-05-18T03:35:01.324798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:01.324798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Benjamin L\\'ev\\^eque, Marthe Bonamy","submitted_at":"2013-01-29T22:44:52Z","abstract_excerpt":"For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbor receive different colors. It is already known that planar graphs of girth at least 6 and of maximum degree D are list 2-distance (D+2)-colorable when D>=24 (Borodin and Ivanova (2009)) and 2-distance (D+2)-colorable when D>=18 (Borodin and Ivanova (2009)). We prove here that D>=17 suffices in both cases. More generally, we show that graphs with maximum average degree less than 3 an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7090","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":"1301.7090","created_at":"2026-05-18T03:35:01.324924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7090v1","created_at":"2026-05-18T03:35:01.324924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7090","created_at":"2026-05-18T03:35:01.324924+00:00"},{"alias_kind":"pith_short_12","alias_value":"S67JAVSYLDMB","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S67JAVSYLDMBUJSS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S67JAVSY","created_at":"2026-05-18T12:27:59.945178+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":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27","json":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27.json","graph_json":"https://pith.science/api/pith-number/S67JAVSYLDMBUJSSSZSC6NRD27/graph.json","events_json":"https://pith.science/api/pith-number/S67JAVSYLDMBUJSSSZSC6NRD27/events.json","paper":"https://pith.science/paper/S67JAVSY"},"agent_actions":{"view_html":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27","download_json":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27.json","view_paper":"https://pith.science/paper/S67JAVSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7090&json=true","fetch_graph":"https://pith.science/api/pith-number/S67JAVSYLDMBUJSSSZSC6NRD27/graph.json","fetch_events":"https://pith.science/api/pith-number/S67JAVSYLDMBUJSSSZSC6NRD27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27/action/storage_attestation","attest_author":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27/action/author_attestation","sign_citation":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27/action/citation_signature","submit_replication":"https://pith.science/pith/S67JAVSYLDMBUJSSSZSC6NRD27/action/replication_record"}},"created_at":"2026-05-18T03:35:01.324924+00:00","updated_at":"2026-05-18T03:35:01.324924+00:00"}