{"entities":{"Q7361735":{"pageid":31520744,"ns":120,"title":"Item:Q7361735","lastrevid":105368474,"modified":"2026-10-07T13:37:30Z","type":"item","id":"Q7361735","labels":{"en":{"language":"en","value":"Closest Pair of Points Algorithms"}},"descriptions":{"en":{"language":"en","value":"AFP entry Closest_Pair_Points"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"008b03b51c6e836fab5c42b5692b84d4b0a53350","datavalue":{"value":"https://isa-afp.org/entries/Closest_Pair_Points.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361735$703A9752-23FD-4F60-9B45-C4D40E1B3429","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6b7e8cf16d5068a895c69c4cf37d7b5d354bf018","datavalue":{"value":{"time":"+2020-01-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361735$B5BBA0B1-2C19-42D2-B020-029A78FD81D3","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"44339fcce651e1b75c86fd5d7808e314117ddcb2","datavalue":{"value":"Martin Rau","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361735$98765971-2B85-4311-B315-557A73CB64ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"78083bbf5b06a4f292e9e00ee445948e4fa51db5","datavalue":{"value":"Tobias Nipkow","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361735$F9A3EC6C-4352-4F92-A1D1-3B86775BB66F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d174d9f34e79a85e0bb11b727ca81982c25a83c0","datavalue":{"value":{"text":"Closest Pair of Points Algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361735$8FA4E985-CDE8-4820-B2C3-5E5D422D81A7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"2c0a481c8e0ce60ef57b3a741fe12e271eeb07b2","datavalue":{"value":"This entry provides two related verified divide-and-conquer algorithms solving the fundamental Closest Pair of Points problem in Computational Geometry. Functional correctness and the optimal running time of O ( n log n ) are proved. Executable code is generated which is empirically competitive with handwritten reference implementations.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361735$3B6167AF-4175-43BE-B5A8-1D04C88A4F90","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b79eadc5c7ac47e51026891c752c528f156e1276","datavalue":{"value":{"entity-type":"item","numeric-id":6906466,"id":"Q6906466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$6A608958-7106-4CE0-9C72-9BAAF299D9F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9194e9b150f8488fef979658da21ddd0e60751fc","datavalue":{"value":{"entity-type":"item","numeric-id":3651735,"id":"Q3651735"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$60A139C1-799F-43F4-A0F5-B850F5AE7346","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$0963436C-4C8A-4E63-9AE4-E269746C9D78","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"c59d6423163046acce1b8b61c05910b8e4e338ca","datavalue":{"value":{"entity-type":"item","numeric-id":7361782,"id":"Q7361782"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$055736E5-B289-433D-94CD-FC41651BEF65","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"c19d3d2985ae4c7264c7edf9445a6e4552a316dc","datavalue":{"value":{"entity-type":"item","numeric-id":7361880,"id":"Q7361880"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$96FD2595-C093-4643-9156-4127B26D3CCD","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"346453d5c7f026e4cd2e3cd3fee1e526a3eb7f29","datavalue":{"value":{"entity-type":"item","numeric-id":7360776,"id":"Q7360776"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$AF9C5FBE-245A-4EFE-8EC0-59C8191FEDC7","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361735$20EB1312-A63B-47E4-821D-A01E28024E6D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Closest Pair of Points Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Closest_Pair_of_Points_Algorithms"}}}}}