{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UDWMR62DZ4HXLSLTR3SKXBWEWW","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":"e3c96c34cb8225fe66bcff1fa87c2853c70f8a641c4f050df95c1491aaa568af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-19T17:56:43Z","title_canon_sha256":"1958a41e0d6819b3dee1d2c2ad50033a9b11cfa8899303f458fb707273d733a0"},"schema_version":"1.0","source":{"id":"2401.10853","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.10853","created_at":"2026-07-05T10:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"2401.10853v2","created_at":"2026-07-05T10:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.10853","created_at":"2026-07-05T10:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"UDWMR62DZ4HX","created_at":"2026-07-05T10:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"UDWMR62DZ4HXLSLT","created_at":"2026-07-05T10:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"UDWMR62D","created_at":"2026-07-05T10:55:17Z"}],"graph_snapshots":[{"event_id":"sha256:1d5023ee9d35210bfedeae72229f24cc07df0c6280463b1511faf6c318e98231","target":"graph","created_at":"2026-07-05T10:55:17Z","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/2401.10853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The celebrated K\\H{o}v\\'ari-S\\'os-Tur\\'an theorem states that any $n$-vertex graph containing no copy of the complete bipartite graph $K_{s,s}$ has at most $O_s(n^{2-1/s})$ edges. In the past two decades, motivated by the applications in discrete geometry and structural graph theory, a number of results demonstrated that this bound can be greatly improved if the graph satisfies certain structural restrictions. We propose the systematic study of this phenomenon, and state the conjecture that if $H$ is a bipartite graph, then an induced $H$-free and $K_{s,s}$-free graph cannot have much more edg","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon, Zach Hunter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-19T17:56:43Z","title":"K\\H{o}v\\'ari-S\\'os-Tur\\'an theorem for hereditary families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.10853","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:44c65ead60b31163d3803b0f7e90d07cfacb006f33c9a646f729838258b4fe66","target":"record","created_at":"2026-07-05T10:55:17Z","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":"e3c96c34cb8225fe66bcff1fa87c2853c70f8a641c4f050df95c1491aaa568af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-19T17:56:43Z","title_canon_sha256":"1958a41e0d6819b3dee1d2c2ad50033a9b11cfa8899303f458fb707273d733a0"},"schema_version":"1.0","source":{"id":"2401.10853","kind":"arxiv","version":2}},"canonical_sha256":"a0ecc8fb43cf0f75c9738ee4ab86c4b58e8cd4c4600dd9b56ebf986e640e53d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0ecc8fb43cf0f75c9738ee4ab86c4b58e8cd4c4600dd9b56ebf986e640e53d9","first_computed_at":"2026-07-05T10:55:17.961528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:17.961528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bnMrm5HV2A7T99r9huYTcFnQJIbc4FA/PpOQf7nKCeT1I6aEu/7oBXDqqXXQ+FjjM1au/W8wQDV+y5ep+TlDCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:17.962018Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.10853","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44c65ead60b31163d3803b0f7e90d07cfacb006f33c9a646f729838258b4fe66","sha256:1d5023ee9d35210bfedeae72229f24cc07df0c6280463b1511faf6c318e98231"],"state_sha256":"1b36f5181c1239661322fedf51f6c97ced29a6ad6a5c0420bfe1edbba3ccd26a"}