{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LKFAQQLK2WZJQBMV6KP6BPQKSY","short_pith_number":"pith:LKFAQQLK","schema_version":"1.0","canonical_sha256":"5a8a08416ad5b2980595f29fe0be0a9620711e71e2d5b3a868783d076c7df3c1","source":{"kind":"arxiv","id":"2407.00427","version":1},"attestation_state":"computed","paper":{"title":"On the boundedness of degenerate hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Caiyun Hu, Heng Li, Jianfeng Hou, Xizhi Liu, Yixiao Zhang","submitted_at":"2024-06-29T12:37:20Z","abstract_excerpt":"We investigate the impact of a high-degree vertex in Tur\\'{a}n problems for degenerate hypergraphs (including graphs). We say an $r$-graph $F$ is bounded if there exist constants $\\alpha, \\beta>0$ such that for large $n$, every $n$-vertex $F$-free $r$-graph with a vertex of degree at least $\\alpha \\binom{n-1}{r-1}$ has fewer than $(1-\\beta) \\cdot \\mathrm{ex}(n,F)$ edges. The boundedness property is crucial for recent works~\\cite{HHLLYZ23a,DHLY24} that aim to extend the classical Hajnal--Szemer\\'{e}di Theorem and the anti-Ramsey theorems of Erd\\H{o}s--Simonovits--S\\'{o}s.\n  We show that many we"},"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":"2407.00427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-29T12:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"27ecd83f6c3331a6a4b26012563dc19e1bfe652942b1a5f3bac8052acd9e2c5b","abstract_canon_sha256":"e74143f7d3b4ccb31e34a814cda80825afa988cef8f420a24acbb8bc30ff06b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:19.575484Z","signature_b64":"XmYL8xD+ZEAUxSwNj+2x/G32vqucKEMDpKq+xyigumyBXZMGBBvuVWFBuyZlpASS5rNa34BnlaMf8D42B90jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a8a08416ad5b2980595f29fe0be0a9620711e71e2d5b3a868783d076c7df3c1","last_reissued_at":"2026-07-05T08:38:19.575072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:19.575072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the boundedness of degenerate hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Caiyun Hu, Heng Li, Jianfeng Hou, Xizhi Liu, Yixiao Zhang","submitted_at":"2024-06-29T12:37:20Z","abstract_excerpt":"We investigate the impact of a high-degree vertex in Tur\\'{a}n problems for degenerate hypergraphs (including graphs). We say an $r$-graph $F$ is bounded if there exist constants $\\alpha, \\beta>0$ such that for large $n$, every $n$-vertex $F$-free $r$-graph with a vertex of degree at least $\\alpha \\binom{n-1}{r-1}$ has fewer than $(1-\\beta) \\cdot \\mathrm{ex}(n,F)$ edges. The boundedness property is crucial for recent works~\\cite{HHLLYZ23a,DHLY24} that aim to extend the classical Hajnal--Szemer\\'{e}di Theorem and the anti-Ramsey theorems of Erd\\H{o}s--Simonovits--S\\'{o}s.\n  We show that many we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00427","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/2407.00427/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":"2407.00427","created_at":"2026-07-05T08:38:19.575135+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.00427v1","created_at":"2026-07-05T08:38:19.575135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00427","created_at":"2026-07-05T08:38:19.575135+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKFAQQLK2WZJ","created_at":"2026-07-05T08:38:19.575135+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKFAQQLK2WZJQBMV","created_at":"2026-07-05T08:38:19.575135+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKFAQQLK","created_at":"2026-07-05T08:38:19.575135+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11450","citing_title":"Tiling $H$ in dense graphs","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY","json":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY.json","graph_json":"https://pith.science/api/pith-number/LKFAQQLK2WZJQBMV6KP6BPQKSY/graph.json","events_json":"https://pith.science/api/pith-number/LKFAQQLK2WZJQBMV6KP6BPQKSY/events.json","paper":"https://pith.science/paper/LKFAQQLK"},"agent_actions":{"view_html":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY","download_json":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY.json","view_paper":"https://pith.science/paper/LKFAQQLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.00427&json=true","fetch_graph":"https://pith.science/api/pith-number/LKFAQQLK2WZJQBMV6KP6BPQKSY/graph.json","fetch_events":"https://pith.science/api/pith-number/LKFAQQLK2WZJQBMV6KP6BPQKSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY/action/storage_attestation","attest_author":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY/action/author_attestation","sign_citation":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY/action/citation_signature","submit_replication":"https://pith.science/pith/LKFAQQLK2WZJQBMV6KP6BPQKSY/action/replication_record"}},"created_at":"2026-07-05T08:38:19.575135+00:00","updated_at":"2026-07-05T08:38:19.575135+00:00"}