{"entities":{"Q6575158":{"pageid":14186313,"ns":120,"title":"Item:Q6575158","lastrevid":99881885,"modified":"2026-06-05T20:55:17Z","type":"item","id":"Q6575158","labels":{"en":{"language":"en","value":"Efficient generation of elimination trees and graph associahedra"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883665"}},"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":"Q6575158$D0585EBE-94B0-4368-B744-6F856264215A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ff453adf6aff9d362222b2234a9850eaab1c625e","datavalue":{"value":{"text":"Efficient generation of elimination trees and graph associahedra","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575158$E806B4B1-D699-404A-9107-F0E0BBDE48B4","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7a2783b3ff156fa505f072bdab4829be9c32ddf2","datavalue":{"value":"10.1137/1.9781611977073.84","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575158$DB8C673F-50CE-4AB0-A13B-AE8232493EBE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c8726a15dc299cd4173f24acc61812735416bfa6","datavalue":{"value":{"entity-type":"item","numeric-id":364845,"id":"Q364845"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575158$FBE234FB-0630-43C5-942D-9FDED2538663","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2516675980eeb03cd71d0cea1f56329e488d309c","datavalue":{"value":{"entity-type":"item","numeric-id":5080483,"id":"Q5080483"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575158$3CF53AA0-B7F8-4D53-8463-E55153412888","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7ede7458759da710fb9c72f49308d00c18f22ac4","datavalue":{"value":{"entity-type":"item","numeric-id":299828,"id":"Q299828"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575158$B067A233-21FA-4CE5-BA18-CC312A15B373","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575158$A374C0DA-F9F3-44DA-914E-8AB4A5F3457F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575158$AEA9030F-209C-496F-B34A-81DC272FE241","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2f473e5d5f174c240693262f048a118b3fe4cf97","datavalue":{"value":"7883665","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575158$67C16E49-FB43-4990-8E70-290F09AC460B","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":"Q6575158$9515D015-9F78-41A6-9891-0A0EBD26C4C4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient generation of elimination trees and graph associahedra","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_generation_of_elimination_trees_and_graph_associahedra"}}}}}