{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XEAGO4SQC7UACNSLAVKIFQZG4I","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":"42556568bd938c80578854109784fd46cf22c106e87290bf2e3354df11f93c2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T17:02:09Z","title_canon_sha256":"a637a61e7e5c32433cfc57b113e435f92230343f4824134502bd4d5ef79e7511"},"schema_version":"1.0","source":{"id":"1808.10842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10842","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10842v1","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10842","created_at":"2026-05-18T00:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"XEAGO4SQC7UA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XEAGO4SQC7UACNSL","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XEAGO4SQ","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bff1aaf708f973b11601958b6758c961e1e80874239edcad2b56c6102bc99b1c","target":"graph","created_at":"2026-05-18T00:06:44Z","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":"For a graph $F$, a hypergraph $\\mathcal{H}$ is a Berge copy of $F$ (or a Berge-$F$ in short), if there is a bijection $f : E(F) \\rightarrow E(\\mathcal{H})$ such that for each $e \\in E(F)$ we have $e \\subset f(e)$. A hypergraph is Berge-$F$-free if it does not contain a Berge copy of $F$. We denote the maximum number of hyperedges in an $n$-vertex $r$-uniform Berge-$F$-free hypergraph by $\\mathrm{ex}_r(n,\\textrm{Berge-}F).$\n  In this paper we prove two general lemmas concerning the maximum size of a Berge-$F$-free hypergraph and use them to establish new results and improve several old results.","authors_text":"Abhishek Methuku, Cory Palmer, D\\'aniel Gerbner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T17:02:09Z","title":"General lemmas for Berge-Tur\\'an hypergraph problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10842","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:0fcef503a4230a18863aa82499ec52e1c6821b803b7007d9391f134e8ea61b10","target":"record","created_at":"2026-05-18T00:06:44Z","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":"42556568bd938c80578854109784fd46cf22c106e87290bf2e3354df11f93c2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-31T17:02:09Z","title_canon_sha256":"a637a61e7e5c32433cfc57b113e435f92230343f4824134502bd4d5ef79e7511"},"schema_version":"1.0","source":{"id":"1808.10842","kind":"arxiv","version":1}},"canonical_sha256":"b90067725017e801364b055482c326e21f14b0b50e291468f6162dbe89d69b12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b90067725017e801364b055482c326e21f14b0b50e291468f6162dbe89d69b12","first_computed_at":"2026-05-18T00:06:44.466128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:44.466128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uj5yukcLOUvCmoaUvSEAKYMGsszLCPjH91S3PMsMIF1fEIzdwzjCEbb9DUf84tMb+JOJXdv6b0dmUzqfBas9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:44.466735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fcef503a4230a18863aa82499ec52e1c6821b803b7007d9391f134e8ea61b10","sha256:bff1aaf708f973b11601958b6758c961e1e80874239edcad2b56c6102bc99b1c"],"state_sha256":"c090658e0d13ec6421ca29c9de2eddd31bfe2ea2f49982e088ba7b402d0848e3"}