{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WIAMX5S5UPHQBCP3K6CKQKICEH","short_pith_number":"pith:WIAMX5S5","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"},"canonical_sha256":"b200cbf65da3cf0089fb5784a8290221f576aeca03607bfbce0db9fb0e0dc107","source":{"kind":"arxiv","id":"2501.12953","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12953","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12953v3","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12953","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"WIAMX5S5UPHQ","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"WIAMX5S5UPHQBCP3","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"WIAMX5S5","created_at":"2026-06-23T02:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WIAMX5S5UPHQBCP3K6CKQKICEH","target":"record","payload":{"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"},"canonical_sha256":"b200cbf65da3cf0089fb5784a8290221f576aeca03607bfbce0db9fb0e0dc107","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"},"source_kind":"arxiv","source_id":"2501.12953","source_version":3,"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-06-23T02:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfGdk0Yn7StIXeqyuzaIOyUIHzjsTCJuV79c68TjinIVWrs1Cu/NDc11uf72mMQUEs1LZ3MK1AFeKnE+5LXACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:23:49.057591Z"},"content_sha256":"9de258523af20c49d4c41be2d7ff77ec1880188c2d40223020bec5c5e64720ff","schema_version":"1.0","event_id":"sha256:9de258523af20c49d4c41be2d7ff77ec1880188c2d40223020bec5c5e64720ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WIAMX5S5UPHQBCP3K6CKQKICEH","target":"graph","payload":{"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"},"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-06-23T02:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCmD2UEgObEg0XCJRI48NsneMjpP+SGf9MT1hw9fRycbGlfKk1rs/CG2xiakbCf+SIvZM7SykgJ7vXwDcUGUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:23:49.057966Z"},"content_sha256":"81f3cd7e0872e7a37b1e030672b1f723f332863575978f292a033eea80cb5873","schema_version":"1.0","event_id":"sha256:81f3cd7e0872e7a37b1e030672b1f723f332863575978f292a033eea80cb5873"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/bundle.json","state_url":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/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-06-23T12:23:49Z","links":{"resolver":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH","bundle":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/bundle.json","state":"https://pith.science/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIAMX5S5UPHQBCP3K6CKQKICEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WIAMX5S5UPHQBCP3K6CKQKICEH","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":"6b979d3ce76174868633febce5c0bfbfb30d97237f01fb90e0108d9f036d1f07","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-22T15:25:14Z","title_canon_sha256":"ef7747d9d99b041f09f7a064ada174e0898028b26487ffe738a3220c15df21fb"},"schema_version":"1.0","source":{"id":"2501.12953","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.12953","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2501.12953v3","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12953","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"WIAMX5S5UPHQ","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"WIAMX5S5UPHQBCP3","created_at":"2026-06-23T02:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"WIAMX5S5","created_at":"2026-06-23T02:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:81f3cd7e0872e7a37b1e030672b1f723f332863575978f292a033eea80cb5873","target":"graph","created_at":"2026-06-23T02:13:13Z","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/2501.12953/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hong Liu, Jun Gao, Zichao Dong","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-22T15:25:14Z","title":"Bipartite Tur\\'an problems via graph gluing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12953","kind":"arxiv","version":3},"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:9de258523af20c49d4c41be2d7ff77ec1880188c2d40223020bec5c5e64720ff","target":"record","created_at":"2026-06-23T02:13:13Z","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":"6b979d3ce76174868633febce5c0bfbfb30d97237f01fb90e0108d9f036d1f07","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-22T15:25:14Z","title_canon_sha256":"ef7747d9d99b041f09f7a064ada174e0898028b26487ffe738a3220c15df21fb"},"schema_version":"1.0","source":{"id":"2501.12953","kind":"arxiv","version":3}},"canonical_sha256":"b200cbf65da3cf0089fb5784a8290221f576aeca03607bfbce0db9fb0e0dc107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b200cbf65da3cf0089fb5784a8290221f576aeca03607bfbce0db9fb0e0dc107","first_computed_at":"2026-06-23T02:13:13.790612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:13.790612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ymPMdt/OHEx+n7U5XSPOb4hLtVZIshOlrmcZNijqOdC4wtwzjq+DJbbe9g/fgocwPNhGaX4d6mF1L5S/rQ1HBQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:13.791032Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.12953","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9de258523af20c49d4c41be2d7ff77ec1880188c2d40223020bec5c5e64720ff","sha256:81f3cd7e0872e7a37b1e030672b1f723f332863575978f292a033eea80cb5873"],"state_sha256":"496b3c39c54ec1b9b3953859e9bc60953167095167077b2dc803aed3a93df5b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wIRELPM0rSICGCWqMNtTRML2t2O1pqxP+7uICye7eFmiykPAj+5S8Kw6ve8R5LcaJ+qOHDaXOy658I5eu0ZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:23:49.060218Z","bundle_sha256":"36a19035687cdf4e5d59515b88bd2ad203540d6509d4a5379b66d207ab24b97e"}}