{"entities":{"Q6943471":{"pageid":21164412,"ns":120,"title":"Item:Q6943471","lastrevid":75943104,"modified":"2026-04-21T15:24:17Z","type":"item","id":"Q6943471","labels":{"en":{"language":"en","value":"Amortized circuit complexity, formal complexity measures, and catalytic algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8079524"}},"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":"Q6943471$C9196843-E32D-4F7E-997B-05F5B9D43BEC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"874f91ca992885db5b659afc5a915e1fe0a6f028","datavalue":{"value":{"text":"Amortized circuit complexity, formal complexity measures, and catalytic algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6943471$278A0CCD-5D18-45C8-8CBF-C14DD1F9E610","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4f006ca223fc5354c4a54d00560e921064a58b9e","datavalue":{"value":"10.1109/FOCS52979.2021.00079","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943471$47F84C45-A701-4A13-8872-8B93C8909B31","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7749ea419a7c3b783242f22f32dec4d05237622f","datavalue":{"value":{"entity-type":"item","numeric-id":2040599,"id":"Q2040599"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943471$0992E69C-C06E-4CD4-A1AF-0E813CDB20BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fc469b252f78ae9d1ec571fb34288d7d22a9644a","datavalue":{"value":{"entity-type":"item","numeric-id":783061,"id":"Q783061"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943471$9426C243-009D-429F-B55B-2EBD5CAC954A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aa9a3404048ba5ab60c02125ac90886eb8d57c31","datavalue":{"value":{"time":"+2025-08-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":"Q6943471$B1388632-CA18-4A5A-A30F-5BC4A7A263CE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943471$BF84E5B2-ED8E-4016-98F4-F4D3C2E7AE3F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8dc5d8f03fcaaa9e07fb2b90c65b675a74eb1ab2","datavalue":{"value":"94-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943471$8308D7AC-A830-433F-927D-3B543DE33D30","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3112b5cd3afe814363c2fdf36a0ae2bd1aafd7cb","datavalue":{"value":"8079524","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943471$9590E4C8-0A51-4C2E-8468-77773DF88F32","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":"Q6943471$8A3C93AE-78B1-4097-A68A-3628D0268EB1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Amortized circuit complexity, formal complexity measures, and catalytic algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Amortized_circuit_complexity,_formal_complexity_measures,_and_catalytic_algorithms"}}}}}