{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XTQMONJJWU66BO3LBHATNBB353","short_pith_number":"pith:XTQMONJJ","schema_version":"1.0","canonical_sha256":"bce0c73529b53de0bb6b09c136843beef8d70454fbadc543af4fd337550f872f","source":{"kind":"arxiv","id":"1212.1029","version":3},"attestation_state":"computed","paper":{"title":"The Distance Coloring of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lian-Ying Miao, Yi-Zheng Fan","submitted_at":"2012-12-05T14:03:43Z","abstract_excerpt":"Let $G$ be a connected graph with maximum degree $\\Delta \\ge 3$. We investigate the upper bound for the chromatic number $\\chi_\\gamma(G)$ of the power graph $G^\\gamma$. It was proved that $\\chi_\\gamma(G) \\le\\Delta\\frac{(\\Delta-1)^{\\gamma}-1}{\\Delta-2}+1=:M+1$ with equality if and only $G$ is a Moore graph. If $G$ is not a Moore graph, and $G$ holds one of the following conditions: (1) $G$ is non-regular, (2) the girth $g(G) \\le 2\\gamma-1$, (3) $g(G) \\ge 2\\gamma+2$, and the connectivity $\\kappa(G) \\ge 3$ if $\\gamma \\ge 3$, $\\kappa(G) \\ge 4$ but $g(G) >6$ if $\\gamma =2$, (4) $\\Delta$ is sufficie"},"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":"1212.1029","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-05T14:03:43Z","cross_cats_sorted":[],"title_canon_sha256":"82d360219c09602bbb5810cf9674cefd02fa7aa9c36d031d2ee1117ef7bf240e","abstract_canon_sha256":"30f54d5fdf77578d09de7390b2a4c7313e1e2303dd00f25357f89adb04dc2e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.199277Z","signature_b64":"nRb8QVZySKwJRuIO3C37eo2s1qfDkc/bP6fhpDXst9KQjTyH1xtFhYTODfIC3sWxp3HSjJjUqEewYJEMA1saDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bce0c73529b53de0bb6b09c136843beef8d70454fbadc543af4fd337550f872f","last_reissued_at":"2026-05-18T02:41:09.198838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.198838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Distance Coloring of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lian-Ying Miao, Yi-Zheng Fan","submitted_at":"2012-12-05T14:03:43Z","abstract_excerpt":"Let $G$ be a connected graph with maximum degree $\\Delta \\ge 3$. We investigate the upper bound for the chromatic number $\\chi_\\gamma(G)$ of the power graph $G^\\gamma$. It was proved that $\\chi_\\gamma(G) \\le\\Delta\\frac{(\\Delta-1)^{\\gamma}-1}{\\Delta-2}+1=:M+1$ with equality if and only $G$ is a Moore graph. If $G$ is not a Moore graph, and $G$ holds one of the following conditions: (1) $G$ is non-regular, (2) the girth $g(G) \\le 2\\gamma-1$, (3) $g(G) \\ge 2\\gamma+2$, and the connectivity $\\kappa(G) \\ge 3$ if $\\gamma \\ge 3$, $\\kappa(G) \\ge 4$ but $g(G) >6$ if $\\gamma =2$, (4) $\\Delta$ is sufficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1029","kind":"arxiv","version":3},"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":"1212.1029","created_at":"2026-05-18T02:41:09.198902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1029v3","created_at":"2026-05-18T02:41:09.198902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1029","created_at":"2026-05-18T02:41:09.198902+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTQMONJJWU66","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTQMONJJWU66BO3L","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTQMONJJ","created_at":"2026-05-18T12:27:27.928770+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/XTQMONJJWU66BO3LBHATNBB353","json":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353.json","graph_json":"https://pith.science/api/pith-number/XTQMONJJWU66BO3LBHATNBB353/graph.json","events_json":"https://pith.science/api/pith-number/XTQMONJJWU66BO3LBHATNBB353/events.json","paper":"https://pith.science/paper/XTQMONJJ"},"agent_actions":{"view_html":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353","download_json":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353.json","view_paper":"https://pith.science/paper/XTQMONJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1029&json=true","fetch_graph":"https://pith.science/api/pith-number/XTQMONJJWU66BO3LBHATNBB353/graph.json","fetch_events":"https://pith.science/api/pith-number/XTQMONJJWU66BO3LBHATNBB353/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353/action/storage_attestation","attest_author":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353/action/author_attestation","sign_citation":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353/action/citation_signature","submit_replication":"https://pith.science/pith/XTQMONJJWU66BO3LBHATNBB353/action/replication_record"}},"created_at":"2026-05-18T02:41:09.198902+00:00","updated_at":"2026-05-18T02:41:09.198902+00:00"}