{"entities":{"Q6439804":{"pageid":13572817,"ns":120,"title":"Item:Q6439804","lastrevid":103123151,"modified":"2026-06-06T06:21:11Z","type":"item","id":"Q6439804","labels":{"en":{"language":"en","value":"Optimal distance query reconstruction for graphs without long induced cycles"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900595516"}},"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":"Q6439804$2399371E-03F8-4ECF-B118-D8A3DC84F021","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"44e1828fa073c0379809daaccd24365530666147","datavalue":{"value":{"time":"+2023-06-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6439804$10EF5A77-0EFC-453F-B9E6-95E63283F4ED","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7c4ce59956245f2650dea255dcf9bdd86b5a1c23","datavalue":{"value":{"entity-type":"item","numeric-id":2233159,"id":"Q2233159"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6439804$DCA98726-4E0B-4393-A828-8A4B709FB76C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7b2b657973b9b789970b8fba888e1b9abb91c42c","datavalue":{"value":{"entity-type":"item","numeric-id":2010642,"id":"Q2010642"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6439804$1186BB45-7482-4452-89EF-F8F0A60856A6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"91a6e53c5bce861d532aa7932b626301f964fd73","datavalue":{"value":"900595516","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6439804$C410FEA9-60E2-4B36-AD8A-52B3C2B4D7E4","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":"Q6439804$A59E7447-ABD3-4D9D-A729-9FB1AEC2D5B4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal distance query reconstruction for graphs without long induced cycles","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_distance_query_reconstruction_for_graphs_without_long_induced_cycles"}}}}}