{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B3LF73LHBAA7H3KSJ2XCO42M6R","short_pith_number":"pith:B3LF73LH","schema_version":"1.0","canonical_sha256":"0ed65fed670801f3ed524eae27734cf45bcaf19714b3d7f62e4d74a688b40589","source":{"kind":"arxiv","id":"1804.02852","version":1},"attestation_state":"computed","paper":{"title":"Colorings v.s. list colorings of uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianguo Qian, Wei Wang, Zhidan Yan","submitted_at":"2018-04-09T07:35:59Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.02852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-09T07:35:59Z","cross_cats_sorted":[],"title_canon_sha256":"c4c05ab334b92ddb9befeb78466ab2f9fab5da9e4c9f8808085d8b8c150f04cc","abstract_canon_sha256":"94f8951cbd9c49f40cf9b1ea433a40c331be7fa97d71ccb640fcdf596b8faf3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:58.173548Z","signature_b64":"JWVwmaC6MQhh3baSZTu3neAx/KdL2RsmHkw5m6wchiCjwmuC0XfM4/HgUKPPTlbRLVU4xTDUQPAw1kpzz6oSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed65fed670801f3ed524eae27734cf45bcaf19714b3d7f62e4d74a688b40589","last_reissued_at":"2026-05-18T00:18:58.173011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:58.173011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colorings v.s. list colorings of uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jianguo Qian, Wei Wang, Zhidan Yan","submitted_at":"2018-04-09T07:35:59Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02852","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.02852","created_at":"2026-05-18T00:18:58.173100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02852v1","created_at":"2026-05-18T00:18:58.173100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02852","created_at":"2026-05-18T00:18:58.173100+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3LF73LHBAA7","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3LF73LHBAA7H3KS","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3LF73LH","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R","json":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R.json","graph_json":"https://pith.science/api/pith-number/B3LF73LHBAA7H3KSJ2XCO42M6R/graph.json","events_json":"https://pith.science/api/pith-number/B3LF73LHBAA7H3KSJ2XCO42M6R/events.json","paper":"https://pith.science/paper/B3LF73LH"},"agent_actions":{"view_html":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R","download_json":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R.json","view_paper":"https://pith.science/paper/B3LF73LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02852&json=true","fetch_graph":"https://pith.science/api/pith-number/B3LF73LHBAA7H3KSJ2XCO42M6R/graph.json","fetch_events":"https://pith.science/api/pith-number/B3LF73LHBAA7H3KSJ2XCO42M6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R/action/storage_attestation","attest_author":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R/action/author_attestation","sign_citation":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R/action/citation_signature","submit_replication":"https://pith.science/pith/B3LF73LHBAA7H3KSJ2XCO42M6R/action/replication_record"}},"created_at":"2026-05-18T00:18:58.173100+00:00","updated_at":"2026-05-18T00:18:58.173100+00:00"}