{"entities":{"Q6504439":{"pageid":14083392,"ns":120,"title":"Item:Q6504439","lastrevid":103634834,"modified":"2026-06-06T07:47:40Z","type":"item","id":"Q6504439","labels":{"en":{"language":"en","value":"Interval constraint programming for globally solving catalog-based categorical optimization"}},"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":"Q6504439$8EA25EEF-F8D3-4EB6-98A4-3A33B928897B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"26ad32de979554b57f4d84ffd508c7ecfd212a7a","datavalue":{"value":{"text":"Interval constraint programming for globally solving catalog-based categorical optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6504439$E0ABBF39-E66F-4488-9D61-7F72035F0057","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"55c6950022cade7c37032b1dd7537ebaeacad51a","datavalue":{"value":{"entity-type":"item","numeric-id":2216189,"id":"Q2216189"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6504439$132F99B4-C712-456C-B3FB-A5C186D7F148","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":"Q6504439$D98925AA-04E8-4713-967C-E9744F7014F8","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"5de8034e9373d88fcae14582ed48a542a625de03","datavalue":{"value":"Q129573990","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6504439$03CD49EF-583E-4082-8B51-E9F0B07A5941","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"234e402d0b312a33ccf7510fbd3ece7c5d045dd3","datavalue":{"value":"10.1007/S10898-023-01362-0","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6504439$481385F7-B708-40CB-B411-31EDCB57ECA0","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"f48a8664ef8ec6e3b66c73b13957d9097d5f6cd0","datavalue":{"value":"2104.03652","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6504439$634FE6EA-46A2-4AF1-84DD-BB2BFF70984F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Interval constraint programming for globally solving catalog-based categorical optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Interval_constraint_programming_for_globally_solving_catalog-based_categorical_optimization"}}}}}