{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WOQJAXETCL6435OHAJDTJB7KZQ","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":"9bc33a2541b01a20bfc7fa90dc72675b129ec1a79900dee245cbddc23df3f189","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-05T12:05:39Z","title_canon_sha256":"3ea7b22b9f9e1f77c9f7c4353c29eabce0732858e713b11c8de201614c8c8263"},"schema_version":"1.0","source":{"id":"1812.01940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01940","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01940v2","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01940","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"WOQJAXETCL64","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOQJAXETCL6435OH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOQJAXET","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ec27988fcf11d72045393c09857bcc34bf7a997443b5c9a5b431dc387d5b27b3","target":"graph","created_at":"2026-05-17T23:58:47Z","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":"Let $\\mathcal{F}$ be a family of $r$-graphs. The Tur\\'an number $ex_r(n;\\mathcal{F})$ is defined to be the maximum number of edges in an $r$-graph of order $n$ that is $\\mathcal{F}$-free. The famous Erd\\H{o}s Matching Conjecture shows that \\[ ex_r(n,M_{k+1}^{(r)})= \\max\\left\\{\\binom{rk+r-1}{r},\\binom{n}{r}-\\binom{n-k}{r}\\right\\}, \\] where $M_{k+1}^{(r)}$ represents the $r$-graph consisting of $k+1$ disjoint edges. Motivated by this conjecture, we consider the Tur\\'an problem for tight linear forests. A tight linear forest is an $r$-graph whose connected components are all tight paths or isolat","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-12-05T12:05:39Z","title":"The Tur\\'an problem for a family of tight linear forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01940","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:5b09af8879bcf64c0b3583df9128cd20fa2002a2f20a9a895422d76fa4849b2c","target":"record","created_at":"2026-05-17T23:58:47Z","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":"9bc33a2541b01a20bfc7fa90dc72675b129ec1a79900dee245cbddc23df3f189","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-05T12:05:39Z","title_canon_sha256":"3ea7b22b9f9e1f77c9f7c4353c29eabce0732858e713b11c8de201614c8c8263"},"schema_version":"1.0","source":{"id":"1812.01940","kind":"arxiv","version":2}},"canonical_sha256":"b3a0905c9312fdcdf5c702473487eacc217a2b9577eabd0a4a64e167184f6c99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3a0905c9312fdcdf5c702473487eacc217a2b9577eabd0a4a64e167184f6c99","first_computed_at":"2026-05-17T23:58:47.080532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:47.080532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vnrLKlvdKoxllaXUHSlosoPQLYgn89HHlO6Kdd/uwGj8ihTUakLCSk7rEwo0/Yn0l6taWveHACqc/fRTf0GNCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:47.080961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b09af8879bcf64c0b3583df9128cd20fa2002a2f20a9a895422d76fa4849b2c","sha256:ec27988fcf11d72045393c09857bcc34bf7a997443b5c9a5b431dc387d5b27b3"],"state_sha256":"bebed086e8735fcd45ae902eed6e07cde82a56a7eee2bd2242d150b7560873a2"}