{"entities":{"Q7219700":{"pageid":22305269,"ns":120,"title":"Item:Q7219700","lastrevid":107668394,"modified":"2026-10-27T11:31:34Z","type":"item","id":"Q7219700","labels":{"en":{"language":"en","value":"Efficient exact sequential lifting algorithm for binary knapsack set"}},"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":"Q7219700$96E458EC-7634-4E4D-9E48-8285FC280477","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":"Q7219700$354356F8-DA46-4CEF-B214-53003C8C53B8","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"0b3e2d9e6f13134ebbee10c03e443de868e670f4","datavalue":{"value":"2602.22640","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7219700$08C86ED2-A7BA-414E-9CCA-342D1E53D564","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"109d70909b3e81ddc4801b46ffa8ae901c3962a1","datavalue":{"value":{"entity-type":"item","numeric-id":2052546,"id":"Q2052546"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7219700$167AB9F1-3184-4BFE-ADAE-A0AB9D45343D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"03abfab87cceab36a9048592b9aebc052ea48096","datavalue":{"value":{"entity-type":"item","numeric-id":6102181,"id":"Q6102181"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7219700$7EEC3E3E-12A5-43A1-B67B-430D6B84CCFD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"119a75e09e6a6cf51576e75bdba5850f0c3f702c","datavalue":{"value":{"entity-type":"item","numeric-id":457541,"id":"Q457541"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7219700$9A46B819-49B7-4C87-9DA3-E9E5D9F28F3B","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":"Q7219700$4B439CA9-3B7C-4B46-B347-59338DF8BB49","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":"Q7219700$BCB349AD-51D8-492C-BDF9-26ABE40E0D14","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient exact sequential lifting algorithm for binary knapsack set","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_exact_sequential_lifting_algorithm_for_binary_knapsack_set"}}}}}