{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LKFAQQLK2WZJQBMV6KP6BPQKSY","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":"e74143f7d3b4ccb31e34a814cda80825afa988cef8f420a24acbb8bc30ff06b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-29T12:37:20Z","title_canon_sha256":"27ecd83f6c3331a6a4b26012563dc19e1bfe652942b1a5f3bac8052acd9e2c5b"},"schema_version":"1.0","source":{"id":"2407.00427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.00427","created_at":"2026-07-05T08:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"2407.00427v1","created_at":"2026-07-05T08:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.00427","created_at":"2026-07-05T08:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"LKFAQQLK2WZJ","created_at":"2026-07-05T08:38:19Z"},{"alias_kind":"pith_short_16","alias_value":"LKFAQQLK2WZJQBMV","created_at":"2026-07-05T08:38:19Z"},{"alias_kind":"pith_short_8","alias_value":"LKFAQQLK","created_at":"2026-07-05T08:38:19Z"}],"graph_snapshots":[{"event_id":"sha256:84828f3fd09c125d3c0df3caed642ba95c480aa08d628e9471c1206385f4028d","target":"graph","created_at":"2026-07-05T08:38: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.00427/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Caihong Yang, Caiyun Hu, Heng Li, Jianfeng Hou, Xizhi Liu, Yixiao Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-29T12:37:20Z","title":"On the boundedness of degenerate hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.00427","kind":"arxiv","version":1},"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:02b5906b4d3024ec74364f49da9e45105dd72e20fbedd7f181c10fe68362aae5","target":"record","created_at":"2026-07-05T08:38:19Z","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":"e74143f7d3b4ccb31e34a814cda80825afa988cef8f420a24acbb8bc30ff06b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-06-29T12:37:20Z","title_canon_sha256":"27ecd83f6c3331a6a4b26012563dc19e1bfe652942b1a5f3bac8052acd9e2c5b"},"schema_version":"1.0","source":{"id":"2407.00427","kind":"arxiv","version":1}},"canonical_sha256":"5a8a08416ad5b2980595f29fe0be0a9620711e71e2d5b3a868783d076c7df3c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a8a08416ad5b2980595f29fe0be0a9620711e71e2d5b3a868783d076c7df3c1","first_computed_at":"2026-07-05T08:38:19.575072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:19.575072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XmYL8xD+ZEAUxSwNj+2x/G32vqucKEMDpKq+xyigumyBXZMGBBvuVWFBuyZlpASS5rNa34BnlaMf8D42B90jAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:19.575484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.00427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02b5906b4d3024ec74364f49da9e45105dd72e20fbedd7f181c10fe68362aae5","sha256:84828f3fd09c125d3c0df3caed642ba95c480aa08d628e9471c1206385f4028d"],"state_sha256":"0d2d2f585d3a618cfe0a008df0133bbf50e497e30a697c736004427a1a0f6b33"}