{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WOQJAXETCL6435OHAJDTJB7KZQ","short_pith_number":"pith:WOQJAXET","schema_version":"1.0","canonical_sha256":"b3a0905c9312fdcdf5c702473487eacc217a2b9577eabd0a4a64e167184f6c99","source":{"kind":"arxiv","id":"1812.01940","version":2},"attestation_state":"computed","paper":{"title":"The Tur\\'an problem for a family of tight 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-12-05T12:05:39Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.01940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-05T12:05:39Z","cross_cats_sorted":[],"title_canon_sha256":"3ea7b22b9f9e1f77c9f7c4353c29eabce0732858e713b11c8de201614c8c8263","abstract_canon_sha256":"9bc33a2541b01a20bfc7fa90dc72675b129ec1a79900dee245cbddc23df3f189"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:47.080961Z","signature_b64":"vnrLKlvdKoxllaXUHSlosoPQLYgn89HHlO6Kdd/uwGj8ihTUakLCSk7rEwo0/Yn0l6taWveHACqc/fRTf0GNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3a0905c9312fdcdf5c702473487eacc217a2b9577eabd0a4a64e167184f6c99","last_reissued_at":"2026-05-17T23:58:47.080532Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:47.080532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tur\\'an problem for a family of tight 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-12-05T12:05:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01940","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.01940","created_at":"2026-05-17T23:58:47.080594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01940v2","created_at":"2026-05-17T23:58:47.080594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01940","created_at":"2026-05-17T23:58:47.080594+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOQJAXETCL64","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOQJAXETCL6435OH","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOQJAXET","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ","json":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ.json","graph_json":"https://pith.science/api/pith-number/WOQJAXETCL6435OHAJDTJB7KZQ/graph.json","events_json":"https://pith.science/api/pith-number/WOQJAXETCL6435OHAJDTJB7KZQ/events.json","paper":"https://pith.science/paper/WOQJAXET"},"agent_actions":{"view_html":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ","download_json":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ.json","view_paper":"https://pith.science/paper/WOQJAXET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01940&json=true","fetch_graph":"https://pith.science/api/pith-number/WOQJAXETCL6435OHAJDTJB7KZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WOQJAXETCL6435OHAJDTJB7KZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ/action/storage_attestation","attest_author":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ/action/author_attestation","sign_citation":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ/action/citation_signature","submit_replication":"https://pith.science/pith/WOQJAXETCL6435OHAJDTJB7KZQ/action/replication_record"}},"created_at":"2026-05-17T23:58:47.080594+00:00","updated_at":"2026-05-17T23:58:47.080594+00:00"}