{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z3MQC4FOP3CPP7PD7H3CX5ZBDM","short_pith_number":"pith:Z3MQC4FO","schema_version":"1.0","canonical_sha256":"ced90170ae7ec4f7fde3f9f62bf7211b355591f8a7822642c71e07ca37b8825c","source":{"kind":"arxiv","id":"1805.04195","version":2},"attestation_state":"computed","paper":{"title":"Avoiding long Berge cycles","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-05-10T22:18:57Z","abstract_excerpt":"Let $n\\geq k\\geq r+3$ and $\\mathcal H$ be an $n$-vertex $r$-uniform hypergraph. We show that if $|\\mathcal H|> \\frac{n-1}{k-2}\\binom{k-1}{r}$ then $\\mathcal H$ contains a Berge cycle of length at least $k$. This bound is tight when $k-2$ divides $n-1$. We also show that the bound is attained only for connected $r$-uniform hypergraphs in which every block is the complete hypergraph $K^{(r)}_{k-1}$. We conjecture that our bound also holds in the case $k=r+2$, but the case of short cycles, $k\\leq r+1$, is different."},"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":"1805.04195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-10T22:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"5d946051ccf770d80afdd39e458b11ecdeea0dcadf333470fe06718e9cf0a971","abstract_canon_sha256":"de0edfa2c1b18156ae33d0e739af6d03983f094b69075c52a550378cef037e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.242109Z","signature_b64":"mUucjnFhAnb4s5qe3WLI1XoLLGMD7quklknfbqHHA5NU1r4+dslinntCayMnCLl6qmUWzlCELujybL9A0t9UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced90170ae7ec4f7fde3f9f62bf7211b355591f8a7822642c71e07ca37b8825c","last_reissued_at":"2026-05-18T00:16:07.241396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.241396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding long Berge cycles","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-05-10T22:18:57Z","abstract_excerpt":"Let $n\\geq k\\geq r+3$ and $\\mathcal H$ be an $n$-vertex $r$-uniform hypergraph. We show that if $|\\mathcal H|> \\frac{n-1}{k-2}\\binom{k-1}{r}$ then $\\mathcal H$ contains a Berge cycle of length at least $k$. This bound is tight when $k-2$ divides $n-1$. We also show that the bound is attained only for connected $r$-uniform hypergraphs in which every block is the complete hypergraph $K^{(r)}_{k-1}$. We conjecture that our bound also holds in the case $k=r+2$, but the case of short cycles, $k\\leq r+1$, is different."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04195","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":"1805.04195","created_at":"2026-05-18T00:16:07.241507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04195v2","created_at":"2026-05-18T00:16:07.241507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04195","created_at":"2026-05-18T00:16:07.241507+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3MQC4FOP3CP","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3MQC4FOP3CPP7PD","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3MQC4FO","created_at":"2026-05-18T12:33:04.347982+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/Z3MQC4FOP3CPP7PD7H3CX5ZBDM","json":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM.json","graph_json":"https://pith.science/api/pith-number/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/graph.json","events_json":"https://pith.science/api/pith-number/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/events.json","paper":"https://pith.science/paper/Z3MQC4FO"},"agent_actions":{"view_html":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM","download_json":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM.json","view_paper":"https://pith.science/paper/Z3MQC4FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04195&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/action/storage_attestation","attest_author":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/action/author_attestation","sign_citation":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/action/citation_signature","submit_replication":"https://pith.science/pith/Z3MQC4FOP3CPP7PD7H3CX5ZBDM/action/replication_record"}},"created_at":"2026-05-18T00:16:07.241507+00:00","updated_at":"2026-05-18T00:16:07.241507+00:00"}