{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6OGYMJDEAGQ2WCKQ2HZZ3475CJ","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":"c63e2835d9fc3246e27cc3a123eaa06716dd81f16b21008ea2187b100d6f4ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:47:58Z","title_canon_sha256":"909564706b2085a7a82ad1f759c50429a22e188530bfa8aed38e7399cb043510"},"schema_version":"1.0","source":{"id":"1908.03189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03189","created_at":"2026-07-04T23:52:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03189v1","created_at":"2026-07-04T23:52:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03189","created_at":"2026-07-04T23:52:27Z"},{"alias_kind":"pith_short_12","alias_value":"6OGYMJDEAGQ2","created_at":"2026-07-04T23:52:27Z"},{"alias_kind":"pith_short_16","alias_value":"6OGYMJDEAGQ2WCKQ","created_at":"2026-07-04T23:52:27Z"},{"alias_kind":"pith_short_8","alias_value":"6OGYMJDE","created_at":"2026-07-04T23:52:27Z"}],"graph_snapshots":[{"event_id":"sha256:3211fc4123f08ae6c339163b491dd4367f352f97ee367180c3103569baca3436","target":"graph","created_at":"2026-07-04T23:52: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/1908.03189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A zero-one matrix $M$ contains a zero-one matrix $A$ if one can delete some rows and columns of $M$, and turn some 1-entries into 0-entries such that the resulting matrix is $A$. The extremal number of $A$, denoted by $ex(n,A)$, is the maximum number of $1$-entries in an $n\\times n$ sized matrix $M$ that does not contain $A$.\n  A matrix $A$ is column-$t$-partite (or row-$t$-partite), if it can be cut along the columns (or rows) into $t$ submatrices such that every row (or column) of these submatrices contains at most one $1$-entry. We prove that if $A$ is column-$t$-partite, then $ex(n,A)<n^{2","authors_text":"Abhishek Methuku, Istv\\'an Tomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:47:58Z","title":"Bipartite Tur\\'an problems for ordered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03189","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:7242100906c3db3e62ed4bec8cc642eba5dd97baa5e8c91df567297f73925a9f","target":"record","created_at":"2026-07-04T23:52: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":"c63e2835d9fc3246e27cc3a123eaa06716dd81f16b21008ea2187b100d6f4ad7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:47:58Z","title_canon_sha256":"909564706b2085a7a82ad1f759c50429a22e188530bfa8aed38e7399cb043510"},"schema_version":"1.0","source":{"id":"1908.03189","kind":"arxiv","version":1}},"canonical_sha256":"f38d86246401a1ab0950d1f39df3fd125dae5208b0ca87d1e8235a5d3b7b4f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f38d86246401a1ab0950d1f39df3fd125dae5208b0ca87d1e8235a5d3b7b4f6e","first_computed_at":"2026-07-04T23:52:27.097666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:27.097666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D5S3RkpAtKZMeijX6sGxkAfllyB56IGZzJm/LjLNGB56ySQz7+WJxjAl/9oq3q5ojdsqVY4utWmxvBROknKgDw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:27.098074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7242100906c3db3e62ed4bec8cc642eba5dd97baa5e8c91df567297f73925a9f","sha256:3211fc4123f08ae6c339163b491dd4367f352f97ee367180c3103569baca3436"],"state_sha256":"10b24a5cf26a44edd3b7ec8c6bb2e8efb50f7db5038c66149faf6f95754c7938"}