{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Y57OZFKUZTVAL5A74SI6A4IW7Q","short_pith_number":"pith:Y57OZFKU","canonical_record":{"source":{"id":"1902.03398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T10:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"0444d4a5ba0ba06cb59a39cf898fd25219b53d3a3169561188ebebf60090b39f","abstract_canon_sha256":"247cfcb780fdeffc09bbfb2f74f84557e9466d3d4670a6d19850cb804ea42420"},"schema_version":"1.0"},"canonical_sha256":"c77eec9554ccea05f41fe491e07116fc35e1a812d1520d1eeafd91b0baa85ebc","source":{"kind":"arxiv","id":"1902.03398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03398","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03398v2","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03398","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"pith_short_12","alias_value":"Y57OZFKUZTVA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y57OZFKUZTVAL5A7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y57OZFKU","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Y57OZFKUZTVAL5A74SI6A4IW7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T10:10:36Z","cross_cats_sorted":[],"title_canon_sha256":"0444d4a5ba0ba06cb59a39cf898fd25219b53d3a3169561188ebebf60090b39f","abstract_canon_sha256":"247cfcb780fdeffc09bbfb2f74f84557e9466d3d4670a6d19850cb804ea42420"},"schema_version":"1.0"},"canonical_sha256":"c77eec9554ccea05f41fe491e07116fc35e1a812d1520d1eeafd91b0baa85ebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:21.139098Z","signature_b64":"KpEa9/gJg3Z6RVwYwkW2pi7iF3vY6XcTe+31kt4N9gx89IuqLSw7qgPpiLb0NbnQosXGZYD0TeObnN1uiUdpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c77eec9554ccea05f41fe491e07116fc35e1a812d1520d1eeafd91b0baa85ebc","last_reissued_at":"2026-05-17T23:51:21.138637Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:21.138637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03398","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:51:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNECTqiquenFXzlhO82V8jB7xWoDEjz7t/rT6Vrum5hc0i0drhE3ZPxCqkrXZt/XDgPU247rHzlpRVY1ePELAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:05:11.664179Z"},"content_sha256":"21fb37316188ad9bd7315354fe2de0be3067316e876dbe87dd80b6572409868a","schema_version":"1.0","event_id":"sha256:21fb37316188ad9bd7315354fe2de0be3067316e876dbe87dd80b6572409868a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Y57OZFKUZTVAL5A74SI6A4IW7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the weight of Berge-$F$-free hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Cory Palmer, D\\'aniel Gerbner, Sean English","submitted_at":"2019-02-09T10:10:36Z","abstract_excerpt":"For a graph $F$, we say a hypergraph is a Berge-$F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is a Berge-$F$. The weight of a non-uniform hypergraph $\\mathcal{H}$ is the quantity $\\sum_{h \\in E(\\mathcal{H})} |h|$.\n  Suppose $\\mathcal{H}$ is a Berge-$F$-free hypergraph on $n$ vertices. In this short note, we prove that as long as every edge of $\\mathcal{H}$ has size at least the Ramsey number of $F$ and at most $o(n)$, the weight of $\\mathcal{H}$ is $o(n^2)$. This result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03398","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:51:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzN5SzFuiyzkKoXyKv8ObFXb5L9CiGrByX8Ct/Pw1EBSBZCWjajmvgqZkO0cUQcTL2zhFeZ26pP5F6Ad0IjNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:05:11.664551Z"},"content_sha256":"83dd7b090ceefa51c9f2da09ea1aa85a9c38015ba681579e595e7df2eff01b25","schema_version":"1.0","event_id":"sha256:83dd7b090ceefa51c9f2da09ea1aa85a9c38015ba681579e595e7df2eff01b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q/bundle.json","state_url":"https://pith.science/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q/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-25T11:05:11Z","links":{"resolver":"https://pith.science/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q","bundle":"https://pith.science/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q/bundle.json","state":"https://pith.science/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y57OZFKUZTVAL5A74SI6A4IW7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Y57OZFKUZTVAL5A74SI6A4IW7Q","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":"247cfcb780fdeffc09bbfb2f74f84557e9466d3d4670a6d19850cb804ea42420","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T10:10:36Z","title_canon_sha256":"0444d4a5ba0ba06cb59a39cf898fd25219b53d3a3169561188ebebf60090b39f"},"schema_version":"1.0","source":{"id":"1902.03398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03398","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03398v2","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03398","created_at":"2026-05-17T23:51:21Z"},{"alias_kind":"pith_short_12","alias_value":"Y57OZFKUZTVA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y57OZFKUZTVAL5A7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y57OZFKU","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:83dd7b090ceefa51c9f2da09ea1aa85a9c38015ba681579e595e7df2eff01b25","target":"graph","created_at":"2026-05-17T23:51:21Z","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$, we say a hypergraph is a Berge-$F$ if it can be obtained from $F$ by replacing each edge of $F$ with a hyperedge containing it. A hypergraph is Berge-$F$-free if it does not contain a subhypergraph that is a Berge-$F$. The weight of a non-uniform hypergraph $\\mathcal{H}$ is the quantity $\\sum_{h \\in E(\\mathcal{H})} |h|$.\n  Suppose $\\mathcal{H}$ is a Berge-$F$-free hypergraph on $n$ vertices. In this short note, we prove that as long as every edge of $\\mathcal{H}$ has size at least the Ramsey number of $F$ and at most $o(n)$, the weight of $\\mathcal{H}$ is $o(n^2)$. This result","authors_text":"Abhishek Methuku, Cory Palmer, D\\'aniel Gerbner, Sean English","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T10:10:36Z","title":"On the weight of Berge-$F$-free hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03398","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:21fb37316188ad9bd7315354fe2de0be3067316e876dbe87dd80b6572409868a","target":"record","created_at":"2026-05-17T23:51:21Z","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":"247cfcb780fdeffc09bbfb2f74f84557e9466d3d4670a6d19850cb804ea42420","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-09T10:10:36Z","title_canon_sha256":"0444d4a5ba0ba06cb59a39cf898fd25219b53d3a3169561188ebebf60090b39f"},"schema_version":"1.0","source":{"id":"1902.03398","kind":"arxiv","version":2}},"canonical_sha256":"c77eec9554ccea05f41fe491e07116fc35e1a812d1520d1eeafd91b0baa85ebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c77eec9554ccea05f41fe491e07116fc35e1a812d1520d1eeafd91b0baa85ebc","first_computed_at":"2026-05-17T23:51:21.138637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:21.138637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KpEa9/gJg3Z6RVwYwkW2pi7iF3vY6XcTe+31kt4N9gx89IuqLSw7qgPpiLb0NbnQosXGZYD0TeObnN1uiUdpBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:21.139098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21fb37316188ad9bd7315354fe2de0be3067316e876dbe87dd80b6572409868a","sha256:83dd7b090ceefa51c9f2da09ea1aa85a9c38015ba681579e595e7df2eff01b25"],"state_sha256":"fb72e78e0464014b09960f1d77d86598b48ea3c9a90be31f76c0c376c23c2e39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsn3QOL62b8ZQ+mu0NUpGOkmNriu15LDXGSOiMd8O7JcxqECDUb34JMfJNiskPLA+g6dTnIkeNVsZ/dm2FmyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:05:11.666645Z","bundle_sha256":"29ce0687a17fc69dae69475ab24a3ec71139f444de8ec0609e8f158f793c0558"}}