{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PLOWCSSGEQ56GHENFE6CM66GHA","short_pith_number":"pith:PLOWCSSG","canonical_record":{"source":{"id":"1811.12650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T07:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"6f2c3183e70e3c5dc139a2c0c30dd5cdfecfd781d1177181998460a855b86764","abstract_canon_sha256":"77bdffd42433ac9e7451937148a3192ac27d39c41d1ede9dfb3f3de43f72e965"},"schema_version":"1.0"},"canonical_sha256":"7add614a46243be31c8d293c267bc6382acb7bb3acb431ee95e91ff7dd807bce","source":{"kind":"arxiv","id":"1811.12650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12650","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12650v1","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12650","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"PLOWCSSGEQ56","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PLOWCSSGEQ56GHEN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PLOWCSSG","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PLOWCSSGEQ56GHENFE6CM66GHA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T07:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"6f2c3183e70e3c5dc139a2c0c30dd5cdfecfd781d1177181998460a855b86764","abstract_canon_sha256":"77bdffd42433ac9e7451937148a3192ac27d39c41d1ede9dfb3f3de43f72e965"},"schema_version":"1.0"},"canonical_sha256":"7add614a46243be31c8d293c267bc6382acb7bb3acb431ee95e91ff7dd807bce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:28.939151Z","signature_b64":"Z+M0tIBRPiL+cvdD4Sbfpg+UGNOQUKEAPVFNL1watuquqaJF/iIMmfDZ4kewGg1LjT33lxIcr3UsRMdEIHZUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7add614a46243be31c8d293c267bc6382acb7bb3acb431ee95e91ff7dd807bce","last_reissued_at":"2026-05-17T23:59:28.938511Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:28.938511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12650","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toOE5xIF8vjkdD13uPV4C3cb178cZSrDKN9t5/jXjSOhauUe0ZZeosxEEwJmprMfF/2alkkWh310BhFGg7zpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:18:42.407238Z"},"content_sha256":"33a96caeb7f43051e0d6e0306d1819c4991b4bbf782dd00619f48197901cbe0f","schema_version":"1.0","event_id":"sha256:33a96caeb7f43051e0d6e0306d1819c4991b4bbf782dd00619f48197901cbe0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PLOWCSSGEQ56GHENFE6CM66GHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Frozen $(\\Delta+1)$-colourings of bounded degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillem Perarnau, Marthe Bonamy, Nicolas Bousquet","submitted_at":"2018-11-30T07:34:36Z","abstract_excerpt":"Let $G$ be a graph of maximum degree $\\Delta$ and $k$ be an integer. The $k$-recolouring graph of $G$ is the graph whose vertices are $k$-colourings of $G$ and where two $k$-colourings are adjacent if they differ at exactly one vertex. It is well-known that the $k$-recolouring graph is connected for $k\\geq \\Delta+2$. Feghali, Johnson and Paulusma [Journal of Graph Theory, 83(4):340--358] showed that the $(\\Delta+1)$-recolouring graph is composed by a unique connected component of size at least $2$ and (possibly many) isolated vertices.\n  In this paper, we study the proportion of isolated verti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12650","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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7LxWjXAi2OqVCfJ6YKduaOxTQWsofjk5So80YfWmW6FdVcnLbvj5nE8b7nf5JL60zyruAE/p8dJn3VG1DEoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:18:42.407898Z"},"content_sha256":"e27c3ba41eabedf30ffbd39d9bb2622079a77b5c34d0c5c9c296bc83ac37e34f","schema_version":"1.0","event_id":"sha256:e27c3ba41eabedf30ffbd39d9bb2622079a77b5c34d0c5c9c296bc83ac37e34f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLOWCSSGEQ56GHENFE6CM66GHA/bundle.json","state_url":"https://pith.science/pith/PLOWCSSGEQ56GHENFE6CM66GHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLOWCSSGEQ56GHENFE6CM66GHA/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-05-26T07:18:42Z","links":{"resolver":"https://pith.science/pith/PLOWCSSGEQ56GHENFE6CM66GHA","bundle":"https://pith.science/pith/PLOWCSSGEQ56GHENFE6CM66GHA/bundle.json","state":"https://pith.science/pith/PLOWCSSGEQ56GHENFE6CM66GHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLOWCSSGEQ56GHENFE6CM66GHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PLOWCSSGEQ56GHENFE6CM66GHA","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":"77bdffd42433ac9e7451937148a3192ac27d39c41d1ede9dfb3f3de43f72e965","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T07:34:36Z","title_canon_sha256":"6f2c3183e70e3c5dc139a2c0c30dd5cdfecfd781d1177181998460a855b86764"},"schema_version":"1.0","source":{"id":"1811.12650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12650","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12650v1","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12650","created_at":"2026-05-17T23:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"PLOWCSSGEQ56","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PLOWCSSGEQ56GHEN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PLOWCSSG","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:e27c3ba41eabedf30ffbd39d9bb2622079a77b5c34d0c5c9c296bc83ac37e34f","target":"graph","created_at":"2026-05-17T23:59:28Z","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":"Let $G$ be a graph of maximum degree $\\Delta$ and $k$ be an integer. The $k$-recolouring graph of $G$ is the graph whose vertices are $k$-colourings of $G$ and where two $k$-colourings are adjacent if they differ at exactly one vertex. It is well-known that the $k$-recolouring graph is connected for $k\\geq \\Delta+2$. Feghali, Johnson and Paulusma [Journal of Graph Theory, 83(4):340--358] showed that the $(\\Delta+1)$-recolouring graph is composed by a unique connected component of size at least $2$ and (possibly many) isolated vertices.\n  In this paper, we study the proportion of isolated verti","authors_text":"Guillem Perarnau, Marthe Bonamy, Nicolas Bousquet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T07:34:36Z","title":"Frozen $(\\Delta+1)$-colourings of bounded degree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12650","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:33a96caeb7f43051e0d6e0306d1819c4991b4bbf782dd00619f48197901cbe0f","target":"record","created_at":"2026-05-17T23:59:28Z","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":"77bdffd42433ac9e7451937148a3192ac27d39c41d1ede9dfb3f3de43f72e965","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T07:34:36Z","title_canon_sha256":"6f2c3183e70e3c5dc139a2c0c30dd5cdfecfd781d1177181998460a855b86764"},"schema_version":"1.0","source":{"id":"1811.12650","kind":"arxiv","version":1}},"canonical_sha256":"7add614a46243be31c8d293c267bc6382acb7bb3acb431ee95e91ff7dd807bce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7add614a46243be31c8d293c267bc6382acb7bb3acb431ee95e91ff7dd807bce","first_computed_at":"2026-05-17T23:59:28.938511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:28.938511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z+M0tIBRPiL+cvdD4Sbfpg+UGNOQUKEAPVFNL1watuquqaJF/iIMmfDZ4kewGg1LjT33lxIcr3UsRMdEIHZUAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:28.939151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33a96caeb7f43051e0d6e0306d1819c4991b4bbf782dd00619f48197901cbe0f","sha256:e27c3ba41eabedf30ffbd39d9bb2622079a77b5c34d0c5c9c296bc83ac37e34f"],"state_sha256":"a1e3b0572a0342ecb85b96bd1e73ed20729b854db93b8df783e129a33f98e8df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXTBv4Btckyu35Z0/F5HN7fwBU1gv0aDnX68x0RWZZWX27hHJdYtUaLiaT7BHj5uSiISIiZedyyIQVWaF9O8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:18:42.411646Z","bundle_sha256":"af565136d93b80f39272ab62591aebebd01634e44858071701bf1e3686668596"}}