{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:64K3A73XPWKJ2TQH5XXRNWSPPC","short_pith_number":"pith:64K3A73X","schema_version":"1.0","canonical_sha256":"f715b07f777d949d4e07edef16da4f7897cb8f8dde534dd2ac8d6462695a914e","source":{"kind":"arxiv","id":"2503.05166","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'an problems for suspension of a balanced tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fangfang Zhang, Xiaolin Wang, Xiutao Zhu, Yanbo Zhang","submitted_at":"2025-03-07T06:11:04Z","abstract_excerpt":"The Tur\\'an number $\\ex(n,H)$ is the maximum number of edges that an $n$-vertex $H$-free graph can have. The suspension $\\widehat{H}$ is obtained from $H$ by adding a new vertex which is adjacent to all vertices of $H$ and a tree is balanced if the sizes of its two color classes differ at most $1$. In this paper, we obtain a sharp bound of $\\ex(n,\\widehat{T})$ when $n\\ge 4(4k)^6$ based on the Erd\\H{o}s-S\\'os conjecture. We also show the bound is sharp for infinitely many $n$ and characterize all extremal graphs. In particular, if $T$ satisfies some conditions such as $T$ contains a matching co"},"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":"2503.05166","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T06:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"c9ece8ebbb73749aa8c7d42a1c5385e9abc0a42149da1a575559d658b4996f6b","abstract_canon_sha256":"c4026c2d1664e59d0762a9537b3335848d77c276e2e4854779aded49cf0f128a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:22.379871Z","signature_b64":"32GhinSzjCnv4vH+xZ38S/WFYzU5xr+srXcXeZK22MGs1uGZeQ1Wy59R6nU3JeqR/zi8uDlbsRv834L/idcODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f715b07f777d949d4e07edef16da4f7897cb8f8dde534dd2ac8d6462695a914e","last_reissued_at":"2026-07-05T10:26:22.379386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:22.379386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an problems for suspension of a balanced tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fangfang Zhang, Xiaolin Wang, Xiutao Zhu, Yanbo Zhang","submitted_at":"2025-03-07T06:11:04Z","abstract_excerpt":"The Tur\\'an number $\\ex(n,H)$ is the maximum number of edges that an $n$-vertex $H$-free graph can have. The suspension $\\widehat{H}$ is obtained from $H$ by adding a new vertex which is adjacent to all vertices of $H$ and a tree is balanced if the sizes of its two color classes differ at most $1$. In this paper, we obtain a sharp bound of $\\ex(n,\\widehat{T})$ when $n\\ge 4(4k)^6$ based on the Erd\\H{o}s-S\\'os conjecture. We also show the bound is sharp for infinitely many $n$ and characterize all extremal graphs. In particular, if $T$ satisfies some conditions such as $T$ contains a matching co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05166","kind":"arxiv","version":1},"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/2503.05166/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":"2503.05166","created_at":"2026-07-05T10:26:22.379445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.05166v1","created_at":"2026-07-05T10:26:22.379445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05166","created_at":"2026-07-05T10:26:22.379445+00:00"},{"alias_kind":"pith_short_12","alias_value":"64K3A73XPWKJ","created_at":"2026-07-05T10:26:22.379445+00:00"},{"alias_kind":"pith_short_16","alias_value":"64K3A73XPWKJ2TQH","created_at":"2026-07-05T10:26:22.379445+00:00"},{"alias_kind":"pith_short_8","alias_value":"64K3A73X","created_at":"2026-07-05T10:26:22.379445+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03851","citing_title":"The generalized Tur\\'an number for K_3 in graphs without suspensions of a path on five vertices","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC","json":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC.json","graph_json":"https://pith.science/api/pith-number/64K3A73XPWKJ2TQH5XXRNWSPPC/graph.json","events_json":"https://pith.science/api/pith-number/64K3A73XPWKJ2TQH5XXRNWSPPC/events.json","paper":"https://pith.science/paper/64K3A73X"},"agent_actions":{"view_html":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC","download_json":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC.json","view_paper":"https://pith.science/paper/64K3A73X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.05166&json=true","fetch_graph":"https://pith.science/api/pith-number/64K3A73XPWKJ2TQH5XXRNWSPPC/graph.json","fetch_events":"https://pith.science/api/pith-number/64K3A73XPWKJ2TQH5XXRNWSPPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/action/storage_attestation","attest_author":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/action/author_attestation","sign_citation":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/action/citation_signature","submit_replication":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/action/replication_record"}},"created_at":"2026-07-05T10:26:22.379445+00:00","updated_at":"2026-07-05T10:26:22.379445+00:00"}