{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LPWPCK3UJSOTKZ5252RXJCZTD5","short_pith_number":"pith:LPWPCK3U","schema_version":"1.0","canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","source":{"kind":"arxiv","id":"2311.13662","version":2},"attestation_state":"computed","paper":{"title":"Zarankiewicz's problem via $\\epsilon$-t-nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2023-11-22T19:34:36Z","abstract_excerpt":"The classical Zarankiewicz's problem asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{t,t}$. In one of the cornerstones of extremal graph theory, K\\H{o}v\\'ari S\\'os and Tur\\'an proved an upper bound of $O(n^{2-\\frac{1}{t}})$. In a celebrated result, Fox et al. obtained an improved bound of $O(n^{2-\\frac{1}{d}})$ for graphs of VC-dimension $d$ (where $d<t$). Basit, Chernikov, Starchenko, Tao and Tran improved the bound for the case of semilinear graphs. At SODA'23, Chan and Har-Peled further improved Basit et al.'s"},"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":"2311.13662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-22T19:34:36Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"57d24a45861a93a76879197d32ac087730f28a30a2fcf19898453193a612a114","abstract_canon_sha256":"59540e8b434512f0755a9927d52e950eb0d14f1fed505aaad95c3ba3424fb2a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:27.316768Z","signature_b64":"meeQWihwl/hVSYi0bjBWFNRi7MYPaXRV6kR5Am+b8w1Ml8Mq/MUjVqi8tFbz/WIuJ3pQwv2iGpDdNwB80vQTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","last_reissued_at":"2026-07-05T09:01:27.316137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:27.316137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zarankiewicz's problem via $\\epsilon$-t-nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2023-11-22T19:34:36Z","abstract_excerpt":"The classical Zarankiewicz's problem asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{t,t}$. In one of the cornerstones of extremal graph theory, K\\H{o}v\\'ari S\\'os and Tur\\'an proved an upper bound of $O(n^{2-\\frac{1}{t}})$. In a celebrated result, Fox et al. obtained an improved bound of $O(n^{2-\\frac{1}{d}})$ for graphs of VC-dimension $d$ (where $d<t$). Basit, Chernikov, Starchenko, Tao and Tran improved the bound for the case of semilinear graphs. At SODA'23, Chan and Har-Peled further improved Basit et al.'s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13662","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/2311.13662/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":"2311.13662","created_at":"2026-07-05T09:01:27.316225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13662v2","created_at":"2026-07-05T09:01:27.316225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13662","created_at":"2026-07-05T09:01:27.316225+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPWPCK3UJSOT","created_at":"2026-07-05T09:01:27.316225+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPWPCK3UJSOTKZ52","created_at":"2026-07-05T09:01:27.316225+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPWPCK3U","created_at":"2026-07-05T09:01:27.316225+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":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5","json":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5.json","graph_json":"https://pith.science/api/pith-number/LPWPCK3UJSOTKZ5252RXJCZTD5/graph.json","events_json":"https://pith.science/api/pith-number/LPWPCK3UJSOTKZ5252RXJCZTD5/events.json","paper":"https://pith.science/paper/LPWPCK3U"},"agent_actions":{"view_html":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5","download_json":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5.json","view_paper":"https://pith.science/paper/LPWPCK3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13662&json=true","fetch_graph":"https://pith.science/api/pith-number/LPWPCK3UJSOTKZ5252RXJCZTD5/graph.json","fetch_events":"https://pith.science/api/pith-number/LPWPCK3UJSOTKZ5252RXJCZTD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/action/storage_attestation","attest_author":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/action/author_attestation","sign_citation":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/action/citation_signature","submit_replication":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/action/replication_record"}},"created_at":"2026-07-05T09:01:27.316225+00:00","updated_at":"2026-07-05T09:01:27.316225+00:00"}