{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D7HFGKQXQA3VI7OPRYZL6D222I","short_pith_number":"pith:D7HFGKQX","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"},"canonical_sha256":"1fce532a178037547dcf8e32bf0f5ad22d530c4475b28cbb2795e1d92cfca9a6","source":{"kind":"arxiv","id":"1701.07639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07639","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07639v1","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07639","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"D7HFGKQXQA3V","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7HFGKQXQA3VI7OP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7HFGKQX","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D7HFGKQXQA3VI7OPRYZL6D222I","target":"record","payload":{"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"},"canonical_sha256":"1fce532a178037547dcf8e32bf0f5ad22d530c4475b28cbb2795e1d92cfca9a6","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"},"source_kind":"arxiv","source_id":"1701.07639","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHq5mXzHYf9uMT4ydYJs2/5+4UeY+MjJ/XQDbcf/DU/ym2uff+0mT3zRdq/DZH2Xc4WLZe6hnERsK/KNbPORBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:21:05.763213Z"},"content_sha256":"a10d6ceae253d7abfae82d81a1ffdbc3e3a11a34c4e34f62ad6445027ab2e2b6","schema_version":"1.0","event_id":"sha256:a10d6ceae253d7abfae82d81a1ffdbc3e3a11a34c4e34f62ad6445027ab2e2b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D7HFGKQXQA3VI7OPRYZL6D222I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Iz0MwhENs3ual7Vi6nb3gMtn43HN4yVnfbYRX7MvMthtj+vUxUN+gvH2XEGEWwpGRbzqrlRDsf1mTWloO5MDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:21:05.763898Z"},"content_sha256":"f914a5fc70e4613723a9e8e67aa7f2834ca1e67b0fc1df259e92be3a41e2feb9","schema_version":"1.0","event_id":"sha256:f914a5fc70e4613723a9e8e67aa7f2834ca1e67b0fc1df259e92be3a41e2feb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/bundle.json","state_url":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7HFGKQXQA3VI7OPRYZL6D222I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T23:21:05Z","links":{"resolver":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I","bundle":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/bundle.json","state":"https://pith.science/pith/D7HFGKQXQA3VI7OPRYZL6D222I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7HFGKQXQA3VI7OPRYZL6D222I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D7HFGKQXQA3VI7OPRYZL6D222I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7a3b8733da38bde656e34e4bdfc0bcd6b8104bcc16244bcb12cc7fbbe7f844f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T10:22:46Z","title_canon_sha256":"c244d2fd4f13f4287d22a62611514fec811a235ee1e8f25fadeeb05acf530c12"},"schema_version":"1.0","source":{"id":"1701.07639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07639","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07639v1","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07639","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"D7HFGKQXQA3V","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7HFGKQXQA3VI7OP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7HFGKQX","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f914a5fc70e4613723a9e8e67aa7f2834ca1e67b0fc1df259e92be3a41e2feb9","target":"graph","created_at":"2026-05-17T23:59:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Fran\\c{c}ois Pirot, Ross J. Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T10:22:46Z","title":"Distance colouring without one cycle length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07639","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a10d6ceae253d7abfae82d81a1ffdbc3e3a11a34c4e34f62ad6445027ab2e2b6","target":"record","created_at":"2026-05-17T23:59:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7a3b8733da38bde656e34e4bdfc0bcd6b8104bcc16244bcb12cc7fbbe7f844f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T10:22:46Z","title_canon_sha256":"c244d2fd4f13f4287d22a62611514fec811a235ee1e8f25fadeeb05acf530c12"},"schema_version":"1.0","source":{"id":"1701.07639","kind":"arxiv","version":1}},"canonical_sha256":"1fce532a178037547dcf8e32bf0f5ad22d530c4475b28cbb2795e1d92cfca9a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fce532a178037547dcf8e32bf0f5ad22d530c4475b28cbb2795e1d92cfca9a6","first_computed_at":"2026-05-17T23:59:03.821449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:03.821449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+48SywPyYDlJQnI+puH+fKhQU6NfGm08bnfbbq95FZn36FIozMaMmYnRMPJckrmdMMg5paKMXs90sGOzY96fDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:03.821883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10d6ceae253d7abfae82d81a1ffdbc3e3a11a34c4e34f62ad6445027ab2e2b6","sha256:f914a5fc70e4613723a9e8e67aa7f2834ca1e67b0fc1df259e92be3a41e2feb9"],"state_sha256":"7a19bdf8a1f098549e2e8e7179a1683b21e3010134aa2ae47b39d3c3cd58c7b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL3fhOTzAAo3NujI3XMLO/PxVerp9afFyLHn/MsSd731uMV79SBiIMen4M3PVayIbBUp9B35AcY5x6chEFkPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:21:05.767141Z","bundle_sha256":"23c424b070175bc4f1e781feb82c49c9d0754073828431ac2b429887869a5f84"}}