{"entities":{"Q2986464":{"pageid":2997188,"ns":120,"title":"Item:Q2986464","lastrevid":85484012,"modified":"2026-06-03T08:54:22Z","type":"item","id":"Q2986464","labels":{"en":{"language":"en","value":"A Universal Grammar-Based Code for Lossless Compression of Binary Trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6717604"}},"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":"Q2986464$7C3CEBD2-7419-4CAF-ABED-A1663E391790","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"375998ee84a510381fe99183e9a66ec3d3fa534b","datavalue":{"value":{"text":"A Universal Grammar-Based Code for Lossless Compression of Binary Trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2986464$F3A1F0C0-E308-4AF1-9C47-AACDA28DF50D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c00f08db5f7a0bfa4ed419ec4a98c38756c73963","datavalue":{"value":"1360.94138","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2986464$333A7ED8-B747-44CD-B715-BF7082E1EACA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bbd23f8f91c77bed15c4cb6adb42a2182af71313","datavalue":{"value":"10.1109/TIT.2013.2295392","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2986464$0BC25F35-C28A-439E-B107-2F583D885B0B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6647436d498ec06130030df09aa19bb9ab80b24d","datavalue":{"value":{"entity-type":"item","numeric-id":255254,"id":"Q255254"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2986464$3E43B1C0-B14C-480D-A907-E16EA5830829","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b234509ab16ded637c27e806fd2881c79f3b0afc","datavalue":{"value":{"entity-type":"item","numeric-id":1180010,"id":"Q1180010"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2986464$C5C224D8-12C4-4AA4-AF13-BED82FA0E70D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"187b12303abda7fe410343f5adffc5d6b88b24b7","datavalue":{"value":{"entity-type":"item","numeric-id":1136154,"id":"Q1136154"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2986464$EF311AC8-C122-4679-8259-212C833CBEAC","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"90c5240c9cd9e181a1b77d3501d191b6631d1861","datavalue":{"value":{"entity-type":"item","numeric-id":97723,"id":"Q97723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2986464$29DC5234-2BE5-437D-BE5F-503DFE7CD58B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"daa85c3fca52a36a5bd491b86ad0a10dbad35089","datavalue":{"value":{"time":"+2017-05-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":"Q2986464$FFA0CABA-B55F-4B0C-86DE-276CA620658B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c0b991a3aecf803ab40be79a4e099c3a6baed587","datavalue":{"value":"https://arxiv.org/abs/1304.7392","type":"string"},"datatype":"url"},"type":"statement","id":"Q2986464$54B6B99E-9163-4A02-ABE7-A49B40D87CF5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e1f144a9ab7064f6f8c78503075f6cd455ea06f6","datavalue":{"value":"94A15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2986464$971F62BB-5810-40EA-B758-934ECA053355","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2986464$BADD3CBD-64C9-4E9F-BAB4-490D583079C3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"57830e301dfddba0318efc21720b8a04362c8f0e","datavalue":{"value":"6717604","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2986464$155899B4-F9CF-4751-B0D6-ECA6D8DFB0FD","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":"Q2986464$2E3DD198-4EC2-4207-8035-9418D6616ED9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Universal Grammar-Based Code for Lossless Compression of Binary Trees","badges":[]}}}}}