{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7JWZLILAN523IL6DQHF5HYCRC7","short_pith_number":"pith:7JWZLILA","canonical_record":{"source":{"id":"1511.07679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T12:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"3f9eeba0bb5d29d389f8cdb24ac45b2e735a2798797070d22ae66cbcdb77fec5","abstract_canon_sha256":"eaa5ddbd2b344244d95df1609d3a345d0850493f13b4cb99b1a0b772771e6cb0"},"schema_version":"1.0"},"canonical_sha256":"fa6d95a1606f75b42fc381cbd3e05117f5e70988a97d859c58525b44234f6994","source":{"kind":"arxiv","id":"1511.07679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07679","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07679v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07679","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"7JWZLILAN523","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JWZLILAN523IL6D","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JWZLILA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7JWZLILAN523IL6DQHF5HYCRC7","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T12:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"3f9eeba0bb5d29d389f8cdb24ac45b2e735a2798797070d22ae66cbcdb77fec5","abstract_canon_sha256":"eaa5ddbd2b344244d95df1609d3a345d0850493f13b4cb99b1a0b772771e6cb0"},"schema_version":"1.0"},"canonical_sha256":"fa6d95a1606f75b42fc381cbd3e05117f5e70988a97d859c58525b44234f6994","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:03.984877Z","signature_b64":"vuVI9rE1gGR54yAO5D47Pb/ezB+Ry3JY/aBjX+tzwyzaNpySVkLS9jir8vHLvmM3KPUoGmRzAP4ffuagX7wVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa6d95a1606f75b42fc381cbd3e05117f5e70988a97d859c58525b44234f6994","last_reissued_at":"2026-05-18T01:26:03.984143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:03.984143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07679","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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2Fo7460NRMDYYUFtzw/Bg0spPpx88BJ3IJjGereTzPgYF2Z5eWYdYi96KVYdimFqN/oJvLIItrQzsUnXgGIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:49:43.263023Z"},"content_sha256":"5e1c190a4db8ad33508aac430b0be72d19a82aa9b327c17879b285e80261d4a5","schema_version":"1.0","event_id":"sha256:5e1c190a4db8ad33508aac430b0be72d19a82aa9b327c17879b285e80261d4a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7JWZLILAN523IL6DQHF5HYCRC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Turan Number of Disjoint Copies of 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":"2015-11-24T12:34:40Z","abstract_excerpt":"The Tur\\'{a}n number of a graph $H$, $ex(n,H)$, is the maximum number of edges in a simple graph of order $n$ which does not contain $H$ as a subgraph. Let $k\\cdot P_3$ denote $k$ disjoint copies of a path on $3$ vertices. In this paper, we determine the value $ex(n, k\\cdot P_3)$ and characterize all extremal graphs. This extends a result of Bushaw and Kettle [N. Bushaw and N. Kettle, Tur\\'{a}n Numbers of multiple and equibipartite forests, Combin. Probab. Comput., 20(2011) 837-853.], which solved the conjecture proposed by Gorgol in [I. Gorgol. Tur\\'{a}n numbers for disjoint copies of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07679","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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bx2EUU41jxrOfwK24a6Z7rnQGsYmnPijN18P0rId7fhiOUzfgSEM/xfsXD3X2Hm0NxE89zJOraQW+qFrq8lABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:49:43.263738Z"},"content_sha256":"b5a24ab73f81fdd6abc0f4908ff67298fc77523438cea2726eea1dca0b8b5065","schema_version":"1.0","event_id":"sha256:b5a24ab73f81fdd6abc0f4908ff67298fc77523438cea2726eea1dca0b8b5065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JWZLILAN523IL6DQHF5HYCRC7/bundle.json","state_url":"https://pith.science/pith/7JWZLILAN523IL6DQHF5HYCRC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JWZLILAN523IL6DQHF5HYCRC7/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-09T11:49:43Z","links":{"resolver":"https://pith.science/pith/7JWZLILAN523IL6DQHF5HYCRC7","bundle":"https://pith.science/pith/7JWZLILAN523IL6DQHF5HYCRC7/bundle.json","state":"https://pith.science/pith/7JWZLILAN523IL6DQHF5HYCRC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JWZLILAN523IL6DQHF5HYCRC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7JWZLILAN523IL6DQHF5HYCRC7","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":"eaa5ddbd2b344244d95df1609d3a345d0850493f13b4cb99b1a0b772771e6cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T12:34:40Z","title_canon_sha256":"3f9eeba0bb5d29d389f8cdb24ac45b2e735a2798797070d22ae66cbcdb77fec5"},"schema_version":"1.0","source":{"id":"1511.07679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07679","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07679v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07679","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"7JWZLILAN523","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JWZLILAN523IL6D","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JWZLILA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b5a24ab73f81fdd6abc0f4908ff67298fc77523438cea2726eea1dca0b8b5065","target":"graph","created_at":"2026-05-18T01:26:03Z","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 a simple graph of order $n$ which does not contain $H$ as a subgraph. Let $k\\cdot P_3$ denote $k$ disjoint copies of a path on $3$ vertices. In this paper, we determine the value $ex(n, k\\cdot P_3)$ and characterize all extremal graphs. This extends a result of Bushaw and Kettle [N. Bushaw and N. Kettle, Tur\\'{a}n Numbers of multiple and equibipartite forests, Combin. Probab. Comput., 20(2011) 837-853.], which solved the conjecture proposed by Gorgol in [I. Gorgol. Tur\\'{a}n numbers for disjoint copies of graphs.","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":"2015-11-24T12:34:40Z","title":"The Turan Number of Disjoint Copies of Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07679","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:5e1c190a4db8ad33508aac430b0be72d19a82aa9b327c17879b285e80261d4a5","target":"record","created_at":"2026-05-18T01:26:03Z","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":"eaa5ddbd2b344244d95df1609d3a345d0850493f13b4cb99b1a0b772771e6cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-24T12:34:40Z","title_canon_sha256":"3f9eeba0bb5d29d389f8cdb24ac45b2e735a2798797070d22ae66cbcdb77fec5"},"schema_version":"1.0","source":{"id":"1511.07679","kind":"arxiv","version":1}},"canonical_sha256":"fa6d95a1606f75b42fc381cbd3e05117f5e70988a97d859c58525b44234f6994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa6d95a1606f75b42fc381cbd3e05117f5e70988a97d859c58525b44234f6994","first_computed_at":"2026-05-18T01:26:03.984143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:03.984143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vuVI9rE1gGR54yAO5D47Pb/ezB+Ry3JY/aBjX+tzwyzaNpySVkLS9jir8vHLvmM3KPUoGmRzAP4ffuagX7wVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:03.984877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e1c190a4db8ad33508aac430b0be72d19a82aa9b327c17879b285e80261d4a5","sha256:b5a24ab73f81fdd6abc0f4908ff67298fc77523438cea2726eea1dca0b8b5065"],"state_sha256":"1c77ce2a84a832ad44833039074bded0e553a360877bbd155b2d4eed5bbce3a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghjEteQg8z07awNnxp35nKJcTtSk+IuSruqSO6NAsK1ROcI6P5FDokZVmiqvNEYZqzVwg0Q2iilRDBw7OKniBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:49:43.267721Z","bundle_sha256":"7a32f82ed9504d114a820283f32fb7f44ad017197b339a8aa613c7cba5541306"}}