{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UMSWYATIXYL7QMQHC7OYKLBEXD","short_pith_number":"pith:UMSWYATI","schema_version":"1.0","canonical_sha256":"a3256c0268be17f8320717dd852c24b8eea0b88c395ded81749f1f48a4440bcb","source":{"kind":"arxiv","id":"1807.06119","version":1},"attestation_state":"computed","paper":{"title":"Avoiding long Berge cycles II, exact bounds for all $n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Ruth Luo, Zoltan Furedi","submitted_at":"2018-07-16T21:25:22Z","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$."},"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":"1807.06119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-16T21:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"14964ce13469eb2a5097b4d35370d1f441a25a9ec57e6f38bebcbc04ddeab947","abstract_canon_sha256":"f5b2d848e0d3aaee282d52cde1eaab4cd48d07e8af96356072ce2c41c83328d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:33.972743Z","signature_b64":"K2Hggt/eb2Y7fG5ph+76axE4sFmtMTGxXK+3apEjm7NsACI0KWAXMWUt15FsEVoPm2xY+X/+UFbS2WFpXlpYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3256c0268be17f8320717dd852c24b8eea0b88c395ded81749f1f48a4440bcb","last_reissued_at":"2026-05-18T00:10:33.972099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:33.972099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding long Berge cycles II, exact bounds for all $n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Ruth Luo, Zoltan Furedi","submitted_at":"2018-07-16T21:25:22Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06119","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":"1807.06119","created_at":"2026-05-18T00:10:33.972187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06119v1","created_at":"2026-05-18T00:10:33.972187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06119","created_at":"2026-05-18T00:10:33.972187+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMSWYATIXYL7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMSWYATIXYL7QMQH","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMSWYATI","created_at":"2026-05-18T12:32:56.356000+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/UMSWYATIXYL7QMQHC7OYKLBEXD","json":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD.json","graph_json":"https://pith.science/api/pith-number/UMSWYATIXYL7QMQHC7OYKLBEXD/graph.json","events_json":"https://pith.science/api/pith-number/UMSWYATIXYL7QMQHC7OYKLBEXD/events.json","paper":"https://pith.science/paper/UMSWYATI"},"agent_actions":{"view_html":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD","download_json":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD.json","view_paper":"https://pith.science/paper/UMSWYATI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06119&json=true","fetch_graph":"https://pith.science/api/pith-number/UMSWYATIXYL7QMQHC7OYKLBEXD/graph.json","fetch_events":"https://pith.science/api/pith-number/UMSWYATIXYL7QMQHC7OYKLBEXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD/action/storage_attestation","attest_author":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD/action/author_attestation","sign_citation":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD/action/citation_signature","submit_replication":"https://pith.science/pith/UMSWYATIXYL7QMQHC7OYKLBEXD/action/replication_record"}},"created_at":"2026-05-18T00:10:33.972187+00:00","updated_at":"2026-05-18T00:10:33.972187+00:00"}