{"entities":{"Q2788015":{"pageid":2798753,"ns":120,"title":"Item:Q2788015","lastrevid":83331494,"modified":"2026-05-07T07:15:21Z","type":"item","id":"Q2788015","labels":{"en":{"language":"en","value":"An algorithm for determining minimal covers of acyclic database schemes"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6550735"}},"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":"Q2788015$99F5CB31-C6BA-4564-8B35-2BC142EF378B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a6df9901e3527d3bedcede871e96049835c90ee1","datavalue":{"value":"1332.68043","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2788015$C213B284-35F9-45D7-A039-B7F88C08E1E9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d008098fecca008b1ada01d49f31ae5cfc2496c2","datavalue":{"value":{"entity-type":"item","numeric-id":364435,"id":"Q364435"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2788015$00EB770C-A561-4B8D-AE6F-A3F944164F53","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9161a7586b1f99ddba048fe828dbe3c3672696d2","datavalue":{"value":{"time":"+2016-03-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2788015$5BC246EC-C052-415E-8E1A-CE5EE68E9B97","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"bf2726c5c2109371cc10358eaa69bc4df711caf7","datavalue":{"value":"68P15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2788015$DDFCD74A-3B48-4C3E-A55D-8DBA989AF5CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2788015$783479B8-3DEF-4253-87C9-299E0F262789","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3bc2710f946343c4b5ef77d931d778217ee289da","datavalue":{"value":"6550735","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2788015$C14506EE-A7CC-4131-BAC4-95476876CC9A","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":"Q2788015$1DD80A99-1E58-4AD3-9939-B6F985A5B72D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c1c6d219306c421e52ef8ef4899424da47587c2f","datavalue":{"value":{"text":"An algorithm for determining minimal covers of acyclic database schemes","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2788015$A41F9182-7204-44EE-BD7C-4D7047E019A0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"0c3d3b409e9e50e8acf26953798e8454fc94584e","datavalue":{"value":{"entity-type":"item","numeric-id":6770841,"id":"Q6770841"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2788015$2BB503EE-5317-4210-8390-52AA6C024C4E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for determining minimal covers of acyclic database schemes","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_determining_minimal_covers_of_acyclic_database_schemes"}}}}}