{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q3MGFPOZ2FGQ56T6UTVMKXEUJW","short_pith_number":"pith:Q3MGFPOZ","schema_version":"1.0","canonical_sha256":"86d862bdd9d14d0efa7ea4eac55c944da8ae05f21d4bb3fef0331080a4be7bdd","source":{"kind":"arxiv","id":"1903.09725","version":1},"attestation_state":"computed","paper":{"title":"Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Lea Weber, Maria Axenovich","submitted_at":"2019-03-22T22:27:38Z","abstract_excerpt":"For a bipartite graph G, let h(G) be the largest t such that either G or the bipartite complement of G contain K_{t,t}. For a class F of graphs, let h(F)= min {h(G): G\\in F}. We say that a bipartite graph H is strongly acyclic if neither H nor its bipartite complement contain a cycle. By Forb(n, H) we denote a set of bipartite graphs with parts of sizes n each, that do not contain H as an induced bipartite subgraph respecting the sides. One can easily show that h(Forb(n,H))= O(n^{1-s}) for a positive s if H is not strongly acyclic. Here, we prove that h(Forb(n, H)) is linear in n for all stron"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.09725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-22T22:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"eb018640d48a384ef709eed910ad7b1cfa628827b64a5aeb657e2878bfa91c17","abstract_canon_sha256":"e743c718fc70c22f42c180fc9e102276ed089f183756d227be8ef2a7cf2597b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:35.686868Z","signature_b64":"re3sEBcKs5AeL4Ahp1jOlmu7fTeNWDbDDv5kECuGw6nOHsabKtvnQtVLCOOaEdcwbAXlF6gmjzrtmHfU92j5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86d862bdd9d14d0efa7ea4eac55c944da8ae05f21d4bb3fef0331080a4be7bdd","last_reissued_at":"2026-05-17T23:50:35.686155Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:35.686155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Lea Weber, Maria Axenovich","submitted_at":"2019-03-22T22:27:38Z","abstract_excerpt":"For a bipartite graph G, let h(G) be the largest t such that either G or the bipartite complement of G contain K_{t,t}. For a class F of graphs, let h(F)= min {h(G): G\\in F}. We say that a bipartite graph H is strongly acyclic if neither H nor its bipartite complement contain a cycle. By Forb(n, H) we denote a set of bipartite graphs with parts of sizes n each, that do not contain H as an induced bipartite subgraph respecting the sides. One can easily show that h(Forb(n,H))= O(n^{1-s}) for a positive s if H is not strongly acyclic. Here, we prove that h(Forb(n, H)) is linear in n for all stron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09725","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.09725","created_at":"2026-05-17T23:50:35.686282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09725v1","created_at":"2026-05-17T23:50:35.686282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09725","created_at":"2026-05-17T23:50:35.686282+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3MGFPOZ2FGQ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3MGFPOZ2FGQ56T6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3MGFPOZ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW","json":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW.json","graph_json":"https://pith.science/api/pith-number/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/graph.json","events_json":"https://pith.science/api/pith-number/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/events.json","paper":"https://pith.science/paper/Q3MGFPOZ"},"agent_actions":{"view_html":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW","download_json":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW.json","view_paper":"https://pith.science/paper/Q3MGFPOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09725&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/action/storage_attestation","attest_author":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/action/author_attestation","sign_citation":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/action/citation_signature","submit_replication":"https://pith.science/pith/Q3MGFPOZ2FGQ56T6UTVMKXEUJW/action/replication_record"}},"created_at":"2026-05-17T23:50:35.686282+00:00","updated_at":"2026-05-17T23:50:35.686282+00:00"}