{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LPWPCK3UJSOTKZ5252RXJCZTD5","short_pith_number":"pith:LPWPCK3U","canonical_record":{"source":{"id":"2311.13662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-22T19:34:36Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"57d24a45861a93a76879197d32ac087730f28a30a2fcf19898453193a612a114","abstract_canon_sha256":"59540e8b434512f0755a9927d52e950eb0d14f1fed505aaad95c3ba3424fb2a0"},"schema_version":"1.0"},"canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","source":{"kind":"arxiv","id":"2311.13662","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.13662","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"arxiv_version","alias_value":"2311.13662v2","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13662","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"pith_short_12","alias_value":"LPWPCK3UJSOT","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"pith_short_16","alias_value":"LPWPCK3UJSOTKZ52","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"pith_short_8","alias_value":"LPWPCK3U","created_at":"2026-07-05T09:01:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LPWPCK3UJSOTKZ5252RXJCZTD5","target":"record","payload":{"canonical_record":{"source":{"id":"2311.13662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-22T19:34:36Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"57d24a45861a93a76879197d32ac087730f28a30a2fcf19898453193a612a114","abstract_canon_sha256":"59540e8b434512f0755a9927d52e950eb0d14f1fed505aaad95c3ba3424fb2a0"},"schema_version":"1.0"},"canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:27.316768Z","signature_b64":"meeQWihwl/hVSYi0bjBWFNRi7MYPaXRV6kR5Am+b8w1Ml8Mq/MUjVqi8tFbz/WIuJ3pQwv2iGpDdNwB80vQTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","last_reissued_at":"2026-07-05T09:01:27.316137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:27.316137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.13662","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-07-05T09:01:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BVJYrtzcY/PFU2CwjrXuOrDHb4rCAmZnVgGhYWQGOmmu1Yk6z5DMRW+ColrI7FBDWQ4IUJvf9HtEf9O2zQEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:06:24.900893Z"},"content_sha256":"a4b3c616d7db67cdbfd23bef77e84bd663c1a9b5640d0880b03853165f549971","schema_version":"1.0","event_id":"sha256:a4b3c616d7db67cdbfd23bef77e84bd663c1a9b5640d0880b03853165f549971"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LPWPCK3UJSOTKZ5252RXJCZTD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zarankiewicz's problem via $\\epsilon$-t-nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2023-11-22T19:34:36Z","abstract_excerpt":"The classical Zarankiewicz's problem asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{t,t}$. In one of the cornerstones of extremal graph theory, K\\H{o}v\\'ari S\\'os and Tur\\'an proved an upper bound of $O(n^{2-\\frac{1}{t}})$. In a celebrated result, Fox et al. obtained an improved bound of $O(n^{2-\\frac{1}{d}})$ for graphs of VC-dimension $d$ (where $d<t$). Basit, Chernikov, Starchenko, Tao and Tran improved the bound for the case of semilinear graphs. At SODA'23, Chan and Har-Peled further improved Basit et al.'s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13662","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/2311.13662/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"},"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-07-05T09:01:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hZHQPtiNxtG4tmUjk/9/6jmk8DTMz5o1H5Ff+U4uCM9O+OkRJdbuhI32W9ze6G1wGXbqUjL8qHZrKZDE1LJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:06:24.901815Z"},"content_sha256":"c5361decd6aac14f5ae095c04ee17aca02ecc1d4d6c7f2cf95192188697de740","schema_version":"1.0","event_id":"sha256:c5361decd6aac14f5ae095c04ee17aca02ecc1d4d6c7f2cf95192188697de740"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/bundle.json","state_url":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/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-08-08T21:06:24Z","links":{"resolver":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5","bundle":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/bundle.json","state":"https://pith.science/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPWPCK3UJSOTKZ5252RXJCZTD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LPWPCK3UJSOTKZ5252RXJCZTD5","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":"59540e8b434512f0755a9927d52e950eb0d14f1fed505aaad95c3ba3424fb2a0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-22T19:34:36Z","title_canon_sha256":"57d24a45861a93a76879197d32ac087730f28a30a2fcf19898453193a612a114"},"schema_version":"1.0","source":{"id":"2311.13662","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.13662","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"arxiv_version","alias_value":"2311.13662v2","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13662","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"pith_short_12","alias_value":"LPWPCK3UJSOT","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"pith_short_16","alias_value":"LPWPCK3UJSOTKZ52","created_at":"2026-07-05T09:01:27Z"},{"alias_kind":"pith_short_8","alias_value":"LPWPCK3U","created_at":"2026-07-05T09:01:27Z"}],"graph_snapshots":[{"event_id":"sha256:c5361decd6aac14f5ae095c04ee17aca02ecc1d4d6c7f2cf95192188697de740","target":"graph","created_at":"2026-07-05T09:01:27Z","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/2311.13662/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The classical Zarankiewicz's problem asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{t,t}$. In one of the cornerstones of extremal graph theory, K\\H{o}v\\'ari S\\'os and Tur\\'an proved an upper bound of $O(n^{2-\\frac{1}{t}})$. In a celebrated result, Fox et al. obtained an improved bound of $O(n^{2-\\frac{1}{d}})$ for graphs of VC-dimension $d$ (where $d<t$). Basit, Chernikov, Starchenko, Tao and Tran improved the bound for the case of semilinear graphs. At SODA'23, Chan and Har-Peled further improved Basit et al.'s","authors_text":"Chaya Keller, Shakhar Smorodinsky","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-22T19:34:36Z","title":"Zarankiewicz's problem via $\\epsilon$-t-nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13662","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:a4b3c616d7db67cdbfd23bef77e84bd663c1a9b5640d0880b03853165f549971","target":"record","created_at":"2026-07-05T09:01:27Z","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":"59540e8b434512f0755a9927d52e950eb0d14f1fed505aaad95c3ba3424fb2a0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-22T19:34:36Z","title_canon_sha256":"57d24a45861a93a76879197d32ac087730f28a30a2fcf19898453193a612a114"},"schema_version":"1.0","source":{"id":"2311.13662","kind":"arxiv","version":2}},"canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5becf12b744c9d3567baeea3748b331f5081af6ee99a508849e67e3c54285f80","first_computed_at":"2026-07-05T09:01:27.316137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:01:27.316137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"meeQWihwl/hVSYi0bjBWFNRi7MYPaXRV6kR5Am+b8w1Ml8Mq/MUjVqi8tFbz/WIuJ3pQwv2iGpDdNwB80vQTAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:01:27.316768Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.13662","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4b3c616d7db67cdbfd23bef77e84bd663c1a9b5640d0880b03853165f549971","sha256:c5361decd6aac14f5ae095c04ee17aca02ecc1d4d6c7f2cf95192188697de740"],"state_sha256":"94d476886dd2dfff0afaeb0b9d22dd31bcfb3b93e9adbc538c2cb34e6dae0882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMhSt0k16q0eBT7s5j8n0LEe+0yse1gGakdJcfazb166C1u4fKbvgdP9TAGvLSOZ+XzPOqKaylhrLPyuktC8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:06:24.907310Z","bundle_sha256":"49d400b9593c4e3c5ca43963735715ca030cdb08b3782dc30740582fe0499367"}}