{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HJ6PKNH3HRY7JUOG5O6JGDY5BI","short_pith_number":"pith:HJ6PKNH3","canonical_record":{"source":{"id":"1702.00973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T11:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"4f82a479319644a812a5bd555c0dc9a585333c55ef1ab85aba519a0921054467","abstract_canon_sha256":"21b63956526dfff566015cdd1bf1f61b9f68aab7b9aa6423d6248b13f214bd71"},"schema_version":"1.0"},"canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","source":{"kind":"arxiv","id":"1702.00973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00973","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00973v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00973","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"HJ6PKNH3HRY7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJ6PKNH3HRY7JUOG","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJ6PKNH3","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HJ6PKNH3HRY7JUOG5O6JGDY5BI","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T11:35:44Z","cross_cats_sorted":[],"title_canon_sha256":"4f82a479319644a812a5bd555c0dc9a585333c55ef1ab85aba519a0921054467","abstract_canon_sha256":"21b63956526dfff566015cdd1bf1f61b9f68aab7b9aa6423d6248b13f214bd71"},"schema_version":"1.0"},"canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.265798Z","signature_b64":"V3r1kxUIkXBz04XNKM2jT5m4z44Vx3Zgx1oRISiSrKyqqdt3zNHHejsJ/9Vuq+Db94hkSnxcQgJHkDvE1rpVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","last_reissued_at":"2026-05-18T00:51:29.265206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.265206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00973","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-18T00:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMYQ0JIqVFh30KKX+WiK5/7t47bLTEUSFYmuSZdRZHYNyux9sQghxEWuliB+5zeRaO2ppr1fXeXV9/9KiFemCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:08:45.141465Z"},"content_sha256":"2befc9f69c6ca18a9df64fef53c0ddb2eba1785303aff9ce8c70cee6c58ed98c","schema_version":"1.0","event_id":"sha256:2befc9f69c6ca18a9df64fef53c0ddb2eba1785303aff9ce8c70cee6c58ed98c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HJ6PKNH3HRY7JUOG5O6JGDY5BI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Joshua Erde, Konstantinos Stavropoulos, Martin Merker, Max Pitz, Nathan Bowler","submitted_at":"2017-02-03T11:35:44Z","abstract_excerpt":"A \\emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \\emph{dynamic colouring number} $\\chi_2(G)$ of a graph $G$ is the least number of colours needed for a dynamic colouring of $G$.\n  Montgomery conjectured that $\\chi_2(G) \\leq \\chi(G) + 2$ for all regular graphs $G$, which would significantly improve the best current upper bound $\\chi_2(G) \\leq 2\\chi(G)$. In this note, however, we show that this last upper bound is sharp by constructing, for every integer $n \\geq 2$, a regular graph $G$ with $\\chi(G) = n$ but $\\chi_2("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00973","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-18T00:51:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DvBWWGDsctApNhrk5AQiCVMtS2l63EIZklT6Hwot6SxgtT4LZ8fjTJ1nSg10SFpT2AN1T540EpwK69W/0tBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:08:45.141818Z"},"content_sha256":"10f0719db179cc21bddd43c731c17f599c47c546b6558b77bf945ae00a54d54c","schema_version":"1.0","event_id":"sha256:10f0719db179cc21bddd43c731c17f599c47c546b6558b77bf945ae00a54d54c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/bundle.json","state_url":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/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-21T06:08:45Z","links":{"resolver":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI","bundle":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/bundle.json","state":"https://pith.science/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJ6PKNH3HRY7JUOG5O6JGDY5BI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HJ6PKNH3HRY7JUOG5O6JGDY5BI","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":"21b63956526dfff566015cdd1bf1f61b9f68aab7b9aa6423d6248b13f214bd71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T11:35:44Z","title_canon_sha256":"4f82a479319644a812a5bd555c0dc9a585333c55ef1ab85aba519a0921054467"},"schema_version":"1.0","source":{"id":"1702.00973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00973","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00973v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00973","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"HJ6PKNH3HRY7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJ6PKNH3HRY7JUOG","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJ6PKNH3","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:10f0719db179cc21bddd43c731c17f599c47c546b6558b77bf945ae00a54d54c","target":"graph","created_at":"2026-05-18T00:51:29Z","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":"A \\emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \\emph{dynamic colouring number} $\\chi_2(G)$ of a graph $G$ is the least number of colours needed for a dynamic colouring of $G$.\n  Montgomery conjectured that $\\chi_2(G) \\leq \\chi(G) + 2$ for all regular graphs $G$, which would significantly improve the best current upper bound $\\chi_2(G) \\leq 2\\chi(G)$. In this note, however, we show that this last upper bound is sharp by constructing, for every integer $n \\geq 2$, a regular graph $G$ with $\\chi(G) = n$ but $\\chi_2(","authors_text":"Florian Lehner, Joshua Erde, Konstantinos Stavropoulos, Martin Merker, Max Pitz, Nathan Bowler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T11:35:44Z","title":"A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00973","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:2befc9f69c6ca18a9df64fef53c0ddb2eba1785303aff9ce8c70cee6c58ed98c","target":"record","created_at":"2026-05-18T00:51:29Z","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":"21b63956526dfff566015cdd1bf1f61b9f68aab7b9aa6423d6248b13f214bd71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T11:35:44Z","title_canon_sha256":"4f82a479319644a812a5bd555c0dc9a585333c55ef1ab85aba519a0921054467"},"schema_version":"1.0","source":{"id":"1702.00973","kind":"arxiv","version":1}},"canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a7cf534fb3c71f4d1c6ebbc930f1d0a3ef5e60c4cf6a737998dca4e842dee1a","first_computed_at":"2026-05-18T00:51:29.265206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:29.265206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V3r1kxUIkXBz04XNKM2jT5m4z44Vx3Zgx1oRISiSrKyqqdt3zNHHejsJ/9Vuq+Db94hkSnxcQgJHkDvE1rpVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:29.265798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2befc9f69c6ca18a9df64fef53c0ddb2eba1785303aff9ce8c70cee6c58ed98c","sha256:10f0719db179cc21bddd43c731c17f599c47c546b6558b77bf945ae00a54d54c"],"state_sha256":"409d30f90b975be404bee68d62e390ef231d1948e5b320b1a1bc5e2d0047a837"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyhsmWv5TG2geTlLveSlSW5FxUG48lpUxYGN1RQP8/jh60D6YxbBc1MO8gDCYhsRNWfaubCoLnPtrim8pfrnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:08:45.143772Z","bundle_sha256":"0d75e94837688cc77e0a881c04a08e2d9081c181ba2c5f63ddfb82b3eac62dd3"}}