{"entities":{"Q4778261":{"pageid":6807841,"ns":120,"title":"Item:Q4778261","lastrevid":74624922,"modified":"2026-04-14T23:38:46Z","type":"item","id":"Q4778261","labels":{"en":{"language":"en","value":"Efficient Algorithm for the Partitioning of Trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3454785"}},"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":"Q4778261$061F3936-E482-4B87-BDF1-DBF3ECDB8073","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fb697e8c18a1901dc4acb8157baa677daf5c52bb","datavalue":{"value":{"text":"Efficient Algorithm for the Partitioning of Trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4778261$7A5C516F-081C-4BA9-8ED8-7F0D5528981B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f2fbf5b2664bdbf140e9e49c0bf253261e82257a","datavalue":{"value":"0289.68008","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$04399338-4FF7-48DC-9266-53150AD86BDB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c563a2c8421e8ae256c1f698d5405cc797f31f1d","datavalue":{"value":{"entity-type":"item","numeric-id":4055187,"id":"Q4055187"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4778261$548BE67B-E47F-43A1-B639-CD755EA0794F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ac97000bb9a6c8b51835fb6b9b95dbf469544801","datavalue":{"value":{"entity-type":"item","numeric-id":3208397,"id":"Q3208397"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4778261$8D895DBA-55D3-401B-8AFA-A88F74CCCE0F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"718868df62fa29cb04609217d34e1254e53a40d9","datavalue":{"value":{"time":"+1974-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":"Q4778261$5AF3F45D-6519-4B54-BAA9-F12482B267B1","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"237b12916f8ae30c46012d9982736e739137823e","datavalue":{"value":"https://semanticscholar.org/paper/325709b0fc091cbebfa53bb32cc1c09143b25ba2","type":"string"},"datatype":"url"},"type":"statement","id":"Q4778261$A08EE7B2-DA9C-4A18-A657-4B9C9E3282E6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9ed1e3c6cced595a05b8ae19055521b22405b78a","datavalue":{"value":"68W99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$D1F06E85-E32D-439B-9A8F-A24D87377F99","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$33A1E8EB-2E58-4506-86FC-B8AE4055788D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2f9920e258389d79a7ef76ef96a77d2e9cc60267","datavalue":{"value":"05-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$582CEA19-A9FD-4D99-9692-11B2FA756176","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$D5CECD20-30C4-48E0-9067-C9EF407B4799","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"25763a8ef2301a641eaba3b53f95161a2b4d174b","datavalue":{"value":"94-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$70FBBFD3-1F02-4B19-A68D-8F8DDC5005DB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"791de1a5ed86d5a4b74514ae35b86577194412ed","datavalue":{"value":"3454785","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$CD95AF88-C4BC-4233-BC3D-1EE0EEE326AC","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":"Q4778261$867E4FD1-B230-4510-8132-44765D8D4075","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9efa549a6b666114feddefa9086c24eaf68ce2dd","datavalue":{"value":"W2048383295","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$544A737B-28D4-4AA1-8E89-856DE4E7E459","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5a81b57c84c20a419a6085e2c5f8595214b1e0ba","datavalue":{"value":"10.1147/RD.183.0217","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4778261$E64DD4FE-FC98-43C0-A3AB-0719326FB4EF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient Algorithm for the Partitioning of Trees","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_Algorithm_for_the_Partitioning_of_Trees"}}}}}