{"entities":{"Q1313765":{"pageid":1324515,"ns":120,"title":"Item:Q1313765","lastrevid":68720853,"modified":"2026-04-13T01:39:36Z","type":"item","id":"Q1313765","labels":{"en":{"language":"en","value":"Kaikoura tree theorems: Computing the maximum agreement subtree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 500552"}},"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":"Q1313765$440E7271-21B1-46AE-B315-F7B0666DCB2F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c39de1b326ce976e4aec50931b7b2a74ae05d218","datavalue":{"value":{"text":"Kaikoura tree theorems: Computing the maximum agreement subtree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1313765$17DAA2C4-F171-431D-9542-A57622670458","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"702356acd9f96bf51b4a01e1abbf6a3773756a21","datavalue":{"value":"0942.68578","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$D42FCEF4-9892-47E6-A9E8-455AEEBABEEA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"dded4ddde4e4d5446cc236b3f804ddeec83194e8","datavalue":{"value":"10.1016/0020-0190(93)90181-8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$FCF64878-2C50-435E-A3EB-F9837B388F73","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"75f44fd5176cfaeb1c41f3609e0533bcbc86cf5d","datavalue":{"value":{"entity-type":"item","numeric-id":659797,"id":"Q659797"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313765$E30B02CC-A8E8-48AD-AFBD-F34C42E5F931","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d50a47eacbc0db0113094ac916c52df906e1675b","datavalue":{"value":{"entity-type":"item","numeric-id":1575711,"id":"Q1575711"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313765$166F2DE5-4914-4787-96B5-E0CF68CD7F66","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313765$665A80F1-FB53-4C25-BECD-36B3193D9F8B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"97fbaa74108aac30250cdf29ad1831a2e82622ab","datavalue":{"value":{"time":"+2000-08-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1313765$8C6E5720-612F-4CAD-ACDD-88D7816C0581","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$F6F26076-580F-4BA7-9E0E-33A9A950F760","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4a5372688a0d668805df5d9ffd1da58833a0f595","datavalue":{"value":"68R05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$6F820EFF-6826-4244-B0A8-DC7D00D198CF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$9BCDFA25-83A2-4B90-BCC5-7E06D8A291D1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c4be65902485cae753f114a01dc356720d7aebd3","datavalue":{"value":"500552","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$DA05D3F6-0412-4AC9-A1E1-3B51CFB9F548","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":"Q1313765$FE76204E-A04E-40B3-8B9B-C807AE036799","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"72d9d5db0f224daa07845192dee84ae10f02e127","datavalue":{"value":"https://doi.org/10.1016/0020-0190(93)90181-8","type":"string"},"datatype":"url"},"type":"statement","id":"Q1313765$B65CA67D-FBA8-497D-A94B-5EA1A6BFC082","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"901b484684ca79acd6055463a67d2482027c79cd","datavalue":{"value":"W1963749031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1313765$4E04D0FA-DD13-48CE-A069-ADB0BA477C12","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"bc0e8163b1cc59cd0372ae78b75cdf8e0d4a3fac","datavalue":{"value":{"entity-type":"item","numeric-id":4729348,"id":"Q4729348"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313765$B2737E93-F4A5-4D6F-AD65-DC5F8D2B75F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3dc0db25b8e3757a0bd41e5471f389a428bb11ec","datavalue":{"value":{"entity-type":"item","numeric-id":1901396,"id":"Q1901396"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313765$A8169D50-1B71-4849-91C5-369C4D622111","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2caaa098449926825c046992243f1429b91697b4","datavalue":{"value":{"entity-type":"item","numeric-id":3139538,"id":"Q3139538"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1313765$85CD2DCB-D89F-44AB-9D7C-EA6A8D3A3FCD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Kaikoura tree theorems: Computing the maximum agreement subtree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Kaikoura_tree_theorems:_Computing_the_maximum_agreement_subtree"}}}}}