{"entities":{"Q6657035":{"pageid":14268192,"ns":120,"title":"Item:Q6657035","lastrevid":103682357,"modified":"2026-06-06T07:54:19Z","type":"item","id":"Q6657035","labels":{"en":{"language":"en","value":"Towards bypassing lower bounds for graph shortcuts"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7961918"}},"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":"Q6657035$F766E0ED-26E8-4B85-9A1C-BD7971CBA461","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0cde0532f9d11142b6f8eb8bcea363481daadf33","datavalue":{"value":{"text":"Towards bypassing lower bounds for graph shortcuts","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6657035$F1DCD7FD-E689-40A3-A2DB-7CB102E243C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"de5adae93860f2eb93717d679c34b293a3d1f133","datavalue":{"value":{"entity-type":"item","numeric-id":528992,"id":"Q528992"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657035$D75DCB2A-E87D-4D37-9BCB-965343DF4E00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a5e7d33a4638268d113de2abb760a7c1253e35b0","datavalue":{"value":{"entity-type":"item","numeric-id":831781,"id":"Q831781"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6657035$79F43B23-A77A-4389-95FF-F281CE5EDA21","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"61d4fcd001548dfc6222d0098d472cd2a6031b71","datavalue":{"value":{"time":"+2025-01-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6657035$588DD411-5768-45AF-93A8-CEFFF59191E7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657035$045A6DE9-F76D-49A6-BB10-3C418CECDF21","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"be48c7da5e6db16e326e7fd93b261391597ba858","datavalue":{"value":"7961918","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657035$5FBDADED-327A-4FB1-AA42-220A4AA3AED8","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d10ea1ad28f40feb2a4e7b7ee9d07a89d3861e57","datavalue":{"value":"directed shortcuts","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657035$C0613E4B-85E9-44ED-9F30-1DA6E737E2B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"047ee34d75e601cfb5cfee7e082ceaaf2562544e","datavalue":{"value":"hopsets","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657035$77CD4882-58EA-4D45-8DCE-0D417DC2BC70","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"458f453000184dd64f94bd1671acf31f52762e52","datavalue":{"value":"emulators","type":"string"},"datatype":"string"},"type":"statement","id":"Q6657035$05ABF2A8-3C57-4AD4-B2B2-8E4B288A2651","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":"Q6657035$F36B9A0A-A25E-4B6D-AB68-4BD9163755FB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"78c5a688e517b6e4afcb3c9af9da2a6826a4a5a0","datavalue":{"value":"10.4230/LIPICS.ESA.2023.73","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6657035$F48FD3A2-5C19-404B-B68B-57F1374C078D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Towards bypassing lower bounds for graph shortcuts","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Towards_bypassing_lower_bounds_for_graph_shortcuts"}}}}}