{"entities":{"Q6526707":{"pageid":14137768,"ns":120,"title":"Item:Q6526707","lastrevid":103475651,"modified":"2026-06-06T07:27:03Z","type":"item","id":"Q6526707","labels":{"en":{"language":"en","value":"Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6526707$4062F81D-A2BC-4385-A9FA-8A7CB4A7D986","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cc8ed36ef091bb25cdf5cb91674cc553efef5faf","datavalue":{"value":{"text":"Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6526707$83777017-E434-4474-B52F-56C2F29B1D8B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e89e4bb9940698bab28a04426e664f40076a08f","datavalue":{"value":{"entity-type":"item","numeric-id":6526706,"id":"Q6526706"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6526707$05405F86-ABA4-483B-BB1E-E3911F9744FD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6ecae2ef313b301a087d9359e08333d8c6395b4f","datavalue":{"value":{"entity-type":"item","numeric-id":295643,"id":"Q295643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6526707$E2B6CD3C-65EE-4CB9-95C6-FF2BDBA31836","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a67b9eafd7c737a4c5260adde5b42a0acfba63ce","datavalue":{"value":{"entity-type":"item","numeric-id":685963,"id":"Q685963"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6526707$A5B915E6-819B-4133-BD1A-A11AC1F55B1C","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":"Q6526707$ACA94E8C-B7DF-4E75-A455-52B45783399C","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"0698c9f74e51cfeeaa150ce6b192e93f2aa2ba47","datavalue":{"value":"2403.12734","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6526707$A989A79D-1E74-4A89-855A-52704EF76A28","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"eb3e473e9c29dd2fe315f869103c8943c2db95b6","datavalue":{"value":"https://github.com/nholtgrefe/computingscanwidth","type":"string"},"datatype":"url"},"type":"statement","id":"Q6526707$EE069D96-409B-45A9-A171-F5CB4B07413D","rank":"normal","references":[{"hash":"6a6f960d8dd83d3396378123622949cc5a788730","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"556b13b9defde204c699697ae349cf72c7337845","datavalue":{"value":"https://paperswithcode.com/paper/exact-and-heuristic-computation-of-the","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Exact_and_Heuristic_Computation_of_the_Scanwidth_of_Directed_Acyclic_Graphs"}}}}}