{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PB7GQ23DMOLEOAR54BYGY2YNUL","short_pith_number":"pith:PB7GQ23D","canonical_record":{"source":{"id":"1605.01578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T13:10:39Z","cross_cats_sorted":[],"title_canon_sha256":"62b5f2288a30cd390aec3b4f55b00689a3d34b821622d2a91b55a99fbce241c0","abstract_canon_sha256":"8fda11427c7b4e3ddeae918554fc616a159f6a316cd7b0227aac2a21df3978fb"},"schema_version":"1.0"},"canonical_sha256":"787e686b63639647023de0706c6b0da2ee108cb59cb208558e5567c9cd00caf0","source":{"kind":"arxiv","id":"1605.01578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01578","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01578v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01578","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"PB7GQ23DMOLE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PB7GQ23DMOLEOAR5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PB7GQ23D","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PB7GQ23DMOLEOAR54BYGY2YNUL","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T13:10:39Z","cross_cats_sorted":[],"title_canon_sha256":"62b5f2288a30cd390aec3b4f55b00689a3d34b821622d2a91b55a99fbce241c0","abstract_canon_sha256":"8fda11427c7b4e3ddeae918554fc616a159f6a316cd7b0227aac2a21df3978fb"},"schema_version":"1.0"},"canonical_sha256":"787e686b63639647023de0706c6b0da2ee108cb59cb208558e5567c9cd00caf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.245748Z","signature_b64":"988I2WW2YwfGjF00jh6sSEJFqV8ZfcOnAnkIIqNqSTwOOX8fegYgc9PpneHYJ+hmJT7oi0kJepoqCU35t0dkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787e686b63639647023de0706c6b0da2ee108cb59cb208558e5567c9cd00caf0","last_reissued_at":"2026-05-18T01:15:33.244983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.244983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01578","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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8vchitOfOTku5kbNdozxsFNwYIlRVyCQAo3UyLXPzjE5QFDxt+YKF3GNDQMiyp2O/zMwaFQXsjexR7QV8IfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:48:59.212293Z"},"content_sha256":"918b1596929fd171e116430b91fd0726b6a060a2a2a64421a015cc0388a95c8f","schema_version":"1.0","event_id":"sha256:918b1596929fd171e116430b91fd0726b6a060a2a2a64421a015cc0388a95c8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PB7GQ23DMOLEOAR54BYGY2YNUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform hypergraphs and dominating sets of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaume Mart\\'i-Farr\\'e, Jos\\'e Luis Ruiz, Merc\\`e Mora","submitted_at":"2016-05-05T13:10:39Z","abstract_excerpt":"A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H. Given a hypergraph, we are interested in determining if it is a domination hypergraph and, if this is not the case, we want to find domination hypergraphs in some sense close to it, the domination completions. Here we will focus on the family of hypergraphs containing all the subsets with the same cardinality, the uniform hypergraphs of maximum size. Specifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01578","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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBQCp+usx1h5RDSOf8pxzO3hDQIXqMeQ8iG0fg6sDtLlZk6tgsSLh3zAgn1GKixjlBaTmQ9bLIDYTiKE/Ol3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:48:59.213415Z"},"content_sha256":"1b352fc959b6d80934d55b348b564f36ed784fdd5757d54e25702a67bec35ed2","schema_version":"1.0","event_id":"sha256:1b352fc959b6d80934d55b348b564f36ed784fdd5757d54e25702a67bec35ed2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB7GQ23DMOLEOAR54BYGY2YNUL/bundle.json","state_url":"https://pith.science/pith/PB7GQ23DMOLEOAR54BYGY2YNUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB7GQ23DMOLEOAR54BYGY2YNUL/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-25T18:48:59Z","links":{"resolver":"https://pith.science/pith/PB7GQ23DMOLEOAR54BYGY2YNUL","bundle":"https://pith.science/pith/PB7GQ23DMOLEOAR54BYGY2YNUL/bundle.json","state":"https://pith.science/pith/PB7GQ23DMOLEOAR54BYGY2YNUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB7GQ23DMOLEOAR54BYGY2YNUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PB7GQ23DMOLEOAR54BYGY2YNUL","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":"8fda11427c7b4e3ddeae918554fc616a159f6a316cd7b0227aac2a21df3978fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T13:10:39Z","title_canon_sha256":"62b5f2288a30cd390aec3b4f55b00689a3d34b821622d2a91b55a99fbce241c0"},"schema_version":"1.0","source":{"id":"1605.01578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01578","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01578v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01578","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"PB7GQ23DMOLE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PB7GQ23DMOLEOAR5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PB7GQ23D","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:1b352fc959b6d80934d55b348b564f36ed784fdd5757d54e25702a67bec35ed2","target":"graph","created_at":"2026-05-18T01:15:33Z","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":"A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H. Given a hypergraph, we are interested in determining if it is a domination hypergraph and, if this is not the case, we want to find domination hypergraphs in some sense close to it, the domination completions. Here we will focus on the family of hypergraphs containing all the subsets with the same cardinality, the uniform hypergraphs of maximum size. Specifi","authors_text":"Jaume Mart\\'i-Farr\\'e, Jos\\'e Luis Ruiz, Merc\\`e Mora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T13:10:39Z","title":"Uniform hypergraphs and dominating sets of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01578","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:918b1596929fd171e116430b91fd0726b6a060a2a2a64421a015cc0388a95c8f","target":"record","created_at":"2026-05-18T01:15:33Z","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":"8fda11427c7b4e3ddeae918554fc616a159f6a316cd7b0227aac2a21df3978fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-05T13:10:39Z","title_canon_sha256":"62b5f2288a30cd390aec3b4f55b00689a3d34b821622d2a91b55a99fbce241c0"},"schema_version":"1.0","source":{"id":"1605.01578","kind":"arxiv","version":1}},"canonical_sha256":"787e686b63639647023de0706c6b0da2ee108cb59cb208558e5567c9cd00caf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787e686b63639647023de0706c6b0da2ee108cb59cb208558e5567c9cd00caf0","first_computed_at":"2026-05-18T01:15:33.244983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:33.244983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"988I2WW2YwfGjF00jh6sSEJFqV8ZfcOnAnkIIqNqSTwOOX8fegYgc9PpneHYJ+hmJT7oi0kJepoqCU35t0dkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:33.245748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:918b1596929fd171e116430b91fd0726b6a060a2a2a64421a015cc0388a95c8f","sha256:1b352fc959b6d80934d55b348b564f36ed784fdd5757d54e25702a67bec35ed2"],"state_sha256":"d35e392fe54757f3d0c775e32e7c257efd72b5c404eafb362e628bb62ffe4f2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ohlf1ANzl+QEaaPhZEn/ZBoKiMmUfNII7V6TjuyeGSQ94d48f3B+JB6icAR+BwgJqXLfOoTtGxx6rjr7gNJYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:48:59.218196Z","bundle_sha256":"6942064dba591b50fecfc16ca0ac9f497667b981e35267ca2781821431ea771b"}}