{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:U4YMUDHTJ43O75Z7CEEBP7DJT7","short_pith_number":"pith:U4YMUDHT","schema_version":"1.0","canonical_sha256":"a730ca0cf34f36eff73f110817fc699fd9569b4fa51ddf591f6b1f4b9d43483a","source":{"kind":"arxiv","id":"2212.08636","version":3},"attestation_state":"computed","paper":{"title":"Finite Hypergraph Families with Rich Extremal Tur\\'an Constructions via Mixing Patterns","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oleg Pikhurko, Xizhi Liu","submitted_at":"2022-12-16T18:25:49Z","abstract_excerpt":"We prove that, for any finite set of minimal $r$-graph patterns, there is a finite family $\\mathcal F$ of forbidden $r$-graphs such that the extremal Tur\\'an constructions for $\\mathcal F$ are precisely the maximum $r$-graphs obtainable from mixing the given patterns in any way via blowups and recursion. This extends the result by the second author \\cite{PI14}, where the above statement was established for a single pattern.\n  We present two applications of this result. First, we construct a finite family $\\mathcal F$ of $3$-graphs such that there are exponentially many maximum $\\mathcal F$-fre"},"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":"2212.08636","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-16T18:25:49Z","cross_cats_sorted":[],"title_canon_sha256":"da69f8e08b17334749cd35594ab484f606484bb1d20db0e4599d681c938f3c16","abstract_canon_sha256":"5ebd06baa88bd0a9b771456a5ca57f47186cc3d0c48f699fd9764e79cca597fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:10.123456Z","signature_b64":"5ffAKxYE0dLcj5scQ6poVkJ9GEIWuntygc/uulL09NXHYwyW45/sAGcfyCy0H7kGDKhdoh8KqGiE7GjWOUC5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a730ca0cf34f36eff73f110817fc699fd9569b4fa51ddf591f6b1f4b9d43483a","last_reissued_at":"2026-07-05T10:28:10.123038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:10.123038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Hypergraph Families with Rich Extremal Tur\\'an Constructions via Mixing Patterns","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oleg Pikhurko, Xizhi Liu","submitted_at":"2022-12-16T18:25:49Z","abstract_excerpt":"We prove that, for any finite set of minimal $r$-graph patterns, there is a finite family $\\mathcal F$ of forbidden $r$-graphs such that the extremal Tur\\'an constructions for $\\mathcal F$ are precisely the maximum $r$-graphs obtainable from mixing the given patterns in any way via blowups and recursion. This extends the result by the second author \\cite{PI14}, where the above statement was established for a single pattern.\n  We present two applications of this result. First, we construct a finite family $\\mathcal F$ of $3$-graphs such that there are exponentially many maximum $\\mathcal F$-fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08636","kind":"arxiv","version":3},"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/2212.08636/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":"2212.08636","created_at":"2026-07-05T10:28:10.123095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.08636v3","created_at":"2026-07-05T10:28:10.123095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08636","created_at":"2026-07-05T10:28:10.123095+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4YMUDHTJ43O","created_at":"2026-07-05T10:28:10.123095+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4YMUDHTJ43O75Z7","created_at":"2026-07-05T10:28:10.123095+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4YMUDHT","created_at":"2026-07-05T10:28:10.123095+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.21011","citing_title":"The Tur\\'an density of the tight 5-cycle minus one edge","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7","json":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7.json","graph_json":"https://pith.science/api/pith-number/U4YMUDHTJ43O75Z7CEEBP7DJT7/graph.json","events_json":"https://pith.science/api/pith-number/U4YMUDHTJ43O75Z7CEEBP7DJT7/events.json","paper":"https://pith.science/paper/U4YMUDHT"},"agent_actions":{"view_html":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7","download_json":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7.json","view_paper":"https://pith.science/paper/U4YMUDHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.08636&json=true","fetch_graph":"https://pith.science/api/pith-number/U4YMUDHTJ43O75Z7CEEBP7DJT7/graph.json","fetch_events":"https://pith.science/api/pith-number/U4YMUDHTJ43O75Z7CEEBP7DJT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/action/storage_attestation","attest_author":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/action/author_attestation","sign_citation":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/action/citation_signature","submit_replication":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/action/replication_record"}},"created_at":"2026-07-05T10:28:10.123095+00:00","updated_at":"2026-07-05T10:28:10.123095+00:00"}