{"entities":{"Q6231676":{"pageid":13368449,"ns":120,"title":"Item:Q6231676","lastrevid":40688438,"modified":"2025-03-28T14:22:32Z","type":"item","id":"Q6231676","labels":{"en":{"language":"en","value":"A low multiplicative complexity fast recursive DCT-2 algorithm"}},"descriptions":{"en":{"language":"en","value":"preprint article from arXiv"}},"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":"Q6231676$9FC0B8C6-04CD-4F9D-9FC7-BEA1AE2AA1E3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bbc150dbc49164b3da7229a7dc1f13b6795c0faf","datavalue":{"value":{"time":"+2012-03-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":"Q6231676$5A545215-254C-4C51-8D40-2CDA10CC4944","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"6b187c9172306cb8a8ed4b9dc5e98a0a066d27d5","datavalue":{"value":"1203.3442","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6231676$016F4354-7942-43B9-916A-F2934BA491EF","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"978de76261106d731aa947788d4bb931f3500171","datavalue":{"value":"cs.IT","type":"string"},"datatype":"string"},"type":"statement","id":"Q6231676$AA78487E-83F7-44E0-A795-75BA073962FF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"931f304235725988f1b8c31b4e843d58f9c17935","datavalue":{"value":"math.IT","type":"string"},"datatype":"string"},"type":"statement","id":"Q6231676$8FB23CEE-C872-4B1A-A43B-E5D6A952F020","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"fd3790bdd92657544265c8f4d65f6a58aef44cc2","datavalue":{"value":"Maxim Vashkevich","type":"string"},"datatype":"string"},"type":"statement","id":"Q6231676$736EE31D-2264-4990-AC21-9A0AB142879F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"70e4e55784880c2fbf8356a0e51e2ad725aa9f41","datavalue":{"value":"Alexander Petrovsky","type":"string"},"datatype":"string"},"type":"statement","id":"Q6231676$317292B3-0DB6-4E62-999F-851FCCA9DB2C","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":"Q6231676$FA1E9C1B-ACE8-4EF7-ADFF-F90A999F7FDD","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"e5f1babc5a409ba28f2f0197606efc27d8bfc0a1","datavalue":{"value":"https://github.com/Mak-Sim/Fast_recursive_DCT","type":"string"},"datatype":"url"},"type":"statement","id":"Q6231676$DB54F236-8538-4B99-85B4-47FE41D9D090","rank":"normal","references":[{"hash":"fa3a04b00a2fb53a930e83808a8e63a051b63a52","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"348cea0ef9a906c888a91b3ec020b0d482ece4bc","datavalue":{"value":"https://paperswithcode.com/paper/a-low-multiplicative-complexity-fast","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6231676","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6231676"}}}}}