{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IIUWHYYABLBGYAW6VUKX6FXPZ3","short_pith_number":"pith:IIUWHYYA","canonical_record":{"source":{"id":"1303.5022","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-20T18:38:10Z","cross_cats_sorted":[],"title_canon_sha256":"b55d42cdb8469ca21a34a02f47df290bb84aec0fe9eb10c669858d111705f5d9","abstract_canon_sha256":"94ba74c74f502a4e90eba765cfc96047051e271c510442d417d2c4222b71239a"},"schema_version":"1.0"},"canonical_sha256":"422963e3000ac26c02dead157f16efcef2d0914ff954a80fe15bad9b8727d736","source":{"kind":"arxiv","id":"1303.5022","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5022","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5022v4","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5022","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"IIUWHYYABLBG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IIUWHYYABLBGYAW6","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IIUWHYYA","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IIUWHYYABLBGYAW6VUKX6FXPZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1303.5022","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-20T18:38:10Z","cross_cats_sorted":[],"title_canon_sha256":"b55d42cdb8469ca21a34a02f47df290bb84aec0fe9eb10c669858d111705f5d9","abstract_canon_sha256":"94ba74c74f502a4e90eba765cfc96047051e271c510442d417d2c4222b71239a"},"schema_version":"1.0"},"canonical_sha256":"422963e3000ac26c02dead157f16efcef2d0914ff954a80fe15bad9b8727d736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:13.174190Z","signature_b64":"55vhIofsbchrL4ZePabuCugGyG+Y+ipVGlb+0CE+XOfJ1/gqi89116o405sqWmIsRBaMb90q2fdZySVQnWugCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"422963e3000ac26c02dead157f16efcef2d0914ff954a80fe15bad9b8727d736","last_reissued_at":"2026-05-18T02:58:13.173334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:13.173334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.5022","source_version":4,"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-18T02:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N03vjIJUncZSQKLdYASUTiT1CVwzPfJTqkvXZdNud/p83xklGxL5O7m7g8q3DVKTWCPFjSq4BV7PjrvlVqR7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:35:54.602786Z"},"content_sha256":"8044b7bbf9bb340e7ea9f5a7ac770f0e7248d73171ac3d2fa83a457c1c578224","schema_version":"1.0","event_id":"sha256:8044b7bbf9bb340e7ea9f5a7ac770f0e7248d73171ac3d2fa83a457c1c578224"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IIUWHYYABLBGYAW6VUKX6FXPZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an Numbers for Forests of Paths in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Kettle, Neal Bushaw","submitted_at":"2013-03-20T18:38:10Z","abstract_excerpt":"The Tur\\'an number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P_l^(r) denote the family of r-uniform loose paths on l edges, F(k,l) denote the family of hypergraphs consisting of k disjoint paths from P_l^(r), and P'_l^(r) denote an r-uniform linear path on l edges. We determine precisely ex_r(n;F(k,l)) and ex_r(n;k*P'_l^(r)), as well as the Tur\\'an numbers for forests of paths of differing lengths (whether these paths are loose or linear) when n is appropriately large dependent on k,l,r, for r>=3. Our re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5022","kind":"arxiv","version":4},"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-18T02:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsy/UHiYt3cbsQ6WjpI9xIM6L2uBb36wGdSjRpSvC9e2RaYBLsw5swpZSrBYpzmr2CQFNSVH1WOjDRGK5YelAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:35:54.603286Z"},"content_sha256":"7a1d82627cbc4a38acae0c01a820b3c14580872b7364ebd440befdc0ef1e3a4a","schema_version":"1.0","event_id":"sha256:7a1d82627cbc4a38acae0c01a820b3c14580872b7364ebd440befdc0ef1e3a4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3/bundle.json","state_url":"https://pith.science/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3/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-01T02:35:54Z","links":{"resolver":"https://pith.science/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3","bundle":"https://pith.science/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3/bundle.json","state":"https://pith.science/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIUWHYYABLBGYAW6VUKX6FXPZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IIUWHYYABLBGYAW6VUKX6FXPZ3","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":"94ba74c74f502a4e90eba765cfc96047051e271c510442d417d2c4222b71239a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-20T18:38:10Z","title_canon_sha256":"b55d42cdb8469ca21a34a02f47df290bb84aec0fe9eb10c669858d111705f5d9"},"schema_version":"1.0","source":{"id":"1303.5022","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5022","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5022v4","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5022","created_at":"2026-05-18T02:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"IIUWHYYABLBG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IIUWHYYABLBGYAW6","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IIUWHYYA","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:7a1d82627cbc4a38acae0c01a820b3c14580872b7364ebd440befdc0ef1e3a4a","target":"graph","created_at":"2026-05-18T02:58:13Z","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 an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P_l^(r) denote the family of r-uniform loose paths on l edges, F(k,l) denote the family of hypergraphs consisting of k disjoint paths from P_l^(r), and P'_l^(r) denote an r-uniform linear path on l edges. We determine precisely ex_r(n;F(k,l)) and ex_r(n;k*P'_l^(r)), as well as the Tur\\'an numbers for forests of paths of differing lengths (whether these paths are loose or linear) when n is appropriately large dependent on k,l,r, for r>=3. Our re","authors_text":"Nathan Kettle, Neal Bushaw","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-20T18:38:10Z","title":"Tur\\'an Numbers for Forests of Paths in Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5022","kind":"arxiv","version":4},"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:8044b7bbf9bb340e7ea9f5a7ac770f0e7248d73171ac3d2fa83a457c1c578224","target":"record","created_at":"2026-05-18T02:58:13Z","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":"94ba74c74f502a4e90eba765cfc96047051e271c510442d417d2c4222b71239a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-20T18:38:10Z","title_canon_sha256":"b55d42cdb8469ca21a34a02f47df290bb84aec0fe9eb10c669858d111705f5d9"},"schema_version":"1.0","source":{"id":"1303.5022","kind":"arxiv","version":4}},"canonical_sha256":"422963e3000ac26c02dead157f16efcef2d0914ff954a80fe15bad9b8727d736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"422963e3000ac26c02dead157f16efcef2d0914ff954a80fe15bad9b8727d736","first_computed_at":"2026-05-18T02:58:13.173334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:13.173334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55vhIofsbchrL4ZePabuCugGyG+Y+ipVGlb+0CE+XOfJ1/gqi89116o405sqWmIsRBaMb90q2fdZySVQnWugCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:13.174190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5022","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8044b7bbf9bb340e7ea9f5a7ac770f0e7248d73171ac3d2fa83a457c1c578224","sha256:7a1d82627cbc4a38acae0c01a820b3c14580872b7364ebd440befdc0ef1e3a4a"],"state_sha256":"eac2b972b4c42263da8bfd41d2dd6ac6cb7b66c7ee638b8c5be2bddeb23afa20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uiXMP5m6ZGvYr+iVsSH1IW9338bLqzvoda3yne5BHyMYF6JhyxoUjqFzXil7YkqNN4WtfYl5htiXzFz1tPWYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:35:54.607127Z","bundle_sha256":"94fc4118b8bf905541b41818a637d2ff2c0b26b19454491e4a0ea02cec8ca44e"}}