{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UYKYJ35BYUVB4ESBYR4KEWJFRA","short_pith_number":"pith:UYKYJ35B","canonical_record":{"source":{"id":"1807.01825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T01:49:06Z","cross_cats_sorted":[],"title_canon_sha256":"3f4e1424b3fd8c2dd730a8a8484e5eff0ed0b12f6a15ab66832e50c27cea4d1b","abstract_canon_sha256":"5866fd2f61435159097de407bfd69ed060a110c3097c43499b6a406ace3109b6"},"schema_version":"1.0"},"canonical_sha256":"a61584efa1c52a1e1241c478a2592588317f9da3863f26dc17697c37732b62ff","source":{"kind":"arxiv","id":"1807.01825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01825","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01825v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01825","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"UYKYJ35BYUVB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UYKYJ35BYUVB4ESB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UYKYJ35B","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UYKYJ35BYUVB4ESBYR4KEWJFRA","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T01:49:06Z","cross_cats_sorted":[],"title_canon_sha256":"3f4e1424b3fd8c2dd730a8a8484e5eff0ed0b12f6a15ab66832e50c27cea4d1b","abstract_canon_sha256":"5866fd2f61435159097de407bfd69ed060a110c3097c43499b6a406ace3109b6"},"schema_version":"1.0"},"canonical_sha256":"a61584efa1c52a1e1241c478a2592588317f9da3863f26dc17697c37732b62ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:28.567897Z","signature_b64":"daF6ktyWjDy3Q9FjVbL73lvzdw4a+1C5UfRFTT1Tit0vGKfdi5YIB52hMT0kBtqCviAHEojhOmsFD5C98zDpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a61584efa1c52a1e1241c478a2592588317f9da3863f26dc17697c37732b62ff","last_reissued_at":"2026-05-18T00:11:28.567340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:28.567340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01825","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-18T00:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kE2HhXbo6+QMO25zMZPQHhG2VQb+OEyR9b06mfjREv7h64EcGHvxqd3IY/SYE0uplwD4A1BsiFCgEAdHLUf3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:05:57.988364Z"},"content_sha256":"3ef004c06ef47b5a3e3658057bccab26ea2a10fdb3b2a964864c8d3f91a7cc76","schema_version":"1.0","event_id":"sha256:3ef004c06ef47b5a3e3658057bccab26ea2a10fdb3b2a964864c8d3f91a7cc76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UYKYJ35BYUVB4ESBYR4KEWJFRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Tur\\'{a}n Number for Spanning Linear Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Weihua Yang","submitted_at":"2018-07-05T01:49:06Z","abstract_excerpt":"For a set of graphs $\\mathcal{F}$, the extremal number $ex(n;\\mathcal{F})$ is the maximum number of edges in a graph of order $n$ not containing any subgraph isomorphic to some graph in $\\mathcal{F}$. If $\\mathcal{F}$ contains a graph on $n$ vertices, then we often call the problem a spanning Tur\\'{a}n problem. A linear forest is a graph whose connected components are all paths and isolated vertices. In this paper, we let $\\mathcal{L}_n^k$ be the set of all linear forests of order $n$ with at least $n-k+1$ edges. We prove that when $n\\geq 3k$ and $k\\geq 2$, \\[ ex(n;\\mathcal{L}_n^k)=\\binom{n-k+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01825","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-18T00:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uth30ahB3FL+FfyuSpQXjJas8/QmLvNUF33PcTPJ05V61GZY6SFdle4sAiU5VUS1yPx+OkqY/DpQ03PgRZPkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:05:57.988723Z"},"content_sha256":"fc6f0150356ce8e3afde0d15dda1932cb1c8ea652dd11072dcacdef213f1feeb","schema_version":"1.0","event_id":"sha256:fc6f0150356ce8e3afde0d15dda1932cb1c8ea652dd11072dcacdef213f1feeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA/bundle.json","state_url":"https://pith.science/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA/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-05-25T22:05:57Z","links":{"resolver":"https://pith.science/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA","bundle":"https://pith.science/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA/bundle.json","state":"https://pith.science/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYKYJ35BYUVB4ESBYR4KEWJFRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UYKYJ35BYUVB4ESBYR4KEWJFRA","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":"5866fd2f61435159097de407bfd69ed060a110c3097c43499b6a406ace3109b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T01:49:06Z","title_canon_sha256":"3f4e1424b3fd8c2dd730a8a8484e5eff0ed0b12f6a15ab66832e50c27cea4d1b"},"schema_version":"1.0","source":{"id":"1807.01825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01825","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01825v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01825","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"UYKYJ35BYUVB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UYKYJ35BYUVB4ESB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UYKYJ35B","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:fc6f0150356ce8e3afde0d15dda1932cb1c8ea652dd11072dcacdef213f1feeb","target":"graph","created_at":"2026-05-18T00:11:28Z","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 set of graphs $\\mathcal{F}$, the extremal number $ex(n;\\mathcal{F})$ is the maximum number of edges in a graph of order $n$ not containing any subgraph isomorphic to some graph in $\\mathcal{F}$. If $\\mathcal{F}$ contains a graph on $n$ vertices, then we often call the problem a spanning Tur\\'{a}n problem. A linear forest is a graph whose connected components are all paths and isolated vertices. In this paper, we let $\\mathcal{L}_n^k$ be the set of all linear forests of order $n$ with at least $n-k+1$ edges. We prove that when $n\\geq 3k$ and $k\\geq 2$, \\[ ex(n;\\mathcal{L}_n^k)=\\binom{n-k+","authors_text":"Jian Wang, Weihua Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T01:49:06Z","title":"The Tur\\'{a}n Number for Spanning Linear Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01825","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:3ef004c06ef47b5a3e3658057bccab26ea2a10fdb3b2a964864c8d3f91a7cc76","target":"record","created_at":"2026-05-18T00:11:28Z","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":"5866fd2f61435159097de407bfd69ed060a110c3097c43499b6a406ace3109b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-05T01:49:06Z","title_canon_sha256":"3f4e1424b3fd8c2dd730a8a8484e5eff0ed0b12f6a15ab66832e50c27cea4d1b"},"schema_version":"1.0","source":{"id":"1807.01825","kind":"arxiv","version":1}},"canonical_sha256":"a61584efa1c52a1e1241c478a2592588317f9da3863f26dc17697c37732b62ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a61584efa1c52a1e1241c478a2592588317f9da3863f26dc17697c37732b62ff","first_computed_at":"2026-05-18T00:11:28.567340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:28.567340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"daF6ktyWjDy3Q9FjVbL73lvzdw4a+1C5UfRFTT1Tit0vGKfdi5YIB52hMT0kBtqCviAHEojhOmsFD5C98zDpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:28.567897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ef004c06ef47b5a3e3658057bccab26ea2a10fdb3b2a964864c8d3f91a7cc76","sha256:fc6f0150356ce8e3afde0d15dda1932cb1c8ea652dd11072dcacdef213f1feeb"],"state_sha256":"90c309163c0a3cadea7e834140d5a75bbd46a21606e459fb50b12a37d1cfc241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxzAdWBCYPyi2KnM1o9qZeAlFhMNKYfv+J3zoYLE3U2VkgwRtJbqJIsXMujHG82QRaG7D0dluY/c5KcX2k1DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:05:57.991166Z","bundle_sha256":"7bfe312f47c12e27458c277b962ee2b5f761a901a920fbc0978dacf7ba8b0e7b"}}