{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FM3Z73VHYGGOB45BSNKSFJSBTY","short_pith_number":"pith:FM3Z73VH","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"},"canonical_sha256":"2b379feea7c18ce0f3a1935522a6419e1ba35c3cd2b98ea1c75aa7d778172dc7","source":{"kind":"arxiv","id":"2410.08921","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08921","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08921v2","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08921","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"FM3Z73VHYGGO","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"FM3Z73VHYGGOB45B","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"FM3Z73VH","created_at":"2026-07-05T10:11:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FM3Z73VHYGGOB45BSNKSFJSBTY","target":"record","payload":{"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"},"canonical_sha256":"2b379feea7c18ce0f3a1935522a6419e1ba35c3cd2b98ea1c75aa7d778172dc7","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"},"source_kind":"arxiv","source_id":"2410.08921","source_version":2,"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-07-05T10:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ie3l4jctwsYTKEL1iEM2ra6jmvBCBWWsPNjsnpEHpBnR2ynEbtvf9RGio6n+lRNZXEWZtx2GM53OetB6+/wYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:38:27.941121Z"},"content_sha256":"d435c24748d1c7dd011e8252404f2ff3f9c15f45d19c187c81088a8a9298c035","schema_version":"1.0","event_id":"sha256:d435c24748d1c7dd011e8252404f2ff3f9c15f45d19c187c81088a8a9298c035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FM3Z73VHYGGOB45BSNKSFJSBTY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioRHnVvr21XKhzPCpoc7TVe60RjVyp6PGyLXVK1LSuNrw0svSdo1kHLcX/rqISpjL2HPtbym0zxrQBKBttWnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:38:27.941503Z"},"content_sha256":"a9e4adaa19344c63c1a8499ca1d581014b3984391fbed2d74158fcba59885fbe","schema_version":"1.0","event_id":"sha256:a9e4adaa19344c63c1a8499ca1d581014b3984391fbed2d74158fcba59885fbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/bundle.json","state_url":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/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-07-06T18:38:27Z","links":{"resolver":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY","bundle":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/bundle.json","state":"https://pith.science/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FM3Z73VHYGGOB45BSNKSFJSBTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FM3Z73VHYGGOB45BSNKSFJSBTY","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":"4b99fc042482729e9513520382ce8cddad1b3ff2a3f71ec76fc4c6b4947d3069","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-11T15:48:18Z","title_canon_sha256":"2579c14709662d42be4a0119c13a83134ba02ea59204abf65d8c59e334ab4784"},"schema_version":"1.0","source":{"id":"2410.08921","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.08921","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2410.08921v2","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08921","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"FM3Z73VHYGGO","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"FM3Z73VHYGGOB45B","created_at":"2026-07-05T10:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"FM3Z73VH","created_at":"2026-07-05T10:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:a9e4adaa19344c63c1a8499ca1d581014b3984391fbed2d74158fcba59885fbe","target":"graph","created_at":"2026-07-05T10:11:25Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.08921/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bjarne Sch\\\"ulke, Haotian Yang, Hong Liu, Shuaichao Wang, Yixiao Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-11T15:48:18Z","title":"Separating hypergraph Tur\\'an densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08921","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d435c24748d1c7dd011e8252404f2ff3f9c15f45d19c187c81088a8a9298c035","target":"record","created_at":"2026-07-05T10:11:25Z","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":"4b99fc042482729e9513520382ce8cddad1b3ff2a3f71ec76fc4c6b4947d3069","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-11T15:48:18Z","title_canon_sha256":"2579c14709662d42be4a0119c13a83134ba02ea59204abf65d8c59e334ab4784"},"schema_version":"1.0","source":{"id":"2410.08921","kind":"arxiv","version":2}},"canonical_sha256":"2b379feea7c18ce0f3a1935522a6419e1ba35c3cd2b98ea1c75aa7d778172dc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b379feea7c18ce0f3a1935522a6419e1ba35c3cd2b98ea1c75aa7d778172dc7","first_computed_at":"2026-07-05T10:11:25.679953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:25.679953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfYCwY3BXXtX3klIO6n5YSbmM4bElHchOnMx9Sp8+o/imO405BpnbHLji5uvQVvJbQajtHK214vxa+o4bxQ2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:25.680480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.08921","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d435c24748d1c7dd011e8252404f2ff3f9c15f45d19c187c81088a8a9298c035","sha256:a9e4adaa19344c63c1a8499ca1d581014b3984391fbed2d74158fcba59885fbe"],"state_sha256":"828b3cec8090db3a49f5f2fa08788be0d61939135c1e4636e5b398319d380afa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGav4QULTasKRuilKtI7oEavLcNh8WGeiGypfK5l97DI6Soe3kDK2e/R2JsDIj4uJih/TS9vsNPZnrgt8sGqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:38:27.943531Z","bundle_sha256":"2a30239ca32a965ae77938037f9fc27e6d92dbb4e349d29f5afb57571c4a0ca9"}}