{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WIAMX5S5UPHQBCP3K6CKQKICEH","short_pith_number":"pith:WIAMX5S5","schema_version":"1.0","canonical_sha256":"b200cbf65da3cf0089fb5784a8290221f576aeca03607bfbce0db9fb0e0dc107","source":{"kind":"arxiv","id":"2501.12953","version":3},"attestation_state":"computed","paper":{"title":"Bipartite Tur\\'an problems via graph gluing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jun Gao, Zichao Dong","submitted_at":"2025-01-22T15:25:14Z","abstract_excerpt":"For graphs $H_1$ and $H_2$, if we glue them by identifying a given pair of vertices $u \\in V(H_1)$ and $v \\in V(H_2)$, what is the extremal number of the resulting graph $H_1^u \\odot H_2^v$? In this paper, we study this problem and show that interestingly it is equivalent to an old question of Erd\\H{o}s and Simonovits on the Zarankiewicz problem. When $H_1, H_2$ are copies of a same bipartite graph $H$ and $u, v$ come from a same part, we prove that $\\operatorname{ex}(n, H_1^u \\odot H_2^v) = \\Theta \\bigl( \\operatorname{ex}(n, H) \\bigr)$. As a corollary, we provide a short self-contained dispro"},"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":"2501.12953","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-22T15:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"ef7747d9d99b041f09f7a064ada174e0898028b26487ffe738a3220c15df21fb","abstract_canon_sha256":"6b979d3ce76174868633febce5c0bfbfb30d97237f01fb90e0108d9f036d1f07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:13.791032Z","signature_b64":"ymPMdt/OHEx+n7U5XSPOb4hLtVZIshOlrmcZNijqOdC4wtwzjq+DJbbe9g/fgocwPNhGaX4d6mF1L5S/rQ1HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b200cbf65da3cf0089fb5784a8290221f576aeca03607bfbce0db9fb0e0dc107","last_reissued_at":"2026-06-23T02:13:13.790612Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:13.790612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite Tur\\'an problems via graph gluing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jun Gao, Zichao Dong","submitted_at":"2025-01-22T15:25:14Z","abstract_excerpt":"For graphs $H_1$ and $H_2$, if we glue them by identifying a given pair of vertices $u \\in V(H_1)$ and $v \\in V(H_2)$, what is the extremal number of the resulting graph $H_1^u \\odot H_2^v$? In this paper, we study this problem and show that interestingly it is equivalent to an old question of Erd\\H{o}s and Simonovits on the Zarankiewicz problem. When $H_1, H_2$ are copies of a same bipartite graph $H$ and $u, v$ come from a same part, we prove that $\\operatorname{ex}(n, H_1^u \\odot H_2^v) = \\Theta \\bigl( \\operatorname{ex}(n, H) \\bigr)$. As a corollary, we provide a short self-contained dispro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12953","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/2501.12953/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":"2501.12953","created_at":"2026-06-23T02:13:13.790671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12953v3","created_at":"2026-06-23T02:13:13.790671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12953","created_at":"2026-06-23T02:13:13.790671+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIAMX5S5UPHQ","created_at":"2026-06-23T02:13:13.790671+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIAMX5S5UPHQBCP3","created_at":"2026-06-23T02:13:13.790671+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIAMX5S5","created_at":"2026-06-23T02:13:13.790671+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/WIAMX5S5UPHQBCP3K6CKQKICEH","json":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH.json","graph_json":"https://pith.science/api/pith-number/WIAMX5S5UPHQBCP3K6CKQKICEH/graph.json","events_json":"https://pith.science/api/pith-number/WIAMX5S5UPHQBCP3K6CKQKICEH/events.json","paper":"https://pith.science/paper/WIAMX5S5"},"agent_actions":{"view_html":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH","download_json":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH.json","view_paper":"https://pith.science/paper/WIAMX5S5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12953&json=true","fetch_graph":"https://pith.science/api/pith-number/WIAMX5S5UPHQBCP3K6CKQKICEH/graph.json","fetch_events":"https://pith.science/api/pith-number/WIAMX5S5UPHQBCP3K6CKQKICEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/action/storage_attestation","attest_author":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/action/author_attestation","sign_citation":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/action/citation_signature","submit_replication":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/action/replication_record"}},"created_at":"2026-06-23T02:13:13.790671+00:00","updated_at":"2026-06-23T02:13:13.790671+00:00"}