{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B3LF73LHBAA7H3KSJ2XCO42M6R","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":"94f8951cbd9c49f40cf9b1ea433a40c331be7fa97d71ccb640fcdf596b8faf3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-09T07:35:59Z","title_canon_sha256":"c4c05ab334b92ddb9befeb78466ab2f9fab5da9e4c9f8808085d8b8c150f04cc"},"schema_version":"1.0","source":{"id":"1804.02852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02852","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02852v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02852","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"B3LF73LHBAA7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3LF73LHBAA7H3KS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3LF73LH","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:8d04b44534e6178740661d6b7738b1bac0977f869e61129aaa0d075cdd1101c9","target":"graph","created_at":"2026-05-18T00:18:58Z","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 $r$ be an integer with $r\\ge 2$ and $G$ be a connected $r$-uniform hypergraph with $m$ edges. By refining the broken cycle theorem for hypergraphs, we show that if $k>\\frac{m-1}{\\ln(1+\\sqrt{2})}\\approx 1.135 (m-1)$ then the $k$-list assignment of $G$ admitting the fewest colorings is the constant list assignment. This extends the previous results of Donner, Thomassen and the current authors for graphs.","authors_text":"Jianguo Qian, Wei Wang, Zhidan Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-09T07:35:59Z","title":"Colorings v.s. list colorings of uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02852","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:27b1dd5b6d541a96adda0a9f89213418cb7479b558992970075caf3afd73dbef","target":"record","created_at":"2026-05-18T00:18:58Z","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":"94f8951cbd9c49f40cf9b1ea433a40c331be7fa97d71ccb640fcdf596b8faf3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-09T07:35:59Z","title_canon_sha256":"c4c05ab334b92ddb9befeb78466ab2f9fab5da9e4c9f8808085d8b8c150f04cc"},"schema_version":"1.0","source":{"id":"1804.02852","kind":"arxiv","version":1}},"canonical_sha256":"0ed65fed670801f3ed524eae27734cf45bcaf19714b3d7f62e4d74a688b40589","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed65fed670801f3ed524eae27734cf45bcaf19714b3d7f62e4d74a688b40589","first_computed_at":"2026-05-18T00:18:58.173011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:58.173011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JWVwmaC6MQhh3baSZTu3neAx/KdL2RsmHkw5m6wchiCjwmuC0XfM4/HgUKPPTlbRLVU4xTDUQPAw1kpzz6oSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:58.173548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27b1dd5b6d541a96adda0a9f89213418cb7479b558992970075caf3afd73dbef","sha256:8d04b44534e6178740661d6b7738b1bac0977f869e61129aaa0d075cdd1101c9"],"state_sha256":"997ddaf542a7a1e8d2ce475ad2b6b1efa60e70d8b95ad50be95083ff14839e91"}