{"entities":{"Q7353286":{"pageid":31480642,"ns":120,"title":"Item:Q7353286","lastrevid":107998526,"modified":"2026-10-27T14:15:06Z","type":"item","id":"Q7353286","labels":{"en":{"language":"en","value":"Optimizing Both Checking and Update Costs in Random Walk Search"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q7353286$AA7CAFE4-45FB-4BC4-8698-5804209F6B22","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":"Q7353286$4556DDE5-95E4-4BDC-BE46-B03C42D26E0B","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"10ae7c3fff87015085e7d7bac47ffe238ab982ef","datavalue":{"value":"2609.18833","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7353286$B5DE4C2D-1E28-4400-9E4C-A27C441A3A76","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"dfbf61e1f9e0a256d7e256e2cdbc4d6d217c3475","datavalue":{"value":{"entity-type":"item","numeric-id":1689225,"id":"Q1689225"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7353286$1211B970-A9A4-4023-BDC4-88C4F378C275","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2d11e95d1cd75b8f94d99436413bc2d4e0f0e5e0","datavalue":{"value":{"entity-type":"item","numeric-id":6168417,"id":"Q6168417"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7353286$D0A98D37-B53D-4C09-B716-D326FB8C7A77","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":"Q7353286$A973554B-8C27-46C4-9215-98F6DF2A49BE","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":"Q7353286$861D918B-8AE2-4879-9DB3-DF6DC8C32AE6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimizing Both Checking and Update Costs in Random Walk Search","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimizing_Both_Checking_and_Update_Costs_in_Random_Walk_Search"}}}}}