{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZGD4MP7J2ZY5RUEW2237YBULND","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":"f73bdadbe108e2eadbc751d125f48f218a0e0c3e4779e93c475ac2a12671853c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-15T10:27:56Z","title_canon_sha256":"47ddbd10e7aeb490498cb19831fd68325c788b3bdede49e8b86bef4d7b8f7370"},"schema_version":"1.0","source":{"id":"2302.07571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.07571","created_at":"2026-07-05T05:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"2302.07571v2","created_at":"2026-07-05T05:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07571","created_at":"2026-07-05T05:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZGD4MP7J2ZY5","created_at":"2026-07-05T05:43:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZGD4MP7J2ZY5RUEW","created_at":"2026-07-05T05:43:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZGD4MP7J","created_at":"2026-07-05T05:43:04Z"}],"graph_snapshots":[{"event_id":"sha256:d437c8431ad02308f23eb341477c4b029ad3bd449e62b6961b612911e876487d","target":"graph","created_at":"2026-07-05T05:43:04Z","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/2302.07571/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Write $K^{(k)}_{n}$ for the complete $k$-graph on $n$ vertices. For $2 \\leq k \\leq g < r$ integers, let $\\pi\\left(n, K^{(k)}_{g}, K^{(k)}_r\\right)$ be the maximum density of $K^{(k)}_{g}$ in $n$ vertex $K^{(k)}_{r}$-free $k$-graphs. The main contribution of this paper is the upper bound: $\\pi\\left(n, K^{(k)}_{g}, K^{(k)}_r\\right) \\leq \\left(1 + O\\left(n^{-1}\\right) \\right)\\prod_{m=k}^{g} \\left(1 - \\frac{\\binom{m-1}{k-1}}{\\binom{r-1}{k-1}} \\right).$ The graph case ($k=2$) is the first known generalized Tur\\'an question, investigated by Erd\\H{o}s. The $k=g$ case is the hypergraph Tur\\'an problem","authors_text":"Levente Bodnar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-15T10:27:56Z","title":"Generalized Tur\\'an problem for Complete Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07571","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:8f3b25601493e049e19580bd772636536020a29073503f0bf4e8cf8249743473","target":"record","created_at":"2026-07-05T05:43:04Z","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":"f73bdadbe108e2eadbc751d125f48f218a0e0c3e4779e93c475ac2a12671853c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-15T10:27:56Z","title_canon_sha256":"47ddbd10e7aeb490498cb19831fd68325c788b3bdede49e8b86bef4d7b8f7370"},"schema_version":"1.0","source":{"id":"2302.07571","kind":"arxiv","version":2}},"canonical_sha256":"c987c63fe9d671d8d096d6b7fc068b68d4e0cab3513efe591b251d971fd8eb0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c987c63fe9d671d8d096d6b7fc068b68d4e0cab3513efe591b251d971fd8eb0f","first_computed_at":"2026-07-05T05:43:04.327590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:43:04.327590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AwelEjEZu5qGyc39Y7E4TvvvgCkTUme7UJVQGo386Oc7iayE6Wzf5Ay+xq9KG3NMSsY2Drnd+whHit74cMRaBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:43:04.328024Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.07571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f3b25601493e049e19580bd772636536020a29073503f0bf4e8cf8249743473","sha256:d437c8431ad02308f23eb341477c4b029ad3bd449e62b6961b612911e876487d"],"state_sha256":"dbf831454cd5ded8c7ca008f1356f2c0cdd285ec07cf2a537931f59df3549f42"}