{"entities":{"Q1259270":{"pageid":1270020,"ns":120,"title":"Item:Q1259270","lastrevid":70486065,"modified":"2026-04-13T14:57:11Z","type":"item","id":"Q1259270","labels":{"en":{"language":"en","value":"A spectral algorithm for sequential aggregation of m linear diophantine constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3637593"}},"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":"Q1259270$FEA4DC58-5CD0-4701-94B3-A5905678D086","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b98d9bfb34181a3b7fe7b98949d496c01d340198","datavalue":{"value":{"text":"A spectral algorithm for sequential aggregation of m linear diophantine constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1259270$FF7A3521-2F00-40CA-AE68-E31D5DE364DF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e25d79696ed341fd4e7239d810cd549235eb2d8f","datavalue":{"value":"0409.90058","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1259270$FEE3DCA0-496D-4174-895A-1A30423BC9CD","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d0c90eff0b11142ed4dfd441e7fc8b5ab5a516d5","datavalue":{"value":"10.1007/BF01590845","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1259270$034A84BB-5CF3-4E5F-83F7-89B5FA7055CA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"160990d9734ede3485e4fefa0ab6ffc46f5db4cf","datavalue":{"value":{"entity-type":"item","numeric-id":1244169,"id":"Q1244169"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1259270$EA2BDCCD-CC7F-48BB-89A6-AC667015CB10","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b4853c523daea7882d6b56bcce0ec1aba052e904","datavalue":{"value":{"entity-type":"item","numeric-id":174666,"id":"Q174666"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1259270$CC7A11E2-DA5F-4A97-9FB6-63340DD27F1E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0b87f78dda5694898cc127305eecf88680ce6c83","datavalue":{"value":{"time":"+1979-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1259270$E351E08D-CB4A-4733-A201-D0B8231B8EAD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1259270$66D343B0-7F3D-4E72-A582-1B5B39B7A7B4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c1649e0541a4f0018ccf2f2ae276a64ff7205ce9","datavalue":{"value":"3637593","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1259270$F8C363B8-F5A7-4304-B0AB-85683523E484","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ac8fc3f6004ce3ac46c1905b05e53e0c0c68d022","datavalue":{"value":"Spectral Algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1259270$957736C6-9415-4529-8231-91DFDE1EF0B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d3f2ee1adf5b53d1b1b835f56cc7ccd9880a5a97","datavalue":{"value":"Sequential AgGregation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1259270$67E50B87-707E-413A-825F-74994BE4D4BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b2c9cd1a28787ff3f5fabc1149ed011663ecd7b9","datavalue":{"value":"Linear Diophantine Constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q1259270$90CCF931-B3C6-45B3-A776-4912FC2B3333","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3c3f60d1a5bc95373a6bf5a47110beb9bcfae87d","datavalue":{"value":"Integer Programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1259270$66F392F3-F636-491D-9E62-0B57F83D6228","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":"Q1259270$D4458CB1-A79A-4401-BC04-FEF05EE28657","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"e95ae45195cbcee64b5394f5e83079a283f51ea3","datavalue":{"value":{"entity-type":"item","numeric-id":1244170,"id":"Q1244170"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1259270$8B92A818-09B0-4BB0-8444-22D439582ACD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"808929934e72f188a428d880ba558d1f94d6a3c8","datavalue":{"value":{"entity-type":"item","numeric-id":4044367,"id":"Q4044367"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1259270$1EC5630B-AB90-4F4B-88FF-170A4A0C553A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7a7e1d33d19afa87915f0666c881c355e4f2601b","datavalue":{"value":{"entity-type":"item","numeric-id":2547181,"id":"Q2547181"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1259270$35B75619-7E50-4D1B-B6E8-05E0491AF487","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A spectral algorithm for sequential aggregation of m linear diophantine constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_spectral_algorithm_for_sequential_aggregation_of_m_linear_diophantine_constraints"}}}}}