{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4JW3YGF7YFLGJGN2ZRIJRINDCB","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":"586ae27fc01ffd495c10441ea88486d51086263445e59ef7b6d7d4e346fbe72a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T10:57:56Z","title_canon_sha256":"78b20b3602863ca2a3f771cf513e33f165e5a1df5d2e8c394378092def9c6e9c"},"schema_version":"1.0","source":{"id":"1106.5904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5904","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5904v2","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5904","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"4JW3YGF7YFLG","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4JW3YGF7YFLGJGN2","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4JW3YGF7","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:96e0082fef74b736e8e06e14709347d4fb7c0a61c489a926245557b64f99b315","target":"graph","created_at":"2026-05-18T03:57:26Z","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\\'an number of a graph H, ex(n;H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let P_l denote a path on l vertices, and kP_l denote k vertex-disjoint copies of P_l. We determine ex(n, kP_3) for n appropriately large, answering in the positive a conjecture of Gorgol. Further, we determine ex (n, kP_l) for arbitrary l, and n appropriately large relative to k and l. We provide some background on the famous Erd\\H{o}s-S\\'os conjecture, and conditional on its truth we determine ex(n;H) when H is an equibipartite forest, for appropriately l","authors_text":"Nathan Kettle, Neal Bushaw","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T10:57:56Z","title":"Tur\\`an numbers of Multiple Paths and Equibipartite Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5904","kind":"arxiv","version":2},"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:388bae63f7d98fc3aa73f6d50b5cd2d450dd5b508b954b0ceae93725acf1e02e","target":"record","created_at":"2026-05-18T03:57:26Z","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":"586ae27fc01ffd495c10441ea88486d51086263445e59ef7b6d7d4e346fbe72a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-29T10:57:56Z","title_canon_sha256":"78b20b3602863ca2a3f771cf513e33f165e5a1df5d2e8c394378092def9c6e9c"},"schema_version":"1.0","source":{"id":"1106.5904","kind":"arxiv","version":2}},"canonical_sha256":"e26dbc18bfc1566499bacc5098a1a31073506141a65946c4ed2efec8db056176","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e26dbc18bfc1566499bacc5098a1a31073506141a65946c4ed2efec8db056176","first_computed_at":"2026-05-18T03:57:26.897376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:26.897376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"stnVcz/gAlzts0HRZVurttLwPTZGjsz+xRUKMFxngD+vPh9h60rqTZJMbQhGUIPAiSmFXmK3MoVjeDdxh7LYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:26.898100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:388bae63f7d98fc3aa73f6d50b5cd2d450dd5b508b954b0ceae93725acf1e02e","sha256:96e0082fef74b736e8e06e14709347d4fb7c0a61c489a926245557b64f99b315"],"state_sha256":"014559abb19f4329bcb677ccbcea6a3433475c19788cb79e2d61ec1c53169f35"}