2016 the United States of Microsoft programming the title of the Chinese Translation _ Programming Beauty

Microsoft Academic Graph (MAG) is a large heterogeneous graph containing entities such as authors, papers, journals, CONFE Rences and relations between them. Microsoft provides academic knowledge API for this contest. The Entity attributes are defined here.

The Microsoft Academic Atlas (Microsoft Academic Graph, MAG) is a large, rich variety of graphs that include: authors, papers, periodicals, conferences, and relationships between the aforementioned entities. Microsoft has provided the Academic knowledge API (Academic knowledge API) for this competition. The entity attributes are defined as follows (see links).

Participants are supposed to provide a REST service endpoint so can find all the 1-hop, 2-hop, and 3-hop graph paths con Necting a given pair of entity identifiers in MAG. The given pair of entity identifiers could be [ID, id], [ID, AA. Auid], [AA. Auid, Id], [AA. Auid, AA. Auid]. Each node of a path should is one of the following identifiers:id, F.fid, J.jid, C.cid, AA. Auid, AA. Afid. Possible edges (a pair of adjacent nodes) of a path are:

Participants are required to provide rest service terminals. This service should be able to find all 1-hop, 2-hop, 3-hop path paths that connect pairs of the entity identifiers (entity Indentifier) given in mag. The possible forms of the entity identifier pair are: [ID, id], [ID, AA. Auid], [AA. Auid, Id], [AA. Auid, AA. Auid]. Each node of a path should be one of the following identifiers: Id, F.fid, J.jid, C.cid, AA. Auid, AA. Afid. The edge of a possible path (also known as a neighboring node pair) is as follows:

For each test case, the REST service endpoint'll receive a JSON array via HTTP with a pair of entity identifiers, whe Re the identifiers are 64-bit integers, e.g. [123, 456]. The service endpoint needs to respond with a JSON array within-seconds. The response JSON array consists of a list of graph paths in the form of [path1, path2, ..., pathn], where each path is a Rray of entity identifiers. For example, if your program finds one 1-hop paths, two 2-hop paths, and one 3-hop paths, the results could look like this: [[123,456], [123,2,456], [123,3,456], [123,4,5,456]]. For a path such as [123,4,5,456], the integers are the identifiers to the entities on the path. After receiving the response, the evaluator would wait for a random period of time before sending the next requests.

For each test sample, the rest service terminal will receive a JSON array (JSON array) that is transmitted as HTTP, with a pair of entity identifiers, where the identifier is a 64-bit integer, such as [123, 456]. The service terminal needs to return a JSON array within 300s. The JSON array of server-side responses contains a list of paths in the diagram, as follows: [Path1, path2, ..., pathn]. Each path is an array of entity identifiers. For example, if the program finds a 1-hop path, two 2-hop paths, and a 3-hop path, the result should have the following form: [[123,456], [123,2,456], [123,3,456], [123,4,5,456]]. For a path, such as [123,4,5,456], where the integer is the entity identifier on the path. After receiving a response from the server, the evaluation program (the scoring program for the game) waits for a random period of time and then sends the request again. Evaluation Metric Scoring Index

The REST service must is deployed to a STANDARD_A3 virtual machine for the final test. There are no constraints on the programming language your can use.

The rest service that participates in the final test must be deployed on the standard A3 virtual machine. There are no restrictions on the language used by the contestants.

The test cases are not available before the final evaluation. When the evaluation starts, the evaluator system sends test cases to the REST endpoint the all team individually. Each team would receive the test cases (q1to Q10). The response time for test case Qi is recorded as Ti (1≤I≤10). The final score is calculated using:

Test cases will not be open until the final score is scored. When the grading program is started, the scoring system will individually send test cases to the rest terminals of each participating team. Each team is subject to 10 test cases (Q1 to Q10). The response time of the test Case Qi is ti, and the final score is calculated using the following formula:

Where Ni is the size of the solution (the total number of correct paths) for Qi, and the Ki is the total number of paths returned By the rest service, Mi was the number of distinct correct paths returned by the rest service.

Wherein NI represents the size of the Qi solution (the total number of the correct path); Ki is the total number of paths returned by the rest service; MI is the number of different correct paths returned by the rest service (that is, the total number is first weighed in the correct path).