{"entities":{"Q6944157":{"pageid":21168528,"ns":120,"title":"Item:Q6944157","lastrevid":75949320,"modified":"2026-04-21T15:59:24Z","type":"item","id":"Q6944157","labels":{"en":{"language":"en","value":"Why are proof complexity lower bounds hard?"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078834"}},"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":"Q6944157$195853C1-8EC5-4652-B472-E0645F829A2E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d38d665eafc2d1a943898c11f6ebe5aedd26f368","datavalue":{"value":{"text":"Why are proof complexity lower bounds hard?","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944157$41ACBD44-9FA3-4B77-998C-1BEA36A16389","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"062f777641f86847a4d0bced28854c69ebac840f","datavalue":{"value":"10.1109/FOCS.2019.00080","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944157$7513857C-8480-4CC4-8FED-FFD3DD113562","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cbd280028d852be0bb1791a3912dfc76b7046ce1","datavalue":{"value":{"entity-type":"item","numeric-id":466446,"id":"Q466446"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944157$DC481D81-5311-46A6-BF3F-D9DB11121F1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b23adbfc18cdc63b7e63348213f20b490e75c5f0","datavalue":{"value":{"entity-type":"item","numeric-id":488048,"id":"Q488048"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944157$CEEE3649-4344-42BC-84E1-3581C19A5894","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6944157$D0B9EF07-6C70-4799-A222-C9FB5C953541","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e8ac402c50f0c46b79159acb3ef3f0ac666b9e69","datavalue":{"value":"https://ora.ox.ac.uk/objects/uuid:b038d171-928d-4dfe-abf5-a6fdb03217b2","type":"string"},"datatype":"url"},"type":"statement","id":"Q6944157$43C2F244-6D2C-4F0D-A480-56EF4C2BA67E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944157$CC15D51D-FFD8-4A21-A2EC-18E618C07342","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6b31f4813295cbfdac6120583b05e8a5dd8b63e6","datavalue":{"value":"8078834","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944157$1C5F633C-2EBF-4606-9000-22FBF98CE7FE","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":"Q6944157$732DEC75-CD41-41D8-9CD7-FFC990CCFD04","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Why are proof complexity lower bounds hard?","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Why_are_proof_complexity_lower_bounds_hard%3F"}}}}}