{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5TGNJVIJIILEN2EUVKUFLCIOUO","short_pith_number":"pith:5TGNJVIJ","schema_version":"1.0","canonical_sha256":"ecccd4d509421646e894aaa855890ea3a8eb7ec47e32925a19a9487e57203818","source":{"kind":"arxiv","id":"1607.07432","version":2},"attestation_state":"computed","paper":{"title":"Chromatic Number of Random Kneser Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2016-07-25T19:57:01Z","abstract_excerpt":"Recently, Kupavskii~[{\\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\\rm 2016}.}] investigated the chromatic number of random Kneser graphs $\\KG_{n,k}(\\rho)$ and proved that, in many cases, the chromatic numbers of the random Kneser graph $\\KG_{n,k}(\\rho)$ and the Kneser graph $\\KG_{n,k}$ are almost surely closed. He also marked the studying of the chromatic number of random Kneser hypergraphs $\\KG^r_{n,k}(\\rho)$ as a very interesting problem. With the help of $\\Z_p$-Tucker lemma, a combinatorial generalization of the Borsuk-Ulam theorem, we generalize K"},"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":"1607.07432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T19:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"e96b61e9248cdc6095bc63f702f44d1d4e2f98c3330afd4e31b7b3ebc35bdfb6","abstract_canon_sha256":"bfdf8a76f6a22bce546f2404fff90fbce51e59c91fa02738ac5b4ecd2ed6b6a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.192833Z","signature_b64":"3o7Oz2ns5SZqDw39dukx1pwu1UhVDW5e2upNeyUG4f5XwbJIEc9nnzKOUnBVX6qRkJTbWokU5pCOQMzOUAXDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecccd4d509421646e894aaa855890ea3a8eb7ec47e32925a19a9487e57203818","last_reissued_at":"2026-05-18T01:09:06.192353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.192353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic Number of Random Kneser Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2016-07-25T19:57:01Z","abstract_excerpt":"Recently, Kupavskii~[{\\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\\rm 2016}.}] investigated the chromatic number of random Kneser graphs $\\KG_{n,k}(\\rho)$ and proved that, in many cases, the chromatic numbers of the random Kneser graph $\\KG_{n,k}(\\rho)$ and the Kneser graph $\\KG_{n,k}$ are almost surely closed. He also marked the studying of the chromatic number of random Kneser hypergraphs $\\KG^r_{n,k}(\\rho)$ as a very interesting problem. With the help of $\\Z_p$-Tucker lemma, a combinatorial generalization of the Borsuk-Ulam theorem, we generalize K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07432","kind":"arxiv","version":2},"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":"1607.07432","created_at":"2026-05-18T01:09:06.192427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07432v2","created_at":"2026-05-18T01:09:06.192427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07432","created_at":"2026-05-18T01:09:06.192427+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TGNJVIJIILE","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TGNJVIJIILEN2EU","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TGNJVIJ","created_at":"2026-05-18T12:30:01.593930+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/5TGNJVIJIILEN2EUVKUFLCIOUO","json":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO.json","graph_json":"https://pith.science/api/pith-number/5TGNJVIJIILEN2EUVKUFLCIOUO/graph.json","events_json":"https://pith.science/api/pith-number/5TGNJVIJIILEN2EUVKUFLCIOUO/events.json","paper":"https://pith.science/paper/5TGNJVIJ"},"agent_actions":{"view_html":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO","download_json":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO.json","view_paper":"https://pith.science/paper/5TGNJVIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07432&json=true","fetch_graph":"https://pith.science/api/pith-number/5TGNJVIJIILEN2EUVKUFLCIOUO/graph.json","fetch_events":"https://pith.science/api/pith-number/5TGNJVIJIILEN2EUVKUFLCIOUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO/action/storage_attestation","attest_author":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO/action/author_attestation","sign_citation":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO/action/citation_signature","submit_replication":"https://pith.science/pith/5TGNJVIJIILEN2EUVKUFLCIOUO/action/replication_record"}},"created_at":"2026-05-18T01:09:06.192427+00:00","updated_at":"2026-05-18T01:09:06.192427+00:00"}