{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D7HFGKQXQA3VI7OPRYZL6D222I","short_pith_number":"pith:D7HFGKQX","schema_version":"1.0","canonical_sha256":"1fce532a178037547dcf8e32bf0f5ad22d530c4475b28cbb2795e1d92cfca9a6","source":{"kind":"arxiv","id":"1701.07639","version":1},"attestation_state":"computed","paper":{"title":"Distance colouring without one cycle length","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":"2017-01-26T10:22:46Z","abstract_excerpt":"We consider distance colourings in graphs of maximum degree at most $d$ and how excluding one fixed cycle length $\\ell$ affects the number of colours required as $d\\to\\infty$. For vertex-colouring and $t\\ge 1$, if any two distinct vertices connected by a path of at most $t$ edges are required to be coloured differently, then a reduction by a logarithmic (in $d$) factor against the trivial bound $O(d^t)$ can be obtained by excluding an odd cycle length $\\ell \\ge 3t$ if $t$ is odd or by excluding an even cycle length $\\ell \\ge 2t+2$. For edge-colouring and $t\\ge 2$, if any two distinct edges con"},"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":"1701.07639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T10:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"c244d2fd4f13f4287d22a62611514fec811a235ee1e8f25fadeeb05acf530c12","abstract_canon_sha256":"7a3b8733da38bde656e34e4bdfc0bcd6b8104bcc16244bcb12cc7fbbe7f844f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:03.821883Z","signature_b64":"+48SywPyYDlJQnI+puH+fKhQU6NfGm08bnfbbq95FZn36FIozMaMmYnRMPJckrmdMMg5paKMXs90sGOzY96fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fce532a178037547dcf8e32bf0f5ad22d530c4475b28cbb2795e1d92cfca9a6","last_reissued_at":"2026-05-17T23:59:03.821449Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:03.821449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance colouring without one cycle length","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":"2017-01-26T10:22:46Z","abstract_excerpt":"We consider distance colourings in graphs of maximum degree at most $d$ and how excluding one fixed cycle length $\\ell$ affects the number of colours required as $d\\to\\infty$. For vertex-colouring and $t\\ge 1$, if any two distinct vertices connected by a path of at most $t$ edges are required to be coloured differently, then a reduction by a logarithmic (in $d$) factor against the trivial bound $O(d^t)$ can be obtained by excluding an odd cycle length $\\ell \\ge 3t$ if $t$ is odd or by excluding an even cycle length $\\ell \\ge 2t+2$. For edge-colouring and $t\\ge 2$, if any two distinct edges con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07639","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":"1701.07639","created_at":"2026-05-17T23:59:03.821510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07639v1","created_at":"2026-05-17T23:59:03.821510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07639","created_at":"2026-05-17T23:59:03.821510+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7HFGKQXQA3V","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7HFGKQXQA3VI7OP","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7HFGKQX","created_at":"2026-05-18T12:31:10.602751+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":120,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I","json":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I.json","graph_json":"https://pith.science/api/pith-number/D7HFGKQXQA3VI7OPRYZL6D222I/graph.json","events_json":"https://pith.science/api/pith-number/D7HFGKQXQA3VI7OPRYZL6D222I/events.json","paper":"https://pith.science/paper/D7HFGKQX"},"agent_actions":{"view_html":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I","download_json":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I.json","view_paper":"https://pith.science/paper/D7HFGKQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07639&json=true","fetch_graph":"https://pith.science/api/pith-number/D7HFGKQXQA3VI7OPRYZL6D222I/graph.json","fetch_events":"https://pith.science/api/pith-number/D7HFGKQXQA3VI7OPRYZL6D222I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/action/storage_attestation","attest_author":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/action/author_attestation","sign_citation":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/action/citation_signature","submit_replication":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/action/replication_record"}},"created_at":"2026-05-17T23:59:03.821510+00:00","updated_at":"2026-05-17T23:59:03.821510+00:00"}