{"entities":{"Q6538770":{"pageid":14149913,"ns":120,"title":"Item:Q6538770","lastrevid":99751304,"modified":"2026-06-05T20:38:22Z","type":"item","id":"Q6538770","labels":{"en":{"language":"en","value":"Deterministic approximation of random walks via queries in graphs of unbounded size"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7848200"}},"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":"Q6538770$8AE29425-58F2-4DF4-888E-607B48D4187B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"50893a3447469d7efbb698a2dbd2f005ef1d25fe","datavalue":{"value":{"text":"Deterministic approximation of random walks via queries in graphs of unbounded size","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6538770$D1F53822-C06F-487F-998E-BC4FF4CE3224","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c3dc3b55208d11daf89b0fbc2fe269e0e6032775","datavalue":{"value":"10.1137/1.9781611977066.5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538770$42EF1C56-129E-4357-BDD2-91D9A1A0D103","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d0b1358bdfb70143a0f7341ec37409af5045d5d5","datavalue":{"value":{"entity-type":"item","numeric-id":2695265,"id":"Q2695265"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538770$D5EE7635-C17D-49BD-A4CB-EA73912E0A22","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c8f5ef0bac548ee8bf8b517109d771301fbca7df","datavalue":{"value":{"entity-type":"item","numeric-id":383730,"id":"Q383730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6538770$E2659750-7C0D-4EF5-AE8B-2550D2993BB8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e8e66a32d534df6de0df71c4be5910df36dd6c70","datavalue":{"value":{"time":"+2024-05-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6538770$148A0662-8B4A-47B5-B547-3340D76A58EF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538770$7AE9BF55-3E13-4832-988D-941B2218C7AA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"14c64ba8aca7844ccaf824b138e35f1eb448d7a3","datavalue":{"value":"7848200","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6538770$9A85BF37-025F-43EE-9C5F-BF5EA89CDBA9","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":"Q6538770$F9F13DEF-A46A-4B3F-9A30-97E0DFC1E8E9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Deterministic approximation of random walks via queries in graphs of unbounded size","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Deterministic_approximation_of_random_walks_via_queries_in_graphs_of_unbounded_size"}}}}}