{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ORRNBJTEQK4A7MYW6GWMAYDRNH","short_pith_number":"pith:ORRNBJTE","schema_version":"1.0","canonical_sha256":"7462d0a66482b80fb316f1acc0607169e68039db94851391d20a085d7d570845","source":{"kind":"arxiv","id":"1511.08826","version":2},"attestation_state":"computed","paper":{"title":"Colouring powers and girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Pirot, Ross J. Kang","submitted_at":"2015-11-27T21:43:03Z","abstract_excerpt":"Alon and Mohar (2002) posed the following problem: among all graphs $G$ of maximum degree at most $d$ and girth at least $g$, what is the largest possible value of $\\chi(G^t)$, the chromatic number of the $t$th power of $G$? For $t\\ge 3$, we provide several upper and lower bounds concerning this problem, all of which are sharp up to a constant factor as $d\\to \\infty$. The upper bounds rely in part on the probabilistic method, while the lower bounds are various direct constructions whose building blocks are incidence structures."},"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":"1511.08826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T21:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"90d484d9e3a2ac724b5f116202ce107c6434dfa9a7d203cf9695019eee5d226e","abstract_canon_sha256":"66edd1ca6bdb754440f37491f4a7fca2d0bf06e2a16c56a5f993a19dce82ecf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:08.484248Z","signature_b64":"kHeQgxiV2LC3aoeiKfAd2o05QTYYu4oGRCVK6ZZMxIJ4k1A84S815vlKlq1jLkD7PwTv0i8sGWYI6KyUKIBZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7462d0a66482b80fb316f1acc0607169e68039db94851391d20a085d7d570845","last_reissued_at":"2026-05-18T00:40:08.483791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:08.483791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring powers and girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Pirot, Ross J. Kang","submitted_at":"2015-11-27T21:43:03Z","abstract_excerpt":"Alon and Mohar (2002) posed the following problem: among all graphs $G$ of maximum degree at most $d$ and girth at least $g$, what is the largest possible value of $\\chi(G^t)$, the chromatic number of the $t$th power of $G$? For $t\\ge 3$, we provide several upper and lower bounds concerning this problem, all of which are sharp up to a constant factor as $d\\to \\infty$. The upper bounds rely in part on the probabilistic method, while the lower bounds are various direct constructions whose building blocks are incidence structures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08826","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":"1511.08826","created_at":"2026-05-18T00:40:08.483873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08826v2","created_at":"2026-05-18T00:40:08.483873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08826","created_at":"2026-05-18T00:40:08.483873+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORRNBJTEQK4A","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORRNBJTEQK4A7MYW","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORRNBJTE","created_at":"2026-05-18T12:29:34.919912+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":119,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH","json":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH.json","graph_json":"https://pith.science/api/pith-number/ORRNBJTEQK4A7MYW6GWMAYDRNH/graph.json","events_json":"https://pith.science/api/pith-number/ORRNBJTEQK4A7MYW6GWMAYDRNH/events.json","paper":"https://pith.science/paper/ORRNBJTE"},"agent_actions":{"view_html":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH","download_json":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH.json","view_paper":"https://pith.science/paper/ORRNBJTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08826&json=true","fetch_graph":"https://pith.science/api/pith-number/ORRNBJTEQK4A7MYW6GWMAYDRNH/graph.json","fetch_events":"https://pith.science/api/pith-number/ORRNBJTEQK4A7MYW6GWMAYDRNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH/action/storage_attestation","attest_author":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH/action/author_attestation","sign_citation":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH/action/citation_signature","submit_replication":"https://pith.science/pith/ORRNBJTEQK4A7MYW6GWMAYDRNH/action/replication_record"}},"created_at":"2026-05-18T00:40:08.483873+00:00","updated_at":"2026-05-18T00:40:08.483873+00:00"}