{"entities":{"Q6732453":{"pageid":14451231,"ns":120,"title":"Item:Q6732453","lastrevid":105850181,"modified":"2026-10-21T12:28:46Z","type":"item","id":"Q6732453","labels":{"en":{"language":"en","value":"Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q6732453$FB8D1473-3318-43BD-8732-5EEB8F4E73F8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fecb2f2a7c1f813db3a025a7dd8b5d82439618b9","datavalue":{"value":{"time":"+2024-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":"Q6732453$C622CA5B-F929-4F47-999F-810FE962C0A1","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"e540c3d13ab8cefab0112a07e2c65822bd5976ed","datavalue":{"value":"2406.08913","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6732453$EFB43257-A556-4244-8011-398D88698655","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f915f812b9ae603b8f64ef2abc0d660aacf1c33b","datavalue":{"value":{"entity-type":"item","numeric-id":5074692,"id":"Q5074692"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6732453$4220EB1C-8E7F-42DB-9B68-017D3BBE07FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5b905a1f97eedf9f0c58cb4ee92d3415099d061","datavalue":{"value":{"entity-type":"item","numeric-id":202655,"id":"Q202655"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6732453$388B648E-1763-4907-A729-A5DB275D89A2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c32ff5b32249e6b4db0d5020326f835a38c44010","datavalue":{"value":{"entity-type":"item","numeric-id":2080229,"id":"Q2080229"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6732453$1100B050-79B0-4A17-BF34-45B268BC4342","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3d70ae6f7ae43eb094cfcd0d099dcb48577d8ebd","datavalue":{"value":{"entity-type":"item","numeric-id":6509400,"id":"Q6509400"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6732453$B499DF5B-C393-4294-AB1B-57594D907BA8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f16f84468a45f8d402cf79bd075483e3f7168e11","datavalue":{"value":{"entity-type":"item","numeric-id":2191612,"id":"Q2191612"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6732453$11E04BE1-120B-4557-9969-B13E14AB92E9","rank":"normal"}],"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":"Q6732453$1D584706-985E-4977-B293-53EF44537A21","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":"Q6732453$0102CDD4-34AB-4072-B269-083D56731592","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Maximizing_the_Maximum_Degree_in_Ordered_Nearest_Neighbor_Graphs"}}}}}