{"entities":{"Q7225807":{"pageid":22326713,"ns":120,"title":"Item:Q7225807","lastrevid":107713979,"modified":"2026-10-27T11:51:52Z","type":"item","id":"Q7225807","labels":{"en":{"language":"en","value":"An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"beea17b17b8d1b5a9f9834b620089ca44509579a","datavalue":{"value":"cs.CC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7225807$CBFC9739-8C1D-45A2-A494-DD33DFE38A14","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7225807$97044A84-5D9C-4A58-AE69-1DE040BA8091","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"36b65c3d042d223559daf68a1b82bcfd6432a722","datavalue":{"value":"2604.00746","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7225807$76F7A805-E501-4F01-8452-7408E142C6C6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"55e874ac9bb94f248f2932e672964c908ed73d10","datavalue":{"value":{"entity-type":"item","numeric-id":2034077,"id":"Q2034077"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7225807$49AA0DAB-4FE3-41B8-B5E0-C3293703A3A8","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":"Q7225807$3D1C390A-2C6A-4A5D-A7F9-E8BFA1FE4137","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":"Q7225807$91659203-828E-4EFC-A2B4-1A0C30009D73","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Unconditional_Barrier_for_Proving_Multilinear_Algebraic_Branching_Program_Lower_Bounds"}}}}}