{"entities":{"Q71782":{"pageid":72909,"ns":120,"title":"Item:Q71782","lastrevid":59348796,"modified":"2026-04-10T12:12:43Z","type":"item","id":"Q71782","labels":{"en":{"language":"en","value":"Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms"}},"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":"Q71782$0758DF15-0955-4242-96E3-B864E408EA4D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"da22dd798edb52cb4cd38ece3d93e1b6b18670dd","datavalue":{"value":{"entity-type":"item","numeric-id":71781,"id":"Q71781"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q71782$78FA6AE1-6DBA-41DE-ADDD-5803DA54CB06","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"0fbc53645043faa842dd4708a60c58139a0ea259","datavalue":{"value":"68","type":"string"},"datatype":"string"},"type":"statement","id":"Q71782$A47C916E-FC8D-437E-82EC-6B28CA5F0B1B","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"4cfc1ff2648e880f577ecc1376f9730143f038a5","datavalue":{"value":"5","type":"string"},"datatype":"string"},"type":"statement","id":"Q71782$002DA9A2-27FB-42E5-8492-697C6D5ABA9D","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"13ba4829f0e298c11d267a21d33edacca3d7178c","datavalue":{"value":"1517-1537","type":"string"},"datatype":"string"},"type":"statement","id":"Q71782$F827A706-1E68-44CD-8459-E9415ADD83EE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f1fe43493fc447e1e316439e43cdfe023a7c3709","datavalue":{"value":{"time":"+2020-09-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":10,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q71782$17D50E14-A0CE-40D7-82A7-A01B016C4B5E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b13e58afd744e1fb14ea50072397934991d0f621","datavalue":{"value":{"entity-type":"item","numeric-id":71778,"id":"Q71778"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q71782$D6E142A7-C27D-465A-8AA5-8A0794FC83FB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d47807cf6c5399457727cddd5dc2f29be7fc6015","datavalue":{"value":{"entity-type":"item","numeric-id":71779,"id":"Q71779"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q71782$C2F35CDB-0DDB-41D0-9F74-D1041AFEB01C","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":"Q71782$B20E8857-D0D6-45C5-8403-2A3E75822A79","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fda4217a3f334c33fd5247b5d1192bc1fc1d99e3","datavalue":{"value":"10.1287/OPRE.2019.1919","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q71782$7FE452AC-5524-4B4C-A416-5293D655EEA0","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_Best_Subset_Selection:_Coordinate_Descent_and_Local_Combinatorial_Optimization_Algorithms"}}}}}