{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SBVMFNMCB5JHKKPXY3ZASYJIKI","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":"ba8a91d3a5014d7e6e61f5be97a70283118c6e1238722ba4933e6caaf99f0831","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T03:07:59Z","title_canon_sha256":"29f9cad834248c81171c9211b02fc660bf1eb27fdcc8b1ef68cfaa4c68685ed8"},"schema_version":"1.0","source":{"id":"2504.03138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.03138","created_at":"2026-07-05T10:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2504.03138v1","created_at":"2026-07-05T10:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03138","created_at":"2026-07-05T10:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"SBVMFNMCB5JH","created_at":"2026-07-05T10:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"SBVMFNMCB5JHKKPX","created_at":"2026-07-05T10:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"SBVMFNMC","created_at":"2026-07-05T10:44:27Z"}],"graph_snapshots":[{"event_id":"sha256:601c60238acace545f668eddb07a1c58517b373c4b4c535df28adaac6d2b6b06","target":"graph","created_at":"2026-07-05T10:44:27Z","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/2504.03138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given $r$-uniform hypergraphs $G$ and $F$ and an integer $n$, let $f_{F,G}(n)$ be the maximum $m$ such that every $n$-vertex $G$-free $r$-graph has an $F$-free induced subgraph on $m$ vertices. We show that $f_{F,G}(n)$ is polynomial in $n$ when $G$ is a subgraph of an iterated blowup of $F$. As a partial converse, we show that if $G$ is not a subgraph of an $F$-iterated blowup and is $2$-tightly connected, then $f_{F,G}(n)$ is at most polylogarithmic in $n$. Our bounds generalize previous results of Dudek and Mubayi for the case when $F$ and $G$ are complete.","authors_text":"Jiaxi Nie, Xiaoyu He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T03:07:59Z","title":"Generalized Erd\\H{o}s-Rogers problems for hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03138","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:5f56e9d876c2933d09d3778319719b5059bfd19fdcf6b3b259ab2c1b53090513","target":"record","created_at":"2026-07-05T10:44:27Z","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":"ba8a91d3a5014d7e6e61f5be97a70283118c6e1238722ba4933e6caaf99f0831","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T03:07:59Z","title_canon_sha256":"29f9cad834248c81171c9211b02fc660bf1eb27fdcc8b1ef68cfaa4c68685ed8"},"schema_version":"1.0","source":{"id":"2504.03138","kind":"arxiv","version":1}},"canonical_sha256":"906ac2b5820f527529f7c6f209612852256ea1531e1008ef7dd5ec1941ec269f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"906ac2b5820f527529f7c6f209612852256ea1531e1008ef7dd5ec1941ec269f","first_computed_at":"2026-07-05T10:44:27.025539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:27.025539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jE4/KdamOYMd7V0ts1WxUu3VAstslPX34azpoG91r0mQNdawjYUHeF5GzWnPp17yJfQ5jzPU+wl20dpssJDDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:27.025938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.03138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f56e9d876c2933d09d3778319719b5059bfd19fdcf6b3b259ab2c1b53090513","sha256:601c60238acace545f668eddb07a1c58517b373c4b4c535df28adaac6d2b6b06"],"state_sha256":"fa56dada5a02159dbc173f5dab7acd8746510596904bb515b45cbb5a45a7e5c6"}