{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4973641","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4973641","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4973641","kernelVersion":"v1","immutable":true,"modified":"2025-05-08T03:29:25Z","fdo:hasComponent":[{"@id":"#fulltext","componentId":"fulltext","mediaType":"application/pdf"}]},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4973641","name":"Enumeration and randomized constructions of hypertrees","headline":"Enumeration and randomized constructions of hypertrees","description":"scientific article; zbMATH DE number 7138331","url":"https://portal.mardi4nfdi.de/entity/Q4973641","datePublished":"2019-11-28","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q178480"},{"@id":"https://portal.mardi4nfdi.de/entity/Q322220"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q6486797"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1002/RSA.20841","url":"https://doi.org/10.1002/RSA.20841"},"sameAs":["https://doi.org/10.1002/RSA.20841"]},"provenance":{"prov:generatedAtTime":"2025-05-08T03:29:25Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}