{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L6TUT7IRPAHYNCYUGYGPMAM7AW","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":"d6d5b614a86427469d28265f6c0738ff53d7558c49ad0cee757f2a8f56406ca0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-13T20:44:08Z","title_canon_sha256":"0e3c3c75aa9b154f188db571c1f910a166bdf3a681801aebb7e32a3ce1146bb4"},"schema_version":"1.0","source":{"id":"1706.04249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04249","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04249v1","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04249","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"L6TUT7IRPAHY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6TUT7IRPAHYNCYU","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6TUT7IR","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5c3d18984b518240896bfc68b17d3c99b6f18c716fc951c39e25c5a16a4bbe17","target":"graph","created_at":"2026-05-18T00:42:23Z","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 $F$ be a graph. We say that a hypergraph $H$ is a {\\it Berge}-$F$ if there is a bijection $f : E(F) \\rightarrow E(H )$ such that $e \\subseteq f(e)$ for every $e \\in E(F)$. Note that Berge-$F$ actually denotes a class of hypergraphs. The maximum number of edges in an $n$-vertex $r$-graph with no subhypergraph isomorphic to any Berge-$F$ is denoted $\\ex_r(n,\\textrm{Berge-}F)$. In this paper we establish new upper and lower bounds on $\\ex_r(n,\\textrm{Berge-}F)$ for general graphs $F$, and investigate connections between $\\ex_r(n,\\textrm{Berge-}F)$ and other recently studied extremal functions","authors_text":"Adam Zsolt Wagner, Cory Palmer, Craig Timmons, Michael Tait","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-13T20:44:08Z","title":"Tur\\'an numbers for Berge-hypergraphs and related extremal problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04249","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:7cefe0dba0209e6eba48c4ad7ab80ea2227be648697f3c8e0affe4adedea32e7","target":"record","created_at":"2026-05-18T00:42:23Z","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":"d6d5b614a86427469d28265f6c0738ff53d7558c49ad0cee757f2a8f56406ca0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-13T20:44:08Z","title_canon_sha256":"0e3c3c75aa9b154f188db571c1f910a166bdf3a681801aebb7e32a3ce1146bb4"},"schema_version":"1.0","source":{"id":"1706.04249","kind":"arxiv","version":1}},"canonical_sha256":"5fa749fd11780f868b14360cf6019f05bbe3dbb50f0c16c710ec6c010012b1e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fa749fd11780f868b14360cf6019f05bbe3dbb50f0c16c710ec6c010012b1e5","first_computed_at":"2026-05-18T00:42:23.155927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:23.155927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NBiNHUC7cuCuNMYKBv0IANCUV++Cfv6vUKQt2ZFBu5j2MFsN5Apvb2MBEC6V3aHlMX2nx+RoquO4ri8iKUc/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:23.156603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cefe0dba0209e6eba48c4ad7ab80ea2227be648697f3c8e0affe4adedea32e7","sha256:5c3d18984b518240896bfc68b17d3c99b6f18c716fc951c39e25c5a16a4bbe17"],"state_sha256":"89ab132ec1c377c624f93285bb9dea039977fccd2e6b116f4534abaa45b199b3"}