{"entities":{"Q6512268":{"pageid":14091227,"ns":120,"title":"Item:Q6512268","lastrevid":95539544,"modified":"2026-06-05T09:14:17Z","type":"item","id":"Q6512268","labels":{"en":{"language":"en","value":"Hierarchical Space Exploration Campaign Schedule Optimization With Ambiguous Programmatic Requirements"}},"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":"Q6512268$16A704D5-809F-4B92-808D-ED42D4D1AA22","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"62883ca6891183dee147bec4ab8feca7947dfb6d","datavalue":{"value":{"text":"Hierarchical Space Exploration Campaign Schedule Optimization With Ambiguous Programmatic Requirements","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6512268$F61DDAE7-39F2-47B6-8AB8-AFF38C3A2E65","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7fecc7ec5c6afc8c3a5422974b03b80696e16ee1","datavalue":{"value":{"entity-type":"item","numeric-id":6512267,"id":"Q6512267"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512268$3FE8A83B-91ED-46EF-BDEF-3BB1DAACCF8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2450ba795513a244a94154b1c75765285a8a6d6a","datavalue":{"value":{"entity-type":"item","numeric-id":6427584,"id":"Q6427584"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6512268$A31F8BBD-0AE9-4200-A865-6AD009E8CDFC","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":"Q6512268$A42BCDE8-10E2-443E-9194-DAD605995F66","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bc4f1afa637e8997ca883b44b53d375fb63b836b","datavalue":{"value":"10.2514/1.A35828","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6512268$DC0BBB1F-6784-4DF8-ACD8-DF7BAF7C9368","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"baf66d1efab4672fb806d5cb0943968dd21f2af7","datavalue":{"value":"2308.00632","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6512268$11F14AEC-2305-4D47-B8C6-C4F4A44C5B85","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Hierarchical Space Exploration Campaign Schedule Optimization With Ambiguous Programmatic Requirements","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Hierarchical_Space_Exploration_Campaign_Schedule_Optimization_With_Ambiguous_Programmatic_Requirements"}}}}}