{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2T5OCLVOF576XPISKINBXJ47C6","short_pith_number":"pith:2T5OCLVO","schema_version":"1.0","canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","source":{"kind":"arxiv","id":"2112.13119","version":3},"attestation_state":"computed","paper":{"title":"Tur\\'an Number of Subdivisions of Multipartite Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danni Peng, Xiao-Chuan Liu, Xu Yang","submitted_at":"2021-12-24T18:30:21Z","abstract_excerpt":"In this paper, we investigate the Tur\\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\\'an number of the 1-subdivision of $K_{s,t}^+$, where $K_{s,t}^+$ is obtained by adding a single edge within the part of size $s$ of the complete bipartite graph $K_{s,t}$, with $4\\leq s \\leq t$. In addition, we derive an upper bound for the extremal number of a family of graphs formed by (possibly degenerate) 1-subdivisions of certain tripartite graphs."},"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":"2112.13119","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-24T18:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"be939127e970edbb1890e8abc69cd8ae1233d6c5e39ca8d5d228ff0c1a49c532","abstract_canon_sha256":"5cd1dde37894c94057d2e165d09dc80ff28cfa68d0f990767d580533566e225f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:56.198032Z","signature_b64":"naBh33WvY3rDgQ4cpD3kwQuV41TFD8ngt9QWMJPaImNL/LCS+H6GmXdW8v2TC2HFHtON4v7adflYQG5gTZwaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fae12eae2f7febbd12521a1ba79f17a978f08642d1c251a1fa40dd5f7dc255","last_reissued_at":"2026-07-05T11:18:56.197347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:56.197347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an Number of Subdivisions of Multipartite Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danni Peng, Xiao-Chuan Liu, Xu Yang","submitted_at":"2021-12-24T18:30:21Z","abstract_excerpt":"In this paper, we investigate the Tur\\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\\'an number of the 1-subdivision of $K_{s,t}^+$, where $K_{s,t}^+$ is obtained by adding a single edge within the part of size $s$ of the complete bipartite graph $K_{s,t}$, with $4\\leq s \\leq t$. In addition, we derive an upper bound for the extremal number of a family of graphs formed by (possibly degenerate) 1-subdivisions of certain tripartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13119","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/2112.13119/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":"2112.13119","created_at":"2026-07-05T11:18:56.197435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.13119v3","created_at":"2026-07-05T11:18:56.197435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13119","created_at":"2026-07-05T11:18:56.197435+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T5OCLVOF576","created_at":"2026-07-05T11:18:56.197435+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T5OCLVOF576XPIS","created_at":"2026-07-05T11:18:56.197435+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T5OCLVO","created_at":"2026-07-05T11:18:56.197435+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/2T5OCLVOF576XPISKINBXJ47C6","json":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6.json","graph_json":"https://pith.science/api/pith-number/2T5OCLVOF576XPISKINBXJ47C6/graph.json","events_json":"https://pith.science/api/pith-number/2T5OCLVOF576XPISKINBXJ47C6/events.json","paper":"https://pith.science/paper/2T5OCLVO"},"agent_actions":{"view_html":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6","download_json":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6.json","view_paper":"https://pith.science/paper/2T5OCLVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.13119&json=true","fetch_graph":"https://pith.science/api/pith-number/2T5OCLVOF576XPISKINBXJ47C6/graph.json","fetch_events":"https://pith.science/api/pith-number/2T5OCLVOF576XPISKINBXJ47C6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/action/storage_attestation","attest_author":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/action/author_attestation","sign_citation":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/action/citation_signature","submit_replication":"https://pith.science/pith/2T5OCLVOF576XPISKINBXJ47C6/action/replication_record"}},"created_at":"2026-07-05T11:18:56.197435+00:00","updated_at":"2026-07-05T11:18:56.197435+00:00"}