{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2RWLUWTVQSZ5LLYWFIAFMHBQQJ","short_pith_number":"pith:2RWLUWTV","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"},"canonical_sha256":"d46cba5a7584b3d5af162a00561c30825c9c541365dccd0a79c635e19efca111","source":{"kind":"arxiv","id":"1611.00981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00981","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00981v1","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00981","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"pith_short_12","alias_value":"2RWLUWTVQSZ5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2RWLUWTVQSZ5LLYW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2RWLUWTV","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2RWLUWTVQSZ5LLYWFIAFMHBQQJ","target":"record","payload":{"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"},"canonical_sha256":"d46cba5a7584b3d5af162a00561c30825c9c541365dccd0a79c635e19efca111","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"},"source_kind":"arxiv","source_id":"1611.00981","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-05-18T01:00:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgEsKdczuLR04Wrc7/ihUODakZ58xeVQ3oi31KODMzQPbMjcfb+w7Ba8kCBGcdt6D5I9U9QPxeOhhx3PuWyABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:29.205157Z"},"content_sha256":"4f71e7089bf3196b9bddc2dfcf394c33c7809544ddfd0b3b354a54444e24854a","schema_version":"1.0","event_id":"sha256:4f71e7089bf3196b9bddc2dfcf394c33c7809544ddfd0b3b354a54444e24854a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2RWLUWTVQSZ5LLYWFIAFMHBQQJ","target":"graph","payload":{"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"},"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-05-18T01:00:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uaMNkO3MX8wuyvYKX/IUD6BTezUL9pjy88ZEA0K7MP7+ja50POh2iLC5qbC5qnXgWFrOEViu0tBoxf0AAaF/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:16:29.205821Z"},"content_sha256":"be08a7054bbab9926d4a79fda5da0f5d98b0fe3c3f8cdc188e0d22cc52299259","schema_version":"1.0","event_id":"sha256:be08a7054bbab9926d4a79fda5da0f5d98b0fe3c3f8cdc188e0d22cc52299259"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/bundle.json","state_url":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/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-06-09T07:16:29Z","links":{"resolver":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ","bundle":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/bundle.json","state":"https://pith.science/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RWLUWTVQSZ5LLYWFIAFMHBQQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2RWLUWTVQSZ5LLYWFIAFMHBQQJ","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":"77b81fb535f19714bc16e55b3b0ca3f99d2a3fdfa6b6aac6264f80381b4d60b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T12:38:35Z","title_canon_sha256":"7fb2c3a60e4fe79d691fb3b0992b8e580775f1bc3a7388a69574197ceeffc081"},"schema_version":"1.0","source":{"id":"1611.00981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00981","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00981v1","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00981","created_at":"2026-05-18T01:00:18Z"},{"alias_kind":"pith_short_12","alias_value":"2RWLUWTVQSZ5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2RWLUWTVQSZ5LLYW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2RWLUWTV","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:be08a7054bbab9926d4a79fda5da0f5d98b0fe3c3f8cdc188e0d22cc52299259","target":"graph","created_at":"2026-05-18T01:00:18Z","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":"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","authors_text":"Long-tu Yuan, Xiao-Dong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T12:38:35Z","title":"Tur\\'an numbers for disjoint paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00981","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:4f71e7089bf3196b9bddc2dfcf394c33c7809544ddfd0b3b354a54444e24854a","target":"record","created_at":"2026-05-18T01:00:18Z","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":"77b81fb535f19714bc16e55b3b0ca3f99d2a3fdfa6b6aac6264f80381b4d60b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-03T12:38:35Z","title_canon_sha256":"7fb2c3a60e4fe79d691fb3b0992b8e580775f1bc3a7388a69574197ceeffc081"},"schema_version":"1.0","source":{"id":"1611.00981","kind":"arxiv","version":1}},"canonical_sha256":"d46cba5a7584b3d5af162a00561c30825c9c541365dccd0a79c635e19efca111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d46cba5a7584b3d5af162a00561c30825c9c541365dccd0a79c635e19efca111","first_computed_at":"2026-05-18T01:00:18.027130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:18.027130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fya56hT9fTX4Ul3bhaVVOL3hYitX2DTyyJ/2puKUBF7twAozF1vjPNjHvr58bUOmzQAuxICp/H2XtTnLrwhtDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:18.027834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f71e7089bf3196b9bddc2dfcf394c33c7809544ddfd0b3b354a54444e24854a","sha256:be08a7054bbab9926d4a79fda5da0f5d98b0fe3c3f8cdc188e0d22cc52299259"],"state_sha256":"cca58f210ee2e6b510427bbf640793828ce700b7292f9f298c6904e01771ca05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJ+pHV8dwNRhDHM96vRpLsZsGm50JmIPEMUb3IkXt4qNNE1D9m7ljbfdw/4XKUCag3ZrIdXnP/F+uIJ0mjNBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:16:29.209409Z","bundle_sha256":"0fc2ab200c7f30c153581021af6fd94cf22f1335b785cf91800a0fd5672fd017"}}