{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KD3CSBJKVC4TN4BTRCK47ETT7H","short_pith_number":"pith:KD3CSBJK","schema_version":"1.0","canonical_sha256":"50f629052aa8b936f0338895cf9273f9f10c7e4262f805b94b2425e9848332ac","source":{"kind":"arxiv","id":"2202.05507","version":2},"attestation_state":"computed","paper":{"title":"Exact values for unbalanced Zarankiewicz numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti, Daniel Horsley, Guangzhou Chen","submitted_at":"2022-02-11T08:43:53Z","abstract_excerpt":"For positive integers $s$, $t$, $m$ and $n$, the Zarankiewicz number $Z_{s,t}(m,n)$ is defined to be the maximum number of edges in a bipartite graph with parts of sizes $m$ and $n$ that has no complete biparitite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices in the part of size $n$. A simple argument shows that, for each $t \\geq 2$, $Z_{2,t}(m,n)=(t-1)\\binom{m}{2}+n$ when $n \\geq (t-1)\\binom{m}{2}$. Here, for large $m$, we determine the exact value of $Z_{2,t}(m,n)$ in almost all of the remaining cases where $n=\\Theta(tm^2)$. We establish a new family of upper boun"},"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":"2202.05507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-11T08:43:53Z","cross_cats_sorted":[],"title_canon_sha256":"8c4cd546d1310ab5fcaac38cb100fffc71a566e3f838bcb11a539990ed89e8b5","abstract_canon_sha256":"2ea27561d3542c3060716d299e3f64f73d2d1965c4c8ae3db7f571339cbc9530"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:10.248855Z","signature_b64":"Wz7UPHf0jD9xYL5oN3lQW2WyidPh+/0d2oYNBaY8o7p0H9DqbxPSsKdlRsa7hQCR74qRe7u15+Eqxxf2qsSJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50f629052aa8b936f0338895cf9273f9f10c7e4262f805b94b2425e9848332ac","last_reissued_at":"2026-07-05T08:06:10.248453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:10.248453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact values for unbalanced Zarankiewicz numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Mammoliti, Daniel Horsley, Guangzhou Chen","submitted_at":"2022-02-11T08:43:53Z","abstract_excerpt":"For positive integers $s$, $t$, $m$ and $n$, the Zarankiewicz number $Z_{s,t}(m,n)$ is defined to be the maximum number of edges in a bipartite graph with parts of sizes $m$ and $n$ that has no complete biparitite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices in the part of size $n$. A simple argument shows that, for each $t \\geq 2$, $Z_{2,t}(m,n)=(t-1)\\binom{m}{2}+n$ when $n \\geq (t-1)\\binom{m}{2}$. Here, for large $m$, we determine the exact value of $Z_{2,t}(m,n)$ in almost all of the remaining cases where $n=\\Theta(tm^2)$. We establish a new family of upper boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05507","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/2202.05507/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":"2202.05507","created_at":"2026-07-05T08:06:10.248507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.05507v2","created_at":"2026-07-05T08:06:10.248507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05507","created_at":"2026-07-05T08:06:10.248507+00:00"},{"alias_kind":"pith_short_12","alias_value":"KD3CSBJKVC4T","created_at":"2026-07-05T08:06:10.248507+00:00"},{"alias_kind":"pith_short_16","alias_value":"KD3CSBJKVC4TN4BT","created_at":"2026-07-05T08:06:10.248507+00:00"},{"alias_kind":"pith_short_8","alias_value":"KD3CSBJK","created_at":"2026-07-05T08:06:10.248507+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07607","citing_title":"A congruence obstruction to Roman's bound for Zarankiewicz numbers","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H","json":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H.json","graph_json":"https://pith.science/api/pith-number/KD3CSBJKVC4TN4BTRCK47ETT7H/graph.json","events_json":"https://pith.science/api/pith-number/KD3CSBJKVC4TN4BTRCK47ETT7H/events.json","paper":"https://pith.science/paper/KD3CSBJK"},"agent_actions":{"view_html":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H","download_json":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H.json","view_paper":"https://pith.science/paper/KD3CSBJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.05507&json=true","fetch_graph":"https://pith.science/api/pith-number/KD3CSBJKVC4TN4BTRCK47ETT7H/graph.json","fetch_events":"https://pith.science/api/pith-number/KD3CSBJKVC4TN4BTRCK47ETT7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H/action/storage_attestation","attest_author":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H/action/author_attestation","sign_citation":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H/action/citation_signature","submit_replication":"https://pith.science/pith/KD3CSBJKVC4TN4BTRCK47ETT7H/action/replication_record"}},"created_at":"2026-07-05T08:06:10.248507+00:00","updated_at":"2026-07-05T08:06:10.248507+00:00"}