{"entities":{"Q2743980":{"pageid":2754719,"ns":120,"title":"Item:Q2743980","lastrevid":41959566,"modified":"2025-05-19T16:37:28Z","type":"item","id":"Q2743980","labels":{"en":{"language":"en","value":"A technique for bounding the number of iterations in path following algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648021"}},"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":"Q2743980$D89FCFAA-E0DF-4FB3-B5AD-92464EFF2F18","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7d5ae50f0fef934b865a22d48ec2771f75b0673e","datavalue":{"value":"0968.90510","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743980$30F07716-EA6E-407D-A3CC-75B6B061B87E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f8de4a6f713c83ebac2233da0ff14b109d2f769d","datavalue":{"value":{"entity-type":"item","numeric-id":687083,"id":"Q687083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743980$0411099F-500E-4708-8984-F1048801D28B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9106274fb0e097225b96d0cd1675aa157cf14bf5","datavalue":{"value":{"entity-type":"item","numeric-id":687082,"id":"Q687082"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743980$177A2897-599C-4F95-BD39-9323C717D242","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a12c476678ac830de6d391e0b3f53860587b6e09","datavalue":{"value":{"time":"+2001-09-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2743980$9219D5D7-A260-4C2A-A3C2-BD8D6E4F74A0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743980$693D366E-C65C-4E9A-82BB-980471F0DE40","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743980$3301F15F-8A3D-4122-8A09-3728EAD5CDE7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9e5cb2a2e3dd23ccefe703338bcac46670c519eb","datavalue":{"value":"1648021","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743980$9F12C378-E907-4C2A-B967-A7D8BD78D5C3","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":"Q2743980$2985002F-A926-4F27-BAC0-6681952ADE3D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2ed48a897d3ba8e8d237a1404892a97ef22bf61e","datavalue":{"value":{"text":"A technique for bounding the number of iterations in path following algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2743980$E3A7F01D-B889-40E2-8DD5-CA53CB3D2955","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2743980","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2743980"}}}}}