{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FM3Z73VHYGGOB45BSNKSFJSBTY","short_pith_number":"pith:FM3Z73VH","schema_version":"1.0","canonical_sha256":"2b379feea7c18ce0f3a1935522a6419e1ba35c3cd2b98ea1c75aa7d778172dc7","source":{"kind":"arxiv","id":"2410.08921","version":2},"attestation_state":"computed","paper":{"title":"Separating hypergraph Tur\\'an densities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarne Sch\\\"ulke, Haotian Yang, Hong Liu, Shuaichao Wang, Yixiao Zhang","submitted_at":"2024-10-11T15:48:18Z","abstract_excerpt":"Determining the Tur\\'an densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Tur\\'an posed this problem in 1941, $\\pi(K_{\\ell}^{(k)})$ remains unknown for all $\\ell>k\\geq 3$. Prior to this work, it was not even known whether $\\pi(K_{\\ell}^{(k)})<\\pi(K_{\\ell+1}^{(k)})$ holds for general $\\ell$ and $k$, and the best-known bounds on $\\pi(K_{\\ell}^{(k)})$ are far from implying anything close to this. We prove that $\\pi(K_{\\ell}^{(k)})<\\pi(K_{\\ell+1}^{(k)})$, for all $\\ell>k\\geq 3$, and provide a general criterion to distinguish the Tur\\'an densities of"},"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":"2410.08921","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-11T15:48:18Z","cross_cats_sorted":[],"title_canon_sha256":"2579c14709662d42be4a0119c13a83134ba02ea59204abf65d8c59e334ab4784","abstract_canon_sha256":"4b99fc042482729e9513520382ce8cddad1b3ff2a3f71ec76fc4c6b4947d3069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:25.680480Z","signature_b64":"VfYCwY3BXXtX3klIO6n5YSbmM4bElHchOnMx9Sp8+o/imO405BpnbHLji5uvQVvJbQajtHK214vxa+o4bxQ2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b379feea7c18ce0f3a1935522a6419e1ba35c3cd2b98ea1c75aa7d778172dc7","last_reissued_at":"2026-07-05T10:11:25.679953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:25.679953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating hypergraph Tur\\'an densities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarne Sch\\\"ulke, Haotian Yang, Hong Liu, Shuaichao Wang, Yixiao Zhang","submitted_at":"2024-10-11T15:48:18Z","abstract_excerpt":"Determining the Tur\\'an densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Tur\\'an posed this problem in 1941, $\\pi(K_{\\ell}^{(k)})$ remains unknown for all $\\ell>k\\geq 3$. Prior to this work, it was not even known whether $\\pi(K_{\\ell}^{(k)})<\\pi(K_{\\ell+1}^{(k)})$ holds for general $\\ell$ and $k$, and the best-known bounds on $\\pi(K_{\\ell}^{(k)})$ are far from implying anything close to this. We prove that $\\pi(K_{\\ell}^{(k)})<\\pi(K_{\\ell+1}^{(k)})$, for all $\\ell>k\\geq 3$, and provide a general criterion to distinguish the Tur\\'an densities of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08921","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/2410.08921/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":"2410.08921","created_at":"2026-07-05T10:11:25.680019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08921v2","created_at":"2026-07-05T10:11:25.680019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08921","created_at":"2026-07-05T10:11:25.680019+00:00"},{"alias_kind":"pith_short_12","alias_value":"FM3Z73VHYGGO","created_at":"2026-07-05T10:11:25.680019+00:00"},{"alias_kind":"pith_short_16","alias_value":"FM3Z73VHYGGOB45B","created_at":"2026-07-05T10:11:25.680019+00:00"},{"alias_kind":"pith_short_8","alias_value":"FM3Z73VH","created_at":"2026-07-05T10:11:25.680019+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/FM3Z73VHYGGOB45BSNKSFJSBTY","json":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY.json","graph_json":"https://pith.science/api/pith-number/FM3Z73VHYGGOB45BSNKSFJSBTY/graph.json","events_json":"https://pith.science/api/pith-number/FM3Z73VHYGGOB45BSNKSFJSBTY/events.json","paper":"https://pith.science/paper/FM3Z73VH"},"agent_actions":{"view_html":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY","download_json":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY.json","view_paper":"https://pith.science/paper/FM3Z73VH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08921&json=true","fetch_graph":"https://pith.science/api/pith-number/FM3Z73VHYGGOB45BSNKSFJSBTY/graph.json","fetch_events":"https://pith.science/api/pith-number/FM3Z73VHYGGOB45BSNKSFJSBTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/action/storage_attestation","attest_author":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/action/author_attestation","sign_citation":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/action/citation_signature","submit_replication":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/action/replication_record"}},"created_at":"2026-07-05T10:11:25.680019+00:00","updated_at":"2026-07-05T10:11:25.680019+00:00"}