{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RK6C7IOYEYLHX7BIDLOZNWXZ3Q","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":"6e3f90e28365efda96064726d47ac18efb18254d45d518e492c4f30fd283b404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-31T01:10:11Z","title_canon_sha256":"8a5f00cc6989957d9b971462632486146ca2a2a951d961ee56290e86952193f2"},"schema_version":"1.0","source":{"id":"1901.11159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11159","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11159v2","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11159","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"RK6C7IOYEYLH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RK6C7IOYEYLHX7BI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RK6C7IOY","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ab78e8096b99ce91e4e35483e6ea9cb219d67e889c56ca3d983e6b15391cfb0c","target":"graph","created_at":"2026-05-17T23:54:58Z","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":"We give an upper bound for the maximum number of edges in an $n$-vertex 2-connected $r$-uniform hypergraph with no Berge cycle of length $k$ or greater, where $n\\geq k \\geq 4r\\geq 12$. For $n$ large with respect to $r$ and $k$, this bound is sharp and is significantly stronger than the bound without restrictions on connectivity. It turned out that it is simpler to prove the bound for the broader class of Sperner families where the size of each set is at most $r$. For such families, our bound is sharp for all $n\\geq k\\geq r\\geq 3$.","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":"2019-01-31T01:10:11Z","title":"On 2-connected hypergraphs with no long cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11159","kind":"arxiv","version":2},"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:9d716a10baad3fa9608e0791c6d7e9d0f8c42e8fd637b60327129df07a0149aa","target":"record","created_at":"2026-05-17T23:54:58Z","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":"6e3f90e28365efda96064726d47ac18efb18254d45d518e492c4f30fd283b404","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-31T01:10:11Z","title_canon_sha256":"8a5f00cc6989957d9b971462632486146ca2a2a951d961ee56290e86952193f2"},"schema_version":"1.0","source":{"id":"1901.11159","kind":"arxiv","version":2}},"canonical_sha256":"8abc2fa1d826167bfc281add96daf9dc00c0df11a2d7f1c50a0fbb102aacf301","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8abc2fa1d826167bfc281add96daf9dc00c0df11a2d7f1c50a0fbb102aacf301","first_computed_at":"2026-05-17T23:54:58.435119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:58.435119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qi94XorVKGKSkgXRDdZF/DuyOF2c6jtEpYJuaVEiJy0TjEtpFIKKuml4en0BeJDGQXxCirJdrOWU5WPf8UaWBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:58.435716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.11159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d716a10baad3fa9608e0791c6d7e9d0f8c42e8fd637b60327129df07a0149aa","sha256:ab78e8096b99ce91e4e35483e6ea9cb219d67e889c56ca3d983e6b15391cfb0c"],"state_sha256":"a9cf33d4e8c52dda7da03e976c63a04aff2250ca687bf54af5c38c8103410756"}