{"entities":{"Q108467":{"pageid":109935,"ns":120,"title":"Item:Q108467","lastrevid":59563347,"modified":"2026-04-10T13:07:18Z","type":"item","id":"Q108467","labels":{"en":{"language":"en","value":"FLSSS: A Novel Algorithmic Framework for Combinatorial Optimization   Problems in the Subset Sum Family"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q108467$3299E3CD-18D4-4A8E-9588-A28495F48A5D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ed18df05388c1365b6270680a64bf1da2b664703","datavalue":{"value":{"time":"+2016-12-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q108467$36C2FD3D-B5E3-4822-9F4B-2D2FFEC0FE06","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"52da3781c388aefe2872bb48500809022ec9f713","datavalue":{"value":"1612.04484v3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q108467$1F9CF488-731E-481B-8EF8-392EB1B34A27","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q108467$1493863F-5C1C-4273-9C61-F80991730186","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"65c2ef6d32d260605abbdcbe3bf8aa3f68eed4c0","datavalue":{"value":{"entity-type":"item","numeric-id":108466,"id":"Q108466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q108467$94C01765-90BD-4EB3-8204-038F66C4810A","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":"Q108467$6E80FCFD-6F07-4476-BCD1-CD71798FCCB6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d2f1fe79b4246cb7deb7b6077c75373fb19c4272","datavalue":{"value":"10.48550/ARXIV.1612.04484V3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q108467$E1DD48CC-EE7F-4495-9791-765B6E4648E8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"FLSSS: A Novel Algorithmic Framework for Combinatorial Optimization Problems in the Subset Sum Family","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/FLSSS:_A_Novel_Algorithmic_Framework_for_Combinatorial_Optimization_Problems_in_the_Subset_Sum_Family"}}}}}