{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A2EHUFUDOQ6AUJLRPLJPTAQF73","short_pith_number":"pith:A2EHUFUD","schema_version":"1.0","canonical_sha256":"06887a1683743c0a25717ad2f98205fec80c5bab2bae03b867c2df16070dda30","source":{"kind":"arxiv","id":"2305.01305","version":1},"attestation_state":"computed","paper":{"title":"The minimum positive uniform Tur\\'an density in uniformly dense $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hao Lin, Wenling Zhou","submitted_at":"2023-05-02T10:30:13Z","abstract_excerpt":"A $k$-graph (or $k$-uniform hypergraph) $H$ is uniformly dense if the edge distribution of $H$ is uniformly dense with respect to every large collection of $k$-vertex cliques induced by sets of $(k-2)$-tuples. Reiher, R\\\"odl and Schacht [Int. Math. Res. Not., 2018] proposed the study of the uniform Tur\\'an density $\\pi_{k-2}(F)$ for given $k$-graphs $F$ in uniformly dense $k$-graphs. Meanwhile, they [J. London Math. Soc., 2018] characterized $k$-graphs $F$ satisfying $\\pi_{k-2}(F)=0$ and showed that $\\pi_{k-2}(\\cdot)$ ``jumps\" from 0 to at least $k^{-k}$. In particular, they asked whether ther"},"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":"2305.01305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-02T10:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"3c05d94cbc90623f102a9adf459a368f89284cbc562d2a4f994c631c440ec72c","abstract_canon_sha256":"c82b7c209990b0e8430d7efcb4ad4557885fcb68d9fa907dfb4d54dbf1505887"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:24.212968Z","signature_b64":"mfnRFIWc4BEi2+vUIkifNwxxEm/O7D2JCuMyDkKTW0YCgIgoCtr50X838ZnTOikSJjDxL9nGvcaloSXJRoGxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06887a1683743c0a25717ad2f98205fec80c5bab2bae03b867c2df16070dda30","last_reissued_at":"2026-07-05T06:06:24.212499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:24.212499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum positive uniform Tur\\'an density in uniformly dense $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hao Lin, Wenling Zhou","submitted_at":"2023-05-02T10:30:13Z","abstract_excerpt":"A $k$-graph (or $k$-uniform hypergraph) $H$ is uniformly dense if the edge distribution of $H$ is uniformly dense with respect to every large collection of $k$-vertex cliques induced by sets of $(k-2)$-tuples. Reiher, R\\\"odl and Schacht [Int. Math. Res. Not., 2018] proposed the study of the uniform Tur\\'an density $\\pi_{k-2}(F)$ for given $k$-graphs $F$ in uniformly dense $k$-graphs. Meanwhile, they [J. London Math. Soc., 2018] characterized $k$-graphs $F$ satisfying $\\pi_{k-2}(F)=0$ and showed that $\\pi_{k-2}(\\cdot)$ ``jumps\" from 0 to at least $k^{-k}$. In particular, they asked whether ther"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01305","kind":"arxiv","version":1},"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/2305.01305/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":"2305.01305","created_at":"2026-07-05T06:06:24.212569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01305v1","created_at":"2026-07-05T06:06:24.212569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01305","created_at":"2026-07-05T06:06:24.212569+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2EHUFUDOQ6A","created_at":"2026-07-05T06:06:24.212569+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2EHUFUDOQ6AUJLR","created_at":"2026-07-05T06:06:24.212569+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2EHUFUD","created_at":"2026-07-05T06:06:24.212569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20696","citing_title":"Uniform Tur\\'an density beyond 3-graphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73","json":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73.json","graph_json":"https://pith.science/api/pith-number/A2EHUFUDOQ6AUJLRPLJPTAQF73/graph.json","events_json":"https://pith.science/api/pith-number/A2EHUFUDOQ6AUJLRPLJPTAQF73/events.json","paper":"https://pith.science/paper/A2EHUFUD"},"agent_actions":{"view_html":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73","download_json":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73.json","view_paper":"https://pith.science/paper/A2EHUFUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01305&json=true","fetch_graph":"https://pith.science/api/pith-number/A2EHUFUDOQ6AUJLRPLJPTAQF73/graph.json","fetch_events":"https://pith.science/api/pith-number/A2EHUFUDOQ6AUJLRPLJPTAQF73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73/action/storage_attestation","attest_author":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73/action/author_attestation","sign_citation":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73/action/citation_signature","submit_replication":"https://pith.science/pith/A2EHUFUDOQ6AUJLRPLJPTAQF73/action/replication_record"}},"created_at":"2026-07-05T06:06:24.212569+00:00","updated_at":"2026-07-05T06:06:24.212569+00:00"}