{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L5DWYCBKUIA3C5635T5YJXSXAO","short_pith_number":"pith:L5DWYCBK","schema_version":"1.0","canonical_sha256":"5f476c082aa201b177dbecfb84de57038d8a0b6e013cd83173d2e3ab427be1ab","source":{"kind":"arxiv","id":"1609.08983","version":1},"attestation_state":"computed","paper":{"title":"Turan numbers of extensions of some sparse hypergraphs via Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biao Wu, Tao Jiang, Yuejian Peng","submitted_at":"2016-09-28T16:06:40Z","abstract_excerpt":"Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension $H^F $ of $F$ is obtained as follows: For each pair of vertices $v_i,v_j$ in $F$ not contained in an edge of $F$, we add a set $B_{ij}$ of $r-2$ new vertices and the edge $\\{v_i,v_j\\} \\cup B_{ij}$, where the $B_{ij}$ 's are pairwise disjoint over all such pairs $\\{i,j\\}$. Let $K^r_p$ denote the complete $r$-graph on $p$ vertices. For all sufficiently large "},"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":"1609.08983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-28T16:06:40Z","cross_cats_sorted":[],"title_canon_sha256":"f1648636b288c26fff00f64c516ffed73eb41f86f7ff202721ffe4aae3590236","abstract_canon_sha256":"af0cc603254516732dc42b9051f0d25aecac6cfc683c3e13fb5d6ffe91190694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:41.452627Z","signature_b64":"o8GYmi9vaVOT3q794LnVCRsngPYr3bZAzF4w4yywmC/vJl4F3riOo23UuWCDfoJsw9pSlmeQ0ZlV3NDPYQNhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f476c082aa201b177dbecfb84de57038d8a0b6e013cd83173d2e3ab427be1ab","last_reissued_at":"2026-05-18T01:03:41.452248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:41.452248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turan numbers of extensions of some sparse hypergraphs via Lagrangians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Biao Wu, Tao Jiang, Yuejian Peng","submitted_at":"2016-09-28T16:06:40Z","abstract_excerpt":"Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension $H^F $ of $F$ is obtained as follows: For each pair of vertices $v_i,v_j$ in $F$ not contained in an edge of $F$, we add a set $B_{ij}$ of $r-2$ new vertices and the edge $\\{v_i,v_j\\} \\cup B_{ij}$, where the $B_{ij}$ 's are pairwise disjoint over all such pairs $\\{i,j\\}$. Let $K^r_p$ denote the complete $r$-graph on $p$ vertices. For all sufficiently large "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08983","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.08983","created_at":"2026-05-18T01:03:41.452311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08983v1","created_at":"2026-05-18T01:03:41.452311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08983","created_at":"2026-05-18T01:03:41.452311+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5DWYCBKUIA3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5DWYCBKUIA3C563","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5DWYCBK","created_at":"2026-05-18T12:30:29.479603+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/L5DWYCBKUIA3C5635T5YJXSXAO","json":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO.json","graph_json":"https://pith.science/api/pith-number/L5DWYCBKUIA3C5635T5YJXSXAO/graph.json","events_json":"https://pith.science/api/pith-number/L5DWYCBKUIA3C5635T5YJXSXAO/events.json","paper":"https://pith.science/paper/L5DWYCBK"},"agent_actions":{"view_html":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO","download_json":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO.json","view_paper":"https://pith.science/paper/L5DWYCBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08983&json=true","fetch_graph":"https://pith.science/api/pith-number/L5DWYCBKUIA3C5635T5YJXSXAO/graph.json","fetch_events":"https://pith.science/api/pith-number/L5DWYCBKUIA3C5635T5YJXSXAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO/action/storage_attestation","attest_author":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO/action/author_attestation","sign_citation":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO/action/citation_signature","submit_replication":"https://pith.science/pith/L5DWYCBKUIA3C5635T5YJXSXAO/action/replication_record"}},"created_at":"2026-05-18T01:03:41.452311+00:00","updated_at":"2026-05-18T01:03:41.452311+00:00"}