{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CSCMVJSJMRYH4WOZRAFLGE74DI","short_pith_number":"pith:CSCMVJSJ","schema_version":"1.0","canonical_sha256":"1484caa64964707e59d9880ab313fc1a18aa41a99048193450911931fed65f01","source":{"kind":"arxiv","id":"2405.05902","version":2},"attestation_state":"computed","paper":{"title":"The largest subgraph without a forbidden induced subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Huy Tuan Pham, Jacob Fox, Rajko Nenadov","submitted_at":"2024-05-09T16:54:47Z","abstract_excerpt":"We initiate the systematic study of the following Tur\\'an-type question. Suppose $\\Gamma$ is a graph with $n$ vertices such that the edge density between any pair of subsets of vertices of size at least $t$ is at most $1 - c$, for some $t$ and $c > 0$. What is the largest number of edges in a subgraph $G \\subseteq \\Gamma$ which does not contain a fixed graph $H$ as an induced subgraph or, more generally, which belongs to a hereditary property $\\mathcal{P}$? This provides a common generalization of two recently studied cases, namely $\\Gamma$ being a (pseudo-)random graph and a graph without a l"},"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":"2405.05902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-05-09T16:54:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"04f88572ba42da15f52dea2971cf76c0eeb6f69b0dde2455c985272bb4c382ae","abstract_canon_sha256":"bbd84a425f8822c746bbc382f3e97b8211636421c7040f6fe5e639eb8b3fd3d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:00.511368Z","signature_b64":"/ngmEC4eXj69HFdHrNjxNZmnfUY88Bnr968d6R4J3okSze42i8cTqqLWmmMw6bK6w/mSVTgqdFM2R7/JdaA2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1484caa64964707e59d9880ab313fc1a18aa41a99048193450911931fed65f01","last_reissued_at":"2026-07-05T08:29:00.510889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:00.510889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The largest subgraph without a forbidden induced subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Huy Tuan Pham, Jacob Fox, Rajko Nenadov","submitted_at":"2024-05-09T16:54:47Z","abstract_excerpt":"We initiate the systematic study of the following Tur\\'an-type question. Suppose $\\Gamma$ is a graph with $n$ vertices such that the edge density between any pair of subsets of vertices of size at least $t$ is at most $1 - c$, for some $t$ and $c > 0$. What is the largest number of edges in a subgraph $G \\subseteq \\Gamma$ which does not contain a fixed graph $H$ as an induced subgraph or, more generally, which belongs to a hereditary property $\\mathcal{P}$? This provides a common generalization of two recently studied cases, namely $\\Gamma$ being a (pseudo-)random graph and a graph without a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.05902","kind":"arxiv","version":2},"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/2405.05902/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":"2405.05902","created_at":"2026-07-05T08:29:00.510948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.05902v2","created_at":"2026-07-05T08:29:00.510948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.05902","created_at":"2026-07-05T08:29:00.510948+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSCMVJSJMRYH","created_at":"2026-07-05T08:29:00.510948+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSCMVJSJMRYH4WOZ","created_at":"2026-07-05T08:29:00.510948+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSCMVJSJ","created_at":"2026-07-05T08:29:00.510948+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.23942","citing_title":"$C_4$-free subgraphs of high degree with geometric applications","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI","json":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI.json","graph_json":"https://pith.science/api/pith-number/CSCMVJSJMRYH4WOZRAFLGE74DI/graph.json","events_json":"https://pith.science/api/pith-number/CSCMVJSJMRYH4WOZRAFLGE74DI/events.json","paper":"https://pith.science/paper/CSCMVJSJ"},"agent_actions":{"view_html":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI","download_json":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI.json","view_paper":"https://pith.science/paper/CSCMVJSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.05902&json=true","fetch_graph":"https://pith.science/api/pith-number/CSCMVJSJMRYH4WOZRAFLGE74DI/graph.json","fetch_events":"https://pith.science/api/pith-number/CSCMVJSJMRYH4WOZRAFLGE74DI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI/action/storage_attestation","attest_author":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI/action/author_attestation","sign_citation":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI/action/citation_signature","submit_replication":"https://pith.science/pith/CSCMVJSJMRYH4WOZRAFLGE74DI/action/replication_record"}},"created_at":"2026-07-05T08:29:00.510948+00:00","updated_at":"2026-07-05T08:29:00.510948+00:00"}