{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6CT2RNBH2ORSO7VWKWW74KZCU3","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":"0b8992b41489093771c2272d90e4007e0381426a897231341f06f2e6191a8884","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T12:56:19Z","title_canon_sha256":"fb8e1d416e37277d466420e9edcc784c543a724e91a6c413d6c7b1eaaa9a1058"},"schema_version":"1.0","source":{"id":"1410.7213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7213","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7213v1","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7213","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"6CT2RNBH2ORS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6CT2RNBH2ORSO7VW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6CT2RNBH","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:68b34ddf775816b22cc6d7b0187c80dd3350eac8286ccb3f1af004304aeeb9af","target":"graph","created_at":"2026-05-18T02:39:17Z","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"},"paper":{"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^*)$.","authors_text":"Lin-Lin Wang, Zhi-Hong Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T12:56:19Z","title":"Tur\\'an's Problem for Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7213","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:d8e8508da02278eb72bc4d830581928a3255ee0eae4e6620ae0a7bea4214d040","target":"record","created_at":"2026-05-18T02:39:17Z","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":"0b8992b41489093771c2272d90e4007e0381426a897231341f06f2e6191a8884","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T12:56:19Z","title_canon_sha256":"fb8e1d416e37277d466420e9edcc784c543a724e91a6c413d6c7b1eaaa9a1058"},"schema_version":"1.0","source":{"id":"1410.7213","kind":"arxiv","version":1}},"canonical_sha256":"f0a7a8b427d3a3277eb655adfe2b22a6d63d002a0cf26b75e1785a083e7f0d8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a7a8b427d3a3277eb655adfe2b22a6d63d002a0cf26b75e1785a083e7f0d8f","first_computed_at":"2026-05-18T02:39:17.798994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:17.798994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bh+IA7dDHIobM/KLIgx9P21QlXkA0ougsxwKT7EvCcJ7HVQCurLDpYUCQk/o17esH2YfCcSYjDddcw5Acta2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:17.799391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8e8508da02278eb72bc4d830581928a3255ee0eae4e6620ae0a7bea4214d040","sha256:68b34ddf775816b22cc6d7b0187c80dd3350eac8286ccb3f1af004304aeeb9af"],"state_sha256":"b25eb1f26e2e1f2f7aa72fec7670c8d6abd953a614fb235b4aa4aa2d262e312d"}