{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UJZSEAJ7372IX5OVLHMUG4U2SC","short_pith_number":"pith:UJZSEAJ7","schema_version":"1.0","canonical_sha256":"a27322013fdff48bf5d559d943729a90a6520c3f424774cfe18875a170923f83","source":{"kind":"arxiv","id":"1812.00472","version":1},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.00472","created_at":"2026-05-17T23:59:21.247673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00472v1","created_at":"2026-05-17T23:59:21.247673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00472","created_at":"2026-05-17T23:59:21.247673+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJZSEAJ7372I","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJZSEAJ7372IX5OV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJZSEAJ7","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC","json":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC.json","graph_json":"https://pith.science/api/pith-number/UJZSEAJ7372IX5OVLHMUG4U2SC/graph.json","events_json":"https://pith.science/api/pith-number/UJZSEAJ7372IX5OVLHMUG4U2SC/events.json","paper":"https://pith.science/paper/UJZSEAJ7"},"agent_actions":{"view_html":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC","download_json":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC.json","view_paper":"https://pith.science/paper/UJZSEAJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00472&json=true","fetch_graph":"https://pith.science/api/pith-number/UJZSEAJ7372IX5OVLHMUG4U2SC/graph.json","fetch_events":"https://pith.science/api/pith-number/UJZSEAJ7372IX5OVLHMUG4U2SC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/action/storage_attestation","attest_author":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/action/author_attestation","sign_citation":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/action/citation_signature","submit_replication":"https://pith.science/pith/UJZSEAJ7372IX5OVLHMUG4U2SC/action/replication_record"}},"created_at":"2026-05-17T23:59:21.247673+00:00","updated_at":"2026-05-17T23:59:21.247673+00:00"}