{"entities":{"Q7174012":{"pageid":22143602,"ns":120,"title":"Item:Q7174012","lastrevid":107319569,"modified":"2026-10-23T13:27:36Z","type":"item","id":"Q7174012","labels":{"en":{"language":"en","value":"A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7174012$C3A080D1-0EAE-4788-8711-714083D7F54D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-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":"Q7174012$F81EFC96-D39A-41FA-872E-93F55F262E8D","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"5375e9c73a087c6a84e386aa4f631f85c15e49e8","datavalue":{"value":"2504.11313","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7174012$9FDCC986-7410-466F-BE3A-A5686866C4F0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5d9eba3b69bb9f0e2ff043c63e8abb19a5ad75c","datavalue":{"value":{"entity-type":"item","numeric-id":7174011,"id":"Q7174011"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7174012$AB640856-4B32-4349-8670-9F9ED40BCCDF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5f1f4996ce6877804f54ba07653e2bb77e9d94b","datavalue":{"value":{"entity-type":"item","numeric-id":312684,"id":"Q312684"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7174012$DA1E07DA-B165-4E13-AC3F-243C58ED9ACC","rank":"normal"}],"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":"Q7174012$FDE59748-24D2-42D2-A7B4-A387328D4C69","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":"Q7174012$52ACA567-A3B3-4A7B-97D1-F84EC00160DF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Composed_Alternating_Relaxed_Projection_Algorithm_for_Feasibility_Problem"}}}}}