{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WEMUUIVVT4TFUQDV4KANLGU7QY","short_pith_number":"pith:WEMUUIVV","schema_version":"1.0","canonical_sha256":"b1194a22b59f265a4075e280d59a9f861fdba2137fb735177443c08c6c306c1e","source":{"kind":"arxiv","id":"2310.12685","version":2},"attestation_state":"computed","paper":{"title":"Zarankiewicz numbers near the triple system threshold","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":"2023-10-19T12:31:28Z","abstract_excerpt":"For positive integers $m$ and $n$, the Zarankiewicz number $Z_{2,2}(m,n)$ can be defined as the maximum total degree of a linear hypergraph with $m$ vertices and $n$ edges. Guy determined $Z_{2,2}(m,n)$ for all $n \\geq \\binom{m}{2}/3+O(m)$. Here, we extend this by determining $Z_{2,2}(m,n)$ for all $n \\geq \\binom{m}{2}/3$ and, when $m$ is large, for all $n \\geq \\binom{m}{2}/6+O(m)$."},"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":"2310.12685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-19T12:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"23ab197fdc54eb644d6e71f889794c23a38c680f744a4d2aeb25f94be309cca3","abstract_canon_sha256":"ab70f85dabd80487961e941527ea6f400754e613b57bf7d9d17dc1b529c3d621"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:53.178548Z","signature_b64":"dIjSZ2+0D/CVJHsYEotErbJukeVRp4uq+vKFp5uCmXQ3A1iXjL3u/ic54Hs2wzxRCQ2KmK0RA/9iNLrH6zFiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1194a22b59f265a4075e280d59a9f861fdba2137fb735177443c08c6c306c1e","last_reissued_at":"2026-07-05T08:42:53.178073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:53.178073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zarankiewicz numbers near the triple system threshold","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":"2023-10-19T12:31:28Z","abstract_excerpt":"For positive integers $m$ and $n$, the Zarankiewicz number $Z_{2,2}(m,n)$ can be defined as the maximum total degree of a linear hypergraph with $m$ vertices and $n$ edges. Guy determined $Z_{2,2}(m,n)$ for all $n \\geq \\binom{m}{2}/3+O(m)$. Here, we extend this by determining $Z_{2,2}(m,n)$ for all $n \\geq \\binom{m}{2}/3$ and, when $m$ is large, for all $n \\geq \\binom{m}{2}/6+O(m)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12685","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/2310.12685/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":"2310.12685","created_at":"2026-07-05T08:42:53.178129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.12685v2","created_at":"2026-07-05T08:42:53.178129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12685","created_at":"2026-07-05T08:42:53.178129+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEMUUIVVT4TF","created_at":"2026-07-05T08:42:53.178129+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEMUUIVVT4TFUQDV","created_at":"2026-07-05T08:42:53.178129+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEMUUIVV","created_at":"2026-07-05T08:42:53.178129+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":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY","json":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY.json","graph_json":"https://pith.science/api/pith-number/WEMUUIVVT4TFUQDV4KANLGU7QY/graph.json","events_json":"https://pith.science/api/pith-number/WEMUUIVVT4TFUQDV4KANLGU7QY/events.json","paper":"https://pith.science/paper/WEMUUIVV"},"agent_actions":{"view_html":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY","download_json":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY.json","view_paper":"https://pith.science/paper/WEMUUIVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.12685&json=true","fetch_graph":"https://pith.science/api/pith-number/WEMUUIVVT4TFUQDV4KANLGU7QY/graph.json","fetch_events":"https://pith.science/api/pith-number/WEMUUIVVT4TFUQDV4KANLGU7QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY/action/storage_attestation","attest_author":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY/action/author_attestation","sign_citation":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY/action/citation_signature","submit_replication":"https://pith.science/pith/WEMUUIVVT4TFUQDV4KANLGU7QY/action/replication_record"}},"created_at":"2026-07-05T08:42:53.178129+00:00","updated_at":"2026-07-05T08:42:53.178129+00:00"}