{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:64K3A73XPWKJ2TQH5XXRNWSPPC","short_pith_number":"pith:64K3A73X","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"},"canonical_sha256":"f715b07f777d949d4e07edef16da4f7897cb8f8dde534dd2ac8d6462695a914e","source":{"kind":"arxiv","id":"2503.05166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05166","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05166v1","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05166","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"64K3A73XPWKJ","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"64K3A73XPWKJ2TQH","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"64K3A73X","created_at":"2026-07-05T10:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:64K3A73XPWKJ2TQH5XXRNWSPPC","target":"record","payload":{"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"},"canonical_sha256":"f715b07f777d949d4e07edef16da4f7897cb8f8dde534dd2ac8d6462695a914e","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"},"source_kind":"arxiv","source_id":"2503.05166","source_version":1,"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-05T10:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQIvo008YlUAuzJJfoFOSLbAMn+xgb+hQJK7HEYPIb/nRrINu6p7twuCo74cU/jg3/d4T6KxxAKTlLNgMoPABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:41:15.189558Z"},"content_sha256":"ed1a84f35d3ccad512ba922d361f203db72bcef82f6dee57ba212c0b9f3bcd20","schema_version":"1.0","event_id":"sha256:ed1a84f35d3ccad512ba922d361f203db72bcef82f6dee57ba212c0b9f3bcd20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:64K3A73XPWKJ2TQH5XXRNWSPPC","target":"graph","payload":{"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"},"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-05T10:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey0Fl7o2qkKgf/RufEJU62jDpIWAtcxoLZKR6hg+xVO7A6O0kd4GD/q2JHJ43OV2HeDlfyTP1gkyDULa/K82AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:41:15.190041Z"},"content_sha256":"239d922fe8bb18aa0a4046a1cf3029158cec996eb7f9dbde5196e9a14146a41a","schema_version":"1.0","event_id":"sha256:239d922fe8bb18aa0a4046a1cf3029158cec996eb7f9dbde5196e9a14146a41a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/bundle.json","state_url":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/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-08-09T00:41:15Z","links":{"resolver":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC","bundle":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/bundle.json","state":"https://pith.science/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64K3A73XPWKJ2TQH5XXRNWSPPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:64K3A73XPWKJ2TQH5XXRNWSPPC","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":"c4026c2d1664e59d0762a9537b3335848d77c276e2e4854779aded49cf0f128a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T06:11:04Z","title_canon_sha256":"c9ece8ebbb73749aa8c7d42a1c5385e9abc0a42149da1a575559d658b4996f6b"},"schema_version":"1.0","source":{"id":"2503.05166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05166","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05166v1","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05166","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"64K3A73XPWKJ","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"64K3A73XPWKJ2TQH","created_at":"2026-07-05T10:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"64K3A73X","created_at":"2026-07-05T10:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:239d922fe8bb18aa0a4046a1cf3029158cec996eb7f9dbde5196e9a14146a41a","target":"graph","created_at":"2026-07-05T10:26:22Z","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/2503.05166/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fangfang Zhang, Xiaolin Wang, Xiutao Zhu, Yanbo Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T06:11:04Z","title":"Tur\\'an problems for suspension of a balanced tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05166","kind":"arxiv","version":1},"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:ed1a84f35d3ccad512ba922d361f203db72bcef82f6dee57ba212c0b9f3bcd20","target":"record","created_at":"2026-07-05T10:26:22Z","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":"c4026c2d1664e59d0762a9537b3335848d77c276e2e4854779aded49cf0f128a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T06:11:04Z","title_canon_sha256":"c9ece8ebbb73749aa8c7d42a1c5385e9abc0a42149da1a575559d658b4996f6b"},"schema_version":"1.0","source":{"id":"2503.05166","kind":"arxiv","version":1}},"canonical_sha256":"f715b07f777d949d4e07edef16da4f7897cb8f8dde534dd2ac8d6462695a914e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f715b07f777d949d4e07edef16da4f7897cb8f8dde534dd2ac8d6462695a914e","first_computed_at":"2026-07-05T10:26:22.379386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:26:22.379386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"32GhinSzjCnv4vH+xZ38S/WFYzU5xr+srXcXeZK22MGs1uGZeQ1Wy59R6nU3JeqR/zi8uDlbsRv834L/idcODw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:26:22.379871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.05166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed1a84f35d3ccad512ba922d361f203db72bcef82f6dee57ba212c0b9f3bcd20","sha256:239d922fe8bb18aa0a4046a1cf3029158cec996eb7f9dbde5196e9a14146a41a"],"state_sha256":"b9ebb8ba2c58af2eab1bd616a05aa74601cdc5f2c906fd9f6f70987e29fa2714"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEtnOpBe3eQr64mUvUsKXHW31edno4jPGcQ5I2ZIsIIspiloN9Ob1CGZkY7punWyQIi0EA5rpZ/5B585YFDfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:41:15.193397Z","bundle_sha256":"65d78cecd0b7196f3d0d93ef649ef450783dc7b5015e7cf9630c5090eb8683ef"}}