{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SBVMFNMCB5JHKKPXY3ZASYJIKI","short_pith_number":"pith:SBVMFNMC","schema_version":"1.0","canonical_sha256":"906ac2b5820f527529f7c6f209612852256ea1531e1008ef7dd5ec1941ec269f","source":{"kind":"arxiv","id":"2504.03138","version":1},"attestation_state":"computed","paper":{"title":"Generalized Erd\\H{o}s-Rogers problems for hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxi Nie, Xiaoyu He","submitted_at":"2025-04-04T03:07:59Z","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."},"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":"2504.03138","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-04T03:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"29f9cad834248c81171c9211b02fc660bf1eb27fdcc8b1ef68cfaa4c68685ed8","abstract_canon_sha256":"ba8a91d3a5014d7e6e61f5be97a70283118c6e1238722ba4933e6caaf99f0831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:27.025938Z","signature_b64":"2jE4/KdamOYMd7V0ts1WxUu3VAstslPX34azpoG91r0mQNdawjYUHeF5GzWnPp17yJfQ5jzPU+wl20dpssJDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906ac2b5820f527529f7c6f209612852256ea1531e1008ef7dd5ec1941ec269f","last_reissued_at":"2026-07-05T10:44:27.025539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:27.025539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Erd\\H{o}s-Rogers problems for hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxi Nie, Xiaoyu He","submitted_at":"2025-04-04T03:07:59Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03138","kind":"arxiv","version":1},"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/2504.03138/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":"2504.03138","created_at":"2026-07-05T10:44:27.025594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.03138v1","created_at":"2026-07-05T10:44:27.025594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03138","created_at":"2026-07-05T10:44:27.025594+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBVMFNMCB5JH","created_at":"2026-07-05T10:44:27.025594+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBVMFNMCB5JHKKPX","created_at":"2026-07-05T10:44:27.025594+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBVMFNMC","created_at":"2026-07-05T10:44:27.025594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI","json":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI.json","graph_json":"https://pith.science/api/pith-number/SBVMFNMCB5JHKKPXY3ZASYJIKI/graph.json","events_json":"https://pith.science/api/pith-number/SBVMFNMCB5JHKKPXY3ZASYJIKI/events.json","paper":"https://pith.science/paper/SBVMFNMC"},"agent_actions":{"view_html":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI","download_json":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI.json","view_paper":"https://pith.science/paper/SBVMFNMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.03138&json=true","fetch_graph":"https://pith.science/api/pith-number/SBVMFNMCB5JHKKPXY3ZASYJIKI/graph.json","fetch_events":"https://pith.science/api/pith-number/SBVMFNMCB5JHKKPXY3ZASYJIKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI/action/storage_attestation","attest_author":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI/action/author_attestation","sign_citation":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI/action/citation_signature","submit_replication":"https://pith.science/pith/SBVMFNMCB5JHKKPXY3ZASYJIKI/action/replication_record"}},"created_at":"2026-07-05T10:44:27.025594+00:00","updated_at":"2026-07-05T10:44:27.025594+00:00"}