{"entities":{"Q6490972":{"pageid":14069741,"ns":120,"title":"Item:Q6490972","lastrevid":103503347,"modified":"2026-06-06T07:30:13Z","type":"item","id":"Q6490972","labels":{"en":{"language":"en","value":"Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7836590"}},"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":"Q6490972$46D78605-273D-4EE7-B8CA-E5A9B23C9886","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"071418c8350169fb40dcdb789d657a7cf48dc584","datavalue":{"value":{"text":"Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6490972$716F0F1E-FBF4-4AD3-9F67-BF548DE031BD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2437e1fe59b9a1021583e9d6dc20eaeaa9df9643","datavalue":{"value":{"entity-type":"item","numeric-id":6405109,"id":"Q6405109"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6490972$989183BD-D10E-47C9-B5A3-A0977D4C9365","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a45171a1fded3ad6fe9ca77db7ca1c9dfd6ed505","datavalue":{"value":{"entity-type":"item","numeric-id":833712,"id":"Q833712"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6490972$489FB42E-2E48-4254-80C6-50BF252A5BE9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"032f9a20c202a9b1863ae3bd37fdc8353d28eb47","datavalue":{"value":{"time":"+2024-04-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6490972$E0326D4F-D6F0-408E-9EAC-2BF91F3944B4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6490972$AAECB12B-AC36-4B86-BBCC-25C93D49A499","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"169f08e9128ca429bd436c674ddf3e8f5a5bd6a1","datavalue":{"value":"7836590","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6490972$E5222468-4703-49D0-A3E6-12C497FB0D89","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eb4dbee0d48d17c0702756f23f68f3af28651233","datavalue":{"value":"induced subgraph","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490972$EC54E3D4-2CDC-41B1-945F-8782535994C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2988becd8bdec55381793b2adbb16d08816fd8ca","datavalue":{"value":"induced path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490972$1B9B2B04-64EB-4AFF-AF0A-ACA1AB50C33F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"46cb27099fb36cfe13f1a7d5659eceb6fd853231","datavalue":{"value":"non-shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490972$BEBD075E-3225-4655-A172-9445F051448A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a8c0d9685aea0c090b360f522fc529eac4f486ae","datavalue":{"value":"dynamic data structure","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490972$53CEFC59-CA80-4A27-B5DB-DD1054DBDD1F","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":"Q6490972$E4E1CCB2-4BD6-4226-9080-C40DF0468C0F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8bcb348907cdd7812de79eb939cc82a1c5a9c77e","datavalue":{"value":"10.4230/LIPICS.STACS.2022.23","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6490972$DC3B3525-7D28-4333-AA52-9BA7CB2C8E0E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (scientific article; zbMATH DE number 7836590)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Blazing_a_trail_via_matrix_multiplications:_a_faster_algorithm_for_non-shortest_induced_paths_(scientific_article;_zbMATH_DE_number_7836590)"}}}}}