{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XA35D5ZAFFZ7IW4KTVDU67RSTP","short_pith_number":"pith:XA35D5ZA","schema_version":"1.0","canonical_sha256":"b837d1f7202973f45b8a9d474f7e329bde805d26bec1bb4c8a7ccaea7d18fee7","source":{"kind":"arxiv","id":"1808.01152","version":2},"attestation_state":"computed","paper":{"title":"The number of 4-colorings of the Hamming cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Jinyoung Park","submitted_at":"2018-08-03T11:00:26Z","abstract_excerpt":"Let $Q_d$ be the $d$-dimensional hypercube and $N=2^d$. We prove that the number of (proper) 4-colorings of $Q_d$ is asymptotically \\[6e2^N,\\] as was conjectured by Engbers and Galvin in 2012. The proof uses a combination of information theory (entropy) and isoperimetric ideas originating in work of Sapozhenko in the 1980's."},"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":"1808.01152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-03T11:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"d45f7d139d43d7e6b82d367d086223dda6a2f8da8852647dd149860556d508ff","abstract_canon_sha256":"2dcc42dcdf0e0f40e68ecd1ac6e3eef18b9770d2df92e5944b3d1045bc7e6a85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:36.175661Z","signature_b64":"kEzzEAE+b8caino7vkrKPYMBwYSZq9pP96hqCt/3J3K74KPO/yVNzWMSh1hU4Gk5Sh9gTiW/URgKXjYa9pD/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b837d1f7202973f45b8a9d474f7e329bde805d26bec1bb4c8a7ccaea7d18fee7","last_reissued_at":"2026-05-17T23:47:36.175145Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:36.175145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of 4-colorings of the Hamming cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Jinyoung Park","submitted_at":"2018-08-03T11:00:26Z","abstract_excerpt":"Let $Q_d$ be the $d$-dimensional hypercube and $N=2^d$. We prove that the number of (proper) 4-colorings of $Q_d$ is asymptotically \\[6e2^N,\\] as was conjectured by Engbers and Galvin in 2012. The proof uses a combination of information theory (entropy) and isoperimetric ideas originating in work of Sapozhenko in the 1980's."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01152","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":"1808.01152","created_at":"2026-05-17T23:47:36.175205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01152v2","created_at":"2026-05-17T23:47:36.175205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01152","created_at":"2026-05-17T23:47:36.175205+00:00"},{"alias_kind":"pith_short_12","alias_value":"XA35D5ZAFFZ7","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XA35D5ZAFFZ7IW4K","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XA35D5ZA","created_at":"2026-05-18T12:33:01.666342+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/XA35D5ZAFFZ7IW4KTVDU67RSTP","json":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP.json","graph_json":"https://pith.science/api/pith-number/XA35D5ZAFFZ7IW4KTVDU67RSTP/graph.json","events_json":"https://pith.science/api/pith-number/XA35D5ZAFFZ7IW4KTVDU67RSTP/events.json","paper":"https://pith.science/paper/XA35D5ZA"},"agent_actions":{"view_html":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP","download_json":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP.json","view_paper":"https://pith.science/paper/XA35D5ZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01152&json=true","fetch_graph":"https://pith.science/api/pith-number/XA35D5ZAFFZ7IW4KTVDU67RSTP/graph.json","fetch_events":"https://pith.science/api/pith-number/XA35D5ZAFFZ7IW4KTVDU67RSTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP/action/storage_attestation","attest_author":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP/action/author_attestation","sign_citation":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP/action/citation_signature","submit_replication":"https://pith.science/pith/XA35D5ZAFFZ7IW4KTVDU67RSTP/action/replication_record"}},"created_at":"2026-05-17T23:47:36.175205+00:00","updated_at":"2026-05-17T23:47:36.175205+00:00"}