{"entities":{"Q6943019":{"pageid":21161721,"ns":120,"title":"Item:Q6943019","lastrevid":75939042,"modified":"2026-04-21T14:59:11Z","type":"item","id":"Q6943019","labels":{"en":{"language":"en","value":"Estimating the longest increasing subsequence in nearly optimal time"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8079961"}},"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":"Q6943019$5E0BF9C2-91C9-4D52-A3CC-75C2BE528C0F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5ae0888bedd9b3b1987ab13f4c160f7173c1bbe3","datavalue":{"value":{"text":"Estimating the longest increasing subsequence in nearly optimal time","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6943019$C0F91AD1-16F1-44ED-BF94-87C3478BC4E3","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1a5d1d8d7446786dcf249b35dc73b04c4cd871fa","datavalue":{"value":"10.1109/FOCS54457.2022.00073","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943019$4AAEF99D-FC0B-43B6-A3EE-B24EE7626398","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f724d9ebbff8958f2713e8368021fe65462e1f94","datavalue":{"value":{"entity-type":"item","numeric-id":5212814,"id":"Q5212814"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943019$D150163E-06BC-4A2C-A57A-4B314C216B36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9bee7e7f2fe57cad1e96193e5ab55db1042fa0cb","datavalue":{"value":{"entity-type":"item","numeric-id":4575738,"id":"Q4575738"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943019$8EF54760-03AA-49BF-A15D-23F288D6DE4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fdfd7e668e562c586cc7d1b8bbb0acd792a1242e","datavalue":{"value":{"entity-type":"item","numeric-id":910242,"id":"Q910242"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943019$73258EFA-B158-449F-8CDF-50EC6915C998","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"eae9a31d6f758a27f2fb0dd99a7d1baabffdd3ef","datavalue":{"value":{"entity-type":"item","numeric-id":713204,"id":"Q713204"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943019$7E2A0B36-A414-4D39-B0CA-62F83E2370DF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c353c511b4dc13ecee102b336a2664d881fe8b6f","datavalue":{"value":{"time":"+2025-08-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6943019$4678AA94-E9A4-475F-981C-FC407D7BD419","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943019$ABBE3877-3DFA-4282-993C-296A4EDAAA7D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2a89da8488a28e9fe3b35fdf7d40680534ecf943","datavalue":{"value":"8079961","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943019$7C856F3B-DBB9-42A0-85D8-E852977CB26C","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":"Q6943019$FAF78CDB-4083-4573-9806-416710CF65D8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Estimating the longest increasing subsequence in nearly optimal time","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Estimating_the_longest_increasing_subsequence_in_nearly_optimal_time"}}}}}