{"entities":{"Q1223161":{"pageid":1233910,"ns":120,"title":"Item:Q1223161","lastrevid":66492666,"modified":"2026-04-12T10:26:09Z","type":"item","id":"Q1223161","labels":{"en":{"language":"en","value":"A principle of independence for binary tree searching"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3502778"}},"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":"Q1223161$293D3721-6AF2-4C74-A3D6-249E56249766","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"114ca5ee5d16a4e8426b9848e60338f9077cde0a","datavalue":{"value":{"text":"A principle of independence for binary tree searching","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1223161$064CF584-CF18-4E51-8BA7-60900207B1B4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d9172ebcb6fa1adb6e421781dc2189f792201eac","datavalue":{"value":"0321.68030","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1223161$39DD7D8C-ABA6-4D38-9C25-9DA39A38136B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ecc85261073746a9f393b74421305cd1ae9af622","datavalue":{"value":"10.1007/BF00289612","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1223161$661D3133-8740-4F21-9264-9960D2BF8E90","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7d0f02e85530cd06ceb2c58a40dc9c2e0258e194","datavalue":{"value":{"entity-type":"item","numeric-id":161641,"id":"Q161641"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1223161$D7EC5CB2-AD3F-4CAD-8F0F-B194400753B0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b5e8f5a4bedcdf1368f667e537d4925490c864ae","datavalue":{"value":{"time":"+1975-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1223161$3FA2EDD9-53C5-4C2D-AE8E-EC3B4F8E63D8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9ed1e3c6cced595a05b8ae19055521b22405b78a","datavalue":{"value":"68W99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1223161$D6E55719-9482-42A0-9444-AD8E40D44FF6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"381d0065bd1161b2a8675198d84b33cc9944324a","datavalue":{"value":"3502778","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1223161$656397FB-A6BC-467B-8F00-1CB56FEA0476","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"27055c7a0af767b1f36b14e7674bc0aa2224fdc0","datavalue":{"value":{"entity-type":"item","numeric-id":534491,"id":"Q534491"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1223161$13FFE132-AD5E-44DE-A016-CCE60B6B36C1","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":"Q1223161$E483990B-0256-45ED-929F-FA5FC6203919","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"918c5b436dc47b6a9fab192953d78a7c3cec530a","datavalue":{"value":{"entity-type":"item","numeric-id":5554721,"id":"Q5554721"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1223161$4FA62AED-6060-4547-88A0-7236F7A65653","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c9539532d16bcb82516fae2db58a1eb7e9c6ca7b","datavalue":{"value":{"entity-type":"item","numeric-id":5538132,"id":"Q5538132"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1223161$6947AF4F-55D0-4460-87AD-163C8A8049E3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc6482fda869c7df0ed32fd6ade8f790a1ff04cc","datavalue":{"value":{"entity-type":"item","numeric-id":5585020,"id":"Q5585020"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1223161$34A38652-A3F6-4A32-8D18-C9FF1ECF9179","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6d631ff690ba4f6ef9d75ab593567e235755892b","datavalue":{"value":"https://doi.org/10.1007/bf00289612","type":"string"},"datatype":"url"},"type":"statement","id":"Q1223161$4F32A2FF-6BF9-464F-A703-05754AF1ED48","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2f815412db4bb238a5002dbd707a526178297e80","datavalue":{"value":"W2140092022","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1223161$036A6888-A48C-4451-B71F-9A975EE0F82C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A principle of independence for binary tree searching","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_principle_of_independence_for_binary_tree_searching"}}}}}