{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CETOAXO5KYNJAOLB6HM4DLJT7H","short_pith_number":"pith:CETOAXO5","canonical_record":{"source":{"id":"2202.05554","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-11T11:13:14Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3efd6055c7f54aeed766def4b92d1598b5ce6b920a480f7ded3a2c8c680979c8","abstract_canon_sha256":"b571a11cc535f5687b568c8611108af6db97558008dbc82762ec7a30a8b80b7a"},"schema_version":"1.0"},"canonical_sha256":"1126e05ddd561a903961f1d9c1ad33f9d0fe5a50d1a7305d0260b5947ad253ec","source":{"kind":"arxiv","id":"2202.05554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.05554","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2202.05554v1","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05554","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"CETOAXO5KYNJ","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"CETOAXO5KYNJAOLB","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"CETOAXO5","created_at":"2026-07-05T03:56:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CETOAXO5KYNJAOLB6HM4DLJT7H","target":"record","payload":{"canonical_record":{"source":{"id":"2202.05554","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-11T11:13:14Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"3efd6055c7f54aeed766def4b92d1598b5ce6b920a480f7ded3a2c8c680979c8","abstract_canon_sha256":"b571a11cc535f5687b568c8611108af6db97558008dbc82762ec7a30a8b80b7a"},"schema_version":"1.0"},"canonical_sha256":"1126e05ddd561a903961f1d9c1ad33f9d0fe5a50d1a7305d0260b5947ad253ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:09.538777Z","signature_b64":"4DgsG7D/fpAEyGVO55G8zoEceDMfnIi4kElWWjbxPhHViaXgxaxgnU9fc6wq7IYEixUjueq/2QE2Ed4QclfjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1126e05ddd561a903961f1d9c1ad33f9d0fe5a50d1a7305d0260b5947ad253ec","last_reissued_at":"2026-07-05T03:56:09.538385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:09.538385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.05554","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-07-05T03:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgOUv4TxNQPDJsxeR/XkqIwP+SXTQ+l3++XsPzmM1n9+QplM6u4ksE9dkJvVCq0YOO+6SoMF+62Owe65BUxBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:16:44.066369Z"},"content_sha256":"68818ad96eaa85a778dc7ebf2deb6737fafd7a3c09dc4c618dc91a9685b04200","schema_version":"1.0","event_id":"sha256:68818ad96eaa85a778dc7ebf2deb6737fafd7a3c09dc4c618dc91a9685b04200"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CETOAXO5KYNJAOLB6HM4DLJT7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds for randomly colouring simple hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Heng Guo, Jiaheng Wang, Weiming Feng","submitted_at":"2022-02-11T11:13:14Z","abstract_excerpt":"We study the problem of sampling almost uniform proper $q$-colourings in $k$-uniform simple hypergraphs with maximum degree $\\Delta$. For any $\\delta > 0$, if $k \\geq\\frac{20(1+\\delta)}{\\delta}$ and $q \\geq 100\\Delta^{\\frac{2+\\delta}{k-4/\\delta-4}}$, the running time of our algorithm is $\\tilde{O}(\\mathrm{poly}(\\Delta k)\\cdot n^{1.01})$, where $n$ is the number of vertices. Our result requires fewer colours than previous results for general hypergraphs (Jain, Pham, and Voung, 2021; He, Sun, and Wu, 2021), and does not require $\\Omega(\\log n)$ colours unlike the work of Frieze and Anastos (2017"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05554","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.05554/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uOcPtpNYWghQrcim+6BPizpSzWNGM+TupWrdJ7VeWiKwufFSgn43B35X0qL0xqoeIm6k2h1UWB6PgfaFanKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:16:44.068730Z"},"content_sha256":"a6ef4624665764d31419453cdcd01e8a13e7aed0af3bc0cf0debe1fc15441881","schema_version":"1.0","event_id":"sha256:a6ef4624665764d31419453cdcd01e8a13e7aed0af3bc0cf0debe1fc15441881"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CETOAXO5KYNJAOLB6HM4DLJT7H/bundle.json","state_url":"https://pith.science/pith/CETOAXO5KYNJAOLB6HM4DLJT7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CETOAXO5KYNJAOLB6HM4DLJT7H/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-08-23T05:16:44Z","links":{"resolver":"https://pith.science/pith/CETOAXO5KYNJAOLB6HM4DLJT7H","bundle":"https://pith.science/pith/CETOAXO5KYNJAOLB6HM4DLJT7H/bundle.json","state":"https://pith.science/pith/CETOAXO5KYNJAOLB6HM4DLJT7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CETOAXO5KYNJAOLB6HM4DLJT7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CETOAXO5KYNJAOLB6HM4DLJT7H","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":"b571a11cc535f5687b568c8611108af6db97558008dbc82762ec7a30a8b80b7a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-11T11:13:14Z","title_canon_sha256":"3efd6055c7f54aeed766def4b92d1598b5ce6b920a480f7ded3a2c8c680979c8"},"schema_version":"1.0","source":{"id":"2202.05554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.05554","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2202.05554v1","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05554","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"CETOAXO5KYNJ","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"CETOAXO5KYNJAOLB","created_at":"2026-07-05T03:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"CETOAXO5","created_at":"2026-07-05T03:56:09Z"}],"graph_snapshots":[{"event_id":"sha256:a6ef4624665764d31419453cdcd01e8a13e7aed0af3bc0cf0debe1fc15441881","target":"graph","created_at":"2026-07-05T03:56:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.05554/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of sampling almost uniform proper $q$-colourings in $k$-uniform simple hypergraphs with maximum degree $\\Delta$. For any $\\delta > 0$, if $k \\geq\\frac{20(1+\\delta)}{\\delta}$ and $q \\geq 100\\Delta^{\\frac{2+\\delta}{k-4/\\delta-4}}$, the running time of our algorithm is $\\tilde{O}(\\mathrm{poly}(\\Delta k)\\cdot n^{1.01})$, where $n$ is the number of vertices. Our result requires fewer colours than previous results for general hypergraphs (Jain, Pham, and Voung, 2021; He, Sun, and Wu, 2021), and does not require $\\Omega(\\log n)$ colours unlike the work of Frieze and Anastos (2017","authors_text":"Heng Guo, Jiaheng Wang, Weiming Feng","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-11T11:13:14Z","title":"Improved bounds for randomly colouring simple hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05554","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:68818ad96eaa85a778dc7ebf2deb6737fafd7a3c09dc4c618dc91a9685b04200","target":"record","created_at":"2026-07-05T03:56:09Z","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":"b571a11cc535f5687b568c8611108af6db97558008dbc82762ec7a30a8b80b7a","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-02-11T11:13:14Z","title_canon_sha256":"3efd6055c7f54aeed766def4b92d1598b5ce6b920a480f7ded3a2c8c680979c8"},"schema_version":"1.0","source":{"id":"2202.05554","kind":"arxiv","version":1}},"canonical_sha256":"1126e05ddd561a903961f1d9c1ad33f9d0fe5a50d1a7305d0260b5947ad253ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1126e05ddd561a903961f1d9c1ad33f9d0fe5a50d1a7305d0260b5947ad253ec","first_computed_at":"2026-07-05T03:56:09.538385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:09.538385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4DgsG7D/fpAEyGVO55G8zoEceDMfnIi4kElWWjbxPhHViaXgxaxgnU9fc6wq7IYEixUjueq/2QE2Ed4QclfjCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:09.538777Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.05554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68818ad96eaa85a778dc7ebf2deb6737fafd7a3c09dc4c618dc91a9685b04200","sha256:a6ef4624665764d31419453cdcd01e8a13e7aed0af3bc0cf0debe1fc15441881"],"state_sha256":"9dbed0ddff8ddbd000738bd2f21562802ecc750104a6fd68650ef4cef7eb4e65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jboubTNLufrZPmC9Ke+oGV5HmmUXxwgonl1OyuNb/+Rw636ZiZQOOLxsdsYNXWEC156eQUVUIkViv6W4O3RZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T05:16:44.072765Z","bundle_sha256":"3397d724c78b5a7d9f5cd09aff5c739d0d31eb257de340493608b8418b6cf5e0"}}