{"entities":{"Q7294672":{"pageid":31181761,"ns":120,"title":"Item:Q7294672","lastrevid":104664109,"modified":"2026-09-11T14:20:42Z","type":"item","id":"Q7294672","labels":{"en":{"language":"en","value":"A deterministic polylogarithmic competitive algorithm for matching with delays"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8222534"}},"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":"Q7294672$2CA99F7E-8B0C-41AE-88E4-101C8EDA1C85","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c657c57ceeb03dc26c571d1d5fde44e1963d98aa","datavalue":{"value":{"text":"A deterministic polylogarithmic competitive algorithm for matching with delays","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7294672$A8D07D07-8259-4102-8415-8E2EDED0F25F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4ebf0cb0d2848fd9d2570905f0613abbfd2565d9","datavalue":{"value":"10.1137/1.9781611978971.144","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7294672$A6F53A2C-CC38-42C7-BD00-05385EEF492F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ae8e97cdc578f9f3d8958b35bf0a68efd7ecfc7d","datavalue":{"value":{"entity-type":"item","numeric-id":6615131,"id":"Q6615131"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7294672$59A2DFB1-2A77-46D1-902F-D4C8371035F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f6326f08d101e08bdf835ef63dd1fab6d72f29ad","datavalue":{"value":{"entity-type":"item","numeric-id":249057,"id":"Q249057"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7294672$C403D5D9-3F7D-41AE-A20B-21D9E4A7C5F4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4225be356f006c0e315bb2073ed1ea4864807e07","datavalue":{"value":{"time":"+2026-07-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7294672$93CB70E8-4232-435B-B78D-069DC0DF012C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7294672$7115E99F-432C-4D6B-8E4E-525C6D9CBAE7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0839a104b545be44defb3fe62606e06673c16789","datavalue":{"value":"8222534","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7294672$1DC19790-778D-4A58-ADEE-3677CB60CDBB","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":"Q7294672$4F0A903F-18D6-4F7E-ACDB-DFCE580B8B03","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A deterministic polylogarithmic competitive algorithm for matching with delays","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_deterministic_polylogarithmic_competitive_algorithm_for_matching_with_delays"}}}}}