{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4N2SPQHB3AAXHCBKECVN6FIYFP","short_pith_number":"pith:4N2SPQHB","schema_version":"1.0","canonical_sha256":"e37527c0e1d80173882a20aadf15182bfef0d46ab6e9c0f0a67964f1e5f090f4","source":{"kind":"arxiv","id":"2608.01606","version":1},"attestation_state":"computed","paper":{"title":"An Improved Upper Bound on the Zarankiewicz Number z(43;2)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ankan Sadhu","submitted_at":"2026-08-03T02:29:12Z","abstract_excerpt":"The Zarankiewicz number z(43;2) is the largest number of edges in a four-cycle-free bipartite graph with two parts of size 43. Reiman's bound gives z(43;2) <= 301, with equality only for the incidence graph of a projective plane of order six; no such plane exists, so z(43;2) <= 300. We prove z(43;2) <= 299. The argument is elementary and uses no computer search: a counting identity for the leave of the configuration shows that a hypothetical 300-edge graph admits one of exactly twenty-seven degree profiles per side, of which only four combinations are locally compatible. Three force two vertic"},"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":"2608.01606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T02:29:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7a1510f8c138caf6a3e3edc76acb4e1cbc83f3dd5e604c26801cbfeea5b5d209","abstract_canon_sha256":"41d1ac9d184823b9796efabd26642a6f13af9e2821ee62624aaad967d52993b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:06:06.974084Z","signature_b64":"wfOU9IsDjGY53VTQF06+C/OaEzJEGw5S+J51ytzWMqvzbGrujT6vBNfVg3uN0BxUCLJsXbT4je2DX8MzCBOmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37527c0e1d80173882a20aadf15182bfef0d46ab6e9c0f0a67964f1e5f090f4","last_reissued_at":"2026-08-04T02:06:06.972483Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:06:06.972483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Upper Bound on the Zarankiewicz Number z(43;2)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ankan Sadhu","submitted_at":"2026-08-03T02:29:12Z","abstract_excerpt":"The Zarankiewicz number z(43;2) is the largest number of edges in a four-cycle-free bipartite graph with two parts of size 43. Reiman's bound gives z(43;2) <= 301, with equality only for the incidence graph of a projective plane of order six; no such plane exists, so z(43;2) <= 300. We prove z(43;2) <= 299. The argument is elementary and uses no computer search: a counting identity for the leave of the configuration shows that a hypothetical 300-edge graph admits one of exactly twenty-seven degree profiles per side, of which only four combinations are locally compatible. Three force two vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01606","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/2608.01606/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":"2608.01606","created_at":"2026-08-04T02:06:06.973948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01606v1","created_at":"2026-08-04T02:06:06.973948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01606","created_at":"2026-08-04T02:06:06.973948+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N2SPQHB3AAX","created_at":"2026-08-04T02:06:06.973948+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N2SPQHB3AAXHCBK","created_at":"2026-08-04T02:06:06.973948+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N2SPQHB","created_at":"2026-08-04T02:06:06.973948+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP","json":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP.json","graph_json":"https://pith.science/api/pith-number/4N2SPQHB3AAXHCBKECVN6FIYFP/graph.json","events_json":"https://pith.science/api/pith-number/4N2SPQHB3AAXHCBKECVN6FIYFP/events.json","paper":"https://pith.science/paper/4N2SPQHB"},"agent_actions":{"view_html":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP","download_json":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP.json","view_paper":"https://pith.science/paper/4N2SPQHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01606&json=true","fetch_graph":"https://pith.science/api/pith-number/4N2SPQHB3AAXHCBKECVN6FIYFP/graph.json","fetch_events":"https://pith.science/api/pith-number/4N2SPQHB3AAXHCBKECVN6FIYFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP/action/storage_attestation","attest_author":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP/action/author_attestation","sign_citation":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP/action/citation_signature","submit_replication":"https://pith.science/pith/4N2SPQHB3AAXHCBKECVN6FIYFP/action/replication_record"}},"created_at":"2026-08-04T02:06:06.973948+00:00","updated_at":"2026-08-04T02:06:06.973948+00:00"}