{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:U4YMUDHTJ43O75Z7CEEBP7DJT7","short_pith_number":"pith:U4YMUDHT","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"},"canonical_sha256":"a730ca0cf34f36eff73f110817fc699fd9569b4fa51ddf591f6b1f4b9d43483a","source":{"kind":"arxiv","id":"2212.08636","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08636","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08636v3","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08636","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"pith_short_12","alias_value":"U4YMUDHTJ43O","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"pith_short_16","alias_value":"U4YMUDHTJ43O75Z7","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"pith_short_8","alias_value":"U4YMUDHT","created_at":"2026-07-05T10:28:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:U4YMUDHTJ43O75Z7CEEBP7DJT7","target":"record","payload":{"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"},"canonical_sha256":"a730ca0cf34f36eff73f110817fc699fd9569b4fa51ddf591f6b1f4b9d43483a","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"},"source_kind":"arxiv","source_id":"2212.08636","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:28:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Uao1tjnTRHr0L7YskU6fkQhuVN1psfkDzJoNZOqvX1OFQRVl1G/wynpfrMZ/eu1q4Oe6dNXvv+phZBGigIJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T11:32:22.604014Z"},"content_sha256":"436b26a805ada59671e40499cfa7bcdac6e49577edbb919bbeec7d913164ac69","schema_version":"1.0","event_id":"sha256:436b26a805ada59671e40499cfa7bcdac6e49577edbb919bbeec7d913164ac69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:U4YMUDHTJ43O75Z7CEEBP7DJT7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:28:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXPqxMEwANRy3oaMDO5JU09m0r1a5ylLBHuy6R8QFVkOlMdqo4oS1dJCveQ3K3E34i1e1h9hq0VnxuBe/KVjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T11:32:22.605176Z"},"content_sha256":"d92a2f67d7978f7cfc98cb13c11b84f948d5965bad904e936f93982e11b42423","schema_version":"1.0","event_id":"sha256:d92a2f67d7978f7cfc98cb13c11b84f948d5965bad904e936f93982e11b42423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/bundle.json","state_url":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T11:32:22Z","links":{"resolver":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7","bundle":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/bundle.json","state":"https://pith.science/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4YMUDHTJ43O75Z7CEEBP7DJT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:U4YMUDHTJ43O75Z7CEEBP7DJT7","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":"5ebd06baa88bd0a9b771456a5ca57f47186cc3d0c48f699fd9764e79cca597fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-16T18:25:49Z","title_canon_sha256":"da69f8e08b17334749cd35594ab484f606484bb1d20db0e4599d681c938f3c16"},"schema_version":"1.0","source":{"id":"2212.08636","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08636","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08636v3","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08636","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"pith_short_12","alias_value":"U4YMUDHTJ43O","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"pith_short_16","alias_value":"U4YMUDHTJ43O75Z7","created_at":"2026-07-05T10:28:10Z"},{"alias_kind":"pith_short_8","alias_value":"U4YMUDHT","created_at":"2026-07-05T10:28:10Z"}],"graph_snapshots":[{"event_id":"sha256:d92a2f67d7978f7cfc98cb13c11b84f948d5965bad904e936f93982e11b42423","target":"graph","created_at":"2026-07-05T10:28:10Z","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/2212.08636/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Oleg Pikhurko, Xizhi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-16T18:25:49Z","title":"Finite Hypergraph Families with Rich Extremal Tur\\'an Constructions via Mixing Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08636","kind":"arxiv","version":3},"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:436b26a805ada59671e40499cfa7bcdac6e49577edbb919bbeec7d913164ac69","target":"record","created_at":"2026-07-05T10:28:10Z","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":"5ebd06baa88bd0a9b771456a5ca57f47186cc3d0c48f699fd9764e79cca597fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-16T18:25:49Z","title_canon_sha256":"da69f8e08b17334749cd35594ab484f606484bb1d20db0e4599d681c938f3c16"},"schema_version":"1.0","source":{"id":"2212.08636","kind":"arxiv","version":3}},"canonical_sha256":"a730ca0cf34f36eff73f110817fc699fd9569b4fa51ddf591f6b1f4b9d43483a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a730ca0cf34f36eff73f110817fc699fd9569b4fa51ddf591f6b1f4b9d43483a","first_computed_at":"2026-07-05T10:28:10.123038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:10.123038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ffAKxYE0dLcj5scQ6poVkJ9GEIWuntygc/uulL09NXHYwyW45/sAGcfyCy0H7kGDKhdoh8KqGiE7GjWOUC5AA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:10.123456Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.08636","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:436b26a805ada59671e40499cfa7bcdac6e49577edbb919bbeec7d913164ac69","sha256:d92a2f67d7978f7cfc98cb13c11b84f948d5965bad904e936f93982e11b42423"],"state_sha256":"0fa8290d038c799296e2bfb0ac7051fd2fd079e45121da181d7aac30d803f0e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdoVCzrALV9E0N+AZAeQ8Ym53CpfqhxqSirxxkpEt6kJMo663XbMa5tITT2mh5dtwAERk2apSvB5tH0BVMhKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T11:32:22.611476Z","bundle_sha256":"cae15c26cd3dfe89202ef603c71f3606ebaa0d83f81870357e8589d4d27e53a8"}}