{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6CT2RNBH2ORSO7VWKWW74KZCU3","short_pith_number":"pith:6CT2RNBH","schema_version":"1.0","canonical_sha256":"f0a7a8b427d3a3277eb655adfe2b22a6d63d002a0cf26b75e1785a083e7f0d8f","source":{"kind":"arxiv","id":"1410.7213","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'an's Problem for Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin-Lin Wang, Zhi-Hong Sun","submitted_at":"2014-10-27T12:56:19Z","abstract_excerpt":"For a forbidden graph $L$, let $ex(p;L)$ denote the maximal number of edges in a simple graph of order $p$ not containing $L$. Let $T_n$ denote the unique tree on $n$ vertices with maximal degree $n-2$, and let $T_n^*=(V,E)$ be the tree on $n$ vertices with $V=\\{v_0,v_1,\\ldots,v_{n-1}\\}$ and\n  $E=\\{v_0v_1,\\ldots,v_0v_{n-3},v_{n-3}v_{n-2},v_{n-2}v_{n-1}\\}$. In the paper we give exact values of $ex(p;T_n)$ and $ex(p;T_n^*)$."},"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":"1410.7213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T12:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"fb8e1d416e37277d466420e9edcc784c543a724e91a6c413d6c7b1eaaa9a1058","abstract_canon_sha256":"0b8992b41489093771c2272d90e4007e0381426a897231341f06f2e6191a8884"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.799391Z","signature_b64":"Bh+IA7dDHIobM/KLIgx9P21QlXkA0ougsxwKT7EvCcJ7HVQCurLDpYUCQk/o17esH2YfCcSYjDddcw5Acta2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a7a8b427d3a3277eb655adfe2b22a6d63d002a0cf26b75e1785a083e7f0d8f","last_reissued_at":"2026-05-18T02:39:17.798994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.798994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an's Problem for Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin-Lin Wang, Zhi-Hong Sun","submitted_at":"2014-10-27T12:56:19Z","abstract_excerpt":"For a forbidden graph $L$, let $ex(p;L)$ denote the maximal number of edges in a simple graph of order $p$ not containing $L$. Let $T_n$ denote the unique tree on $n$ vertices with maximal degree $n-2$, and let $T_n^*=(V,E)$ be the tree on $n$ vertices with $V=\\{v_0,v_1,\\ldots,v_{n-1}\\}$ and\n  $E=\\{v_0v_1,\\ldots,v_0v_{n-3},v_{n-3}v_{n-2},v_{n-2}v_{n-1}\\}$. In the paper we give exact values of $ex(p;T_n)$ and $ex(p;T_n^*)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7213","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":""},"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":"1410.7213","created_at":"2026-05-18T02:39:17.799046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7213v1","created_at":"2026-05-18T02:39:17.799046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7213","created_at":"2026-05-18T02:39:17.799046+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CT2RNBH2ORS","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CT2RNBH2ORSO7VW","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CT2RNBH","created_at":"2026-05-18T12:28:16.859392+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/6CT2RNBH2ORSO7VWKWW74KZCU3","json":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3.json","graph_json":"https://pith.science/api/pith-number/6CT2RNBH2ORSO7VWKWW74KZCU3/graph.json","events_json":"https://pith.science/api/pith-number/6CT2RNBH2ORSO7VWKWW74KZCU3/events.json","paper":"https://pith.science/paper/6CT2RNBH"},"agent_actions":{"view_html":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3","download_json":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3.json","view_paper":"https://pith.science/paper/6CT2RNBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7213&json=true","fetch_graph":"https://pith.science/api/pith-number/6CT2RNBH2ORSO7VWKWW74KZCU3/graph.json","fetch_events":"https://pith.science/api/pith-number/6CT2RNBH2ORSO7VWKWW74KZCU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3/action/storage_attestation","attest_author":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3/action/author_attestation","sign_citation":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3/action/citation_signature","submit_replication":"https://pith.science/pith/6CT2RNBH2ORSO7VWKWW74KZCU3/action/replication_record"}},"created_at":"2026-05-18T02:39:17.799046+00:00","updated_at":"2026-05-18T02:39:17.799046+00:00"}