{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4N2SPQHB3AAXHCBKECVN6FIYFP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41d1ac9d184823b9796efabd26642a6f13af9e2821ee62624aaad967d52993b9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T02:29:12Z","title_canon_sha256":"7a1510f8c138caf6a3e3edc76acb4e1cbc83f3dd5e604c26801cbfeea5b5d209"},"schema_version":"1.0","source":{"id":"2608.01606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.01606","created_at":"2026-08-04T02:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2608.01606v1","created_at":"2026-08-04T02:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01606","created_at":"2026-08-04T02:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"4N2SPQHB3AAX","created_at":"2026-08-04T02:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"4N2SPQHB3AAXHCBK","created_at":"2026-08-04T02:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"4N2SPQHB","created_at":"2026-08-04T02:06:06Z"}],"graph_snapshots":[{"event_id":"sha256:b99acd7f14e4e442fd36a6d65d235ed5a5f443241c2f85e5f470697d7d63e229","target":"graph","created_at":"2026-08-04T02:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.01606/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ankan Sadhu","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T02:29:12Z","title":"An Improved Upper Bound on the Zarankiewicz Number z(43;2)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01606","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f9f60fd163c673b0fb27f1305e4aa6a6d53bdd7aa1335642d486260787c7c1f4","target":"record","created_at":"2026-08-04T02:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41d1ac9d184823b9796efabd26642a6f13af9e2821ee62624aaad967d52993b9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T02:29:12Z","title_canon_sha256":"7a1510f8c138caf6a3e3edc76acb4e1cbc83f3dd5e604c26801cbfeea5b5d209"},"schema_version":"1.0","source":{"id":"2608.01606","kind":"arxiv","version":1}},"canonical_sha256":"e37527c0e1d80173882a20aadf15182bfef0d46ab6e9c0f0a67964f1e5f090f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e37527c0e1d80173882a20aadf15182bfef0d46ab6e9c0f0a67964f1e5f090f4","first_computed_at":"2026-08-04T02:06:06.972483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T02:06:06.972483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wfOU9IsDjGY53VTQF06+C/OaEzJEGw5S+J51ytzWMqvzbGrujT6vBNfVg3uN0BxUCLJsXbT4je2DX8MzCBOmBw==","signature_status":"signed_v1","signed_at":"2026-08-04T02:06:06.974084Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.01606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9f60fd163c673b0fb27f1305e4aa6a6d53bdd7aa1335642d486260787c7c1f4","sha256:b99acd7f14e4e442fd36a6d65d235ed5a5f443241c2f85e5f470697d7d63e229"],"state_sha256":"4fde006e9e2f26073dcb7823fc4ae259389d7d38bbabbb241b532fe6105929dc"}