{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UJZSEAJ7372IX5OVLHMUG4U2SC","short_pith_number":"pith:UJZSEAJ7","canonical_record":{"source":{"id":"1812.00472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-02T21:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"b318f188c071cc905af8c9bcd113709c8cb3851faaf46758f5f942cbcc1e7af6","abstract_canon_sha256":"842f19d09ce01acf0cf533482f73a0d82090b684e1810a42694907573ff25a86"},"schema_version":"1.0"},"canonical_sha256":"a27322013fdff48bf5d559d943729a90a6520c3f424774cfe18875a170923f83","source":{"kind":"arxiv","id":"1812.00472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00472","created_at":"2026-05-17T23:59:21Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00472v1","created_at":"2026-05-17T23:59:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00472","created_at":"2026-05-17T23:59:21Z"},{"alias_kind":"pith_short_12","alias_value":"UJZSEAJ7372I","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UJZSEAJ7372IX5OV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UJZSEAJ7","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UJZSEAJ7372IX5OVLHMUG4U2SC","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-02T21:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"b318f188c071cc905af8c9bcd113709c8cb3851faaf46758f5f942cbcc1e7af6","abstract_canon_sha256":"842f19d09ce01acf0cf533482f73a0d82090b684e1810a42694907573ff25a86"},"schema_version":"1.0"},"canonical_sha256":"a27322013fdff48bf5d559d943729a90a6520c3f424774cfe18875a170923f83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:21.248179Z","signature_b64":"IZ0tjk4/dsLJ4eezsMowi/zC462hQTzFxVdczJOyojeIIVzc3ZfkR+ZVl0LQhtLlYdmhV0fzAGC3Vx/eOrQtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a27322013fdff48bf5d559d943729a90a6520c3f424774cfe18875a170923f83","last_reissued_at":"2026-05-17T23:59:21.247598Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:21.247598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00472","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-17T23:59:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lw81RslB/zJOmaa0LVM5HNDK9Wk1lMFvRE45j3VsgrTMz8KvHcF0sfBcfM3aAgusMR0J+iSM21NVccCY05ioCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:31:01.562953Z"},"content_sha256":"1e4b3893887459ad49e5f4cc4be84f7c12e2d42a0af0cf9165601115c1ba7fc7","schema_version":"1.0","event_id":"sha256:1e4b3893887459ad49e5f4cc4be84f7c12e2d42a0af0cf9165601115c1ba7fc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UJZSEAJ7372IX5OVLHMUG4U2SC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly-Regular Hypergraphs and Saturation of Berge Stars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bethany Austhof, Sean English","submitted_at":"2018-12-02T21:44:36Z","abstract_excerpt":"Given a graph $G$, we say a $k$-uniform hypergraph $H$ on the same vertex set contains a Berge-$G$ if there exists an injection $\\phi:E(G)\\to E(H)$ such that $e\\subseteq\\phi(e)$ for each edge $e\\in E(G)$. A hypergraph $H$ is Berge-$G$-saturated if $H$ does not contain a Berge-$G$, but adding any edge to $H$ creates a Berge-$G$. The saturation number for Berge-$G$, denoted $\\mathrm{sat}_k(n,\\text{Berge-}G)$ is the least number of edges in a $k$-uniform hypergraph that is Berge-$G$-saturated. We determine exactly the value of the saturation numbers for Berge stars. As a tool for our main result,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00472","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-17T23:59:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csW/4g9S89pMElwgz8pVbpMN5sb2WBdgXcnupDB9h1P6OWhmhIwKfVHo4EB+qum//t0YYxsXIc3p9315ck0lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:31:01.563312Z"},"content_sha256":"e7ecacb655cfd8932892598e1a29c8348558090eb3a1e35e0a18a3912bf6b2ad","schema_version":"1.0","event_id":"sha256:e7ecacb655cfd8932892598e1a29c8348558090eb3a1e35e0a18a3912bf6b2ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/bundle.json","state_url":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/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-25T10:31:01Z","links":{"resolver":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC","bundle":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/bundle.json","state":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UJZSEAJ7372IX5OVLHMUG4U2SC","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":"842f19d09ce01acf0cf533482f73a0d82090b684e1810a42694907573ff25a86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-02T21:44:36Z","title_canon_sha256":"b318f188c071cc905af8c9bcd113709c8cb3851faaf46758f5f942cbcc1e7af6"},"schema_version":"1.0","source":{"id":"1812.00472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00472","created_at":"2026-05-17T23:59:21Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00472v1","created_at":"2026-05-17T23:59:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00472","created_at":"2026-05-17T23:59:21Z"},{"alias_kind":"pith_short_12","alias_value":"UJZSEAJ7372I","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UJZSEAJ7372IX5OV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UJZSEAJ7","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:e7ecacb655cfd8932892598e1a29c8348558090eb3a1e35e0a18a3912bf6b2ad","target":"graph","created_at":"2026-05-17T23:59: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":"Given a graph $G$, we say a $k$-uniform hypergraph $H$ on the same vertex set contains a Berge-$G$ if there exists an injection $\\phi:E(G)\\to E(H)$ such that $e\\subseteq\\phi(e)$ for each edge $e\\in E(G)$. A hypergraph $H$ is Berge-$G$-saturated if $H$ does not contain a Berge-$G$, but adding any edge to $H$ creates a Berge-$G$. The saturation number for Berge-$G$, denoted $\\mathrm{sat}_k(n,\\text{Berge-}G)$ is the least number of edges in a $k$-uniform hypergraph that is Berge-$G$-saturated. We determine exactly the value of the saturation numbers for Berge stars. As a tool for our main result,","authors_text":"Bethany Austhof, Sean English","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-02T21:44:36Z","title":"Nearly-Regular Hypergraphs and Saturation of Berge Stars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00472","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:1e4b3893887459ad49e5f4cc4be84f7c12e2d42a0af0cf9165601115c1ba7fc7","target":"record","created_at":"2026-05-17T23:59: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":"842f19d09ce01acf0cf533482f73a0d82090b684e1810a42694907573ff25a86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-02T21:44:36Z","title_canon_sha256":"b318f188c071cc905af8c9bcd113709c8cb3851faaf46758f5f942cbcc1e7af6"},"schema_version":"1.0","source":{"id":"1812.00472","kind":"arxiv","version":1}},"canonical_sha256":"a27322013fdff48bf5d559d943729a90a6520c3f424774cfe18875a170923f83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a27322013fdff48bf5d559d943729a90a6520c3f424774cfe18875a170923f83","first_computed_at":"2026-05-17T23:59:21.247598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:21.247598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IZ0tjk4/dsLJ4eezsMowi/zC462hQTzFxVdczJOyojeIIVzc3ZfkR+ZVl0LQhtLlYdmhV0fzAGC3Vx/eOrQtAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:21.248179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e4b3893887459ad49e5f4cc4be84f7c12e2d42a0af0cf9165601115c1ba7fc7","sha256:e7ecacb655cfd8932892598e1a29c8348558090eb3a1e35e0a18a3912bf6b2ad"],"state_sha256":"f98e0e6db6eb8231c8101aed5d6e16b3e3f19b8ab4772a9177e0f056ddb1e05a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRFKIoXb8Gvq1iNiNyKFNDMza82tW40upIYHb2n1glasjCy7oFHqTzeruh9yOASIOrRvATKxsb+UKEeOvQMFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:31:01.565287Z","bundle_sha256":"5a51a23899e76b903b5996a5d730ea0d506783bab1874f455c16c80e949ce817"}}