{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5BMYZNQ6IX6W7OWLK7JRSZCQL3","short_pith_number":"pith:5BMYZNQ6","schema_version":"1.0","canonical_sha256":"e8598cb61e45fd6fbacb57d31964505ed8d85e0848dc7690caf0bfe3ae819605","source":{"kind":"arxiv","id":"1403.4404","version":5},"attestation_state":"computed","paper":{"title":"Hedetniemi's Conjecture Via Altermatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2014-03-18T11:04:57Z","abstract_excerpt":"A $50$ years unsolved conjecture by Hedetniemi [{\\it Homomorphisms of graphs and automata, \\newblock {\\em Thesis (Ph.D.)--University of Michigan}, 1966}] asserts that the chromatic number of the categorical product of two graphs $G$ and $H$ is $\\min\\{\\chi(G),\\chi(H)\\}$. The present authors [{\\it On the chromatic number of general {K}neser hypergraphs. \\newblock {\\em Journal of Combinatorial Theory, Series B}, 2015.}] introduced the altermatic and the strong altermatic number of graphs as two tight lower bounds for the chromatic number of graphs. In this work, we prove a relaxation of Hedetniem"},"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":"1403.4404","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-18T11:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"40339de60bb3d7fc5c8c7f9e0d97d037619ea8e94d8c04d1cd8722dd2857e643","abstract_canon_sha256":"eb367494b201efe82bc308d681d41cb847b69f672d52fa481cc9eb69e94c6143"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:15.403640Z","signature_b64":"0v8zIXHXznTf6FmKUocLVwP9K7gGuIB/SZgLPwmrv6Eb9FIsJ9JsjbUuD3PbGNLwqUz49liLTCzhehwDPgy4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8598cb61e45fd6fbacb57d31964505ed8d85e0848dc7690caf0bfe3ae819605","last_reissued_at":"2026-05-18T01:10:15.403047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:15.403047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hedetniemi's Conjecture Via Altermatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hossein Hajiabolhassan, Meysam Alishahi","submitted_at":"2014-03-18T11:04:57Z","abstract_excerpt":"A $50$ years unsolved conjecture by Hedetniemi [{\\it Homomorphisms of graphs and automata, \\newblock {\\em Thesis (Ph.D.)--University of Michigan}, 1966}] asserts that the chromatic number of the categorical product of two graphs $G$ and $H$ is $\\min\\{\\chi(G),\\chi(H)\\}$. The present authors [{\\it On the chromatic number of general {K}neser hypergraphs. \\newblock {\\em Journal of Combinatorial Theory, Series B}, 2015.}] introduced the altermatic and the strong altermatic number of graphs as two tight lower bounds for the chromatic number of graphs. In this work, we prove a relaxation of Hedetniem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4404","kind":"arxiv","version":5},"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":"1403.4404","created_at":"2026-05-18T01:10:15.403147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4404v5","created_at":"2026-05-18T01:10:15.403147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4404","created_at":"2026-05-18T01:10:15.403147+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BMYZNQ6IX6W","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BMYZNQ6IX6W7OWL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BMYZNQ6","created_at":"2026-05-18T12:28:14.216126+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/5BMYZNQ6IX6W7OWLK7JRSZCQL3","json":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3.json","graph_json":"https://pith.science/api/pith-number/5BMYZNQ6IX6W7OWLK7JRSZCQL3/graph.json","events_json":"https://pith.science/api/pith-number/5BMYZNQ6IX6W7OWLK7JRSZCQL3/events.json","paper":"https://pith.science/paper/5BMYZNQ6"},"agent_actions":{"view_html":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3","download_json":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3.json","view_paper":"https://pith.science/paper/5BMYZNQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4404&json=true","fetch_graph":"https://pith.science/api/pith-number/5BMYZNQ6IX6W7OWLK7JRSZCQL3/graph.json","fetch_events":"https://pith.science/api/pith-number/5BMYZNQ6IX6W7OWLK7JRSZCQL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3/action/storage_attestation","attest_author":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3/action/author_attestation","sign_citation":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3/action/citation_signature","submit_replication":"https://pith.science/pith/5BMYZNQ6IX6W7OWLK7JRSZCQL3/action/replication_record"}},"created_at":"2026-05-18T01:10:15.403147+00:00","updated_at":"2026-05-18T01:10:15.403147+00:00"}