{"entities":{"Q6740236":{"pageid":14459013,"ns":120,"title":"Item:Q6740236","lastrevid":105909770,"modified":"2026-10-21T12:58:58Z","type":"item","id":"Q6740236","labels":{"en":{"language":"en","value":"Towards an optimal hypergraph container lemma"}},"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":"Q6740236$3EDF99C9-D326-49D3-AB27-473D4E72E90E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fecb2f2a7c1f813db3a025a7dd8b5d82439618b9","datavalue":{"value":{"time":"+2024-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":"Q6740236$081C9370-346F-475F-A4E8-2652C21B206F","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"337da21e2ab924dce2d1d065d98208dc61f0bfc3","datavalue":{"value":"2408.06617","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6740236$2B8F8841-98E2-4E19-AA1E-129CF3CDDE8C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"09715a8a4949d80f8b991a06ae394222d01e599b","datavalue":{"value":{"entity-type":"item","numeric-id":2037846,"id":"Q2037846"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6740236$6E3C4B8B-BB07-4DD9-B922-0EB62727788E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a8013bc00783240c57786649bc43e422121684be","datavalue":{"value":{"entity-type":"item","numeric-id":285062,"id":"Q285062"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6740236$11CC3DCC-013F-47F1-9C35-2BB816E81EA2","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":"Q6740236$9E130387-4905-4F1B-8A17-BBD9959B9C37","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":"Q6740236$340B8950-DE0F-4533-999F-55A42E9A9B76","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Towards an optimal hypergraph container lemma","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Towards_an_optimal_hypergraph_container_lemma"}}}}}