{"entities":{"Q7166456":{"pageid":22116819,"ns":120,"title":"Item:Q7166456","lastrevid":107262725,"modified":"2026-10-23T12:48:51Z","type":"item","id":"Q7166456","labels":{"en":{"language":"en","value":"Embedding loose trees in $k$-uniform hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7166456$885B9581-D1E0-4950-B52B-090EE43E470C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7166456$EBBF191A-EE0C-48EE-BF1A-D84856827B06","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"a2f31a0430a3e5713ff954d95ff0e32f3a59efdf","datavalue":{"value":"2502.04783","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7166456$5E82316D-E37B-4FF9-8252-8DE03B08684D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"851671720cb27d3043665cb969a47dea5c637b98","datavalue":{"value":{"entity-type":"item","numeric-id":3359316,"id":"Q3359316"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7166456$1703F1EE-6F67-4E9E-8FB5-EA7FD065CABB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e7295267f5842374cd4ac32ed38ae1711edd516f","datavalue":{"value":{"entity-type":"item","numeric-id":322201,"id":"Q322201"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7166456$70023B6E-10B1-4F3A-883B-E57C66DA9404","rank":"normal"}],"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7166456$F79C6642-7BBE-42F1-9C76-B4CA0F1B197B","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7166456$990233BC-A206-429B-AC74-4F6A69AE15F5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Embedding loose trees in $k$-uniform hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Embedding_loose_trees_in_$k$-uniform_hypergraphs"}}}}}