{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4MDRKFIGARD5YYFLXVTRECO6AO","short_pith_number":"pith:4MDRKFIG","schema_version":"1.0","canonical_sha256":"e3071515060447dc60abbd671209de0387be15bffffe292be69b5f8ee2617f8b","source":{"kind":"arxiv","id":"1705.00223","version":1},"attestation_state":"computed","paper":{"title":"Coloring Properties of Categorical Product of General Kneser Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani, Meysam Alishahi, Roya Abyazi Sani","submitted_at":"2017-04-29T18:26:05Z","abstract_excerpt":"More than 50 years ago Hedetniemi conjectured that the chromatic number of categorical product of two graphs is equal to the minimum of their chromatic numbers. This conjecture has received a considerable attention in recent years. Hedetniemi's conjecture were generalized to hypergraphs by Zhu in 1992. Hajiabolhassan and Meunier (2016) introduced the first nontrivial lower bound for the chromatic number of categorical product of general Kneser hypergraphs and using this lower bound, they verified Zhu's conjecture for some families of hypergraphs. In this paper, we shall present some colorful t"},"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":"1705.00223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T18:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"0da0266d0c167c8c83174c00d2e84bb24d8864d9d5565d805b5b2be0a86ce151","abstract_canon_sha256":"69b47b9cbda8bd804efca1946a0b51e442f2202e6646a9bf0139f9e031edd5a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:21.098174Z","signature_b64":"YAy8hnPklAxdgywkaQgiHK/eEoPo7fJ56E8NVuw3my1O2E/maQClqcNXeAKoscBN1ZjBkEFRiys2K/ExR3A0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3071515060447dc60abbd671209de0387be15bffffe292be69b5f8ee2617f8b","last_reissued_at":"2026-05-18T00:45:21.097475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:21.097475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring Properties of Categorical Product of General Kneser Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani, Meysam Alishahi, Roya Abyazi Sani","submitted_at":"2017-04-29T18:26:05Z","abstract_excerpt":"More than 50 years ago Hedetniemi conjectured that the chromatic number of categorical product of two graphs is equal to the minimum of their chromatic numbers. This conjecture has received a considerable attention in recent years. Hedetniemi's conjecture were generalized to hypergraphs by Zhu in 1992. Hajiabolhassan and Meunier (2016) introduced the first nontrivial lower bound for the chromatic number of categorical product of general Kneser hypergraphs and using this lower bound, they verified Zhu's conjecture for some families of hypergraphs. In this paper, we shall present some colorful t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00223","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":"1705.00223","created_at":"2026-05-18T00:45:21.097588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00223v1","created_at":"2026-05-18T00:45:21.097588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00223","created_at":"2026-05-18T00:45:21.097588+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MDRKFIGARD5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MDRKFIGARD5YYFL","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MDRKFIG","created_at":"2026-05-18T12:31:00.734936+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/4MDRKFIGARD5YYFLXVTRECO6AO","json":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO.json","graph_json":"https://pith.science/api/pith-number/4MDRKFIGARD5YYFLXVTRECO6AO/graph.json","events_json":"https://pith.science/api/pith-number/4MDRKFIGARD5YYFLXVTRECO6AO/events.json","paper":"https://pith.science/paper/4MDRKFIG"},"agent_actions":{"view_html":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO","download_json":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO.json","view_paper":"https://pith.science/paper/4MDRKFIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00223&json=true","fetch_graph":"https://pith.science/api/pith-number/4MDRKFIGARD5YYFLXVTRECO6AO/graph.json","fetch_events":"https://pith.science/api/pith-number/4MDRKFIGARD5YYFLXVTRECO6AO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO/action/storage_attestation","attest_author":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO/action/author_attestation","sign_citation":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO/action/citation_signature","submit_replication":"https://pith.science/pith/4MDRKFIGARD5YYFLXVTRECO6AO/action/replication_record"}},"created_at":"2026-05-18T00:45:21.097588+00:00","updated_at":"2026-05-18T00:45:21.097588+00:00"}