{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JELR6O5CD5QXUB22WA4OGVBKMZ","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":"48bf6e5b6fcdcb3d91e630a73ff11424c6bef4d785b3e45f6baad8962c43b694","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T14:49:59Z","title_canon_sha256":"f48412db6e76568c3f65b622e57e34aa30778c4419e51e39a4c54708bcb02911"},"schema_version":"1.0","source":{"id":"1711.03396","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03396","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03396v3","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03396","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"JELR6O5CD5QX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JELR6O5CD5QXUB22","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JELR6O5C","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:3bd13cbba41c5caf07d0254cf1af0e6eb3a0fc5daf3b0ed33897e51bc4d75754","target":"graph","created_at":"2026-05-17T23:44:38Z","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 give a fully polynomial-time approximation scheme (FPTAS) to count the number of $q$-colorings for $k$-uniform hypergraphs with maximum degree $\\Delta$ if $k\\ge 28$ and $q >357\\Delta^{\\frac{14}{k-14}}$ . We also obtain a polynomial-time almost uniform sampler if $q>931\\Delta^{\\frac{16}{k-16/3}}$. These are the first approximate counting and sampling algorithms in the regime $q\\ll\\Delta$ (for large $\\Delta$ and $k$) without any additional assumptions. Our method is based on the recent work of Moitra (STOC, 2017). One important contribution of ours is to remove the dependency of $k$ and $\\Del","authors_text":"Chao Liao, Chihao Zhang, Heng Guo, Pinyan Lu","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T14:49:59Z","title":"Counting hypergraph colorings in the local lemma regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03396","kind":"arxiv","version":3},"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:7d2f147a146bd192b3839912ddfb9949ae90d664266b3520be1f380d61692dda","target":"record","created_at":"2026-05-17T23:44:38Z","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":"48bf6e5b6fcdcb3d91e630a73ff11424c6bef4d785b3e45f6baad8962c43b694","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T14:49:59Z","title_canon_sha256":"f48412db6e76568c3f65b622e57e34aa30778c4419e51e39a4c54708bcb02911"},"schema_version":"1.0","source":{"id":"1711.03396","kind":"arxiv","version":3}},"canonical_sha256":"49171f3ba21f617a075ab038e3542a665f62b77b4e7d5eeed5295f665cd154f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49171f3ba21f617a075ab038e3542a665f62b77b4e7d5eeed5295f665cd154f5","first_computed_at":"2026-05-17T23:44:38.389395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:38.389395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvP3PjSpYWxs7l1eGrnCj475gia0XsE6SUMOd9QceXauHzUA7u07hN1jdmwgnig5xErNop3voOB3GotYVb86AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:38.389782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03396","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d2f147a146bd192b3839912ddfb9949ae90d664266b3520be1f380d61692dda","sha256:3bd13cbba41c5caf07d0254cf1af0e6eb3a0fc5daf3b0ed33897e51bc4d75754"],"state_sha256":"e246fb14724022cad96b20d01f08fe86d7b02bdd0cccf0fbb720862bcb95f3e6"}