{"entities":{"Q7107899":{"pageid":21937887,"ns":120,"title":"Item:Q7107899","lastrevid":106728551,"modified":"2026-10-22T13:45:18Z","type":"item","id":"Q7107899","labels":{"en":{"language":"en","value":"A Maximum Linear Arrangement Problem on Directed Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q7107899$5471EC16-5B96-43BF-96BA-53316AEF6725","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-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":"Q7107899$18FAE3CF-EB3D-4FC5-B2F0-8FD66CA82430","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"f3a5a118a2377686d46376cec8bf243936f226b7","datavalue":{"value":"1810.12277","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7107899$6DE79D67-035B-46D8-B386-59931A163155","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"113a7c04a1b9b5a7e2e7fde86cb75d2b02044bee","datavalue":{"value":{"entity-type":"item","numeric-id":273177,"id":"Q273177"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7107899$E93B0446-3319-4CB8-9E83-6A1C0B9DBADC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2ca312bc113e1428e08c4052b4adfd667a47c34e","datavalue":{"value":{"entity-type":"item","numeric-id":6308942,"id":"Q6308942"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7107899$48671FC2-B94D-4341-9331-908E3573A5E1","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":"Q7107899$56EE9944-D9DA-4740-9ED7-5B8259D2DD49","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":"Q7107899$4DE63355-FAB0-408B-AF3B-F9F3069E349F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Maximum Linear Arrangement Problem on Directed Graphs (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Maximum_Linear_Arrangement_Problem_on_Directed_Graphs_(scientific_article_from_arXiv)"}}}}}