{"entities":{"Q6314156":{"pageid":13450027,"ns":120,"title":"Item:Q6314156","lastrevid":99198983,"modified":"2026-06-05T19:26:17Z","type":"item","id":"Q6314156","labels":{"en":{"language":"en","value":"Finding any given 2-factor in sparse pseudorandom graphs efficiently"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900558153"}},"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":"Q6314156$4E45D173-691B-4050-9F9C-253317109DDC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3df9cc9e172b45e1438a580cc23c81b3a384b10d","datavalue":{"value":{"time":"+2019-02-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6314156$AE0060EC-CFE5-444C-8EE6-5E53DD815FBB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4532b9339ddc3e31eddb3bd5b98eefa9ffe07d55","datavalue":{"value":{"entity-type":"item","numeric-id":516072,"id":"Q516072"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6314156$70B14B06-80BC-452C-AC37-B139791902CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9ecf1791af1783a4577a7195bc289abc12db3b8b","datavalue":{"value":{"entity-type":"item","numeric-id":285061,"id":"Q285061"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6314156$A6CEE98D-4A46-447D-91D9-AF4D736FFD67","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a72c2df67a3a734413741d9ff8f8d78ec513c0f","datavalue":{"value":{"entity-type":"item","numeric-id":2221905,"id":"Q2221905"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6314156$AAA16DAE-C496-4705-B0A7-20A9F1872556","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2532270aa021c282902fb16beb1092e301044e83","datavalue":{"value":{"entity-type":"item","numeric-id":290807,"id":"Q290807"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6314156$94D68F45-3EDC-4499-8A56-E8C4A4FD59A2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6314156$E7E6B2A8-D86E-49C0-8848-71156883257B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"625e55f1f2a96178239720bc1bbbe7ad21cf0a75","datavalue":{"value":"05C70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6314156$573D3833-685C-4F23-94CD-2B848B42C7FC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"53754aa9f09e96c230558c93e03cd9984ff9b283","datavalue":{"value":"900558153","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6314156$BC8B2F30-6297-4FC3-A5D3-E954CFAD1B05","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":"Q6314156$38586F53-71F1-4789-926B-E75859AF0F3E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Finding any given 2-factor in sparse pseudorandom graphs efficiently","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Finding_any_given_2-factor_in_sparse_pseudorandom_graphs_efficiently"}}}}}