{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LFAH2FNCEIQWEJVCEMQISAGBM6","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":"0454fb5c03a9e4b3193d6915e078c6bd0368937b5dead95f81196d8b4f57dd2f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T20:19:23Z","title_canon_sha256":"f4f8f5aa1bec395d0e8827b18a57cf34c4d92d517bd7fa20ae89c98bd2897074"},"schema_version":"1.0","source":{"id":"2606.02855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02855","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02855v1","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02855","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"LFAH2FNCEIQW","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"pith_short_16","alias_value":"LFAH2FNCEIQWEJVC","created_at":"2026-06-03T01:05:24Z"},{"alias_kind":"pith_short_8","alias_value":"LFAH2FNC","created_at":"2026-06-03T01:05:24Z"}],"graph_snapshots":[{"event_id":"sha256:854b6696c953ece9b749ec4cfc2233513af2aa0eb9b592df0d35d726767c79b5","target":"graph","created_at":"2026-06-03T01:05:24Z","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/2606.02855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The generalized Tur\\'{a}n number $ex(n, K_{t, t}, K_{2, t+1})$ is the maximum number of copies of $K_{t, t}$ that a $K_{2, t+1}$-free graph on $n$ vertices can contain. Recently, Pohoata, Tidor, and Yu established that $ex(n, K_{t, t}, K_{2, t+1}) = \\Theta_t(n^2)$ for all integers $t \\geq 3$. In this short note, we use an explicit construction to establish that when $t$ is a prime power and $n = t^{2e - 1}$, then $$ ex(n, K_{t, t}, K_{2, t+1}) = (1 + o(1))\\frac{n^2}{2t(t-1)}. $$","authors_text":"Vladislav Taranchuk","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T20:19:23Z","title":"$K_{2, t+1}$-free graphs containing an optimal number of $K_{t, t}$'s"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02855","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:81890cd1bac81189289dbab328d7bfaf065550eb3cb6b6ec7ea33e765eee815b","target":"record","created_at":"2026-06-03T01:05:24Z","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":"0454fb5c03a9e4b3193d6915e078c6bd0368937b5dead95f81196d8b4f57dd2f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T20:19:23Z","title_canon_sha256":"f4f8f5aa1bec395d0e8827b18a57cf34c4d92d517bd7fa20ae89c98bd2897074"},"schema_version":"1.0","source":{"id":"2606.02855","kind":"arxiv","version":1}},"canonical_sha256":"59407d15a222216226a223208900c16796f2cfd9964ea9e07206524b7e16c9bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59407d15a222216226a223208900c16796f2cfd9964ea9e07206524b7e16c9bd","first_computed_at":"2026-06-03T01:05:24.636460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:24.636460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swcNEhhSPX6JX6PpLgb4XgX5DH5IIR/bEHDwRiwMcxGKupHSkAlA63X3IK3z5BKgusERYlYcb06FiSvty7K6Aw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:24.636797Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81890cd1bac81189289dbab328d7bfaf065550eb3cb6b6ec7ea33e765eee815b","sha256:854b6696c953ece9b749ec4cfc2233513af2aa0eb9b592df0d35d726767c79b5"],"state_sha256":"552dff198c4d88352a062caeaa16577f5e99348b5f131f5e031bfb16efa06231"}