{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7W32NSZ3J53UULSQ3JUDT4B5KX","short_pith_number":"pith:7W32NSZ3","canonical_record":{"source":{"id":"1807.06947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T14:01:55Z","cross_cats_sorted":[],"title_canon_sha256":"9f727aae2279290264c2799c614dae4ded4ce76e2603fed721e1c287c64261e0","abstract_canon_sha256":"2a8a64fedf8eabeff29306b1078ea3e98788597209a1b0eed1f1776a156c06ca"},"schema_version":"1.0"},"canonical_sha256":"fdb7a6cb3b4f774a2e50da6839f03d55d0b1a3be7926abacfe03d111733d09ed","source":{"kind":"arxiv","id":"1807.06947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06947","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06947v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06947","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"7W32NSZ3J53U","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7W32NSZ3J53UULSQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7W32NSZ3","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7W32NSZ3J53UULSQ3JUDT4B5KX","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T14:01:55Z","cross_cats_sorted":[],"title_canon_sha256":"9f727aae2279290264c2799c614dae4ded4ce76e2603fed721e1c287c64261e0","abstract_canon_sha256":"2a8a64fedf8eabeff29306b1078ea3e98788597209a1b0eed1f1776a156c06ca"},"schema_version":"1.0"},"canonical_sha256":"fdb7a6cb3b4f774a2e50da6839f03d55d0b1a3be7926abacfe03d111733d09ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:25.254467Z","signature_b64":"NTQI2cImdreOomvVof2f6Y0FBbrc4+XLUnfZNeKqx5dv7IXQeMXl3U9t9Vsb+xtRuNuLBjqqCOxT9tO1LnwLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdb7a6cb3b4f774a2e50da6839f03d55d0b1a3be7926abacfe03d111733d09ed","last_reissued_at":"2026-05-18T00:10:25.253902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:25.253902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06947","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-18T00:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t59GVS0AU9D6rIivAHbJWqtDV1zIrLGO/04HWrk96VlmAIByQyCsMzS825Z+0nquQM0OckaI3tYNgX3afkSuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:52:37.809834Z"},"content_sha256":"55227e88bbe4655fa52108a292e8f5421d9ed623c335e8b2282ba5e1f5f5b11d","schema_version":"1.0","event_id":"sha256:55227e88bbe4655fa52108a292e8f5421d9ed623c335e8b2282ba5e1f5f5b11d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7W32NSZ3J53UULSQ3JUDT4B5KX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearity of Saturation for Berge Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, Michael Tait, Sean English","submitted_at":"2018-07-18T14:01:55Z","abstract_excerpt":"For a graph $F$, we say a hypergraph $H$ is Berge-$F$ if it can be obtained from $F$ be replacing each edge of $F$ with a hyperedge containing it. We say a hypergraph is Berge-$F$-saturated if it does not contain a Berge-$F$, but adding any hyperedge creates a copy of Berge-$F$. The $k$-uniform saturation number of Berge-$F$, $\\mathrm{sat}_k(n,\\text{Berge-}F)$ is the fewest number of edges in a Berge-$F$-saturated $k$-uniform hypergraph on $n$ vertices. We show that $\\mathrm{sat}_k(n,\\text{Berge-}F) = O(n)$ for all graphs $F$ and uniformities $3\\leq k\\leq 5$, partially answering a conjecture o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06947","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-18T00:10:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lor+cNzZ8NIYc6kXH2Scs59U/K9d9lZUqpikmG0fO7uDRiG5QA2lKjWrEHt4NB51tK4XmwgNH4OoFjjja52OAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:52:37.810383Z"},"content_sha256":"f1ac4e406bf73e2189b1a2989350227c128ef2caca8166f6cd491281298fe18a","schema_version":"1.0","event_id":"sha256:f1ac4e406bf73e2189b1a2989350227c128ef2caca8166f6cd491281298fe18a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7W32NSZ3J53UULSQ3JUDT4B5KX/bundle.json","state_url":"https://pith.science/pith/7W32NSZ3J53UULSQ3JUDT4B5KX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7W32NSZ3J53UULSQ3JUDT4B5KX/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-04T08:52:37Z","links":{"resolver":"https://pith.science/pith/7W32NSZ3J53UULSQ3JUDT4B5KX","bundle":"https://pith.science/pith/7W32NSZ3J53UULSQ3JUDT4B5KX/bundle.json","state":"https://pith.science/pith/7W32NSZ3J53UULSQ3JUDT4B5KX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7W32NSZ3J53UULSQ3JUDT4B5KX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7W32NSZ3J53UULSQ3JUDT4B5KX","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":"2a8a64fedf8eabeff29306b1078ea3e98788597209a1b0eed1f1776a156c06ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T14:01:55Z","title_canon_sha256":"9f727aae2279290264c2799c614dae4ded4ce76e2603fed721e1c287c64261e0"},"schema_version":"1.0","source":{"id":"1807.06947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06947","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06947v1","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06947","created_at":"2026-05-18T00:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"7W32NSZ3J53U","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7W32NSZ3J53UULSQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7W32NSZ3","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:f1ac4e406bf73e2189b1a2989350227c128ef2caca8166f6cd491281298fe18a","target":"graph","created_at":"2026-05-18T00:10:25Z","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 $H$ is Berge-$F$ if it can be obtained from $F$ be replacing each edge of $F$ with a hyperedge containing it. We say a hypergraph is Berge-$F$-saturated if it does not contain a Berge-$F$, but adding any hyperedge creates a copy of Berge-$F$. The $k$-uniform saturation number of Berge-$F$, $\\mathrm{sat}_k(n,\\text{Berge-}F)$ is the fewest number of edges in a Berge-$F$-saturated $k$-uniform hypergraph on $n$ vertices. We show that $\\mathrm{sat}_k(n,\\text{Berge-}F) = O(n)$ for all graphs $F$ and uniformities $3\\leq k\\leq 5$, partially answering a conjecture o","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, Michael Tait, Sean English","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T14:01:55Z","title":"Linearity of Saturation for Berge Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06947","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:55227e88bbe4655fa52108a292e8f5421d9ed623c335e8b2282ba5e1f5f5b11d","target":"record","created_at":"2026-05-18T00:10:25Z","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":"2a8a64fedf8eabeff29306b1078ea3e98788597209a1b0eed1f1776a156c06ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T14:01:55Z","title_canon_sha256":"9f727aae2279290264c2799c614dae4ded4ce76e2603fed721e1c287c64261e0"},"schema_version":"1.0","source":{"id":"1807.06947","kind":"arxiv","version":1}},"canonical_sha256":"fdb7a6cb3b4f774a2e50da6839f03d55d0b1a3be7926abacfe03d111733d09ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdb7a6cb3b4f774a2e50da6839f03d55d0b1a3be7926abacfe03d111733d09ed","first_computed_at":"2026-05-18T00:10:25.253902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:25.253902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NTQI2cImdreOomvVof2f6Y0FBbrc4+XLUnfZNeKqx5dv7IXQeMXl3U9t9Vsb+xtRuNuLBjqqCOxT9tO1LnwLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:25.254467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55227e88bbe4655fa52108a292e8f5421d9ed623c335e8b2282ba5e1f5f5b11d","sha256:f1ac4e406bf73e2189b1a2989350227c128ef2caca8166f6cd491281298fe18a"],"state_sha256":"7c6da2c55fdebf3a31036258e4a3b60b6a43df66bece3e48330d6c61c7aaa21b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbWDbQPkT9cT9/oxkaV7NDzo2X+R8d6hjZMMoCtkTntpZuLXoqTyM7tD+XIQtY1kSC+60YYyOo+1d67/l8BfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:52:37.813296Z","bundle_sha256":"47c6626bfd43321b5c0f9f69769e34e8ef9ab3211b23614b557a7cded137729c"}}