{"entities":{"Q6971982":{"pageid":21334947,"ns":120,"title":"Item:Q6971982","lastrevid":84044765,"modified":"2026-05-08T17:24:32Z","type":"item","id":"Q6971982","labels":{"en":{"language":"en","value":"Polylogarithmic time algorithms for shortest path forests in programmable matter"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8052463"}},"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":"Q6971982$26DF80B4-CBC6-4B0B-B7FC-67BB1143518F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ede849a72ff1638ffe6e5ee9341956399c3a20a2","datavalue":{"value":{"text":"Polylogarithmic time algorithms for shortest path forests in programmable matter","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6971982$37CFE0E7-BBED-41D5-AC27-9F379BAA86D9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"05948d0bbf3f5bcdc9dddfdf73d9886ca19a5d90","datavalue":{"value":"10.1145/3662158.3662776","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6971982$12235EC4-C871-46D5-8F25-1840AB6052CB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e08a0c9c19c70992c14d98a108df36b3c4a5d46","datavalue":{"value":{"entity-type":"item","numeric-id":6971981,"id":"Q6971981"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$90B74FF7-80E5-4AD8-8D9F-972593ACADA4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b9edd1a0598c23a16695d6febc9512ccd616d50a","datavalue":{"value":{"entity-type":"item","numeric-id":360273,"id":"Q360273"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$16AD318C-6952-414A-8CD8-4FC590797C7C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"752cbd85e48c29097ef77f01360fb6a232ac8d6d","datavalue":{"value":{"time":"+2025-06-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":"Q6971982$7F8D157C-5598-4E8A-A6D3-8042464847FB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62ff42057022552eaa82447a5a1563ef3bf93acd","datavalue":{"value":"68M14","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6971982$8FEA659E-BAAB-4E9B-BF86-C41D685E19B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b65efe51b183d0f4a672427b8171cd1e14211cba","datavalue":{"value":"68W15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6971982$7A519D83-CAE9-44C8-8108-2D3ED3B8C596","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7072d2bb6d5bfc7eac5e525d4dda9bc16dbc0c2f","datavalue":{"value":"8052463","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6971982$450FDDA0-0E8B-4C2F-B0D6-61E7CE71FECA","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6971982$9DB65CF3-A9F4-4F25-85FF-A9B845D19E1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7a1f9e27def18eb84df03fb493ad749a53e2c13b","datavalue":{"value":"programmable matter","type":"string"},"datatype":"string"},"type":"statement","id":"Q6971982$B4ED3736-E14F-4203-A342-34DA84848F86","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e2748b1bb11250f981dead5037187b808f15875a","datavalue":{"value":"amoebot model","type":"string"},"datatype":"string"},"type":"statement","id":"Q6971982$4442AB6C-1885-4205-B730-2BA454C16E94","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d285273e31c1345e593b0ea29968a9100cae28e","datavalue":{"value":"reconfigurable circuits","type":"string"},"datatype":"string"},"type":"statement","id":"Q6971982$BFACB0D7-9CF6-4C5F-8A3F-735B0A274393","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":"Q6971982$E6C7DD10-16E3-4A62-9AD6-FA3ACDF6D9C0","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"6cb1932d20eb5412192b947bb9754b56ed71f4f7","datavalue":{"value":{"entity-type":"item","numeric-id":5146850,"id":"Q5146850"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$4F5E3368-EA4A-4910-AF98-A68C54E1971D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8228841a03d066bc6551dc00d13fa97188ec3785","datavalue":{"value":{"entity-type":"item","numeric-id":2166365,"id":"Q2166365"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$74BBB5DC-264F-4FED-97CA-D0B9C300DAF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d947096cd30e6468935185ed20f30036d7e733ba","datavalue":{"value":{"entity-type":"item","numeric-id":3588301,"id":"Q3588301"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$D7C46917-3062-42D8-AB65-C3418E68533A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b03c38d81cd2e8fc69928dfb8f17232b1dca9a84","datavalue":{"value":{"entity-type":"item","numeric-id":6830525,"id":"Q6830525"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$496B9003-B10C-478C-8D1C-A0F1410BDA32","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"812ec5b3642f07ab97877811c375b7a71b723627","datavalue":{"value":{"entity-type":"item","numeric-id":6099032,"id":"Q6099032"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$33EB9503-6938-4424-B2C9-28ABCEE2D80F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b8203441e0d700eed0d38b37c338aecef776493e","datavalue":{"value":{"entity-type":"item","numeric-id":6610311,"id":"Q6610311"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$B960D861-4937-4C3F-A755-E89845AD2C21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f44a29104cc6cc652cae22dc7c57756dd15312f6","datavalue":{"value":{"entity-type":"item","numeric-id":3434993,"id":"Q3434993"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$C5BAFF17-F844-4E14-B476-194804C53B3C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4d9f4bd8c2dbc1621df2ffa82031d1d7c6c4bcdd","datavalue":{"value":{"entity-type":"item","numeric-id":2174252,"id":"Q2174252"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$BB4384DB-52D5-45BB-A2E3-08EEF5E1FE7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d33350e3a730a3a943b742e591c9c3a70497f2de","datavalue":{"value":{"entity-type":"item","numeric-id":4907581,"id":"Q4907581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6971982$0A89B3FD-B0D7-49F0-A98C-B89F17B93B51","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Polylogarithmic time algorithms for shortest path forests in programmable matter","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Polylogarithmic_time_algorithms_for_shortest_path_forests_in_programmable_matter"}}}}}