{"entities":{"Q6970747":{"pageid":21327546,"ns":120,"title":"Item:Q6970747","lastrevid":76187994,"modified":"2026-04-23T04:15:33Z","type":"item","id":"Q6970747","labels":{"en":{"language":"en","value":"Sublinear algorithms for scheduling with chain precedence constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8053561"}},"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":"Q6970747$CB74CFEA-C7B8-4C56-9010-73905E87C5EB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"442aadb1b44c5dc5321b9b52c79fcb53d62139cd","datavalue":{"value":{"text":"Sublinear algorithms for scheduling with chain precedence constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6970747$4E780EF1-91E1-4DDC-9874-0C6BD4BCCBCA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fed226ff3c0e8da77f0ecff265c15f2a89562889","datavalue":{"value":"10.1007/978-981-96-1090-7_4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6970747$5567C9EE-1D08-4216-BE31-1588816B4176","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d224193872547e7ed5c8874bbaf20d2bd49220bb","datavalue":{"value":{"entity-type":"item","numeric-id":313968,"id":"Q313968"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6970747$A7271D8F-C992-4F6F-A03F-781F320BDFFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"56494b068c6b3764212589b3a9e9b2df4138aa49","datavalue":{"value":{"entity-type":"item","numeric-id":319144,"id":"Q319144"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6970747$9526D3AB-CBE1-4E03-837C-3561C1573250","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e85103845c74f03c4ecf90171d80d2e83494147f","datavalue":{"value":{"entity-type":"item","numeric-id":319145,"id":"Q319145"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6970747$6BD10083-6E03-4A8A-97A9-124A2767AAE5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0624fa178e03b9fff03ae621c7db899ea102bb25","datavalue":{"value":{"time":"+2025-06-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6970747$0CAD8822-C2A5-47D9-8DF2-AD856DE3C725","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6970747$31DBAB6F-B481-497B-AE47-4DC9743F1587","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b90cd37f5dee0124c40f928b39d4e1418e5fa6cd","datavalue":{"value":"8053561","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6970747$5C6CF684-7C42-4B82-8BED-08BC3CC05B65","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":"Q6970747$32611E2C-4BE4-4715-8299-619495B656CE","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Sublinear algorithms for scheduling with chain precedence constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Sublinear_algorithms_for_scheduling_with_chain_precedence_constraints"}}}}}