{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WB5NZL7OAVCA55OPBKN3PZP4B4","short_pith_number":"pith:WB5NZL7O","canonical_record":{"source":{"id":"1410.3021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-11T19:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"f9824552ee6b4dfa92631e26f744558755d84716fede062ca70633db061d86c2","abstract_canon_sha256":"c9f935b8dedec170542d1425d37e02571312d155bda27a0f8588659c461e3407"},"schema_version":"1.0"},"canonical_sha256":"b07adcafee05440ef5cf0a9bb7e5fc0f0df2dc26f066a6a947fb2408f7903656","source":{"kind":"arxiv","id":"1410.3021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3021","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3021v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3021","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"WB5NZL7OAVCA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WB5NZL7OAVCA55OP","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WB5NZL7O","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WB5NZL7OAVCA55OPBKN3PZP4B4","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-11T19:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"f9824552ee6b4dfa92631e26f744558755d84716fede062ca70633db061d86c2","abstract_canon_sha256":"c9f935b8dedec170542d1425d37e02571312d155bda27a0f8588659c461e3407"},"schema_version":"1.0"},"canonical_sha256":"b07adcafee05440ef5cf0a9bb7e5fc0f0df2dc26f066a6a947fb2408f7903656","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:17.227698Z","signature_b64":"+R5FjAaXUHFP+jo5nCFgHuEaSHQvaJMCK1Oh+dZkC5OeT9jrhF1Dk+nHV50RaQrvFrPCOB/W3bXKJFW0wtT5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07adcafee05440ef5cf0a9bb7e5fc0f0df2dc26f066a6a947fb2408f7903656","last_reissued_at":"2026-05-18T02:40:17.227297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:17.227297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3021","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mS9zMvqsGFBXyxFVV4/oBa56GecjmjGvy+YcZaZbi37z2fRyex8WYGBoFSYvSKuoZtpLFMuYYtFraQUMzTgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:59:42.952881Z"},"content_sha256":"8bf642c750743844185bc7c448f0090baf51cd6391ef2de06db020c072559d8b","schema_version":"1.0","event_id":"sha256:8bf642c750743844185bc7c448f0090baf51cd6391ef2de06db020c072559d8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WB5NZL7OAVCA55OPBKN3PZP4B4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hedetniemi's conjecture for Kneser hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Meunier, Hossein Hajiabolhassan","submitted_at":"2014-10-11T19:08:07Z","abstract_excerpt":"One of the most famous conjecture in graph theory is Hedetniemi's conjecture stating that the chromatic number of the categorical product of graphs is the minimum of their chromatic numbers. Using a suitable extension of the definition of the categorical product, Zhu proposed in 1992 a similar conjecture for hypergraphs. We prove that Zhu's conjecture is true for the usual Kneser hypergraphs of same rank. It provides to the best of our knowledge the first non-trivial and explicit family of hypergraphs with rank larger than two satisfying this conjecture (the rank two case being Hedetniemi's co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3021","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtupJ7WgorJt/Ifz/F/A4+0TKXvQ9sXIfei7mNLJL6h6H1piTMe5yJBOe+A3fqupJ5jlo3W1R6j7t5yyYJ7IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:59:42.953534Z"},"content_sha256":"c3de9d5d2554941310c2d001d8adf05b776f7e315383b4df504b84244bc1691c","schema_version":"1.0","event_id":"sha256:c3de9d5d2554941310c2d001d8adf05b776f7e315383b4df504b84244bc1691c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WB5NZL7OAVCA55OPBKN3PZP4B4/bundle.json","state_url":"https://pith.science/pith/WB5NZL7OAVCA55OPBKN3PZP4B4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WB5NZL7OAVCA55OPBKN3PZP4B4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T22:59:42Z","links":{"resolver":"https://pith.science/pith/WB5NZL7OAVCA55OPBKN3PZP4B4","bundle":"https://pith.science/pith/WB5NZL7OAVCA55OPBKN3PZP4B4/bundle.json","state":"https://pith.science/pith/WB5NZL7OAVCA55OPBKN3PZP4B4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WB5NZL7OAVCA55OPBKN3PZP4B4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WB5NZL7OAVCA55OPBKN3PZP4B4","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":"c9f935b8dedec170542d1425d37e02571312d155bda27a0f8588659c461e3407","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-11T19:08:07Z","title_canon_sha256":"f9824552ee6b4dfa92631e26f744558755d84716fede062ca70633db061d86c2"},"schema_version":"1.0","source":{"id":"1410.3021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3021","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3021v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3021","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"WB5NZL7OAVCA","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WB5NZL7OAVCA55OP","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WB5NZL7O","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:c3de9d5d2554941310c2d001d8adf05b776f7e315383b4df504b84244bc1691c","target":"graph","created_at":"2026-05-18T02:40:17Z","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":"One of the most famous conjecture in graph theory is Hedetniemi's conjecture stating that the chromatic number of the categorical product of graphs is the minimum of their chromatic numbers. Using a suitable extension of the definition of the categorical product, Zhu proposed in 1992 a similar conjecture for hypergraphs. We prove that Zhu's conjecture is true for the usual Kneser hypergraphs of same rank. It provides to the best of our knowledge the first non-trivial and explicit family of hypergraphs with rank larger than two satisfying this conjecture (the rank two case being Hedetniemi's co","authors_text":"Fr\\'ed\\'eric Meunier, Hossein Hajiabolhassan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-11T19:08:07Z","title":"Hedetniemi's conjecture for Kneser hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3021","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:8bf642c750743844185bc7c448f0090baf51cd6391ef2de06db020c072559d8b","target":"record","created_at":"2026-05-18T02:40:17Z","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":"c9f935b8dedec170542d1425d37e02571312d155bda27a0f8588659c461e3407","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-11T19:08:07Z","title_canon_sha256":"f9824552ee6b4dfa92631e26f744558755d84716fede062ca70633db061d86c2"},"schema_version":"1.0","source":{"id":"1410.3021","kind":"arxiv","version":1}},"canonical_sha256":"b07adcafee05440ef5cf0a9bb7e5fc0f0df2dc26f066a6a947fb2408f7903656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b07adcafee05440ef5cf0a9bb7e5fc0f0df2dc26f066a6a947fb2408f7903656","first_computed_at":"2026-05-18T02:40:17.227297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:17.227297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+R5FjAaXUHFP+jo5nCFgHuEaSHQvaJMCK1Oh+dZkC5OeT9jrhF1Dk+nHV50RaQrvFrPCOB/W3bXKJFW0wtT5Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:17.227698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bf642c750743844185bc7c448f0090baf51cd6391ef2de06db020c072559d8b","sha256:c3de9d5d2554941310c2d001d8adf05b776f7e315383b4df504b84244bc1691c"],"state_sha256":"1ddb6301b0eed55a49a4836aaa2ba55fbda963478d56f8287534007686bc35cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+TCBXfTbd0GAcxf34O24MzikhictW2OiJqf0Oi2jox6RgaWV3Ig1p5CcPerrvtDHFR0+xUVbzaO6TNzIXBcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:59:42.957007Z","bundle_sha256":"2a2b9ac776b4689ad1275e7891d380c13376a676945488aaea5e95cd7915afe0"}}