{"entities":{"Q7199867":{"pageid":22235093,"ns":120,"title":"Item:Q7199867","lastrevid":107521832,"modified":"2026-10-27T10:26:56Z","type":"item","id":"Q7199867","labels":{"en":{"language":"en","value":"Complexity of Bilevel Linear Programming with a Single Upper-Level Variable"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7199867$AB23AA42-03F2-4522-8256-9064F33B2048","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":"Q7199867$38D99793-9310-478B-9C51-9DA7BEBC1108","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"e95f3cfffb65a46de289a9d236b47e8da2d7e893","datavalue":{"value":"2510.21126","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7199867$ACDAA47A-094F-4C58-9B28-A9044DAF6FD6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"29138419169f1bf561a378cfbdcc706097a0d610","datavalue":{"value":{"entity-type":"item","numeric-id":2063192,"id":"Q2063192"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7199867$E2E18747-EA25-4AAD-92F5-E3C5D7B262D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"270ab6f197d270cb0aaf19b3f4c89f3e57a7265f","datavalue":{"value":{"entity-type":"item","numeric-id":507330,"id":"Q507330"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7199867$7E910D81-E522-41BA-824C-5AB03A3F05B0","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":"Q7199867$1A30274D-8FC5-42B0-B532-446A5D7B811C","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":"Q7199867$02BC3914-0985-4D40-81FA-B0242DC793DC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Complexity of Bilevel Linear Programming with a Single Upper-Level Variable","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Complexity_of_Bilevel_Linear_Programming_with_a_Single_Upper-Level_Variable"}}}}}