Scheduled Commit

data/retrieval_individual-23cee96f-6768-4f6e-9a62-131dedf90618.jsonl

@@ -146,3 +146,5 @@
 {"tstamp": 1732296382.7925, "task_type": "retrieval", "type": "chat", "model": "intfloat/multilingual-e5-large-instruct", "gen_params": {}, "start": 1732296380.6347, "finish": 1732296382.7925, "ip": "", "conv_id": "8c683eae585b4286a3ca61d83d0639a3", "model_name": "intfloat/multilingual-e5-large-instruct", "prompt": "What is the average time of a formula 1 pit stop in 2024?", "output": [["What is the average time of a formula 1 pit stop in 2024?", "Pit stop\n\n2019 DXC Technology 600: Having led the race from pole position, Rahal Letterman Lanigan Racing's Takuma Sato entered the pits for his first stop at the end of lap 62 and overshot his pit box, hooking the inside air hoses and lollipop on his car and launching the inside front tire changer into the next pit box. The crewman was uninjured, but the lengthy pit stop and subsequent penalty for hitting pit equipment left Sato 3 laps down and out of contention.\n2019 British Grand Prix: The Red Bull Racing team completed a 1.91 pit stop for Pierre Gasly, making it the fourth fastest pit stop in F1 and overall.\n2019 German Grand Prix: The Red Bull Racing team completed a pit stop for Max Verstappen in 1.88 seconds, making it the third fastest pit stop in F1 and overall.\n2019 Brazilian Grand Prix: The Red Bull Racing team completed a pit stop for Max Verstappen in 1.82 seconds, making it the second fastest pit stop ever in F1 and overall.\n2021 Monaco Grand Prix: Valtteri Bottas of the Mercedes team was forced to retire from the race after his wheel could not be removed from the car due to a faulty wheel nut.\n2023 Qatar Grand Prix: The McLaren team completed a pit stop for Lando Norris in 1.80 seconds, making it the fastest pit stop ever in F1 and overall."]], "corpus": "wikipedia"}
 {"tstamp": 1732327306.5893, "task_type": "retrieval", "type": "chat", "model": "Salesforce/SFR-Embedding-2_R", "gen_params": {}, "start": 1732327304.312, "finish": 1732327306.5893, "ip": "", "conv_id": "1d9ccd0846184e79aecd5e4854703e0d", "model_name": "Salesforce/SFR-Embedding-2_R", "prompt": "are all orthogonal matrices symmetric?", "output": [["are all orthogonal matrices symmetric?", "Math Stackexchange\n\nQ: Non-symmetric matrix with orthogonal eigenvectors Given that a symmetric matrix with real entries has orthogonal eigenvectors, is the converse true? That is, if a matrix has orthogonal eigenvectors, does it have to be symmetrical and real?\n\nA: If a matrix $A$ has orthogonal eigenvectors, then there exists an orthogonal $P$ and a diagonal matrix $\\Lambda$ such that \n$$\nA=P\\Lambda P^\\top\n$$\nIt follows that \n$$\nA^\\top\n= (P\\Lambda P^\\top)^\\top\n= (P^\\top)^\\top\\Lambda^\\top P^\\top=P\\Lambda P^\\top=A\n$$\nHence $A$ is symmetric.\n"]], "corpus": "stackexchange"}
 {"tstamp": 1732327306.5893, "task_type": "retrieval", "type": "chat", "model": "sentence-transformers/all-MiniLM-L6-v2", "gen_params": {}, "start": 1732327304.312, "finish": 1732327306.5893, "ip": "", "conv_id": "cdf6fb4d46b544e2a4991eb0b903c3d2", "model_name": "sentence-transformers/all-MiniLM-L6-v2", "prompt": "are all orthogonal matrices symmetric?", "output": [["are all orthogonal matrices symmetric?", "Stackoverflow Stackexchange\n\nQ: What is RFHUTIL used for? What is RFHUTIL. What are the uses of it?\n\nA: From the SupportPac IH03 page:\n\nIt allows test messages to be captured\n  and stored in files, and then used to\n  drive WBI Message Broker Version 7\n  applications. Output messages can also\n  be read and displayed in a variety of\n  formats. The formats include two types\n  of XML as well as matched against a\n  COBOL copybook. The data can be in\n  EBCDIC or ASCII. An RFH2 header can be\n  added to the message before the\n  message is sent.\n\nWebSphere MQ messages can contain a Rules and Formatting Header or RFH for short.  The RFHUtil (and it's client-based companion RFHUtilc) allow for a wide variety of message manipulation with and without these headers.  Because the headers are used extensively by WebSphere Message Broker and for v6 Pub/Sub the utility provides a convenient way to perform ad-hoc testing of message flows, publications and subscriptions.  It also allows the loading and unloading of queues to files or files to queues, for example to perform regression testing against a known workload.\n"]], "corpus": "stackexchange"}
+{"tstamp": 1732365120.6461, "task_type": "retrieval", "type": "chat", "model": "embed-english-v3.0", "gen_params": {}, "start": 1732365118.4456, "finish": 1732365120.6461, "ip": "", "conv_id": "44fc14cf70754333badc91ad7796444f", "model_name": "embed-english-v3.0", "prompt": "Which test was devised to determine whether robots can think?", "output": [["Which test was devised to determine whether robots can think?", "Turing test\n\nThe test was introduced by Turing in his 1950 paper \"Computing Machinery and Intelligence\" while working at the University of Manchester. It opens with the words: \"I propose to consider the question, 'Can machines think? Because \"thinking\" is difficult to define, Turing chooses to \"replace the question by another, which is closely related to it and is expressed in relatively unambiguous words.\" Turing describes the new form of the problem in terms of a three-person game called the \"imitation game\", in which an interrogator asks questions of a man and a woman in another room in order to determine the correct sex of the two players. Turing's new question is: \"Are there imaginable digital computers which would do well in the imitation game?\" This question, Turing believed, was one that could actually be answered. In the remainder of the paper, he argued against all the major objections to the proposition that \"machines can think\".\nSince Turing introduced his test, it has been both highly influential and widely criticized, and has become an important concept in the philosophy of artificial intelligence. Philosopher John Searle would comment on the Turing test in his Chinese room argument, a thought experiment that stipulates that a machine cannot have a \"mind\", \"understanding\", or \"consciousness\", regardless of how intelligently or human-like the program may make the computer behave. Searle criticizes Turing's test and claims it is insufficient to detect the presence of consciousness.\nHistory"]], "corpus": "wikipedia"}
+{"tstamp": 1732365120.6461, "task_type": "retrieval", "type": "chat", "model": "sentence-transformers/all-MiniLM-L6-v2", "gen_params": {}, "start": 1732365118.4456, "finish": 1732365120.6461, "ip": "", "conv_id": "3dc882779f5342d8b7e8e1325e869539", "model_name": "sentence-transformers/all-MiniLM-L6-v2", "prompt": "Which test was devised to determine whether robots can think?", "output": [["Which test was devised to determine whether robots can think?", "History of robots\n\nA similar tale can be found in the near contemporary Indian Buddhist Jataka tales, but here the intricacy of the automation does not match that of Master Yan.Prior to the introduction of Buddhism in the Common Era, Chinese philosophers did not seriously consider the distinction between appearance and reality. The Liezi rebuts Buddhist philosophies and likens human creative powers to that of the Creator. The Indian Lokapannatti, a collection of cycles and lores produced in the 11th or 12th century AD, tells the story of how an army of automated soldiers (bhuta vahana yanta or \"Spirit movement machines\") were crafted to protect the relics of Buddha in a secret stupa. The plans for making such humanoid automatons were stolen from the kingdom of Rome, a generic term for the Greco-Roman-Byzantine culture. According to the Lokapannatti, the Yavanas (\"Greek-speakers\") used the automatons to carry out trade and farming, but also captured and executed criminals. Roman automation makers who left the kingdom were pursued and killed by the automatons. According to the Lokapannatti, the emperor Asoka hears the story of the secret stupa and sets out to find it. "]], "corpus": "wikipedia"}