{"entities":{"Q6327466":{"pageid":13462877,"ns":120,"title":"Item:Q6327466","lastrevid":94933199,"modified":"2026-06-05T07:59:50Z","type":"item","id":"Q6327466","labels":{"en":{"language":"en","value":"Proof complexity of systems of (non-deterministic) decision trees and branching programs"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"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":"Q6327466$45E88DCB-8456-4B3D-82EF-E6EEE623D884","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aed958651123927050bc0cc175cd65565a7f5e9d","datavalue":{"value":{"time":"+2019-10-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6327466$13D7CB16-A040-4CFC-9BC4-A51984AD34AC","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"f329a287e4f9b1182d97fc47c6ea6990ce17c4dc","datavalue":{"value":"1910.08503","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6327466$1FCEA15B-D0C6-4F5B-8E24-98193BB52694","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"beea17b17b8d1b5a9f9834b620089ca44509579a","datavalue":{"value":"cs.CC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6327466$9F86E71A-94FE-497F-8990-EE0296568181","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"52761b11eff7231b8be1bfc1a165f9189de1d528","datavalue":{"value":"cs.LO","type":"string"},"datatype":"string"},"type":"statement","id":"Q6327466$5241D4A2-5812-4380-9168-87BDD335CF7A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"91cfcc3a3c7fc0e829c6b8c5f874cc185f7b19b3","datavalue":{"value":"math.LO","type":"string"},"datatype":"string"},"type":"statement","id":"Q6327466$5C6B344B-E430-45AB-92B3-C03F8B7C7FC5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"556b5f897f5d545f04c26b56d4624f5cc4b2661a","datavalue":{"value":{"entity-type":"item","numeric-id":195654,"id":"Q195654"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6327466$274CD8C7-82F9-4291-9A93-16D90AC49DA9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c255adfc712bad9b4346c358d68a6d24be790f29","datavalue":{"value":{"entity-type":"item","numeric-id":1694470,"id":"Q1694470"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6327466$F88766BA-96F5-4384-9512-9C1516196F86","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e9ec1f3506837cdbc96572a8b9752777c89e7629","datavalue":{"value":{"entity-type":"item","numeric-id":1635509,"id":"Q1635509"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6327466$B1F9A54D-87AA-4BCE-9986-08229EFDD246","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6327466$AC2412A7-3F6F-4877-B00A-BC5A51AFC556","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d53cd5ab715340bbfc507bf5b4aac1b907f4465d","datavalue":{"value":"03B70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6327466$492B1783-E96C-4E4A-B668-F570F9ED3D07","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":"Q6327466$9CCC24A6-D5B2-4811-A934-81AB7FA62976","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0b1142f3e42dd4ecb40b03fad012a1b73f2e0846","datavalue":{"value":"10.4230/LIPICS.CSL.2020.12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6327466$006B6EFE-25B9-4D1B-AE15-CC371432D9AC","rank":"normal"}],"P1676":[{"mainsnak":{"snaktype":"value","property":"P1676","hash":"5e6c2f7b728bd5d74088ed7c066ca33cfd9d7911","datavalue":{"value":{"entity-type":"item","numeric-id":5874198,"id":"Q5874198"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6327466$31475FEA-74B6-448C-B9CB-0BA2558F3F56","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Proof complexity of systems of (non-deterministic) decision trees and branching programs","badges":[]}}}}}