{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IIYXTAY3M7V5L66XA3DS7JONOX","short_pith_number":"pith:IIYXTAY3","schema_version":"1.0","canonical_sha256":"423179831b67ebd5fbd706c72fa5cd75f1ccc4759ad25782fda9aac7e6dff550","source":{"kind":"arxiv","id":"2401.11296","version":2},"attestation_state":"computed","paper":{"title":"Induced Tur\\'an problem in bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakob Zimmermann, Maria Axenovich","submitted_at":"2024-01-20T18:46:41Z","abstract_excerpt":"The classical extremal function for a graph $H$, $ex(K_n, H)$ is the largest number of edges in a subgraph of $K_n$ that contains no subgraph isomorphic to $H$. Note that defining $ex(K_n, H-ind)$ by forbidding induced subgraphs isomorphic to $H$ is not very meaningful for a non-complete $H$ since one can avoid it by considering a clique.\n  For graphs $F$ and $H$, let $ex(K_n, \\{F, H-ind\\})$ be the largest number of edges in an $n$-vertex graph that contains no subgraph isomorphic to $F$ and no induced subgraph isomorphic to $H$. Determining this function asymptotically reduces to finding eith"},"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":"2401.11296","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-20T18:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"3f56edad39783144522757374a8332c316e59822c850f3701fb8c6565a74b340","abstract_canon_sha256":"78d75b36951a02b0b1c30bc41297bb7150df439399c5c8bb3837d7ba05e7741d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:29.804529Z","signature_b64":"ttD8jeTu0FXt4NA8i2Qbuyi4j1C95waQysyBXXV1pI/IQuB7EU7iZLBfi8qzwqmbDosMG+pmarecbU7trZeXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"423179831b67ebd5fbd706c72fa5cd75f1ccc4759ad25782fda9aac7e6dff550","last_reissued_at":"2026-07-05T07:57:29.804035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:29.804035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced Tur\\'an problem in bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakob Zimmermann, Maria Axenovich","submitted_at":"2024-01-20T18:46:41Z","abstract_excerpt":"The classical extremal function for a graph $H$, $ex(K_n, H)$ is the largest number of edges in a subgraph of $K_n$ that contains no subgraph isomorphic to $H$. Note that defining $ex(K_n, H-ind)$ by forbidding induced subgraphs isomorphic to $H$ is not very meaningful for a non-complete $H$ since one can avoid it by considering a clique.\n  For graphs $F$ and $H$, let $ex(K_n, \\{F, H-ind\\})$ be the largest number of edges in an $n$-vertex graph that contains no subgraph isomorphic to $F$ and no induced subgraph isomorphic to $H$. Determining this function asymptotically reduces to finding eith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11296","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/2401.11296/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":"2401.11296","created_at":"2026-07-05T07:57:29.804095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11296v2","created_at":"2026-07-05T07:57:29.804095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11296","created_at":"2026-07-05T07:57:29.804095+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIYXTAY3M7V5","created_at":"2026-07-05T07:57:29.804095+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIYXTAY3M7V5L66X","created_at":"2026-07-05T07:57:29.804095+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIYXTAY3","created_at":"2026-07-05T07:57:29.804095+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":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX","json":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX.json","graph_json":"https://pith.science/api/pith-number/IIYXTAY3M7V5L66XA3DS7JONOX/graph.json","events_json":"https://pith.science/api/pith-number/IIYXTAY3M7V5L66XA3DS7JONOX/events.json","paper":"https://pith.science/paper/IIYXTAY3"},"agent_actions":{"view_html":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX","download_json":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX.json","view_paper":"https://pith.science/paper/IIYXTAY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11296&json=true","fetch_graph":"https://pith.science/api/pith-number/IIYXTAY3M7V5L66XA3DS7JONOX/graph.json","fetch_events":"https://pith.science/api/pith-number/IIYXTAY3M7V5L66XA3DS7JONOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX/action/storage_attestation","attest_author":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX/action/author_attestation","sign_citation":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX/action/citation_signature","submit_replication":"https://pith.science/pith/IIYXTAY3M7V5L66XA3DS7JONOX/action/replication_record"}},"created_at":"2026-07-05T07:57:29.804095+00:00","updated_at":"2026-07-05T07:57:29.804095+00:00"}