{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RK6C7IOYEYLHX7BIDLOZNWXZ3Q","short_pith_number":"pith:RK6C7IOY","canonical_record":{"source":{"id":"1901.11159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-31T01:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"8a5f00cc6989957d9b971462632486146ca2a2a951d961ee56290e86952193f2","abstract_canon_sha256":"6e3f90e28365efda96064726d47ac18efb18254d45d518e492c4f30fd283b404"},"schema_version":"1.0"},"canonical_sha256":"8abc2fa1d826167bfc281add96daf9dc00c0df11a2d7f1c50a0fbb102aacf301","source":{"kind":"arxiv","id":"1901.11159","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RK6C7IOYEYLHX7BIDLOZNWXZ3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1901.11159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-31T01:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"8a5f00cc6989957d9b971462632486146ca2a2a951d961ee56290e86952193f2","abstract_canon_sha256":"6e3f90e28365efda96064726d47ac18efb18254d45d518e492c4f30fd283b404"},"schema_version":"1.0"},"canonical_sha256":"8abc2fa1d826167bfc281add96daf9dc00c0df11a2d7f1c50a0fbb102aacf301","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.435716Z","signature_b64":"Qi94XorVKGKSkgXRDdZF/DuyOF2c6jtEpYJuaVEiJy0TjEtpFIKKuml4en0BeJDGQXxCirJdrOWU5WPf8UaWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8abc2fa1d826167bfc281add96daf9dc00c0df11a2d7f1c50a0fbb102aacf301","last_reissued_at":"2026-05-17T23:54:58.435119Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.435119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.11159","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/NrAX5UVqJLtTu1GTuPKfHi8n4k38Z9+W9SCyKFGUe7lxdKS9/ZsqbNJKy2f8kHWLsx4AJYB+/s4vJBZE1nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:48:49.642803Z"},"content_sha256":"9d716a10baad3fa9608e0791c6d7e9d0f8c42e8fd637b60327129df07a0149aa","schema_version":"1.0","event_id":"sha256:9d716a10baad3fa9608e0791c6d7e9d0f8c42e8fd637b60327129df07a0149aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RK6C7IOYEYLHX7BIDLOZNWXZ3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On 2-connected hypergraphs with no long 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":"2019-01-31T01:10:11Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11159","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MHW2cFMOh5q1mZ5ufAp7AQ1nKPdQjZVAakPVutJBrorDXNus4TKxyNXo3bxZi1jhLXcQ6Kf8N7O1flPBmaTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:48:49.643400Z"},"content_sha256":"ab78e8096b99ce91e4e35483e6ea9cb219d67e889c56ca3d983e6b15391cfb0c","schema_version":"1.0","event_id":"sha256:ab78e8096b99ce91e4e35483e6ea9cb219d67e889c56ca3d983e6b15391cfb0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q/bundle.json","state_url":"https://pith.science/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T14:48:49Z","links":{"resolver":"https://pith.science/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q","bundle":"https://pith.science/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q/bundle.json","state":"https://pith.science/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RK6C7IOYEYLHX7BIDLOZNWXZ3Q/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGGARKBY12pxqyOBEnIanXlIDuFDN5dfmF9DQpSkHcfQWrOzOQGLequ+cBwa8DHls9ahiw4sTvAWTYpOt5c0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T14:48:49.646380Z","bundle_sha256":"eb72bb071440a05b81d5bfd938a76f4b6c2eeb07b4c7fc5d64714a3214599279"}}