{"entities":{"Q6942875":{"pageid":21160857,"ns":120,"title":"Item:Q6942875","lastrevid":75937746,"modified":"2026-04-21T14:54:53Z","type":"item","id":"Q6942875","labels":{"en":{"language":"en","value":"Tight space lower bound for pseudo-deterministic approximate counting"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8080107"}},"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":"Q6942875$38DD136A-E1B5-4BF4-86DB-CC250B9F7DC2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"10c358f4540ee8efec93722172d9831126bd930f","datavalue":{"value":{"text":"Tight space lower bound for pseudo-deterministic approximate counting","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6942875$715917C5-5630-4386-ADE1-F16ABE19AA7B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"70025ac455c519767c5f953cb69af73aafe4f8bb","datavalue":{"value":"10.1109/FOCS57990.2023.00091","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942875$6D461FD4-D623-4DF7-9B05-021DB2C3BB91","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ce4fb2ead0ee98e82d1f55f46efb69832180103c","datavalue":{"value":{"entity-type":"item","numeric-id":6083515,"id":"Q6083515"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942875$CF9E1B0E-CE4E-4C24-936E-CAE783D9497B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7d9845fab6a613eb097b0f8760f64dd0f705dcb7","datavalue":{"value":{"entity-type":"item","numeric-id":2119093,"id":"Q2119093"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942875$77BC4572-D317-4CF7-A886-D1EFBA4EB557","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c65036720d8cf1461f19debc7d16c563cea5fcd9","datavalue":{"value":{"entity-type":"item","numeric-id":510058,"id":"Q510058"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942875$F9E109C2-1810-492E-95AB-9DD9ED903941","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c353c511b4dc13ecee102b336a2664d881fe8b6f","datavalue":{"value":{"time":"+2025-08-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":"Q6942875$8CB21710-2620-4A86-BC76-3FF4FCB54669","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942875$29780A06-2993-4FB8-AF21-FDD05B8BC6D0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2d5915acc1c3bf0975d1d69890fd3f0dcd86c309","datavalue":{"value":"8080107","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942875$E3F807A8-40B1-43CD-9077-55E28ECD441F","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":"Q6942875$083ED637-A895-41B7-B433-1485C96A5E82","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Tight space lower bound for pseudo-deterministic approximate counting","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Tight_space_lower_bound_for_pseudo-deterministic_approximate_counting"}}}}}