{"entities":{"Q6353582":{"pageid":13488079,"ns":120,"title":"Item:Q6353582","lastrevid":103203530,"modified":"2026-06-06T06:31:54Z","type":"item","id":"Q6353582","labels":{"en":{"language":"en","value":"Recoverable Robust Single Machine Scheduling with Polyhedral Uncertainty"}},"descriptions":{"en":{"language":"en","value":"preprint 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":"Q6353582$049515B4-C6F9-4E85-B931-2F47EFD1B0F2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d7f72fe8b9514d4a127d9f5ec579865479ca839b","datavalue":{"value":{"time":"+2020-11-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6353582$93ED61D5-6A4C-4E96-A196-6CFAF5023822","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"8febe2274289c98cd6077c9c21b7f027af90d704","datavalue":{"value":"2011.06284","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6353582$52F322D2-A66D-47B9-9E99-7B50D51CFB49","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6353582$A0426C7B-0849-4B6E-9909-F30C44CF6163","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"d9c15d4dc922d1082ff725e5e40ff9c90d3b6ee4","datavalue":{"value":"cs.DM","type":"string"},"datatype":"string"},"type":"statement","id":"Q6353582$8489210B-3137-4514-8FFF-1292C37005BF","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"747ea54349360cf03068dc3b6926f93790280ca4","datavalue":{"value":"Matthew Bold","type":"string"},"datatype":"string"},"type":"statement","id":"Q6353582$DD92A1C3-49F7-4E76-94C4-B80B311A7987","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"276d0d4c21718460827778f3b01cf6242ff71923","datavalue":{"value":"Marc Goerigk","type":"string"},"datatype":"string"},"type":"statement","id":"Q6353582$5B371A5A-161B-453B-9BDD-876D08283F43","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":"Q6353582$C2C5B181-8177-4B6C-BFA8-71EFA8D86BB9","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"216e04d8d4c530244349b5903cdb2f6c33ec290b","datavalue":{"value":"https://github.com/boldm1/RR-single-machine-scheduling","type":"string"},"datatype":"url"},"type":"statement","id":"Q6353582$49CDCFDD-9C35-4A4B-99FB-DC4540DE4079","rank":"normal","references":[{"hash":"1139e8a7dbffc4d1998ed2dafe66c4fb94c71420","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"7612928c1ca44f36c45c1c11d8ea6d832fec10be","datavalue":{"value":"https://paperswithcode.com/paper/recoverable-robust-single-machine-scheduling","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":"Recoverable Robust Single Machine Scheduling with Polyhedral Uncertainty","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Recoverable_Robust_Single_Machine_Scheduling_with_Polyhedral_Uncertainty"}}}}}