{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LL5PXA235K7DHYEN2I4HEU4E4P","short_pith_number":"pith:LL5PXA23","schema_version":"1.0","canonical_sha256":"5afafb835beabe33e08dd238725384e3f9d74a4248c6e9dcb04a891857eab771","source":{"kind":"arxiv","id":"1612.08856","version":1},"attestation_state":"computed","paper":{"title":"Turan numbers of complete 3-uniform Berge-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Maherani, M. Shahsiah","submitted_at":"2016-12-28T11:32:32Z","abstract_excerpt":"Given a family $\\mathcal{F}$ of $r$-graphs, the Tur\\'{a}n number of $\\mathcal{F}$ for a given positive integer $N$, denoted by $ex(N,\\mathcal{F})$, is the maximum number of edges of an $r$-graph on $N$ vertices that does not contain any member of $\\mathcal{F}$ as a subgraph.  For given $r\\geq 3$, a  complete $r$-uniform Berge-hypergraph, denoted by { ${K}_n^{(r)}$}, is an $r$-uniform hypergraph of order $n$  with the core sequence $v_{1}, v_{2}, \\ldots ,v_{n}$ as the vertices and  distinct edges $e_{ij},$ $1\\leq i<j\\leq n,$ where every $e_{ij}$ contains both   $v_{i}$ and $v_{j}$. Let $\\mathca"},"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":"1612.08856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T11:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"70b3bdec9a7e301dd8f1605e72b06d516d6e26321eab0417def6f666df134798","abstract_canon_sha256":"55979f2ae35535acde082bea06e64f65426cf7095ee7818c38596bddd8bbee6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:47.001503Z","signature_b64":"ga7OMwnBpliwRP7kO0tvzckjkL0vuP0cSwxFjymqkzTFuFNbHYB41NkYCaqTAcCvDWYvaqK9yBdiSpnTHjiwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5afafb835beabe33e08dd238725384e3f9d74a4248c6e9dcb04a891857eab771","last_reissued_at":"2026-05-18T00:53:47.001105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:47.001105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turan numbers of complete 3-uniform Berge-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Maherani, M. Shahsiah","submitted_at":"2016-12-28T11:32:32Z","abstract_excerpt":"Given a family $\\mathcal{F}$ of $r$-graphs, the Tur\\'{a}n number of $\\mathcal{F}$ for a given positive integer $N$, denoted by $ex(N,\\mathcal{F})$, is the maximum number of edges of an $r$-graph on $N$ vertices that does not contain any member of $\\mathcal{F}$ as a subgraph.  For given $r\\geq 3$, a  complete $r$-uniform Berge-hypergraph, denoted by { ${K}_n^{(r)}$}, is an $r$-uniform hypergraph of order $n$  with the core sequence $v_{1}, v_{2}, \\ldots ,v_{n}$ as the vertices and  distinct edges $e_{ij},$ $1\\leq i<j\\leq n,$ where every $e_{ij}$ contains both   $v_{i}$ and $v_{j}$. Let $\\mathca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08856","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":"1612.08856","created_at":"2026-05-18T00:53:47.001161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08856v1","created_at":"2026-05-18T00:53:47.001161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08856","created_at":"2026-05-18T00:53:47.001161+00:00"},{"alias_kind":"pith_short_12","alias_value":"LL5PXA235K7D","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LL5PXA235K7DHYEN","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LL5PXA23","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/LL5PXA235K7DHYEN2I4HEU4E4P","json":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P.json","graph_json":"https://pith.science/api/pith-number/LL5PXA235K7DHYEN2I4HEU4E4P/graph.json","events_json":"https://pith.science/api/pith-number/LL5PXA235K7DHYEN2I4HEU4E4P/events.json","paper":"https://pith.science/paper/LL5PXA23"},"agent_actions":{"view_html":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P","download_json":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P.json","view_paper":"https://pith.science/paper/LL5PXA23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08856&json=true","fetch_graph":"https://pith.science/api/pith-number/LL5PXA235K7DHYEN2I4HEU4E4P/graph.json","fetch_events":"https://pith.science/api/pith-number/LL5PXA235K7DHYEN2I4HEU4E4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P/action/storage_attestation","attest_author":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P/action/author_attestation","sign_citation":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P/action/citation_signature","submit_replication":"https://pith.science/pith/LL5PXA235K7DHYEN2I4HEU4E4P/action/replication_record"}},"created_at":"2026-05-18T00:53:47.001161+00:00","updated_at":"2026-05-18T00:53:47.001161+00:00"}