{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3AGPPOIQUQD3KGF5E2L2EUAIXG","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":"ab8984d9fe026e9417ab4161b30e88d69bcdaf9196c7a002750a6bb4c3b48ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-08T00:54:00Z","title_canon_sha256":"cae1e953930ba07e6fce6d17ecdeef94713d585fd218b08bc7554acd151e6c17"},"schema_version":"1.0","source":{"id":"1903.03233","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03233","created_at":"2026-05-17T23:49:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03233v2","created_at":"2026-05-17T23:49:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03233","created_at":"2026-05-17T23:49:49Z"},{"alias_kind":"pith_short_12","alias_value":"3AGPPOIQUQD3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3AGPPOIQUQD3KGF5","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3AGPPOIQ","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:34e9fb97e814fb6dfb0221227a925b9b74176a88ece8b36e29056c7d99663089","target":"graph","created_at":"2026-05-17T23:49:49Z","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"},"paper":{"abstract_excerpt":"For graphs $H$ and $F$, let $\\text{ex}(n,H,F)$ be the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices. The study of this function, which generalizes the well-known Tur\\'{a}n number of graphs, was systematically studied by Alon and Shikhelman recently. In this paper, we show that for any $m$ and $t\\ge 2m-3\\ge3$, \\[\\text{ex}(n,K_{m},K_{2,t})=\\Theta(n^{\\frac{3}{2}}).\\] This result improves some results of Alon and Shikhelman (J. Combin. Theory Ser. B, 121:146-172, 2016). We also study the $k$-partite $K_{s,t}$-free graph, we show that for any $k\\ge3$ and $t\\ge(k-1)(s","authors_text":"Gennian Ge, Tao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-08T00:54:00Z","title":"Some extremal results on K_{s,t}-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03233","kind":"arxiv","version":2},"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:612599606746c250ee9847dc8c025cdcf2ba8ddaae6a045ee59509d534d6b29f","target":"record","created_at":"2026-05-17T23:49:49Z","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":"ab8984d9fe026e9417ab4161b30e88d69bcdaf9196c7a002750a6bb4c3b48ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-08T00:54:00Z","title_canon_sha256":"cae1e953930ba07e6fce6d17ecdeef94713d585fd218b08bc7554acd151e6c17"},"schema_version":"1.0","source":{"id":"1903.03233","kind":"arxiv","version":2}},"canonical_sha256":"d80cf7b910a407b518bd2697a25008b984015f37c36e2a15905022ba53574a67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d80cf7b910a407b518bd2697a25008b984015f37c36e2a15905022ba53574a67","first_computed_at":"2026-05-17T23:49:49.864763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:49.864763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0NEqaSJo7QEOHImsputNS/nqNDDakei0J0ZNMkoOjtN/aTcj8KZpNWvklkar1zDeEop8klYeD5OSbZ/OOO+CCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:49.865243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03233","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:612599606746c250ee9847dc8c025cdcf2ba8ddaae6a045ee59509d534d6b29f","sha256:34e9fb97e814fb6dfb0221227a925b9b74176a88ece8b36e29056c7d99663089"],"state_sha256":"98169b7c987c716c5ec140793dde8b3abbea52cef6ec9ebdd611f7462263c79a"}