{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GXAAN3ADJHAUAOUFBHEQRJY7GW","short_pith_number":"pith:GXAAN3AD","canonical_record":{"source":{"id":"1801.09219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-28T12:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"125c112447972bd7a73c6f073d7bf04b9d1d4808185bec006d76936ebab856ca","abstract_canon_sha256":"8cdc55e6a046d3dab6d56d9f2b10d010f688f86a8446b1538eca3b1f183802e0"},"schema_version":"1.0"},"canonical_sha256":"35c006ec0349c1403a8509c908a71f35872d1b2bba4bc08d200e4f96ef29cdc5","source":{"kind":"arxiv","id":"1801.09219","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09219","created_at":"2026-05-17T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09219v2","created_at":"2026-05-17T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09219","created_at":"2026-05-17T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"GXAAN3ADJHAU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GXAAN3ADJHAUAOUF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GXAAN3AD","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GXAAN3ADJHAUAOUFBHEQRJY7GW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.09219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-28T12:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"125c112447972bd7a73c6f073d7bf04b9d1d4808185bec006d76936ebab856ca","abstract_canon_sha256":"8cdc55e6a046d3dab6d56d9f2b10d010f688f86a8446b1538eca3b1f183802e0"},"schema_version":"1.0"},"canonical_sha256":"35c006ec0349c1403a8509c908a71f35872d1b2bba4bc08d200e4f96ef29cdc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:59.553664Z","signature_b64":"fXWgAhCQxnMXyYyiKE5Cv2LUfbwSwmeBDWUaKk3ZjzgODDcPOiyDMg7fyIlqJxiOocE0VY7BmAFw5iVE5rGHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c006ec0349c1403a8509c908a71f35872d1b2bba4bc08d200e4f96ef29cdc5","last_reissued_at":"2026-05-17T23:55:59.552902Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:59.552902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.09219","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8rWxjR80QJeEPI0wzMy1S9thS0QxfgNxb+Cz+Jk3QEL/aJxyB0h7uG3iM4AxSieobOsiVZAbTUg3Jea38GoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:34:59.110822Z"},"content_sha256":"6106ccdc6c0155e37b14452add3d0d4fcc0671cabf012132e99af8b221c8850a","schema_version":"1.0","event_id":"sha256:6106ccdc6c0155e37b14452add3d0d4fcc0671cabf012132e99af8b221c8850a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GXAAN3ADJHAUAOUFBHEQRJY7GW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Zarankiewicz problem in 3-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons, Michael Tait","submitted_at":"2018-01-28T12:40:17Z","abstract_excerpt":"Let $F$ be a graph, $k \\geq 2$ be an integer, and write $\\mathrm{ex}_{ \\chi \\leq k } (n , F)$ for the maximum number of edges in an $n$-vertex graph that is $k$-partite and has no subgraph isomorphic to $F$. The function $\\mathrm{ex}_{ \\chi \\leq 2} ( n , F)$ has been studied by many researchers. Finding $\\mathrm{ex}_{ \\chi \\leq 2} (n , K_{s,t})$ is a special case of the Zarankiewicz problem. We prove an analogue of the K\\\"{o}v\\'{a}ri-S\\'{o}s-Tur\\'{a}n Theorem for 3-partite graphs by showing \\[ \\mathrm{ex}_{ \\chi \\leq 3} (n , K_{s,t} ) \\leq \\left( \\frac{1}{3} \\right)^{1 - 1/s} \\left( \\frac{ t -"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09219","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CyC+zhBQtUwKK6geNW1f0bnj617h//FEnsBRXnfJ9Xzzf6f4HVhIF8rL2Gi/Kpa1DUSFmv0LOECWBn0k6i6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:34:59.111209Z"},"content_sha256":"e284ea7e7fdccdf7486dd86910e807b5baf599167b70c188023a9ec36f0bde84","schema_version":"1.0","event_id":"sha256:e284ea7e7fdccdf7486dd86910e807b5baf599167b70c188023a9ec36f0bde84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW/bundle.json","state_url":"https://pith.science/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T10:34:59Z","links":{"resolver":"https://pith.science/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW","bundle":"https://pith.science/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW/bundle.json","state":"https://pith.science/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXAAN3ADJHAUAOUFBHEQRJY7GW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GXAAN3ADJHAUAOUFBHEQRJY7GW","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":"8cdc55e6a046d3dab6d56d9f2b10d010f688f86a8446b1538eca3b1f183802e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-28T12:40:17Z","title_canon_sha256":"125c112447972bd7a73c6f073d7bf04b9d1d4808185bec006d76936ebab856ca"},"schema_version":"1.0","source":{"id":"1801.09219","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09219","created_at":"2026-05-17T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09219v2","created_at":"2026-05-17T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09219","created_at":"2026-05-17T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"GXAAN3ADJHAU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GXAAN3ADJHAUAOUF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GXAAN3AD","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:e284ea7e7fdccdf7486dd86910e807b5baf599167b70c188023a9ec36f0bde84","target":"graph","created_at":"2026-05-17T23:55:59Z","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"},"paper":{"abstract_excerpt":"Let $F$ be a graph, $k \\geq 2$ be an integer, and write $\\mathrm{ex}_{ \\chi \\leq k } (n , F)$ for the maximum number of edges in an $n$-vertex graph that is $k$-partite and has no subgraph isomorphic to $F$. The function $\\mathrm{ex}_{ \\chi \\leq 2} ( n , F)$ has been studied by many researchers. Finding $\\mathrm{ex}_{ \\chi \\leq 2} (n , K_{s,t})$ is a special case of the Zarankiewicz problem. We prove an analogue of the K\\\"{o}v\\'{a}ri-S\\'{o}s-Tur\\'{a}n Theorem for 3-partite graphs by showing \\[ \\mathrm{ex}_{ \\chi \\leq 3} (n , K_{s,t} ) \\leq \\left( \\frac{1}{3} \\right)^{1 - 1/s} \\left( \\frac{ t -","authors_text":"Craig Timmons, Michael Tait","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-28T12:40:17Z","title":"The Zarankiewicz problem in 3-partite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09219","kind":"arxiv","version":2},"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:6106ccdc6c0155e37b14452add3d0d4fcc0671cabf012132e99af8b221c8850a","target":"record","created_at":"2026-05-17T23:55:59Z","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":"8cdc55e6a046d3dab6d56d9f2b10d010f688f86a8446b1538eca3b1f183802e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-28T12:40:17Z","title_canon_sha256":"125c112447972bd7a73c6f073d7bf04b9d1d4808185bec006d76936ebab856ca"},"schema_version":"1.0","source":{"id":"1801.09219","kind":"arxiv","version":2}},"canonical_sha256":"35c006ec0349c1403a8509c908a71f35872d1b2bba4bc08d200e4f96ef29cdc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35c006ec0349c1403a8509c908a71f35872d1b2bba4bc08d200e4f96ef29cdc5","first_computed_at":"2026-05-17T23:55:59.552902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:59.552902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fXWgAhCQxnMXyYyiKE5Cv2LUfbwSwmeBDWUaKk3ZjzgODDcPOiyDMg7fyIlqJxiOocE0VY7BmAFw5iVE5rGHAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:59.553664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09219","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6106ccdc6c0155e37b14452add3d0d4fcc0671cabf012132e99af8b221c8850a","sha256:e284ea7e7fdccdf7486dd86910e807b5baf599167b70c188023a9ec36f0bde84"],"state_sha256":"e7f6e0bab7ac43e48f4745e692a0a2f05588ee5305f4e2b39fdb373813de8df3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXpGHp7jrRWMPFJ0C3auV0IhokA3sAXExNx3Vmd1UPPnUXRNsg9CXpWxDy6iR6uUH8/xMGFlLmus8on6d928Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:34:59.114077Z","bundle_sha256":"c79bd4477d51b359faa0f0489941a2106744d3b16254bf91c873559007d8e28a"}}