{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BPBC3L3WYX7HYXLKOUTKABAWBG","short_pith_number":"pith:BPBC3L3W","schema_version":"1.0","canonical_sha256":"0bc22daf76c5fe7c5d6a7526a0041609b848160a6c3d2a242273a7c49ae1eb31","source":{"kind":"arxiv","id":"2109.01311","version":4},"attestation_state":"computed","paper":{"title":"Bipartite-ness under smooth conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Sean Longbrake, Tao Jiang","submitted_at":"2021-09-03T04:58:13Z","abstract_excerpt":"Given a family $\\mathcal{F}$ of bipartite graphs, the {\\it Zarankiewicz number} $z(m,n,\\mathcal{F})$ is the maximum number of edges in an $m$ by $n$ bipartite graph $G$ that does not contain any member of $\\mathcal{F}$ as a subgraph (such $G$ is called {\\it $\\mathcal{F}$-free}). For $1\\leq \\beta<\\alpha<2$, a family $\\mathcal{F}$ of bipartite graphs is $(\\alpha,\\beta)$-{\\it smooth} if for some $\\rho>0$ and every $m\\leq n$, $z(m,n,\\mathcal{F})=\\rho m n^{\\alpha-1}+O(n^\\beta)$. Motivated by their work on a conjecture of Erd\\H{o}s and Simonovits on compactness and a classic result of Andr\\'asfai, E"},"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":"2109.01311","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-03T04:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"842553ed0e656ada96ca6cdd9734b8b1349fa3bcb78a40165ae3d9fa56ff09c7","abstract_canon_sha256":"a2fcd4f0c7a9fa6a99ab108c0b97747ed6d63057743be98545922bf475973249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:44.102698Z","signature_b64":"Lv/hICgqMkwNr6WLJENc7WloqLOdpUOdFA+OS7lXagoegbTiVUuIGiAnPkCpa+z/X79w6xRfpFAz49St8HdgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bc22daf76c5fe7c5d6a7526a0041609b848160a6c3d2a242273a7c49ae1eb31","last_reissued_at":"2026-07-05T05:31:44.102242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:44.102242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite-ness under smooth conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Sean Longbrake, Tao Jiang","submitted_at":"2021-09-03T04:58:13Z","abstract_excerpt":"Given a family $\\mathcal{F}$ of bipartite graphs, the {\\it Zarankiewicz number} $z(m,n,\\mathcal{F})$ is the maximum number of edges in an $m$ by $n$ bipartite graph $G$ that does not contain any member of $\\mathcal{F}$ as a subgraph (such $G$ is called {\\it $\\mathcal{F}$-free}). For $1\\leq \\beta<\\alpha<2$, a family $\\mathcal{F}$ of bipartite graphs is $(\\alpha,\\beta)$-{\\it smooth} if for some $\\rho>0$ and every $m\\leq n$, $z(m,n,\\mathcal{F})=\\rho m n^{\\alpha-1}+O(n^\\beta)$. Motivated by their work on a conjecture of Erd\\H{o}s and Simonovits on compactness and a classic result of Andr\\'asfai, E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01311","kind":"arxiv","version":4},"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/2109.01311/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.01311","created_at":"2026-07-05T05:31:44.102301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.01311v4","created_at":"2026-07-05T05:31:44.102301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01311","created_at":"2026-07-05T05:31:44.102301+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPBC3L3WYX7H","created_at":"2026-07-05T05:31:44.102301+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPBC3L3WYX7HYXLK","created_at":"2026-07-05T05:31:44.102301+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPBC3L3W","created_at":"2026-07-05T05:31:44.102301+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/BPBC3L3WYX7HYXLKOUTKABAWBG","json":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG.json","graph_json":"https://pith.science/api/pith-number/BPBC3L3WYX7HYXLKOUTKABAWBG/graph.json","events_json":"https://pith.science/api/pith-number/BPBC3L3WYX7HYXLKOUTKABAWBG/events.json","paper":"https://pith.science/paper/BPBC3L3W"},"agent_actions":{"view_html":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG","download_json":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG.json","view_paper":"https://pith.science/paper/BPBC3L3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.01311&json=true","fetch_graph":"https://pith.science/api/pith-number/BPBC3L3WYX7HYXLKOUTKABAWBG/graph.json","fetch_events":"https://pith.science/api/pith-number/BPBC3L3WYX7HYXLKOUTKABAWBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/action/storage_attestation","attest_author":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/action/author_attestation","sign_citation":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/action/citation_signature","submit_replication":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/action/replication_record"}},"created_at":"2026-07-05T05:31:44.102301+00:00","updated_at":"2026-07-05T05:31:44.102301+00:00"}