{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NXUA3HC5HK67FEVXZHPZ76MB2H","short_pith_number":"pith:NXUA3HC5","schema_version":"1.0","canonical_sha256":"6de80d9c5d3abdf292b7c9df9ff981d1f3eef4880128c00f38a1df5735d3649f","source":{"kind":"arxiv","id":"1307.6841","version":1},"attestation_state":"computed","paper":{"title":"Hedetniemi's conjecture for uncountable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Assaf Rinot","submitted_at":"2013-07-25T18:57:24Z","abstract_excerpt":"It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic."},"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":"1307.6841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-25T18:57:24Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"606cca5f4eedbb2bf5db8e84ba2940ca4ef600e6b18492ff5fa4c95c26fc3508","abstract_canon_sha256":"091987e7d81552d3c2933a2c0d5b2103dc67761a8ef294d4a3e7cdba7999f084"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:34.533428Z","signature_b64":"hW6NJY6tPdvgCFovdkXSNKldAR9cq9dRJ3C5TphbNjr7/4eeokWT1HJlZingC0x9APoW+0syZ3AUW02j+XbpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de80d9c5d3abdf292b7c9df9ff981d1f3eef4880128c00f38a1df5735d3649f","last_reissued_at":"2026-05-18T03:17:34.532895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:34.532895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hedetniemi's conjecture for uncountable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Assaf Rinot","submitted_at":"2013-07-25T18:57:24Z","abstract_excerpt":"It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6841","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":"1307.6841","created_at":"2026-05-18T03:17:34.532980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6841v1","created_at":"2026-05-18T03:17:34.532980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6841","created_at":"2026-05-18T03:17:34.532980+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXUA3HC5HK67","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXUA3HC5HK67FEVX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXUA3HC5","created_at":"2026-05-18T12:27:52.871228+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/NXUA3HC5HK67FEVXZHPZ76MB2H","json":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H.json","graph_json":"https://pith.science/api/pith-number/NXUA3HC5HK67FEVXZHPZ76MB2H/graph.json","events_json":"https://pith.science/api/pith-number/NXUA3HC5HK67FEVXZHPZ76MB2H/events.json","paper":"https://pith.science/paper/NXUA3HC5"},"agent_actions":{"view_html":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H","download_json":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H.json","view_paper":"https://pith.science/paper/NXUA3HC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6841&json=true","fetch_graph":"https://pith.science/api/pith-number/NXUA3HC5HK67FEVXZHPZ76MB2H/graph.json","fetch_events":"https://pith.science/api/pith-number/NXUA3HC5HK67FEVXZHPZ76MB2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H/action/storage_attestation","attest_author":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H/action/author_attestation","sign_citation":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H/action/citation_signature","submit_replication":"https://pith.science/pith/NXUA3HC5HK67FEVXZHPZ76MB2H/action/replication_record"}},"created_at":"2026-05-18T03:17:34.532980+00:00","updated_at":"2026-05-18T03:17:34.532980+00:00"}