{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YDPA65QXN6XZ37FELZG4SJ7JOF","short_pith_number":"pith:YDPA65QX","schema_version":"1.0","canonical_sha256":"c0de0f76176faf9dfca45e4dc927e9714392b994e4469c455a65d0836acc3c77","source":{"kind":"arxiv","id":"2304.03203","version":2},"attestation_state":"computed","paper":{"title":"The number of colorings of the middle layers of the Hamming cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gweneth McKinley, Jinyoung Park, Lina Li","submitted_at":"2023-04-06T16:25:56Z","abstract_excerpt":"For an odd integer $n = 2d-1$, let $\\mathcal B_d$ be the subgraph of the hypercube $Q_n$ induced by the two largest layers. In this paper, we describe the typical structure of proper $q$-colorings of $V(\\mathcal B_d)$ and give asymptotics on the number of them. The proofs use various tools including information theory (entropy), Sapozhenko's graph container method and a recently developed method of M. Jenssen and W. Perkins that combines Sapozhenko's graph container lemma with the cluster expansion for polymer models from statistical physics."},"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":"2304.03203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-06T16:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"d79e53efb3ac72df75a3b5db8b0d63c9f365dcfca29ea6d19915422a4ec53163","abstract_canon_sha256":"ef1631c6f1c7d421e60988da110baceac1492cd4c69833effe2f8c3654353d82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:09.455882Z","signature_b64":"m6tt95zAAk2pMD+YSu2TBPz1DcoAOfv30pwAWEQk8uOxBwdCBPgD5Z++L/OozciEl0H6RC8WW2dUhavJ/6J/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0de0f76176faf9dfca45e4dc927e9714392b994e4469c455a65d0836acc3c77","last_reissued_at":"2026-07-05T06:14:09.455533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:09.455533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of colorings of the middle layers of the Hamming cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gweneth McKinley, Jinyoung Park, Lina Li","submitted_at":"2023-04-06T16:25:56Z","abstract_excerpt":"For an odd integer $n = 2d-1$, let $\\mathcal B_d$ be the subgraph of the hypercube $Q_n$ induced by the two largest layers. In this paper, we describe the typical structure of proper $q$-colorings of $V(\\mathcal B_d)$ and give asymptotics on the number of them. The proofs use various tools including information theory (entropy), Sapozhenko's graph container method and a recently developed method of M. Jenssen and W. Perkins that combines Sapozhenko's graph container lemma with the cluster expansion for polymer models from statistical physics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03203","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.03203/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.03203","created_at":"2026-07-05T06:14:09.455589+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03203v2","created_at":"2026-07-05T06:14:09.455589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03203","created_at":"2026-07-05T06:14:09.455589+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDPA65QXN6XZ","created_at":"2026-07-05T06:14:09.455589+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDPA65QXN6XZ37FE","created_at":"2026-07-05T06:14:09.455589+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDPA65QX","created_at":"2026-07-05T06:14:09.455589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03119","citing_title":"Range of random $\\mathbb Z$-homomorphisms on weak expanders","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF","json":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF.json","graph_json":"https://pith.science/api/pith-number/YDPA65QXN6XZ37FELZG4SJ7JOF/graph.json","events_json":"https://pith.science/api/pith-number/YDPA65QXN6XZ37FELZG4SJ7JOF/events.json","paper":"https://pith.science/paper/YDPA65QX"},"agent_actions":{"view_html":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF","download_json":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF.json","view_paper":"https://pith.science/paper/YDPA65QX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03203&json=true","fetch_graph":"https://pith.science/api/pith-number/YDPA65QXN6XZ37FELZG4SJ7JOF/graph.json","fetch_events":"https://pith.science/api/pith-number/YDPA65QXN6XZ37FELZG4SJ7JOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF/action/storage_attestation","attest_author":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF/action/author_attestation","sign_citation":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF/action/citation_signature","submit_replication":"https://pith.science/pith/YDPA65QXN6XZ37FELZG4SJ7JOF/action/replication_record"}},"created_at":"2026-07-05T06:14:09.455589+00:00","updated_at":"2026-07-05T06:14:09.455589+00:00"}