{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CIICNFYDY2I5CRMYBIQQTIAKM6","short_pith_number":"pith:CIICNFYD","schema_version":"1.0","canonical_sha256":"1210269703c691d145980a2109a00a678fc3e795dfbabd2752641b1ce854c778","source":{"kind":"arxiv","id":"1812.10737","version":2},"attestation_state":"computed","paper":{"title":"The Structure of Hypergraphs without long Berge cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gy\\H{o}ri, Nathan Lemons, Nika Salia, Oscar Zamora","submitted_at":"2018-12-27T15:02:00Z","abstract_excerpt":"We study the structure of $r$-uniform hypergraphs containing no Berge cycles of length at least $k$ for $k \\leq r$, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when $k=r$ and giving a a simple solution to a recent result of Kostochka-Luo when $k < r$."},"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.10737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-27T15:02:00Z","cross_cats_sorted":[],"title_canon_sha256":"ab12a728c7dcb0ee40af9334fe16120b5a10078e220fd803cf79bd53c9d10271","abstract_canon_sha256":"cbd6a1261f8eb9abc1c5a9ef676f460eca9d1d102223e2a50bf928c537ad4be1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:55.597943Z","signature_b64":"O0OD9OG9JvMoJ71xQWjnrlvLM+CehfBGdxj9GkCz0LnXT+gcTP35z2NAE0Z0EY5Fan1aaZDVFOtSPogsCJVJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1210269703c691d145980a2109a00a678fc3e795dfbabd2752641b1ce854c778","last_reissued_at":"2026-05-17T23:40:55.597212Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:55.597212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Structure of Hypergraphs without long Berge cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ervin Gy\\H{o}ri, Nathan Lemons, Nika Salia, Oscar Zamora","submitted_at":"2018-12-27T15:02:00Z","abstract_excerpt":"We study the structure of $r$-uniform hypergraphs containing no Berge cycles of length at least $k$ for $k \\leq r$, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when $k=r$ and giving a a simple solution to a recent result of Kostochka-Luo when $k < r$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10737","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.10737","created_at":"2026-05-17T23:40:55.597332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10737v2","created_at":"2026-05-17T23:40:55.597332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10737","created_at":"2026-05-17T23:40:55.597332+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIICNFYDY2I5","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIICNFYDY2I5CRMY","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIICNFYD","created_at":"2026-05-18T12:32:16.446611+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/CIICNFYDY2I5CRMYBIQQTIAKM6","json":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6.json","graph_json":"https://pith.science/api/pith-number/CIICNFYDY2I5CRMYBIQQTIAKM6/graph.json","events_json":"https://pith.science/api/pith-number/CIICNFYDY2I5CRMYBIQQTIAKM6/events.json","paper":"https://pith.science/paper/CIICNFYD"},"agent_actions":{"view_html":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6","download_json":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6.json","view_paper":"https://pith.science/paper/CIICNFYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10737&json=true","fetch_graph":"https://pith.science/api/pith-number/CIICNFYDY2I5CRMYBIQQTIAKM6/graph.json","fetch_events":"https://pith.science/api/pith-number/CIICNFYDY2I5CRMYBIQQTIAKM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6/action/storage_attestation","attest_author":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6/action/author_attestation","sign_citation":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6/action/citation_signature","submit_replication":"https://pith.science/pith/CIICNFYDY2I5CRMYBIQQTIAKM6/action/replication_record"}},"created_at":"2026-05-17T23:40:55.597332+00:00","updated_at":"2026-05-17T23:40:55.597332+00:00"}