{"entities":{"Q6575134":{"pageid":14186289,"ns":120,"title":"Item:Q6575134","lastrevid":99881669,"modified":"2026-06-05T20:55:16Z","type":"item","id":"Q6575134","labels":{"en":{"language":"en","value":"Faster algorithms for bounded-difference min-plus product"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883641"}},"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":"Q6575134$919AFF8E-8EBB-4751-AFA5-6F6D5D4F6867","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"19284d45621f4a2f04299fefc2f607b0683b49b5","datavalue":{"value":{"text":"Faster algorithms for bounded-difference min-plus product","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575134$0A84B3D5-0210-4AF9-856D-CEC14C3BD15E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8f9335d7e3244314285fa193cea9e531fdcdf58d","datavalue":{"value":"10.1137/1.9781611977073.60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575134$1A0E0BEE-5E7E-4F29-90A3-DFFD2E085A9A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"af8dc5e943fbd3c6e67d34860806a295919f9cf0","datavalue":{"value":{"entity-type":"item","numeric-id":6083606,"id":"Q6083606"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575134$9C87A5BC-091C-429F-B5E6-85B1FD7662CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"73d6999409f080ab1ee55fdc68b9c7cf099e6240","datavalue":{"value":{"entity-type":"item","numeric-id":507560,"id":"Q507560"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575134$8FD20CD3-BAA1-4B26-B88C-9E7DEE6B99AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3e6c061c09bf27e9d1ed48b71e1d6b0d51ae4d0f","datavalue":{"value":{"entity-type":"item","numeric-id":6083607,"id":"Q6083607"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575134$E3E4603C-1C53-4B16-A18D-C2380BB70C86","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575134$FBF73E88-E027-4945-9DD1-048D02FC151C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575134$EBF1A188-4925-4E86-96A2-C9507E893C37","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8883205ef064af4c2f4b0a521730511d5f51e441","datavalue":{"value":"7883641","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575134$BA21F846-E9A2-4EDE-906F-00DB7D98E802","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":"Q6575134$D33135A3-3B73-492D-B06D-8DF171BE5582","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster algorithms for bounded-difference min-plus product","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_algorithms_for_bounded-difference_min-plus_product"}}}}}