{"entities":{"Q70835":{"pageid":71959,"ns":120,"title":"Item:Q70835","lastrevid":59346618,"modified":"2026-04-10T12:12:12Z","type":"item","id":"Q70835","labels":{"en":{"language":"en","value":"A polynomial algorithm for best-subset selection problem"}},"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":"Q70835$9DE695FA-BDCA-46DE-9FEA-99F5A46F2210","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"feed2e180e8d2692d2fcd4ceef8b658d0a72a34c","datavalue":{"value":{"entity-type":"item","numeric-id":58107,"id":"Q58107"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q70835$AC8B50A6-4226-4141-824B-DF3181E6720B","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"8a59338f4b5a515a12cd11c4686d0578e8d827f8","datavalue":{"value":"117","type":"string"},"datatype":"string"},"type":"statement","id":"Q70835$E841632F-51C3-48A6-A758-DABF4E3CD918","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"857bd6b87347becfafd5847251c8d846a6e319e2","datavalue":{"value":"52","type":"string"},"datatype":"string"},"type":"statement","id":"Q70835$5AD98AB7-EF12-497F-A069-3AEB64B5C749","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"d4d6b15131132af0f3f5abdb3c37fee15b91d0c1","datavalue":{"value":"33117-33123","type":"string"},"datatype":"string"},"type":"statement","id":"Q70835$1FDCB75B-880C-4668-8AB1-2173DF24ADFA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2ca40d4ed4465267d08462ace16c5b0bf2cd390f","datavalue":{"value":{"time":"+2020-12-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q70835$471DABD6-60EA-4377-9F34-4A00B1A51973","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"775cf1bde226f298aff82710c6c9e95803c9514f","datavalue":{"value":{"entity-type":"item","numeric-id":70826,"id":"Q70826"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q70835$04F02962-1D3C-48FD-A4DB-499E59046A3C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"85e78964284c2a53b25c63b748f03e59d6619d8a","datavalue":{"value":{"entity-type":"item","numeric-id":70827,"id":"Q70827"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q70835$90C014D4-A694-479B-8CA4-F0166D47E7EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"87cfe8384a97301b0ed2464488a3847ab7efba90","datavalue":{"value":{"entity-type":"item","numeric-id":70828,"id":"Q70828"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q70835$A679DA8F-18B3-4038-B7BE-8502C6C0AA0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6aacbfc8739d12571dd4d32041ae9b62cb2a1190","datavalue":{"value":{"entity-type":"item","numeric-id":70829,"id":"Q70829"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q70835$DA503201-FBE0-4708-A654-226A408D2BC5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f77150816f1f537282f83d677b625dac74551459","datavalue":{"value":{"entity-type":"item","numeric-id":70834,"id":"Q70834"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q70835$DE8A06FA-32F8-4B4C-9246-B93144801319","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"55c7782e74f7cc3287a4ff0f5d64e3d52f9b4b56","datavalue":{"value":"Q104486257","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q70835$12D55B61-1E68-4D6D-850C-B35926C9BA52","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":"Q70835$0E39CBA2-AD8D-46B7-9A82-A5C5D5BB123C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"43ce8eb57dab16b565c869e6e99e3953f6e9ad7b","datavalue":{"value":"10.1073/PNAS.2014241117","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q70835$6382981D-E0F5-4202-8935-D5CD02CDD7BC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A polynomial algorithm for best-subset selection problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_polynomial_algorithm_for_best-subset_selection_problem"}}}}}