{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NQIPSHXA7CGGCXQKCE63XOLNPG","short_pith_number":"pith:NQIPSHXA","schema_version":"1.0","canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","source":{"kind":"arxiv","id":"2506.23942","version":1},"attestation_state":"computed","paper":{"title":"$C_4$-free subgraphs of high degree with geometric applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istvan Tomon, Zach Hunter","submitted_at":"2025-06-30T15:09:00Z","abstract_excerpt":"The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$-vertex graph that does not contain the complete bipartite graph $K_{s,s}$. While the problem remains widely open in the case of general graphs, the past two decades have seen significant progress on this problem for various restricted graph classes -- particularly those arising from geometric settings -- leading to a deeper understanding of their structure.\n  In this paper, we develop a new structural tool for addressing Zarankiewicz-type problems. More specifically, we show"},"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":"2506.23942","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-30T15:09:00Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2ad6f1412e102fc414b2aa8fffb16502a7466a9a7548eaad1985e28abc4aae45","abstract_canon_sha256":"d9222fa54f025167b5c9249efe1c268cf9a9e87d4471da1b63285ed19a4c331a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:30.500381Z","signature_b64":"sQu/xFm/4BNHNjnw3VxZi1ggoxCnM4whhmVCkrMagEJ5Mk6AW6LW2R/jrXQz4r74PWigjzddxg1wNmlksFC5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c10f91ee0f88c615e0a113dbbb96d798c5efacde9a2a37936cfcb6785ff48ed","last_reissued_at":"2026-07-05T11:29:30.499857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:30.499857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$C_4$-free subgraphs of high degree with geometric applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istvan Tomon, Zach Hunter","submitted_at":"2025-06-30T15:09:00Z","abstract_excerpt":"The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$-vertex graph that does not contain the complete bipartite graph $K_{s,s}$. While the problem remains widely open in the case of general graphs, the past two decades have seen significant progress on this problem for various restricted graph classes -- particularly those arising from geometric settings -- leading to a deeper understanding of their structure.\n  In this paper, we develop a new structural tool for addressing Zarankiewicz-type problems. More specifically, we show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23942","kind":"arxiv","version":1},"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/2506.23942/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":"2506.23942","created_at":"2026-07-05T11:29:30.499917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23942v1","created_at":"2026-07-05T11:29:30.499917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23942","created_at":"2026-07-05T11:29:30.499917+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQIPSHXA7CGG","created_at":"2026-07-05T11:29:30.499917+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQIPSHXA7CGGCXQK","created_at":"2026-07-05T11:29:30.499917+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQIPSHXA","created_at":"2026-07-05T11:29:30.499917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06444","citing_title":"Nearly tight bounds for induced subdivisions","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11649","citing_title":"A parity Erd\\H{o}s-Hajnal theorem for $t$-intersecting curves","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08848","citing_title":"Ramsey-type $\\chi$-bounds for $\\chi$-bounded graph classes","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20815","citing_title":"A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG","json":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG.json","graph_json":"https://pith.science/api/pith-number/NQIPSHXA7CGGCXQKCE63XOLNPG/graph.json","events_json":"https://pith.science/api/pith-number/NQIPSHXA7CGGCXQKCE63XOLNPG/events.json","paper":"https://pith.science/paper/NQIPSHXA"},"agent_actions":{"view_html":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG","download_json":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG.json","view_paper":"https://pith.science/paper/NQIPSHXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23942&json=true","fetch_graph":"https://pith.science/api/pith-number/NQIPSHXA7CGGCXQKCE63XOLNPG/graph.json","fetch_events":"https://pith.science/api/pith-number/NQIPSHXA7CGGCXQKCE63XOLNPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/action/storage_attestation","attest_author":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/action/author_attestation","sign_citation":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/action/citation_signature","submit_replication":"https://pith.science/pith/NQIPSHXA7CGGCXQKCE63XOLNPG/action/replication_record"}},"created_at":"2026-07-05T11:29:30.499917+00:00","updated_at":"2026-07-05T11:29:30.499917+00:00"}