{"entities":{"Q6316034":{"pageid":13451848,"ns":120,"title":"Item:Q6316034","lastrevid":99108338,"modified":"2026-06-05T19:14:23Z","type":"item","id":"Q6316034","labels":{"en":{"language":"en","value":"The Binary Space Partitioning-Tree Process"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900374488"}},"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":"Q6316034$9122DEC2-5A7B-4A2E-B535-427259FBF38A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9d0bfb78353205537b90346e8569ab44f4493089","datavalue":{"value":{"time":"+2019-03-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6316034$CEF349EA-4E83-4C89-8976-4A547B95ACDE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8e586c71b762c6ffa78248479323bc7bd57760f2","datavalue":{"value":{"entity-type":"item","numeric-id":1669600,"id":"Q1669600"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6316034$32F18F00-9778-4C83-AC92-47F2A6B72E44","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"96dd538bda991513814b44b75e3e93092256fcc0","datavalue":{"value":{"entity-type":"item","numeric-id":6057949,"id":"Q6057949"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6316034$731B5FB6-41CD-4D58-87A0-9D79D245AA06","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"efc515e9d9f95a8d630634a7be4423a55506882a","datavalue":{"value":{"entity-type":"item","numeric-id":6315347,"id":"Q6315347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6316034$E4ABDC6F-A718-4EBA-A29D-612B274D94C4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ed55b392b98894d34f3aea053686c0b8e519a36d","datavalue":{"value":"900374488","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6316034$EFF33F5D-D2CD-4206-AE20-7E76AAD94FF0","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":"Q6316034$FD9599BD-8C6A-4061-AF2D-1154C05CBD54","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The Binary Space Partitioning-Tree Process","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_Binary_Space_Partitioning-Tree_Process"}}}}}