{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2NG47IJKH7O5OCHKAZ7CIVIFK3","short_pith_number":"pith:2NG47IJK","canonical_record":{"source":{"id":"1808.04060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T04:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"410871f91da00218ec46843d33d352e72dac75c27d4f4569da3c60ada990fadf","abstract_canon_sha256":"054c5c42e919caff15b964f0cc5cbbe95696d083dbd104dfeea365663e45a8f3"},"schema_version":"1.0"},"canonical_sha256":"d34dcfa12a3fddd708ea067e24550556cd9bb3c6e19bf6d72ea21179193dcc76","source":{"kind":"arxiv","id":"1808.04060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04060","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04060v2","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04060","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"2NG47IJKH7O5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NG47IJKH7O5OCHK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NG47IJK","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2NG47IJKH7O5OCHKAZ7CIVIFK3","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T04:13:19Z","cross_cats_sorted":[],"title_canon_sha256":"410871f91da00218ec46843d33d352e72dac75c27d4f4569da3c60ada990fadf","abstract_canon_sha256":"054c5c42e919caff15b964f0cc5cbbe95696d083dbd104dfeea365663e45a8f3"},"schema_version":"1.0"},"canonical_sha256":"d34dcfa12a3fddd708ea067e24550556cd9bb3c6e19bf6d72ea21179193dcc76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:43.140757Z","signature_b64":"oRnBDGLb6JEVtwqu/3rPM31DtaGVxGy3FXFgSpw4b7G6fTtUK23Knlok1FP53p8FksoAw4c3C5vH3T2JlMwYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34dcfa12a3fddd708ea067e24550556cd9bb3c6e19bf6d72ea21179193dcc76","last_reissued_at":"2026-05-17T23:43:43.140045Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:43.140045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04060","source_version":2,"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:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwX5iiXLg+9dnLsRbkbbawTBknQGybwz3yg9rWdZfvNgSes9bKTZ5c8D+y6RErdeliPfpTCevdpH4krNgK94AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:15:23.982753Z"},"content_sha256":"95abf8c71dcd1327f62015875b955c7a4c28478f1535fd94d6f2a0dc9949ea99","schema_version":"1.0","event_id":"sha256:95abf8c71dcd1327f62015875b955c7a4c28478f1535fd94d6f2a0dc9949ea99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2NG47IJKH7O5OCHKAZ7CIVIFK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rigid colourings of hypergraphs and contiguity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Greenhill, Peter Ayre","submitted_at":"2018-08-13T04:13:19Z","abstract_excerpt":"We consider the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \\geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of vertices that are linearly frozen, meaning that they cannot be recoloured by a sequence of colourings that each change the colour of a sublinear number of vertices. When the edge density is below the threshold, we prove that all but a vanishing proportion of the vertices can be recoloured by a sequence of colourings that recolour only one vertex at a time. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04060","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"},"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:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCOkqZcqgmFvtLBEejyaWPbeqjrcloUEpLnhteiSypCqktBXZ5/NWl9krmqvVyjoMkIS+9QPF486H5sGI+p3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:15:23.983086Z"},"content_sha256":"4021586454f5f6b8611490f079e7b30e1cbc4f4fa62e2d3e01bf18f0ca0963c1","schema_version":"1.0","event_id":"sha256:4021586454f5f6b8611490f079e7b30e1cbc4f4fa62e2d3e01bf18f0ca0963c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3/bundle.json","state_url":"https://pith.science/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3/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-08T23:15:23Z","links":{"resolver":"https://pith.science/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3","bundle":"https://pith.science/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3/bundle.json","state":"https://pith.science/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NG47IJKH7O5OCHKAZ7CIVIFK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2NG47IJKH7O5OCHKAZ7CIVIFK3","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":"054c5c42e919caff15b964f0cc5cbbe95696d083dbd104dfeea365663e45a8f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T04:13:19Z","title_canon_sha256":"410871f91da00218ec46843d33d352e72dac75c27d4f4569da3c60ada990fadf"},"schema_version":"1.0","source":{"id":"1808.04060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04060","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04060v2","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04060","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"2NG47IJKH7O5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NG47IJKH7O5OCHK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NG47IJK","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:4021586454f5f6b8611490f079e7b30e1cbc4f4fa62e2d3e01bf18f0ca0963c1","target":"graph","created_at":"2026-05-17T23:43:43Z","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 the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \\geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of vertices that are linearly frozen, meaning that they cannot be recoloured by a sequence of colourings that each change the colour of a sublinear number of vertices. When the edge density is below the threshold, we prove that all but a vanishing proportion of the vertices can be recoloured by a sequence of colourings that recolour only one vertex at a time. Th","authors_text":"Catherine Greenhill, Peter Ayre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T04:13:19Z","title":"Rigid colourings of hypergraphs and contiguity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04060","kind":"arxiv","version":2},"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:95abf8c71dcd1327f62015875b955c7a4c28478f1535fd94d6f2a0dc9949ea99","target":"record","created_at":"2026-05-17T23:43:43Z","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":"054c5c42e919caff15b964f0cc5cbbe95696d083dbd104dfeea365663e45a8f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T04:13:19Z","title_canon_sha256":"410871f91da00218ec46843d33d352e72dac75c27d4f4569da3c60ada990fadf"},"schema_version":"1.0","source":{"id":"1808.04060","kind":"arxiv","version":2}},"canonical_sha256":"d34dcfa12a3fddd708ea067e24550556cd9bb3c6e19bf6d72ea21179193dcc76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d34dcfa12a3fddd708ea067e24550556cd9bb3c6e19bf6d72ea21179193dcc76","first_computed_at":"2026-05-17T23:43:43.140045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:43.140045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oRnBDGLb6JEVtwqu/3rPM31DtaGVxGy3FXFgSpw4b7G6fTtUK23Knlok1FP53p8FksoAw4c3C5vH3T2JlMwYCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:43.140757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95abf8c71dcd1327f62015875b955c7a4c28478f1535fd94d6f2a0dc9949ea99","sha256:4021586454f5f6b8611490f079e7b30e1cbc4f4fa62e2d3e01bf18f0ca0963c1"],"state_sha256":"e71c13f8e46da039741bf4a8bf6dc7a00268007ab255f91681cbbf73041f44b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+dFCi7Wg6MuKsI3Yq6QT5aIvgRaD8jblCB5D+ujKqq4awKoU44PzbhqVs757gPRHrBtZSmxwY8e8/hqSPCKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:15:23.985013Z","bundle_sha256":"0031681872d9dc581fc736b060c5d62d6929d5fd6b1aa7c007830d4512e27366"}}