{"entities":{"Q1126216":{"pageid":1136965,"ns":120,"title":"Item:Q1126216","lastrevid":69702279,"modified":"2026-04-13T08:49:32Z","type":"item","id":"Q1126216","labels":{"en":{"language":"en","value":"Minimal coverings of uniform hypergraphs and \\(P\\)-recursiveness"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 955103"}},"aliases":{},"claims":{"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":"Q1126216$30FE8876-0BD8-4565-BF91-75C3A2E69F54","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f2adee706735cbb50ad0731241904551815a5af2","datavalue":{"value":{"text":"Minimal coverings of uniform hypergraphs and \\(P\\)-recursiveness","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1126216$00BCC61C-671B-4DF6-8E91-6DE1AD406F8D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3c81ca11c487b1bd9a8580b256359d027c4eaa93","datavalue":{"value":"0863.05061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1126216$A3E935A5-E619-453B-8E91-50B749312357","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"664e71942ac96ceb238094ff6eb0baba3b5d3b80","datavalue":{"value":"10.1016/0012-365X(95)00084-A","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1126216$2EFE8749-391F-422D-8D08-024CC307587B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"89d7548db43544d308760ad23e72320ae7797c37","datavalue":{"value":{"entity-type":"item","numeric-id":1126215,"id":"Q1126215"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$B39B7532-105D-4E6B-9E43-D353B73BC8ED","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"38665fe4ed2b835132254a58832c329597060029","datavalue":{"value":{"entity-type":"item","numeric-id":175483,"id":"Q175483"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$CEF08174-2CB2-4D2E-834D-26DF237E2616","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"28164914b4be3d1db4cf2c74e16c2af70cce620e","datavalue":{"value":{"time":"+1997-05-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1126216$23623B9F-8AB5-4B21-B8B0-AAAF05BE6290","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8f92a26644da24943e950d6d83b8dc8de3ac2415","datavalue":{"value":"It is proved that the minimal coverings of 3-uniform hypergraphs and 3-partite hypergraphs can be enumerated by means of \\(P\\)-recursive functions.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1126216$E7C43CA7-BE2D-4FF9-926B-C3548E3DD9DB","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"ce70e08f359ed7435e6c66093a6c5d03448fc834","datavalue":{"value":{"entity-type":"item","numeric-id":199001,"id":"Q199001"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$09705009-6A7A-4E4B-AF57-BCBED51AE153","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"a09872c507729d29e1c1613e820db567c4517089","datavalue":{"value":"05C65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1126216$056DBFE6-5147-4F12-8A5C-7CD252A3BBEB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"404d668a9da3f8f0717507eb321875b528014fe8","datavalue":{"value":"955103","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1126216$E35F249C-F2B1-445E-9BAF-7B9B4C65CE3B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"37ca513d79a42851dc819987381fef83d86117ab","datavalue":{"value":"coverings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1126216$AC473CF3-DD48-488B-B92B-09CEDE702BDE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"370afb08886d454ad02a3e32ab188f88b9fed55c","datavalue":{"value":"hypergraphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1126216$32B3676B-0C64-4509-9071-9A38D4232D9A","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":"Q1126216$52BE6640-9E60-43C8-9AA5-1915DEFFD7BB","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"94d0a1478166e8c9cbda0d279b7223d252d5dbc3","datavalue":{"value":{"entity-type":"item","numeric-id":1910527,"id":"Q1910527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$137C7404-C521-4D6B-AFCF-7DF83EB9FD71","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"25c630bd26c81455ea04b41e0046994ab243252a","datavalue":{"value":{"entity-type":"item","numeric-id":916659,"id":"Q916659"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$0530A5C1-61A9-44B7-A6FE-C5141B4F7F90","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9f5c2825d2d2a2c332921f3a91befa3c0eddf4ba","datavalue":{"value":{"entity-type":"item","numeric-id":3947818,"id":"Q3947818"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$84980E70-FBA9-46F7-AF1F-FC79AB1A28A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6008497b77b3f32230f88fa41be4f8753bdee162","datavalue":{"value":{"entity-type":"item","numeric-id":1145145,"id":"Q1145145"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$1C988A0D-CE8A-46A6-996E-18D1792DBCBF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ed15383b3c0fe446ca05f74154aae7cc6e56c2c3","datavalue":{"value":{"entity-type":"item","numeric-id":1916141,"id":"Q1916141"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1126216$7FFFF0A5-5CBB-4C69-B674-0D3EE4CC6E25","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Minimal coverings of uniform hypergraphs and \\(P\\)-recursiveness","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Minimal_coverings_of_uniform_hypergraphs_and_%5C(P%5C)-recursiveness"}}}}}