{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CSQGMNPFJNJVZJOKKKHPUUO4KE","short_pith_number":"pith:CSQGMNPF","schema_version":"1.0","canonical_sha256":"14a06635e54b535ca5ca528efa51dc511586c76303b34264e4dc584ee32b4c71","source":{"kind":"arxiv","id":"1208.0812","version":4},"attestation_state":"computed","paper":{"title":"On the chromatic number of a random hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alan Frieze, Catherine Greenhill, Martin Dyer","submitted_at":"2012-08-03T18:26:50Z","abstract_excerpt":"We consider the problem of $k$-colouring a random $r$-uniform hypergraph with $n$ vertices and $cn$ edges, where $k$, $r$, $c$ remain constant as $n$ tends to infinity. Achlioptas and Naor showed that the chromatic number of a random graph in this setting, the case $r=2$, must have one of two easily computable values as $n$ tends to infinity. We give a complete generalisation of this result to random uniform hypergraphs."},"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":"1208.0812","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-03T18:26:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6b4c9a2095156aac85eeeccf9bf9ed2b37183b421f73791da2daad519de2cda6","abstract_canon_sha256":"d2c9f73bb13f5bfa969e3784616ab80ff7249043bddc89c988dc61d3cac5c1be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.803974Z","signature_b64":"e5knPfwjVBGkBo5tzZjfjEmeKiFUrPRdRLvIwfHBwDjLkfyOErWvz+Lfh7dCPFyGBtv8wBMZTYBtwgIQFLqQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14a06635e54b535ca5ca528efa51dc511586c76303b34264e4dc584ee32b4c71","last_reissued_at":"2026-05-18T02:30:08.803475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.803475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the chromatic number of a random hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alan Frieze, Catherine Greenhill, Martin Dyer","submitted_at":"2012-08-03T18:26:50Z","abstract_excerpt":"We consider the problem of $k$-colouring a random $r$-uniform hypergraph with $n$ vertices and $cn$ edges, where $k$, $r$, $c$ remain constant as $n$ tends to infinity. Achlioptas and Naor showed that the chromatic number of a random graph in this setting, the case $r=2$, must have one of two easily computable values as $n$ tends to infinity. We give a complete generalisation of this result to random uniform hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0812","kind":"arxiv","version":4},"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":"1208.0812","created_at":"2026-05-18T02:30:08.803551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0812v4","created_at":"2026-05-18T02:30:08.803551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0812","created_at":"2026-05-18T02:30:08.803551+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSQGMNPFJNJV","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSQGMNPFJNJVZJOK","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSQGMNPF","created_at":"2026-05-18T12:27:01.376967+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/CSQGMNPFJNJVZJOKKKHPUUO4KE","json":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE.json","graph_json":"https://pith.science/api/pith-number/CSQGMNPFJNJVZJOKKKHPUUO4KE/graph.json","events_json":"https://pith.science/api/pith-number/CSQGMNPFJNJVZJOKKKHPUUO4KE/events.json","paper":"https://pith.science/paper/CSQGMNPF"},"agent_actions":{"view_html":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE","download_json":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE.json","view_paper":"https://pith.science/paper/CSQGMNPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0812&json=true","fetch_graph":"https://pith.science/api/pith-number/CSQGMNPFJNJVZJOKKKHPUUO4KE/graph.json","fetch_events":"https://pith.science/api/pith-number/CSQGMNPFJNJVZJOKKKHPUUO4KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE/action/storage_attestation","attest_author":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE/action/author_attestation","sign_citation":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE/action/citation_signature","submit_replication":"https://pith.science/pith/CSQGMNPFJNJVZJOKKKHPUUO4KE/action/replication_record"}},"created_at":"2026-05-18T02:30:08.803551+00:00","updated_at":"2026-05-18T02:30:08.803551+00:00"}