{"entities":{"Q7070652":{"pageid":21825231,"ns":120,"title":"Item:Q7070652","lastrevid":106392230,"modified":"2026-10-22T11:15:38Z","type":"item","id":"Q7070652","labels":{"en":{"language":"en","value":"Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence"}},"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":"Q7070652$F627F199-53AF-4E86-B31F-990DCE7A9BA4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5e75219c8cee2bb66a30bc1eac77b3f1fe83abf5","datavalue":{"value":{"time":"+2013-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":"Q7070652$063D5243-EBA9-47D6-B3ED-87705B30D852","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"4782b8ea34eb642a344e444f5cf06880749f6f3d","datavalue":{"value":"1311.2879","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7070652$043B293C-B90D-4660-9746-A4830BB70FDF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"dcd57e1bd087f57706a590e254f26b9542c019b8","datavalue":{"value":{"entity-type":"item","numeric-id":2958367,"id":"Q2958367"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7070652$241F7BB5-F25E-44ED-A4AD-5548D259C467","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"52438b138c334413c6abaa1b3816cf519bc8fd04","datavalue":{"value":{"entity-type":"item","numeric-id":403014,"id":"Q403014"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7070652$C3DAD276-4B0E-423E-8B0C-512EEC426995","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7aa41520a03e0f739377652eb4614a0f3f505528","datavalue":{"value":{"entity-type":"item","numeric-id":269063,"id":"Q269063"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7070652$A8756C69-F727-4B42-B0CC-93288833E0D3","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":"Q7070652$EFF45E75-F726-4614-8B8C-55E217E76D5A","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":"Q7070652$73E53F7D-1580-4BA9-8276-572F3C06EB8E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Common_Due-Date_Problem:_Exact_Polynomial_Algorithms_for_a_Given_Job_Sequence"}}}}}