{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:2MGDOPVVXJMJSJMU77VQRUXPHX","short_pith_number":"pith:2MGDOPVV","canonical_record":{"source":{"id":"2007.12816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-25T00:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"19c2860476416dfb4091908ad1bfbda0e15310cf0d872b199a3779cfdf820214","abstract_canon_sha256":"8515387e26af3b25387833f2d01bc5f34acaf19bf176e55fc96d259cd9c949c1"},"schema_version":"1.0"},"canonical_sha256":"d30c373eb5ba58992594ffeb08d2ef3df3f4414779309cdf545575b3526ca7ba","source":{"kind":"arxiv","id":"2007.12816","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12816","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12816v3","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12816","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"2MGDOPVVXJMJ","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"pith_short_16","alias_value":"2MGDOPVVXJMJSJMU","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"pith_short_8","alias_value":"2MGDOPVV","created_at":"2026-07-05T02:53:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:2MGDOPVVXJMJSJMU77VQRUXPHX","target":"record","payload":{"canonical_record":{"source":{"id":"2007.12816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-25T00:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"19c2860476416dfb4091908ad1bfbda0e15310cf0d872b199a3779cfdf820214","abstract_canon_sha256":"8515387e26af3b25387833f2d01bc5f34acaf19bf176e55fc96d259cd9c949c1"},"schema_version":"1.0"},"canonical_sha256":"d30c373eb5ba58992594ffeb08d2ef3df3f4414779309cdf545575b3526ca7ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:53:52.264382Z","signature_b64":"RpGAup73aJyM5LTpNZHGKKKPJfADIASh9hMXYTjf8YWVCz4JipPlNk0HZbo/2h3UybsBKYxHHifp0CVjKX5lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d30c373eb5ba58992594ffeb08d2ef3df3f4414779309cdf545575b3526ca7ba","last_reissued_at":"2026-07-05T02:53:52.263978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:53:52.263978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.12816","source_version":3,"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-05T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jhmb7j8SJumqXNljbeVxjLJB0zUHy460OmihukPAOTvvLbmjuwAPgetqVgrzrcV1/9mdP/b8ZlNKShIa2R4NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:35:27.595336Z"},"content_sha256":"187cb3de692c362347a6344e5cf0f5a1ddaa749cdb241ee6a16f1e8a740b515d","schema_version":"1.0","event_id":"sha256:187cb3de692c362347a6344e5cf0f5a1ddaa749cdb241ee6a16f1e8a740b515d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:2MGDOPVVXJMJSJMU77VQRUXPHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some remarks on the Zarankiewicz problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon","submitted_at":"2020-07-25T00:45:04Z","abstract_excerpt":"The Zarankiewicz problem asks for an estimate on $z(m, n; s, t)$, the largest number of $1$'s in an $m \\times n$ matrix with all entries $0$ or $1$ containing no $s \\times t$ submatrix consisting entirely of $1$'s. We show that a classical upper bound for $z(m, n; s, t)$ due to K\\H{o}v\\'ari, S\\'os and Tur\\'an is tight up to the constant for a broad range of parameters. The proof relies on a new quantitative variant of the random algebraic method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12816","kind":"arxiv","version":3},"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/2007.12816/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-05T02:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znRD4xcXwnmbtcU+UqucBB95PHKwmupyz2aXwIf9o8la4Ro/Xeomek68K44XuBcKeG6yPNbZEvnjZdaz99zPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:35:27.595900Z"},"content_sha256":"bca907a357b26ba2e0aa8529fa451a8fc03bebfb816da371c9393cf59c92c836","schema_version":"1.0","event_id":"sha256:bca907a357b26ba2e0aa8529fa451a8fc03bebfb816da371c9393cf59c92c836"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MGDOPVVXJMJSJMU77VQRUXPHX/bundle.json","state_url":"https://pith.science/pith/2MGDOPVVXJMJSJMU77VQRUXPHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MGDOPVVXJMJSJMU77VQRUXPHX/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-11T17:35:27Z","links":{"resolver":"https://pith.science/pith/2MGDOPVVXJMJSJMU77VQRUXPHX","bundle":"https://pith.science/pith/2MGDOPVVXJMJSJMU77VQRUXPHX/bundle.json","state":"https://pith.science/pith/2MGDOPVVXJMJSJMU77VQRUXPHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MGDOPVVXJMJSJMU77VQRUXPHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:2MGDOPVVXJMJSJMU77VQRUXPHX","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":"8515387e26af3b25387833f2d01bc5f34acaf19bf176e55fc96d259cd9c949c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-25T00:45:04Z","title_canon_sha256":"19c2860476416dfb4091908ad1bfbda0e15310cf0d872b199a3779cfdf820214"},"schema_version":"1.0","source":{"id":"2007.12816","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12816","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12816v3","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12816","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"2MGDOPVVXJMJ","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"pith_short_16","alias_value":"2MGDOPVVXJMJSJMU","created_at":"2026-07-05T02:53:52Z"},{"alias_kind":"pith_short_8","alias_value":"2MGDOPVV","created_at":"2026-07-05T02:53:52Z"}],"graph_snapshots":[{"event_id":"sha256:bca907a357b26ba2e0aa8529fa451a8fc03bebfb816da371c9393cf59c92c836","target":"graph","created_at":"2026-07-05T02:53:52Z","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/2007.12816/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Zarankiewicz problem asks for an estimate on $z(m, n; s, t)$, the largest number of $1$'s in an $m \\times n$ matrix with all entries $0$ or $1$ containing no $s \\times t$ submatrix consisting entirely of $1$'s. We show that a classical upper bound for $z(m, n; s, t)$ due to K\\H{o}v\\'ari, S\\'os and Tur\\'an is tight up to the constant for a broad range of parameters. The proof relies on a new quantitative variant of the random algebraic method.","authors_text":"David Conlon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-25T00:45:04Z","title":"Some remarks on the Zarankiewicz problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12816","kind":"arxiv","version":3},"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:187cb3de692c362347a6344e5cf0f5a1ddaa749cdb241ee6a16f1e8a740b515d","target":"record","created_at":"2026-07-05T02:53:52Z","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":"8515387e26af3b25387833f2d01bc5f34acaf19bf176e55fc96d259cd9c949c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-25T00:45:04Z","title_canon_sha256":"19c2860476416dfb4091908ad1bfbda0e15310cf0d872b199a3779cfdf820214"},"schema_version":"1.0","source":{"id":"2007.12816","kind":"arxiv","version":3}},"canonical_sha256":"d30c373eb5ba58992594ffeb08d2ef3df3f4414779309cdf545575b3526ca7ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d30c373eb5ba58992594ffeb08d2ef3df3f4414779309cdf545575b3526ca7ba","first_computed_at":"2026-07-05T02:53:52.263978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:53:52.263978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RpGAup73aJyM5LTpNZHGKKKPJfADIASh9hMXYTjf8YWVCz4JipPlNk0HZbo/2h3UybsBKYxHHifp0CVjKX5lAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:53:52.264382Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.12816","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:187cb3de692c362347a6344e5cf0f5a1ddaa749cdb241ee6a16f1e8a740b515d","sha256:bca907a357b26ba2e0aa8529fa451a8fc03bebfb816da371c9393cf59c92c836"],"state_sha256":"df2a0d4771da1aa5f81ad17a2bd01b8097e0328fc2075b00910c00ad3534728f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nANTJbN/e0MTUA7NOu7Y+2Y3pj1/r1gCpUc6Zi4GJmUe2g72W16mmeYKALsiglcO4i7YS840i0BAMQ+8jF/3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:35:27.602644Z","bundle_sha256":"8d1fc5edcac2aa57e1aa9bbaa706a4fded2ecc99215ce78bed8f55fc28870de4"}}