{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WLSDVLFHG6ZKWBJL427FJ3MNVX","short_pith_number":"pith:WLSDVLFH","canonical_record":{"source":{"id":"1505.08127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T18:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"3b114f6bf2cf0c65a7fd2f518a22e238ff22c2d4e47476dce3501d53a0781dfd","abstract_canon_sha256":"d2a9f27fd3c425d460f6cf2d6070342d3e8132ebe6b35c88890848dec7a8b906"},"schema_version":"1.0"},"canonical_sha256":"b2e43aaca737b2ab052be6be54ed8dadd84c3d83b3b6a66101c1fc8133ee4271","source":{"kind":"arxiv","id":"1505.08127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08127","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08127v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08127","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"WLSDVLFHG6ZK","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WLSDVLFHG6ZKWBJL","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WLSDVLFH","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WLSDVLFHG6ZKWBJL427FJ3MNVX","target":"record","payload":{"canonical_record":{"source":{"id":"1505.08127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T18:02:08Z","cross_cats_sorted":[],"title_canon_sha256":"3b114f6bf2cf0c65a7fd2f518a22e238ff22c2d4e47476dce3501d53a0781dfd","abstract_canon_sha256":"d2a9f27fd3c425d460f6cf2d6070342d3e8132ebe6b35c88890848dec7a8b906"},"schema_version":"1.0"},"canonical_sha256":"b2e43aaca737b2ab052be6be54ed8dadd84c3d83b3b6a66101c1fc8133ee4271","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.611272Z","signature_b64":"/P0uzZoYr7dl/uBtDXX9r+4BDRhYS4l+Tcf1U+X3MbnAV9tcLhltaPHlre44raFrMOs8HG8vDT/XHr5N50JCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2e43aaca737b2ab052be6be54ed8dadd84c3d83b3b6a66101c1fc8133ee4271","last_reissued_at":"2026-05-18T01:59:59.610781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.610781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.08127","source_version":1,"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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CpbGBB0+Sq39X5zIZzMWA+7NYWK0O8cLjOqCknykhaOP+TuO2yv/r/sU7uUk6ae0mEikv0evxjcun8fMDILICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:43:07.572896Z"},"content_sha256":"a988bd5afdfce5637b6ad974c946c7adc1348254d4d11a58b7922d47ec70cdcf","schema_version":"1.0","event_id":"sha256:a988bd5afdfce5637b6ad974c946c7adc1348254d4d11a58b7922d47ec70cdcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WLSDVLFHG6ZKWBJL427FJ3MNVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal results for Berge-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory Palmer, D\\'aniel Gerbner","submitted_at":"2015-05-29T18:02:08Z","abstract_excerpt":"Let $G$ be a graph and $\\mathcal{H}$ be a hypergraph both on the same vertex set. We say that a hypergraph $\\mathcal{H}$ is a \\emph{Berge}-$G$ if there is a bijection $f : E(G) \\rightarrow E(\\mathcal{H})$ such that for $e \\in E(G)$ we have $e \\subset f(e)$. This generalizes the established definitions of \"Berge path\" and \"Berge cycle\" to general graphs. For a fixed graph $G$ we examine the maximum possible size (i.e.\\ the sum of the cardinality of each edge) of a hypergraph with no Berge-$G$ as a subhypergraph. In the present paper we prove general bounds for this maximum when $G$ is an arbitr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08127","kind":"arxiv","version":1},"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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"enb/6HclOdz2s3ZfAUx0/siVPnUD4IDO6sQdVnUNBZKl+5KeKHeTdW0PKh4K9Vdls3ELQrgDRwBUgjx9TPZmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:43:07.573247Z"},"content_sha256":"c43dcd1d092bb1cb5f5d3e7e872bd458956f06ba7c2d6e528661a31db31e794b","schema_version":"1.0","event_id":"sha256:c43dcd1d092bb1cb5f5d3e7e872bd458956f06ba7c2d6e528661a31db31e794b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX/bundle.json","state_url":"https://pith.science/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX/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-06-04T21:43:07Z","links":{"resolver":"https://pith.science/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX","bundle":"https://pith.science/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX/bundle.json","state":"https://pith.science/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLSDVLFHG6ZKWBJL427FJ3MNVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WLSDVLFHG6ZKWBJL427FJ3MNVX","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":"d2a9f27fd3c425d460f6cf2d6070342d3e8132ebe6b35c88890848dec7a8b906","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T18:02:08Z","title_canon_sha256":"3b114f6bf2cf0c65a7fd2f518a22e238ff22c2d4e47476dce3501d53a0781dfd"},"schema_version":"1.0","source":{"id":"1505.08127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08127","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08127v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08127","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"WLSDVLFHG6ZK","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WLSDVLFHG6ZKWBJL","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WLSDVLFH","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:c43dcd1d092bb1cb5f5d3e7e872bd458956f06ba7c2d6e528661a31db31e794b","target":"graph","created_at":"2026-05-18T01:59:59Z","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 $G$ be a graph and $\\mathcal{H}$ be a hypergraph both on the same vertex set. We say that a hypergraph $\\mathcal{H}$ is a \\emph{Berge}-$G$ if there is a bijection $f : E(G) \\rightarrow E(\\mathcal{H})$ such that for $e \\in E(G)$ we have $e \\subset f(e)$. This generalizes the established definitions of \"Berge path\" and \"Berge cycle\" to general graphs. For a fixed graph $G$ we examine the maximum possible size (i.e.\\ the sum of the cardinality of each edge) of a hypergraph with no Berge-$G$ as a subhypergraph. In the present paper we prove general bounds for this maximum when $G$ is an arbitr","authors_text":"Cory Palmer, D\\'aniel Gerbner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T18:02:08Z","title":"Extremal results for Berge-hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08127","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:a988bd5afdfce5637b6ad974c946c7adc1348254d4d11a58b7922d47ec70cdcf","target":"record","created_at":"2026-05-18T01:59:59Z","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":"d2a9f27fd3c425d460f6cf2d6070342d3e8132ebe6b35c88890848dec7a8b906","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T18:02:08Z","title_canon_sha256":"3b114f6bf2cf0c65a7fd2f518a22e238ff22c2d4e47476dce3501d53a0781dfd"},"schema_version":"1.0","source":{"id":"1505.08127","kind":"arxiv","version":1}},"canonical_sha256":"b2e43aaca737b2ab052be6be54ed8dadd84c3d83b3b6a66101c1fc8133ee4271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2e43aaca737b2ab052be6be54ed8dadd84c3d83b3b6a66101c1fc8133ee4271","first_computed_at":"2026-05-18T01:59:59.610781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.610781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/P0uzZoYr7dl/uBtDXX9r+4BDRhYS4l+Tcf1U+X3MbnAV9tcLhltaPHlre44raFrMOs8HG8vDT/XHr5N50JCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.611272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a988bd5afdfce5637b6ad974c946c7adc1348254d4d11a58b7922d47ec70cdcf","sha256:c43dcd1d092bb1cb5f5d3e7e872bd458956f06ba7c2d6e528661a31db31e794b"],"state_sha256":"bf8124b8434b87fd2d6bcdea4190e1473fd7bc8d61d1af1267f9d8c0a2018949"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/si2jZutVoMq/NalRxIv3n9Cz3Boc5MsFT+zheBDby4S+v+QEzYlHawXAWVzl8kk50zV2f58f235JgCKMahAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:43:07.575231Z","bundle_sha256":"20d54f6863bc28cd130109561b487871737fb860ccc02a51b69df32ec070f858"}}