{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M772AWIDJLMNTZG6JLHB7W6F4D","short_pith_number":"pith:M772AWID","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"},"canonical_sha256":"67ffa059034ad8d9e4de4ace1fdbc5e0ff1c912d56e54e647d572b89a4d7a0f5","source":{"kind":"arxiv","id":"1810.12734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12734","created_at":"2026-05-18T00:01:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12734v1","created_at":"2026-05-18T00:01:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12734","created_at":"2026-05-18T00:01:54Z"},{"alias_kind":"pith_short_12","alias_value":"M772AWIDJLMN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M772AWIDJLMNTZG6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M772AWID","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M772AWIDJLMNTZG6JLHB7W6F4D","target":"record","payload":{"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"},"canonical_sha256":"67ffa059034ad8d9e4de4ace1fdbc5e0ff1c912d56e54e647d572b89a4d7a0f5","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"},"source_kind":"arxiv","source_id":"1810.12734","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:01:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ed7t9+ij+hxkWNsP0NzjGECuiPsXjlbx7nxnnQ+Zsdtgq2QnJb0iAXcRabtPECY2d7jn1tebXJSJp3vaGIVODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:02:53.059812Z"},"content_sha256":"60140045912a1b239e5b4a0df6112e31a301cda7dd2f7339ab236e2b8a059d84","schema_version":"1.0","event_id":"sha256:60140045912a1b239e5b4a0df6112e31a301cda7dd2f7339ab236e2b8a059d84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M772AWIDJLMNTZG6JLHB7W6F4D","target":"graph","payload":{"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"},"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:01:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zVyEfLHlyRNngSDbb2W4kiNjNGm7iCVXAb+Qef18PAvvBaj8B/7MchO6xtaU/jUQdYwiMCV43Kz/r2fQ9vSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:02:53.060154Z"},"content_sha256":"7eb2b7954faac649f7be9466d773f94933e3b8b529d8ca95f7a6404670377da7","schema_version":"1.0","event_id":"sha256:7eb2b7954faac649f7be9466d773f94933e3b8b529d8ca95f7a6404670377da7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/bundle.json","state_url":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M772AWIDJLMNTZG6JLHB7W6F4D/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-05-19T13:02:53Z","links":{"resolver":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D","bundle":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/bundle.json","state":"https://pith.science/pith/M772AWIDJLMNTZG6JLHB7W6F4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M772AWIDJLMNTZG6JLHB7W6F4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M772AWIDJLMNTZG6JLHB7W6F4D","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":"b3cdf7eac8d5611846ba127f60540ca759ec406e7e41ff7cc179c13257403812","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-30T13:49:08Z","title_canon_sha256":"34481393196d12aba83ab30299166974e4000fc7c7c02eaba706cf0b543082d6"},"schema_version":"1.0","source":{"id":"1810.12734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12734","created_at":"2026-05-18T00:01:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12734v1","created_at":"2026-05-18T00:01:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12734","created_at":"2026-05-18T00:01:54Z"},{"alias_kind":"pith_short_12","alias_value":"M772AWIDJLMN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M772AWIDJLMNTZG6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M772AWID","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:7eb2b7954faac649f7be9466d773f94933e3b8b529d8ca95f7a6404670377da7","target":"graph","created_at":"2026-05-18T00:01:54Z","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 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","authors_text":"Christian Winter, Maria Axenovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-30T13:49:08Z","title":"A note on saturation for Berge-G hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12734","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:60140045912a1b239e5b4a0df6112e31a301cda7dd2f7339ab236e2b8a059d84","target":"record","created_at":"2026-05-18T00:01:54Z","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":"b3cdf7eac8d5611846ba127f60540ca759ec406e7e41ff7cc179c13257403812","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-30T13:49:08Z","title_canon_sha256":"34481393196d12aba83ab30299166974e4000fc7c7c02eaba706cf0b543082d6"},"schema_version":"1.0","source":{"id":"1810.12734","kind":"arxiv","version":1}},"canonical_sha256":"67ffa059034ad8d9e4de4ace1fdbc5e0ff1c912d56e54e647d572b89a4d7a0f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67ffa059034ad8d9e4de4ace1fdbc5e0ff1c912d56e54e647d572b89a4d7a0f5","first_computed_at":"2026-05-18T00:01:54.292276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:54.292276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HJpTzNJAFV3O43fKQXIK9Wlxbwj3KZKaU16diV2yw/6vkmIG2BHstHt+J40Cc9zock/wS3nwYom5Y3Cqv+1UCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:54.292721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60140045912a1b239e5b4a0df6112e31a301cda7dd2f7339ab236e2b8a059d84","sha256:7eb2b7954faac649f7be9466d773f94933e3b8b529d8ca95f7a6404670377da7"],"state_sha256":"5dd7b7e5fdd64cb8e8b13df9f76654da50c18dfe3b815831b207088c98969479"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HNMQyTYnO+J2Ewlpma7I3QOWl2nbbwT4pnRAY36G6J9Yk2AcFXdIjXdR0tH3TX2yfo9ieIjNFopLCPFLcRBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:02:53.061909Z","bundle_sha256":"bd5c2ef8ce1a2a3b84117fa53315f7bfe4c2d651c3e7017f49823a7d61d172bc"}}