{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:BPBC3L3WYX7HYXLKOUTKABAWBG","short_pith_number":"pith:BPBC3L3W","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"},"canonical_sha256":"0bc22daf76c5fe7c5d6a7526a0041609b848160a6c3d2a242273a7c49ae1eb31","source":{"kind":"arxiv","id":"2109.01311","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.01311","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"2109.01311v4","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01311","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"BPBC3L3WYX7H","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"pith_short_16","alias_value":"BPBC3L3WYX7HYXLK","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"pith_short_8","alias_value":"BPBC3L3W","created_at":"2026-07-05T05:31:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:BPBC3L3WYX7HYXLKOUTKABAWBG","target":"record","payload":{"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"},"canonical_sha256":"0bc22daf76c5fe7c5d6a7526a0041609b848160a6c3d2a242273a7c49ae1eb31","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"},"source_kind":"arxiv","source_id":"2109.01311","source_version":4,"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-05T05:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJcNN/5qnv5LFyAtzO5+f3M38OgrsbCNM+GubIstCfZMiB+sxTjsnflz9aPc089bT1jdy/Bl1EDSgy+lOASBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T23:12:47.599394Z"},"content_sha256":"2c923266190124b9cbcf1b439db807051d8489cc0dc7e2a778f8fe4f0b9b8609","schema_version":"1.0","event_id":"sha256:2c923266190124b9cbcf1b439db807051d8489cc0dc7e2a778f8fe4f0b9b8609"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:BPBC3L3WYX7HYXLKOUTKABAWBG","target":"graph","payload":{"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"},"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-05T05:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgpPGKURAb4qWKtsZZeWEP+PnNW+vsDRvS/wws2igLKvg/8F3aaj+FZjkCfdYP+mtkkfdxNJg29lW3Qpq82iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T23:12:47.599775Z"},"content_sha256":"d502497f3c3da1c5187b9bbce91a23173ba002b10b1728c941975b8e08fe3684","schema_version":"1.0","event_id":"sha256:d502497f3c3da1c5187b9bbce91a23173ba002b10b1728c941975b8e08fe3684"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/bundle.json","state_url":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/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-07-25T23:12:47Z","links":{"resolver":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG","bundle":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/bundle.json","state":"https://pith.science/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPBC3L3WYX7HYXLKOUTKABAWBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:BPBC3L3WYX7HYXLKOUTKABAWBG","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":"a2fcd4f0c7a9fa6a99ab108c0b97747ed6d63057743be98545922bf475973249","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-03T04:58:13Z","title_canon_sha256":"842553ed0e656ada96ca6cdd9734b8b1349fa3bcb78a40165ae3d9fa56ff09c7"},"schema_version":"1.0","source":{"id":"2109.01311","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.01311","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"2109.01311v4","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01311","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"BPBC3L3WYX7H","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"pith_short_16","alias_value":"BPBC3L3WYX7HYXLK","created_at":"2026-07-05T05:31:44Z"},{"alias_kind":"pith_short_8","alias_value":"BPBC3L3W","created_at":"2026-07-05T05:31:44Z"}],"graph_snapshots":[{"event_id":"sha256:d502497f3c3da1c5187b9bbce91a23173ba002b10b1728c941975b8e08fe3684","target":"graph","created_at":"2026-07-05T05:31:44Z","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/2109.01311/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jie Ma, Sean Longbrake, Tao Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-03T04:58:13Z","title":"Bipartite-ness under smooth conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01311","kind":"arxiv","version":4},"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:2c923266190124b9cbcf1b439db807051d8489cc0dc7e2a778f8fe4f0b9b8609","target":"record","created_at":"2026-07-05T05:31:44Z","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":"a2fcd4f0c7a9fa6a99ab108c0b97747ed6d63057743be98545922bf475973249","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-03T04:58:13Z","title_canon_sha256":"842553ed0e656ada96ca6cdd9734b8b1349fa3bcb78a40165ae3d9fa56ff09c7"},"schema_version":"1.0","source":{"id":"2109.01311","kind":"arxiv","version":4}},"canonical_sha256":"0bc22daf76c5fe7c5d6a7526a0041609b848160a6c3d2a242273a7c49ae1eb31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bc22daf76c5fe7c5d6a7526a0041609b848160a6c3d2a242273a7c49ae1eb31","first_computed_at":"2026-07-05T05:31:44.102242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:44.102242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lv/hICgqMkwNr6WLJENc7WloqLOdpUOdFA+OS7lXagoegbTiVUuIGiAnPkCpa+z/X79w6xRfpFAz49St8HdgBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:44.102698Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.01311","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c923266190124b9cbcf1b439db807051d8489cc0dc7e2a778f8fe4f0b9b8609","sha256:d502497f3c3da1c5187b9bbce91a23173ba002b10b1728c941975b8e08fe3684"],"state_sha256":"c6c3121b22d2b06d26575c29b66bc91fe587cd42c84f820538f85243c20be90d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIYnEqS0q2el5Outs0qHqbO4VjAZG42BlhGlDVXJEDT8ZuxrIHjF+198bg20AYtug6eL54QLss4cqPR4+6bpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T23:12:47.601924Z","bundle_sha256":"ab02b43ad3a4ceb10a3b0d7fbd4d5ad26028d75b67b284c26356ebe6513251e8"}}