{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2RWLUWTVQSZ5LLYWFIAFMHBQQJ","short_pith_number":"pith:2RWLUWTV","schema_version":"1.0","canonical_sha256":"d46cba5a7584b3d5af162a00561c30825c9c541365dccd0a79c635e19efca111","source":{"kind":"arxiv","id":"1611.00981","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'an numbers for disjoint paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Long-tu Yuan, Xiao-Dong Zhang","submitted_at":"2016-11-03T12:38:35Z","abstract_excerpt":"The Tur\\'{a}n number of a graph $H$, $ex(n,H)$, is the maximum number of edges in any graph of order $n$ which does not contain $H$ as a subgraph. Lidick\\'{y}, Liu and Palmer determined $ex(n, F_m)$ for $n$ sufficiently large and proved that the extremal graph is unique, where $F_m$ is disjoint paths of $P_{k_1}, \\ldots, P_{k_m}$ [Lidick\\'{y},B., Liu,H. and Palmer,C. (2013). On the Tur\\'{a}n number of forests. Electron. J. Combin. 20(2) Paper 62, 13 pp]. In this paper, by mean of a different approach, we determine $ex(n, F_m)$ for all integers $n$ with minor conditions, which extends their par"},"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":"1611.00981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T12:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"7fb2c3a60e4fe79d691fb3b0992b8e580775f1bc3a7388a69574197ceeffc081","abstract_canon_sha256":"77b81fb535f19714bc16e55b3b0ca3f99d2a3fdfa6b6aac6264f80381b4d60b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:18.027834Z","signature_b64":"fya56hT9fTX4Ul3bhaVVOL3hYitX2DTyyJ/2puKUBF7twAozF1vjPNjHvr58bUOmzQAuxICp/H2XtTnLrwhtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d46cba5a7584b3d5af162a00561c30825c9c541365dccd0a79c635e19efca111","last_reissued_at":"2026-05-18T01:00:18.027130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:18.027130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an numbers for disjoint paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Long-tu Yuan, Xiao-Dong Zhang","submitted_at":"2016-11-03T12:38:35Z","abstract_excerpt":"The Tur\\'{a}n number of a graph $H$, $ex(n,H)$, is the maximum number of edges in any graph of order $n$ which does not contain $H$ as a subgraph. Lidick\\'{y}, Liu and Palmer determined $ex(n, F_m)$ for $n$ sufficiently large and proved that the extremal graph is unique, where $F_m$ is disjoint paths of $P_{k_1}, \\ldots, P_{k_m}$ [Lidick\\'{y},B., Liu,H. and Palmer,C. (2013). On the Tur\\'{a}n number of forests. Electron. J. Combin. 20(2) Paper 62, 13 pp]. In this paper, by mean of a different approach, we determine $ex(n, F_m)$ for all integers $n$ with minor conditions, which extends their par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00981","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":"1611.00981","created_at":"2026-05-18T01:00:18.027237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00981v1","created_at":"2026-05-18T01:00:18.027237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00981","created_at":"2026-05-18T01:00:18.027237+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RWLUWTVQSZ5","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RWLUWTVQSZ5LLYW","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RWLUWTV","created_at":"2026-05-18T12:29:55.572404+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/2RWLUWTVQSZ5LLYWFIAFMHBQQJ","json":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ.json","graph_json":"https://pith.science/api/pith-number/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/graph.json","events_json":"https://pith.science/api/pith-number/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/events.json","paper":"https://pith.science/paper/2RWLUWTV"},"agent_actions":{"view_html":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ","download_json":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ.json","view_paper":"https://pith.science/paper/2RWLUWTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00981&json=true","fetch_graph":"https://pith.science/api/pith-number/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/action/storage_attestation","attest_author":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/action/author_attestation","sign_citation":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/action/citation_signature","submit_replication":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/action/replication_record"}},"created_at":"2026-05-18T01:00:18.027237+00:00","updated_at":"2026-05-18T01:00:18.027237+00:00"}