{"entities":{"Q4147803":{"pageid":6177403,"ns":120,"title":"Item:Q4147803","lastrevid":89119184,"modified":"2026-06-04T16:24:21Z","type":"item","id":"Q4147803","labels":{"en":{"language":"en","value":"A Descent Algorithm for the Multihour Sizing of Traffic Networks"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3578577"}},"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":"Q4147803$C868E164-ED88-46A5-AEF2-274AFCF172A4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c889e2a286d38703be86974e403db88860457890","datavalue":{"value":{"text":"A Descent Algorithm for the Multihour Sizing of Traffic Networks","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4147803$BD1BC256-0228-4862-97F6-B46BBD714A9B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"53ece91fac1182c92f066b988d59924fd5895503","datavalue":{"value":"0371.90040","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$76326499-4E05-4E1D-BAF8-7689F6860680","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d3b8d6cc3b501a7a2266d50f8309576e3311697d","datavalue":{"value":{"entity-type":"item","numeric-id":4060799,"id":"Q4060799"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4147803$E62F98EB-98BD-4677-8633-001C6C02C9D9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"de75230384798b66a14ef52bdd2c22030d13417c","datavalue":{"value":{"entity-type":"item","numeric-id":88166,"id":"Q88166"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4147803$558A2B05-9AC6-4163-AF7E-2BA74B093259","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a49472451190faf858f564fafd4bcba399999753","datavalue":{"value":{"time":"+1977-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":"Q4147803$B0EC521C-8327-4D9D-9AFC-272DBA1F0D94","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$35DC9537-738F-47D4-914D-342D4C1B1715","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$B239F7B3-587C-4A50-A01F-E6861D4A0582","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1c819bcbc5228a4c15a0698bc48e27bac5cf3646","datavalue":{"value":"90B20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$D5FB85D3-C81B-4568-8631-AEA22552A264","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"522b15968a1f209d6e5da382425f6b2be9a46bd1","datavalue":{"value":"3578577","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$60508718-2F72-465C-A7AD-B2699A443C2D","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":"Q4147803$921E79B0-F12A-4C25-93B2-1B3151179A75","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f40002861f758b274cf7b4ebf831a4abb1ef8593","datavalue":{"value":"https://doi.org/10.1002/j.1538-7305.1977.tb00569.x","type":"string"},"datatype":"url"},"type":"statement","id":"Q4147803$7DE24A2E-6DBF-49FE-AAC4-6857411081CE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6a4cb5b498332596d7514f27f3df465a5e14ca8e","datavalue":{"value":"W2037714286","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$D8567DE8-BE2F-40BC-84EA-06FA15ABE5BB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4484a0783919618ceba00f70b0c0a9f98f6de8ab","datavalue":{"value":"10.1002/J.1538-7305.1977.TB00569.X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4147803$3F5AFBC8-1733-42C8-870C-F7459D9AEC5E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Descent Algorithm for the Multihour Sizing of Traffic Networks","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Descent_Algorithm_for_the_Multihour_Sizing_of_Traffic_Networks"}}}}}