{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UMSWYATIXYL7QMQHC7OYKLBEXD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f5b2d848e0d3aaee282d52cde1eaab4cd48d07e8af96356072ce2c41c83328d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-16T21:25:22Z","title_canon_sha256":"14964ce13469eb2a5097b4d35370d1f441a25a9ec57e6f38bebcbc04ddeab947"},"schema_version":"1.0","source":{"id":"1807.06119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06119","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06119v1","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06119","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"UMSWYATIXYL7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UMSWYATIXYL7QMQH","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UMSWYATI","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:53b0e00457f9d72439b5096f8866d9663b288f5267c942b30ba64f996d420ed9","target":"graph","created_at":"2026-05-18T00:10:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $EG_r(n,k)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph with no Berge cycles of length $k$ or longer. In the first part of this work, we have found exact values of $EG_r(n,k)$ and described the structure of extremal hypergraphs for the case when $k-2$ divides $n-1$ and $k\\geq r+3$. In this paper we determine $EG_r(n,k)$ and describe the extremal hypergraphs for all $n$ when $k\\geq r+4$.","authors_text":"Alexandr Kostochka, Ruth Luo, Zoltan Furedi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-16T21:25:22Z","title":"Avoiding long Berge cycles II, exact bounds for all $n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06119","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5bbdb0f4fe99143774672ebb4f4793377799a5d8d82e16986e3893d3be85e238","target":"record","created_at":"2026-05-18T00:10:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f5b2d848e0d3aaee282d52cde1eaab4cd48d07e8af96356072ce2c41c83328d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-16T21:25:22Z","title_canon_sha256":"14964ce13469eb2a5097b4d35370d1f441a25a9ec57e6f38bebcbc04ddeab947"},"schema_version":"1.0","source":{"id":"1807.06119","kind":"arxiv","version":1}},"canonical_sha256":"a3256c0268be17f8320717dd852c24b8eea0b88c395ded81749f1f48a4440bcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3256c0268be17f8320717dd852c24b8eea0b88c395ded81749f1f48a4440bcb","first_computed_at":"2026-05-18T00:10:33.972099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:33.972099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K2Hggt/eb2Y7fG5ph+76axE4sFmtMTGxXK+3apEjm7NsACI0KWAXMWUt15FsEVoPm2xY+X/+UFbS2WFpXlpYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:33.972743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bbdb0f4fe99143774672ebb4f4793377799a5d8d82e16986e3893d3be85e238","sha256:53b0e00457f9d72439b5096f8866d9663b288f5267c942b30ba64f996d420ed9"],"state_sha256":"31d689b067e0bca43092aec01d1b12a9e6bd6a9b8b0f431a9c79e4426f7c225b"}