{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:S2YIMHICNC2EOUCID2DQ6FXNPZ","short_pith_number":"pith:S2YIMHIC","canonical_record":{"source":{"id":"2605.15105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:23:04Z","cross_cats_sorted":[],"title_canon_sha256":"d7efcb6681589ed4655b3c175f2aec4379df8cb87e7827bb456f500ead80b6a9","abstract_canon_sha256":"e7ef263ca68272e1c715e7b6c3328fa0be845b7c39f3369a9f82221595dccc0c"},"schema_version":"1.0"},"canonical_sha256":"96b0861d0268b44750481e870f16ed7e66f67f2541bc6a94034cac7b8d8f706d","source":{"kind":"arxiv","id":"2605.15105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15105","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15105v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"S2YIMHICNC2E","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"S2YIMHICNC2EOUCI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"S2YIMHIC","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:S2YIMHICNC2EOUCID2DQ6FXNPZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:23:04Z","cross_cats_sorted":[],"title_canon_sha256":"d7efcb6681589ed4655b3c175f2aec4379df8cb87e7827bb456f500ead80b6a9","abstract_canon_sha256":"e7ef263ca68272e1c715e7b6c3328fa0be845b7c39f3369a9f82221595dccc0c"},"schema_version":"1.0"},"canonical_sha256":"96b0861d0268b44750481e870f16ed7e66f67f2541bc6a94034cac7b8d8f706d","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"96b0861d0268b44750481e870f16ed7e66f67f2541bc6a94034cac7b8d8f706d","last_reissued_at":"2026-05-17T21:57:19.127486Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.795609Z"},"source_kind":"arxiv","source_id":"2605.15105","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-17T21:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UV9s6Q6qpazkoZRa3/LsV5rJ4wtmoEXWFv/iYKhxYIcOUulAafyckSoXF1MKOyiBhoFGx8swcKCLNPkS7SprBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:20.206056Z"},"content_sha256":"0bddbe7513f163a2638f24945227cfe0d4989594c92c09968967122e39c025f3","schema_version":"1.0","event_id":"sha256:0bddbe7513f163a2638f24945227cfe0d4989594c92c09968967122e39c025f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:S2YIMHICNC2EOUCID2DQ6FXNPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform Tur\\'an densities of $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For any family of k-graphs, the (k-2)-uniform Turán density equals the palette Turán density.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Guowei Sun, Hao Lin, Wenling Zhou","submitted_at":"2026-05-14T17:23:04Z","abstract_excerpt":"For $k\\ge 3$, the $(k-2)$-uniform Tur\\'an density $\\pi_{k-2}(F)$ of a $k$-graph $F$ is the supremum of $d$ for which there are arbitrarily large $F$-free $k$-graphs that are uniformly $d$-dense with respect to the $k$-vertex cliques of every $(k-2)$-graph on the same vertex set. We develop a \\emph{palette framework} for this density. For every family $\\mathcal F$ of $k$-graphs, we prove that $\\pi_{k-2}(\\mathcal F)$ equals the corresponding palette Tur\\'an density. We further establish palette classification tools for the existence of $k$-graphs satisfying prescribed palette colorability constr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For every family F of k-graphs, we prove that π_{k-2}(F) equals the corresponding palette Turán density. ... we establish the following values [list of six expressions] as (k-2)-uniform Turán densities of single k-graphs. Finally ... there exist k-graphs F1,F2 such that π_{k-2}({F1,F2}) < min{π_{k-2}(F1),π_{k-2}(F2)}.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The palette classification tools correctly characterize the existence of k-graphs satisfying prescribed palette colorability constraints, and these tools apply without hidden restrictions on the underlying vertex sets or color palettes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For any family of k-graphs, the (k-2)-uniform Turán density equals the palette Turán density.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"865fd8208137392df14498b20f99aa7fbd3e56a8aa39f612ffe40ed393c5fe06"},"source":{"id":"2605.15105","kind":"arxiv","version":1},"verdict":{"id":"3c592261-d041-4b4d-9371-6859f9c082fc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:15:45.126868Z","strongest_claim":"For every family F of k-graphs, we prove that π_{k-2}(F) equals the corresponding palette Turán density. ... we establish the following values [list of six expressions] as (k-2)-uniform Turán densities of single k-graphs. Finally ... there exist k-graphs F1,F2 such that π_{k-2}({F1,F2}) < min{π_{k-2}(F1),π_{k-2}(F2)}.","one_line_summary":"A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The palette classification tools correctly characterize the existence of k-graphs satisfying prescribed palette colorability constraints, and these tools apply without hidden restrictions on the underlying vertex sets or color palettes.","pith_extraction_headline":"For any family of k-graphs, the (k-2)-uniform Turán density equals the palette Turán density."},"references":{"count":31,"sample":[{"doi":"","year":2002,"title":"J. Balogh. The Turán density of triple systems is not principal.J. Combin. Theory Ser. A, 100(1):176–180, 2002","work_id":"da375963-25ec-4ba1-9c00-e5d90dedfa78","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1969,"title":"Colloq., Balatonfüred, 1969), volume 4 ofColloq","work_id":"00fd6110-fabc-40a4-90f5-50025ce220b0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"M. Bucić, J. W. Cooper, D. Král’, S. Mohr, and D. Munhá Correia. Uniform Turán density of cycles.Trans. Amer. Math. Soc., 376(7):4765–4809, 2023","work_id":"f31abd78-e169-4989-93e9-2bb4f468ebda","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"A. Y. Chen and B. Schülke. Beyond the broken tetrahedron.Combin. Probab. Comput., 35(1):59–70, 2026","work_id":"db84fc52-5505-419c-a0a3-46465d9f56cf","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"O. Cooley, N. Fountoulakis, D. Kühn, and D. Osthus. Embeddings and Ramsey numbers of sparsek-uniform hypergraphs.Combinatorica, 29(3):263–297, 2009","work_id":"43ae44d9-5ace-4589-9f2a-72046170804f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"7ca160205783893f4c00c42c4a11a03e4d080fd6562a41e9288792e408f9a9c4","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6a6460af3242882b4d38e85477176a4c72cd4b3e5d522e7eca41037974deb8c4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"3c592261-d041-4b4d-9371-6859f9c082fc"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T21:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Xw828a8LBtFjTmbjRY8HNPniosuulNPPFF3LnxAhKmAS96ijOZjl0cYpyE/7cmkG3GXG9nrt/uLwvTAL04pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:20.206655Z"},"content_sha256":"f7e343bf2584c286a843c9420403abb0f9f7e4089c63f119fece5453a0ee7a99","schema_version":"1.0","event_id":"sha256:f7e343bf2584c286a843c9420403abb0f9f7e4089c63f119fece5453a0ee7a99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ/bundle.json","state_url":"https://pith.science/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ/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-06-01T14:43:20Z","links":{"resolver":"https://pith.science/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ","bundle":"https://pith.science/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ/bundle.json","state":"https://pith.science/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2YIMHICNC2EOUCID2DQ6FXNPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S2YIMHICNC2EOUCID2DQ6FXNPZ","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":"e7ef263ca68272e1c715e7b6c3328fa0be845b7c39f3369a9f82221595dccc0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:23:04Z","title_canon_sha256":"d7efcb6681589ed4655b3c175f2aec4379df8cb87e7827bb456f500ead80b6a9"},"schema_version":"1.0","source":{"id":"2605.15105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15105","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15105v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"S2YIMHICNC2E","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"S2YIMHICNC2EOUCI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"S2YIMHIC","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f7e343bf2584c286a843c9420403abb0f9f7e4089c63f119fece5453a0ee7a99","target":"graph","created_at":"2026-05-17T21:57:19Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For every family F of k-graphs, we prove that π_{k-2}(F) equals the corresponding palette Turán density. ... we establish the following values [list of six expressions] as (k-2)-uniform Turán densities of single k-graphs. Finally ... there exist k-graphs F1,F2 such that π_{k-2}({F1,F2}) < min{π_{k-2}(F1),π_{k-2}(F2)}."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The palette classification tools correctly characterize the existence of k-graphs satisfying prescribed palette colorability constraints, and these tools apply without hidden restrictions on the underlying vertex sets or color palettes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For any family of k-graphs, the (k-2)-uniform Turán density equals the palette Turán density."}],"snapshot_sha256":"865fd8208137392df14498b20f99aa7fbd3e56a8aa39f612ffe40ed393c5fe06"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6a6460af3242882b4d38e85477176a4c72cd4b3e5d522e7eca41037974deb8c4"},"paper":{"abstract_excerpt":"For $k\\ge 3$, the $(k-2)$-uniform Tur\\'an density $\\pi_{k-2}(F)$ of a $k$-graph $F$ is the supremum of $d$ for which there are arbitrarily large $F$-free $k$-graphs that are uniformly $d$-dense with respect to the $k$-vertex cliques of every $(k-2)$-graph on the same vertex set. We develop a \\emph{palette framework} for this density. For every family $\\mathcal F$ of $k$-graphs, we prove that $\\pi_{k-2}(\\mathcal F)$ equals the corresponding palette Tur\\'an density. We further establish palette classification tools for the existence of $k$-graphs satisfying prescribed palette colorability constr","authors_text":"Guanghui Wang, Guowei Sun, Hao Lin, Wenling Zhou","cross_cats":[],"headline":"For any family of k-graphs, the (k-2)-uniform Turán density equals the palette Turán density.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:23:04Z","title":"Uniform Tur\\'an densities of $k$-uniform hypergraphs"},"references":{"count":31,"internal_anchors":0,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"J. Balogh. The Turán density of triple systems is not principal.J. Combin. Theory Ser. A, 100(1):176–180, 2002","work_id":"da375963-25ec-4ba1-9c00-e5d90dedfa78","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Colloq., Balatonfüred, 1969), volume 4 ofColloq","work_id":"00fd6110-fabc-40a4-90f5-50025ce220b0","year":1969},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"M. Bucić, J. W. Cooper, D. Král’, S. Mohr, and D. Munhá Correia. Uniform Turán density of cycles.Trans. Amer. Math. Soc., 376(7):4765–4809, 2023","work_id":"f31abd78-e169-4989-93e9-2bb4f468ebda","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A. Y. Chen and B. Schülke. Beyond the broken tetrahedron.Combin. Probab. Comput., 35(1):59–70, 2026","work_id":"db84fc52-5505-419c-a0a3-46465d9f56cf","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"O. Cooley, N. Fountoulakis, D. Kühn, and D. Osthus. Embeddings and Ramsey numbers of sparsek-uniform hypergraphs.Combinatorica, 29(3):263–297, 2009","work_id":"43ae44d9-5ace-4589-9f2a-72046170804f","year":2009}],"snapshot_sha256":"7ca160205783893f4c00c42c4a11a03e4d080fd6562a41e9288792e408f9a9c4"},"source":{"id":"2605.15105","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:15:45.126868Z","id":"3c592261-d041-4b4d-9371-6859f9c082fc","model_set":{"reader":"grok-4.3"},"one_line_summary":"A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For any family of k-graphs, the (k-2)-uniform Turán density equals the palette Turán density.","strongest_claim":"For every family F of k-graphs, we prove that π_{k-2}(F) equals the corresponding palette Turán density. ... we establish the following values [list of six expressions] as (k-2)-uniform Turán densities of single k-graphs. Finally ... there exist k-graphs F1,F2 such that π_{k-2}({F1,F2}) < min{π_{k-2}(F1),π_{k-2}(F2)}.","weakest_assumption":"The palette classification tools correctly characterize the existence of k-graphs satisfying prescribed palette colorability constraints, and these tools apply without hidden restrictions on the underlying vertex sets or color palettes."}},"verdict_id":"3c592261-d041-4b4d-9371-6859f9c082fc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0bddbe7513f163a2638f24945227cfe0d4989594c92c09968967122e39c025f3","target":"record","created_at":"2026-05-17T21:18:33Z","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":"e7ef263ca68272e1c715e7b6c3328fa0be845b7c39f3369a9f82221595dccc0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T17:23:04Z","title_canon_sha256":"d7efcb6681589ed4655b3c175f2aec4379df8cb87e7827bb456f500ead80b6a9"},"schema_version":"1.0","source":{"id":"2605.15105","kind":"arxiv","version":1}},"canonical_sha256":"96b0861d0268b44750481e870f16ed7e66f67f2541bc6a94034cac7b8d8f706d","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b0861d0268b44750481e870f16ed7e66f67f2541bc6a94034cac7b8d8f706d","first_computed_at":"2026-05-17T21:40:25.795609Z","kind":"pith_receipt","last_reissued_at":"2026-05-17T21:57:19.127486Z","receipt_version":"0.2","signature_status":"unsigned_v0"},"source_id":"2605.15105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bddbe7513f163a2638f24945227cfe0d4989594c92c09968967122e39c025f3","sha256:f7e343bf2584c286a843c9420403abb0f9f7e4089c63f119fece5453a0ee7a99"],"state_sha256":"9334f2cc1cca059ec8f07f2aa85d6214ca46f860f039d4d953729c5b681f51d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6j0nw10ykM4FXLM9H9M59zB/NvCwSQHPxZK7l3xZ/Mxs9pjeONzQ3g8Y8JT7Zq5gw7UxaVz0TskuIWj0YdEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:43:20.209078Z","bundle_sha256":"75996be06ebaf351c1891c67bfcb77bf51887c2eba90082b42b519fa36e8fba9"}}