{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M772AWIDJLMNTZG6JLHB7W6F4D","short_pith_number":"pith:M772AWID","schema_version":"1.0","canonical_sha256":"67ffa059034ad8d9e4de4ace1fdbc5e0ff1c912d56e54e647d572b89a4d7a0f5","source":{"kind":"arxiv","id":"1810.12734","version":1},"attestation_state":"computed","paper":{"title":"A note on saturation for Berge-G hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Winter, Maria Axenovich","submitted_at":"2018-10-30T13:49:08Z","abstract_excerpt":"For a graph G, a hypergraph H is called Berge-G if there is a hypergraph H', isomorphic to H, containing all vertices of G, so that e is contained in f(e) for each edge e of G, where f is a bijection between E(G) and E(H'). The set of all Berge-G hypergraphs is denoted B(G). A hypergraph H is called Berge-G saturated if it does not contain any subhypergraph from B(G), but adding any new hyperedge of size at least 2 to H creates such a subhypergraph. Each Berge-G saturated hypergraph has at least |E(G)|-1 hyperedges. We show that for each graph G that is not a certain star and for any n at leas"},"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":"1810.12734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-30T13:49:08Z","cross_cats_sorted":[],"title_canon_sha256":"34481393196d12aba83ab30299166974e4000fc7c7c02eaba706cf0b543082d6","abstract_canon_sha256":"b3cdf7eac8d5611846ba127f60540ca759ec406e7e41ff7cc179c13257403812"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:54.292721Z","signature_b64":"HJpTzNJAFV3O43fKQXIK9Wlxbwj3KZKaU16diV2yw/6vkmIG2BHstHt+J40Cc9zock/wS3nwYom5Y3Cqv+1UCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ffa059034ad8d9e4de4ace1fdbc5e0ff1c912d56e54e647d572b89a4d7a0f5","last_reissued_at":"2026-05-18T00:01:54.292276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:54.292276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on saturation for Berge-G hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Winter, Maria Axenovich","submitted_at":"2018-10-30T13:49:08Z","abstract_excerpt":"For a graph G, a hypergraph H is called Berge-G if there is a hypergraph H', isomorphic to H, containing all vertices of G, so that e is contained in f(e) for each edge e of G, where f is a bijection between E(G) and E(H'). The set of all Berge-G hypergraphs is denoted B(G). A hypergraph H is called Berge-G saturated if it does not contain any subhypergraph from B(G), but adding any new hyperedge of size at least 2 to H creates such a subhypergraph. Each Berge-G saturated hypergraph has at least |E(G)|-1 hyperedges. We show that for each graph G that is not a certain star and for any n at leas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12734","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":"1810.12734","created_at":"2026-05-18T00:01:54.292356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12734v1","created_at":"2026-05-18T00:01:54.292356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12734","created_at":"2026-05-18T00:01:54.292356+00:00"},{"alias_kind":"pith_short_12","alias_value":"M772AWIDJLMN","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M772AWIDJLMNTZG6","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M772AWID","created_at":"2026-05-18T12:32:37.024351+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/M772AWIDJLMNTZG6JLHB7W6F4D","json":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D.json","graph_json":"https://pith.science/api/pith-number/M772AWIDJLMNTZG6JLHB7W6F4D/graph.json","events_json":"https://pith.science/api/pith-number/M772AWIDJLMNTZG6JLHB7W6F4D/events.json","paper":"https://pith.science/paper/M772AWID"},"agent_actions":{"view_html":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D","download_json":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D.json","view_paper":"https://pith.science/paper/M772AWID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12734&json=true","fetch_graph":"https://pith.science/api/pith-number/M772AWIDJLMNTZG6JLHB7W6F4D/graph.json","fetch_events":"https://pith.science/api/pith-number/M772AWIDJLMNTZG6JLHB7W6F4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/action/storage_attestation","attest_author":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/action/author_attestation","sign_citation":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/action/citation_signature","submit_replication":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/action/replication_record"}},"created_at":"2026-05-18T00:01:54.292356+00:00","updated_at":"2026-05-18T00:01:54.292356+00:00"}