{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X6HVUY2FNCNANWGAUM2Y5S56FO","short_pith_number":"pith:X6HVUY2F","schema_version":"1.0","canonical_sha256":"bf8f5a6345689a06d8c0a3358ecbbe2b951efbade27228e63671a372df7e4734","source":{"kind":"arxiv","id":"2607.01680","version":1},"attestation_state":"computed","paper":{"title":"On the generalized Tur\\'{a}n number of the complete bipartite graph $K_{3,b+1}$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Wang, Junpeng Zhou, Zixuan Yang","submitted_at":"2026-07-02T04:12:00Z","abstract_excerpt":"For graphs $F$ and $H$, let $\\mathrm{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Very recently, Janzer, Longbrake, and Yepremyan proved that for $3<a\\leq b$ and sufficiently large $t$, \\begin{equation*} \\mathrm{ex}(n,K_{a,b},K_{3,t})=\\Theta_{a,b,t}(n^3). \\end{equation*} Later, Hou, Hu, and Wang made this threshold explicit by showing that the conclusion holds for all $t\\geq 2\\max\\{3,\\lceil b/2\\rceil\\}+1$. In particular, for every even $b\\geq 6$, this matches the necessary threshold $t=b+1$. In this paper, we resolve the remaining case where $b$ is od"},"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":"2607.01680","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-02T04:12:00Z","cross_cats_sorted":[],"title_canon_sha256":"38abe6486861ecd3c3951e97056195a6d169b6cd53a8d60b413ea25295f60281","abstract_canon_sha256":"867a7e227c5f79420706e4091c7cb20714cd5d9be44cfcb5f321e746348bee4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:26.596277Z","signature_b64":"ZstbpV6cwQv4Z5xg/m9VqABsHkln8xf6aEBrO0BoPm+tZlPiRWBcQyUj8F2fHwYJkbGyVivHOVovEbHSoee3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf8f5a6345689a06d8c0a3358ecbbe2b951efbade27228e63671a372df7e4734","last_reissued_at":"2026-07-03T01:17:26.595814Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:26.595814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the generalized Tur\\'{a}n number of the complete bipartite graph $K_{3,b+1}$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Wang, Junpeng Zhou, Zixuan Yang","submitted_at":"2026-07-02T04:12:00Z","abstract_excerpt":"For graphs $F$ and $H$, let $\\mathrm{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Very recently, Janzer, Longbrake, and Yepremyan proved that for $3<a\\leq b$ and sufficiently large $t$, \\begin{equation*} \\mathrm{ex}(n,K_{a,b},K_{3,t})=\\Theta_{a,b,t}(n^3). \\end{equation*} Later, Hou, Hu, and Wang made this threshold explicit by showing that the conclusion holds for all $t\\geq 2\\max\\{3,\\lceil b/2\\rceil\\}+1$. In particular, for every even $b\\geq 6$, this matches the necessary threshold $t=b+1$. In this paper, we resolve the remaining case where $b$ is od"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01680","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/2607.01680/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":"2607.01680","created_at":"2026-07-03T01:17:26.595881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01680v1","created_at":"2026-07-03T01:17:26.595881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01680","created_at":"2026-07-03T01:17:26.595881+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6HVUY2FNCNA","created_at":"2026-07-03T01:17:26.595881+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6HVUY2FNCNANWGA","created_at":"2026-07-03T01:17:26.595881+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6HVUY2F","created_at":"2026-07-03T01:17:26.595881+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/X6HVUY2FNCNANWGAUM2Y5S56FO","json":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO.json","graph_json":"https://pith.science/api/pith-number/X6HVUY2FNCNANWGAUM2Y5S56FO/graph.json","events_json":"https://pith.science/api/pith-number/X6HVUY2FNCNANWGAUM2Y5S56FO/events.json","paper":"https://pith.science/paper/X6HVUY2F"},"agent_actions":{"view_html":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO","download_json":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO.json","view_paper":"https://pith.science/paper/X6HVUY2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01680&json=true","fetch_graph":"https://pith.science/api/pith-number/X6HVUY2FNCNANWGAUM2Y5S56FO/graph.json","fetch_events":"https://pith.science/api/pith-number/X6HVUY2FNCNANWGAUM2Y5S56FO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO/action/storage_attestation","attest_author":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO/action/author_attestation","sign_citation":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO/action/citation_signature","submit_replication":"https://pith.science/pith/X6HVUY2FNCNANWGAUM2Y5S56FO/action/replication_record"}},"created_at":"2026-07-03T01:17:26.595881+00:00","updated_at":"2026-07-03T01:17:26.595881+00:00"}