{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4EWURG3IDBVHRV2QAMFAWASFQP","short_pith_number":"pith:4EWURG3I","schema_version":"1.0","canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","source":{"kind":"arxiv","id":"1305.5372","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph Tur\\'an numbers of vertex disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","submitted_at":"2013-05-23T10:43:41Z","abstract_excerpt":"The Tur\\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\\left({n;H} \\right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let $\\mathcal{C}_{\\ell}^{\\left(k \\right)}$ denote the family of all $k$-uniform minimal cycles of length $\\ell$, $\\mathcal{S}(\\ell_1,\\ldots,\\ell_r)$ denote the family of hypergraphs consisting of unions of $r$ vertex disjoint minimal cycles of length $\\ell_1,\\ldots,\\ell_r$, respectively, and $\\mathbb{C}_{\\ell}^{\\left(k \\right)}$ denote a $k$-uniform linear cycle of length $\\ell$. We"},"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":"1305.5372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-23T10:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"2a9224d02087e1ab12adf068b420e51c6092f230181829ce3d0374deff4de21d","abstract_canon_sha256":"5d45454592a4bbdc0adf5e755385fb38d4f03972e5a8efaeb264601dbe91ca90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.953099Z","signature_b64":"eQV3aQZ8oHZgL41xYAjIh4u9KqARfZcUbmCXb35C2IAensJoTQPeHCZIO7+GyDgMME+HXQPHraOz6Ez4aTSACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e12d489b68186a78d750030a0b024583facb468a8757595305c1127eb9aab04e","last_reissued_at":"2026-05-18T03:25:04.952404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.952404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Tur\\'an numbers of vertex disjoint cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","submitted_at":"2013-05-23T10:43:41Z","abstract_excerpt":"The Tur\\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\\left({n;H} \\right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let $\\mathcal{C}_{\\ell}^{\\left(k \\right)}$ denote the family of all $k$-uniform minimal cycles of length $\\ell$, $\\mathcal{S}(\\ell_1,\\ldots,\\ell_r)$ denote the family of hypergraphs consisting of unions of $r$ vertex disjoint minimal cycles of length $\\ell_1,\\ldots,\\ell_r$, respectively, and $\\mathbb{C}_{\\ell}^{\\left(k \\right)}$ denote a $k$-uniform linear cycle of length $\\ell$. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5372","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":"1305.5372","created_at":"2026-05-18T03:25:04.952520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5372v1","created_at":"2026-05-18T03:25:04.952520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5372","created_at":"2026-05-18T03:25:04.952520+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EWURG3IDBVH","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EWURG3IDBVHRV2Q","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EWURG3I","created_at":"2026-05-18T12:27:32.513160+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/4EWURG3IDBVHRV2QAMFAWASFQP","json":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP.json","graph_json":"https://pith.science/api/pith-number/4EWURG3IDBVHRV2QAMFAWASFQP/graph.json","events_json":"https://pith.science/api/pith-number/4EWURG3IDBVHRV2QAMFAWASFQP/events.json","paper":"https://pith.science/paper/4EWURG3I"},"agent_actions":{"view_html":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP","download_json":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP.json","view_paper":"https://pith.science/paper/4EWURG3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5372&json=true","fetch_graph":"https://pith.science/api/pith-number/4EWURG3IDBVHRV2QAMFAWASFQP/graph.json","fetch_events":"https://pith.science/api/pith-number/4EWURG3IDBVHRV2QAMFAWASFQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/action/storage_attestation","attest_author":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/action/author_attestation","sign_citation":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/action/citation_signature","submit_replication":"https://pith.science/pith/4EWURG3IDBVHRV2QAMFAWASFQP/action/replication_record"}},"created_at":"2026-05-18T03:25:04.952520+00:00","updated_at":"2026-05-18T03:25:04.952520+00:00"}