{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ICJMWL2YAOEVURO5JCHNEVNLW3","short_pith_number":"pith:ICJMWL2Y","schema_version":"1.0","canonical_sha256":"4092cb2f5803895a45dd488ed255abb6f7b430cdeeda0f2a56a74172fb937785","source":{"kind":"arxiv","id":"2410.03702","version":2},"attestation_state":"computed","paper":{"title":"A survey of Zarankiewicz problems in geometry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"math.HO","authors_text":"Shakhar Smorodinsky","submitted_at":"2024-09-24T13:45:27Z","abstract_excerpt":"One of the central topics in extremal graph theory is the study of the function $ex(n,H)$, which represents the maximum number of edges a graph with $n$ vertices can have while avoiding a fixed graph $H$ as a subgraph. Tur{\\'a}n provided a complete characterization for the case when $H$ is a complete graph on $r$ vertices. Erd{\\H o}s, Stone, and Simonovits extended Tur{\\'a}n's result to arbitrary graphs $H$ with $\\chi(H) > 2$ (chromatic number greater than 2). However, determining the asymptotics of $ex(n, H)$ for bipartite graphs $H$ remains a widely open problem. A classical example of this "},"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":"2410.03702","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2024-09-24T13:45:27Z","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"title_canon_sha256":"9d7ceeea2a7b6752db5afdfd084da9cb4ecf3831c6ff64f9cad324df9bf3fd67","abstract_canon_sha256":"a90885b39c5fa7b5ac9a7632a461f07968dc022e05149d30ee4bfbe68461809d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:31.718939Z","signature_b64":"ZHVMqc8QTlmBDsvPQepUttL5mUHvFm6/BmwFmazWEWt2dSaD7+daFr9VTBjNCl+sl5tmWK4//NOG7QmJXG+3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4092cb2f5803895a45dd488ed255abb6f7b430cdeeda0f2a56a74172fb937785","last_reissued_at":"2026-07-05T10:32:31.718113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:31.718113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A survey of Zarankiewicz problems in geometry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"math.HO","authors_text":"Shakhar Smorodinsky","submitted_at":"2024-09-24T13:45:27Z","abstract_excerpt":"One of the central topics in extremal graph theory is the study of the function $ex(n,H)$, which represents the maximum number of edges a graph with $n$ vertices can have while avoiding a fixed graph $H$ as a subgraph. Tur{\\'a}n provided a complete characterization for the case when $H$ is a complete graph on $r$ vertices. Erd{\\H o}s, Stone, and Simonovits extended Tur{\\'a}n's result to arbitrary graphs $H$ with $\\chi(H) > 2$ (chromatic number greater than 2). However, determining the asymptotics of $ex(n, H)$ for bipartite graphs $H$ remains a widely open problem. A classical example of this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03702","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/2410.03702/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":"2410.03702","created_at":"2026-07-05T10:32:31.718230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03702v2","created_at":"2026-07-05T10:32:31.718230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03702","created_at":"2026-07-05T10:32:31.718230+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICJMWL2YAOEV","created_at":"2026-07-05T10:32:31.718230+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICJMWL2YAOEVURO5","created_at":"2026-07-05T10:32:31.718230+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICJMWL2Y","created_at":"2026-07-05T10:32:31.718230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09785","citing_title":"Biclique decompositions from Welzl orders","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3","json":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3.json","graph_json":"https://pith.science/api/pith-number/ICJMWL2YAOEVURO5JCHNEVNLW3/graph.json","events_json":"https://pith.science/api/pith-number/ICJMWL2YAOEVURO5JCHNEVNLW3/events.json","paper":"https://pith.science/paper/ICJMWL2Y"},"agent_actions":{"view_html":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3","download_json":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3.json","view_paper":"https://pith.science/paper/ICJMWL2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03702&json=true","fetch_graph":"https://pith.science/api/pith-number/ICJMWL2YAOEVURO5JCHNEVNLW3/graph.json","fetch_events":"https://pith.science/api/pith-number/ICJMWL2YAOEVURO5JCHNEVNLW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3/action/storage_attestation","attest_author":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3/action/author_attestation","sign_citation":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3/action/citation_signature","submit_replication":"https://pith.science/pith/ICJMWL2YAOEVURO5JCHNEVNLW3/action/replication_record"}},"created_at":"2026-07-05T10:32:31.718230+00:00","updated_at":"2026-07-05T10:32:31.718230+00:00"}