Project application information duplicate checking method and device based on block chain and medium

Abstract

The invention provides a block chain-based project application information duplicate checking method and device, and a medium. The method comprises the steps of obtaining a plurality of pieces of historical project information of a to-be-audited declaration subject corresponding to to-be-audited project information, and a plurality of pieces of historical project information associated with the declaration subject; analyzing the to-be-audited item information and a plurality of preset key item information to obtain a to-be-audited item identifier corresponding to the to-be-audited item information and a plurality of key item identifiers corresponding to each piece of key item information; determining associated historical project information having an association relationship with the to-be-audited project identifier from a plurality of pieces of historical project information; and if the matching degree between the to-be-audited item information and any associated historical item information is greater than a preset matching degree threshold value, determining that the to-be-audited item information does not pass the audit so as to realize declaration verification of the to-be-audited item information.

Description

Background Art

[0002] When applying for a project, since each project has corresponding project application requirements, such as an applicant can only apply for one or several specific projects for a technical subject, or a technical subject cannot apply for several specific projects at the same time, etc., it is necessary to review and verify each project request information submitted. Currently, the review of project request information is verified by staff who check them one by one. Since the number of project requests submitted is too large and the project application requirements for each project are different, the manual review method is too inefficient and prone to review errors. Summary of the invention

[0003] In view of the above technical problems, the technical solution adopted by the present invention is:

[0004] According to one aspect of the present application, a method for checking duplicate information of project application based on blockchain is provided, which is applied to an information checking system, wherein the information checking system is connected to a checking block chain, and a plurality of information nodes are connected to the checking block chain;

[0005] The method for checking duplicate project application information based on blockchain described in this application includes the following steps:

[0006] Step S100: in response to receiving the information of the project to be reviewed, determining the reporting subject to be reviewed corresponding to the information of the project to be reviewed;

[0007] Step S200: obtaining some historical project information of the applicant to be reviewed, and some historical project information of associated applicants that are associated with the applicant to be reviewed; the historical project information is project information that has passed review and project information that is being reviewed and submitted by the applicant within a historical period;

[0008] Step S300: Analyze the project information to be reviewed and several preset key project information to obtain the project identification corresponding to the project information to be reviewed and several key project identifications corresponding to each key project information; the key project information is the project application requirement information; and the several key project identifications corresponding to the key project information have mutually exclusive association relationships;

[0009] Step S400: According to the identification of the project to be reviewed and several key project identifications, the associated historical project information having an associated relationship with the identification of the project to be reviewed is determined from several historical project information;

[0010] Step S500, traverse several related historical project information. If the matching degree between the project information to be reviewed and any related historical project information is greater than the preset matching degree threshold, it is confirmed that the project information to be reviewed has not passed the review; otherwise, the project information to be reviewed is sent to the duplicate checking blockchain.

[0011] In an exemplary embodiment of the present application, step S200 includes:

[0012] Step S210: Obtain some historical project information of the applicant to be reviewed, and obtain the first historical project information list A = (A1, A2, ..., A i ,...,A n ); where i = 1, 2, ..., n; n is the number of historical project information of the applicant to be reviewed; A i The i-th historical project information of the applicant to be reviewed;

[0013] Step S220: Obtain some historical project information of each associated reporting entity to obtain a second historical project information list set B = (B1, B2, ..., B j ,...,B k );B j =(B j1 ,B j2 ,...,B je ,...,B jf(j) ), where j = 1, 2, ..., k; k is the number of associated reporting entities that have an associated relationship with the reporting entity to be reviewed; B j is the list of historical project information corresponding to the jth associated reporting entity; e=1,2,...,f(j); f(j) is the number of historical project information of the jth associated reporting entity; B je The e-th historical project information of the j-th related reporting entity;

[0014] Step S230: Integrate the first history item information list A and the second history item information list B to obtain a third history item information list C = (C1, C2, ..., C p ,...,C q ), where p = 1, 2, ..., q, and q = n + ∑ k j＝1 f(j);C p The pth historical project information is obtained by integrating the first historical project information list A and the second historical project information list set B.

[0015] In an exemplary embodiment of the present application, step S300 includes:

[0016] Step S310: Perform subject word analysis on the project information to be reviewed to obtain at least one project identifier to be reviewed corresponding to the project information to be reviewed;

[0017] Step S320: Perform a topic word analysis on each key project information to obtain at least one key project identifier corresponding to each key project information.

[0018] In an exemplary embodiment of the present application, step S400 includes:

[0019] Step S410: clustering a plurality of key project information according to the key project identifier corresponding to each key project information to obtain a plurality of key project information groups; each key project information group corresponds to a key project identifier; and the key project identifiers corresponding to a plurality of key project information in the same key project information group are the same;

[0020] Step S420: determine the key project information corresponding to the project information to be reviewed as the target project information;

[0021] Step S430, determining a number of key project information included in the key project information group where the target project information is located as the first project information;

[0022] Step S440: Determine related historical project information from the plurality of historical project information according to the plurality of first project information and key project information corresponding to each piece of historical project information.

[0023] In an exemplary embodiment of the present application, step S410 includes:

[0024] Step S411: Obtain the key project identifier corresponding to each key project information, and obtain a key project identifier list set D = (D1, D2, ..., D a ,...,D b );D a =(D a1 ,D a2 ,...,D ag ,...,D ah(a) ), where a=1,2,...,b; b is the number of key project information; D a is a list of key project identifiers corresponding to the a-th key project information; g = 1, 2, ..., h(a); h(a) is the number of key project identifiers corresponding to the a-th key project information; D ag is the g-th key item identifier corresponding to the a-th key item information;

[0025] Step S412: Select any two key item identification lists D from the key item identification list set D. a and D c , if D a Any key item ID and D cIf any key item identifier is the same, the ath key item information and the cth key item information are determined as the same key item information group; wherein c = 1, 2, ..., b; and c ≠ a; the ath key item information corresponds to h(a) key item information groups.

[0026] In an exemplary embodiment of the present application, step S440 includes:

[0027] Step S441: Obtain key project information corresponding to each historical project information, and obtain a key project information list E=(E1, E2, ..., E p ,...,E q ), where E p is the key project information corresponding to the pth historical project information;

[0028] Step S442, traverse the key project information list E, if E p is the same as any first item information, the pth historical item information is determined as the associated historical item information.

[0029] In an exemplary embodiment of the present application, step S500 includes:

[0030] Step S510: Perform a topic word analysis on each associated historical item information to obtain an associated historical item identifier corresponding to each associated historical item information, and determine an associated historical item identifier list set F = (F1, F2, ..., F d ,...,F r );F d =(F d1 ,F d2 ,...,F ds ,...,F dt(d) ), where d = 1, 2, ..., r, r is the number of associated historical project information; F d is a list of associated historical project identifiers corresponding to the d-th associated historical project information; s=1,2,...,t(d); t(d) is the number of associated historical project identifiers corresponding to the d-th associated historical project information; F ds is the sth associated historical item identifier corresponding to the dth associated historical item information;

[0031] Step S520: Obtain the project IDs corresponding to the project information to be reviewed, and obtain a list of project IDs to be reviewed G = (G1, G2, ..., G m ,...,G u ); where m = 1, 2, ..., u; u is the number of pending project identifiers corresponding to the pending project information; G m The mth pending review project identifier corresponding to the pending review project information;

[0032] Step S530: According to F d and G, determine the matching degree H between the project information to be reviewed and the dth associated historical project information d =I d / (t(d)+u); where, I d F d The number of project identifiers obtained by intersecting with G;

[0033] Step S540: If H d If the matching degree is greater than the preset threshold, it is confirmed that the information of the project to be reviewed has not passed the review; otherwise, the information of the project to be reviewed will be sent to the duplicate checking blockchain.

[0034] In an exemplary embodiment of the present application, step S540 further includes:

[0035] Step S541: If the matching degree of the project information to be reviewed and each associated historical project information is less than or equal to a preset matching degree threshold, the project information to be reviewed and each associated historical project information are sent to each information node;

[0036] Step S542, obtaining the verification result identifier returned by each information node; when the verification result identifier is 1, it means that the verification result of the information node that sent the verification result identifier on the information of the item to be reviewed is passed; when the verification result identifier is 0, it means that the verification result of the information node that sent the verification result identifier on the information of the item to be reviewed is not passed;

[0037] Step S543: among several verification result identifiers, if the ratio of the number of verification result identifiers that are 0 to the total number of verification result identifiers is greater than a preset verification result ratio threshold, it is confirmed that the information of the item to be reviewed has not passed the review.

[0038] According to one aspect of the present application, a non-transitory computer-readable storage medium is provided, in which at least one instruction or at least one program is stored, and the at least one instruction or the at least one program is loaded and executed by a processor to implement the aforementioned blockchain-based project declaration information duplication checking method.

[0039] According to one aspect of the present application, an electronic device is provided, including a processor and the aforementioned non-transitory computer-readable storage medium.

[0040] The present invention has at least the following beneficial effects:

[0041] The project application information duplication checking method based on blockchain of the present invention obtains several historical project information of the to-be-audited application subject corresponding to the to-be-audited project information, and several historical project information of the associated application subject that has an associated relationship with the to-be-audited application subject, analyzes the to-be-audited project information and several preset key project information, obtains the to-be-audited project identifier corresponding to the to-be-audited project information and several key project identifiers corresponding to each key project information, determines the associated historical project information that has an associated relationship with the to-be-audited project identifier from several historical project information according to the to-be-audited project identifier and several key project identifiers, traverses several associated historical project information, and if the matching degree between the to-be-audited project information and any associated historical project information is greater than a preset matching degree threshold, then confirms that the to-be-audited project information and the associated historical project information are similar, and determines that the to-be-audited project information has not passed the audit. By analyzing the to-be-audited project information, determining the associated historical project information that has an associated relationship with the to-be-audited project information from several historical project information, and then determining whether the to-be-audited project information has passed the audit according to the matching degree between each associated historical project information and the to-be-audited project information, so as to verify the to-be-audited project information. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0043] Figure 1 A flowchart of a method for checking duplicate project application information based on blockchain provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0044] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0045] A method for checking duplicate information of project application based on blockchain is applied to an information checking system. The information checking system is connected to a checking duplicate blockchain, and a plurality of information nodes are connected to the checking duplicate blockchain.

[0046] A project information verification contract is stored on the duplicate checking blockchain. The information nodes connected to the duplicate checking blockchain verify the submitted project information through the project information verification contract. The project information may be funding project information. Funding projects will have corresponding application requirements. For example, a submitter can only apply for one funding project with the same technology or the same plan. Therefore, it is necessary to verify the submitted project information to confirm whether the submitter has submitted other funding projects with the technology in the historical period or the current period.

[0047] like Figure 1 As shown, the method for checking duplicate project application information based on blockchain described in this application includes the following steps:

[0048] Step S100: in response to receiving the information of the project to be reviewed, determining the reporting subject to be reviewed corresponding to the information of the project to be reviewed;

[0049] The project information awaiting review is the project information that needs to be checked for duplication and verification, and the applicant for review is the party that submits the project information awaiting review.

[0050] Step S200: obtaining some historical project information of the applicant to be reviewed, and some historical project information of associated applicants that have an associated relationship with the applicant to be reviewed;

[0051] Historical project information refers to project information submitted by the applicant to be reviewed in historical periods. The associated applicant refers to the submitting party that has an associated relationship with the applicant to be reviewed, such as a submitting party that has business dealings with the applicant to be reviewed, or belongs to the same parent company as the applicant to be reviewed, or the two are in a superior-subordinate relationship.

[0052] Since there is an association relationship between the related reporting entity and the reporting entity to be reviewed, it is considered that the related reporting entity and the reporting entity to be reviewed are also the same submitting party, so the historical project information of the related reporting entity must also be checked for duplication and verification.

[0053] Further, step S200 includes steps S210 to S230:

[0054] Step S210: Obtain some historical project information of the applicant to be reviewed, and obtain the first historical project information list A = (A1, A2, ..., A i ,...,A n ); where i = 1, 2, ..., n; n is the number of historical project information of the applicant to be reviewed; A i The i-th historical project information of the applicant to be reviewed;

[0055] Historical project information refers to the project information that has passed the review and the project information that is under review that was submitted by the applicant during the historical period.

[0056] Step S220: Obtain some historical project information of each associated reporting entity to obtain a second historical project information list set B = (B1, B2, ..., B j ,...,B k );B j =(B j1 ,B j2 ,...,B je ,...,B jf(j) ), where j = 1, 2, ..., k; k is the number of associated reporting entities that have an associated relationship with the reporting entity to be reviewed; B j is the list of historical project information corresponding to the jth associated reporting entity; e=1,2,...,f(j); f(j) is the number of historical project information of the jth associated reporting entity; B je The e-th historical project information of the j-th related reporting entity;

[0057] Step S230: Integrate the first history item information list A and the second history item information list B to obtain a third history item information list C = (C1, C2, ..., C p ,...,C q ), where p = 1, 2, ..., q, and q = n + ∑ k j＝1 f(j);C p The pth historical project information is obtained by integrating the first historical project information list A and the second historical project information list set B.

[0058] Step S300: Analyze the project information to be reviewed and several preset key project information to obtain the project identifier to be reviewed corresponding to the project information to be reviewed and several key project identifiers corresponding to each key project information;

[0059] Key project information is the information required for project application. Several key project identifiers corresponding to the key project information have mutually exclusive relationships. Key project information such as Project A and Project B cannot be applied for at the same time. The mutually exclusive relationship means that the same technology or plan cannot be applied for at the same time.

[0060] Further, step S300 includes step S310-step S320:

[0061] Step S310: Perform subject word analysis on the project information to be reviewed to obtain at least one project identification corresponding to the project information to be reviewed;

[0062] To analyze the words and sentences in the information of the projects to be reviewed, the LDA method (Latent Dirichlet Allocation) can be used for analysis. Since there are too many words and sentences in the information of the projects to be reviewed, the subject word analysis method is adopted to obtain the project application information included in the information of the projects to be reviewed. The project application information corresponds to the identification of the project to be reviewed, and the identification of the project to be reviewed indicates the project to be applied for.

[0063] Step S320: Perform a topic word analysis on each key project information to obtain at least one key project identifier corresponding to each key project information.

[0064] The key project identifier corresponding to the key project information represents the projects with mutually exclusive association relationship.

[0065] Step S400: According to the identification of the project to be reviewed and several key project identifications, the associated historical project information having an associated relationship with the identification of the project to be reviewed is determined from several historical project information;

[0066] Further, step S400 includes step S410-step S440:

[0067] Step S410: clustering a plurality of key project information according to the key project identifier corresponding to each key project information to obtain a plurality of key project information groups;

[0068] The key project identifier corresponding to the key project information is the identifier of the declared project corresponding to the key project information.

[0069] Each key project information group corresponds to a key project identifier, and the key project identifiers corresponding to several key project information in the same key project information group are the same.

[0070] Wherein, step S410 includes steps S411-S412:

[0071] Step S411: Obtain the key project identifier corresponding to each key project information, and obtain a key project identifier list set D = (D1, D2, ..., D a ,...,D b );D a =(D a1 ,D a2 ,...,D ag ,...,D ah(a) ), where a=1,2,...,b; b is the number of key project information; D a is a list of key project identifiers corresponding to the a-th key project information; g = 1, 2, ..., h(a); h(a) is the number of key project identifiers corresponding to the a-th key project information; D agis the gth key item identifier corresponding to the ath key item information;

[0072] Step S412: Select any two key item identification lists D from the key item identification list set D. a and D c , if D a Any key item ID and D c If any key item identifier is the same, the ath key item information and the cth key item information are determined as the same key item information group; wherein c = 1, 2, ..., b; and c ≠ a; the ath key item information corresponds to h(a) key item information groups.

[0073] Step S420: determine the key project information corresponding to the project information to be reviewed as the target project information;

[0074] Step S430, determining a number of key project information included in the key project information group where the target project information is located as the first project information;

[0075] Step S440: determining related historical project information from the plurality of historical project information according to the plurality of first project information and key project information corresponding to each piece of historical project information;

[0076] Wherein, step S440 includes steps S441 and S442:

[0077] Step S441: Obtain key project information corresponding to each historical project information, and obtain a key project information list E=(E1, E2, ..., E p ,...,E q ), where E p is the key project information corresponding to the pth historical project information;

[0078] Step S442, traverse the key project information list E, if E p is the same as any first item information, the pth historical item information is determined as the associated historical item information.

[0079] Step S500: traverse a number of related historical project information. If the matching degree between the project information to be reviewed and any related historical project information is greater than a preset matching degree threshold, it is confirmed that the project information to be reviewed has not passed the review; otherwise, the project information to be reviewed is sent to the duplicate checking blockchain;

[0080] If the matching degree between the project information to be reviewed and any related historical project information is greater than the preset matching degree threshold, it means that the application project corresponding to the project information to be reviewed and the application project corresponding to the related historical project information are the same application project or application projects with mutually exclusive relationships, which does not meet the project application requirements corresponding to the project information to be reviewed, so it is confirmed that it has not passed the review.

[0081] Further, step S500 includes steps S510 to S540:

[0082] Step S510: Perform a topic word analysis on each associated historical item information to obtain an associated historical item identifier corresponding to each associated historical item information, and determine an associated historical item identifier list set F = (F1, F2, ..., F d ,...,F r );F d =(F d1 ,F d2 ,...,F ds ,...,F dt(d) ), where d = 1, 2, ..., r, r is the number of associated historical project information; F d is a list of associated historical project identifiers corresponding to the d-th associated historical project information; s=1,2,...,t(d); t(d) is the number of associated historical project identifiers corresponding to the d-th associated historical project information; F ds is the sth associated historical item identifier corresponding to the dth associated historical item information;

[0083] Step S520: Obtain the project IDs corresponding to the project information to be reviewed, and obtain a list of project IDs to be reviewed G = (G1, G2, ..., G m ,...,G u ); where m = 1, 2, ..., u; u is the number of pending project identifiers corresponding to the pending project information; G m The mth pending review project identifier corresponding to the pending review project information;

[0084] Step S530: According to F d and G, determine the matching degree H between the project information to be reviewed and the dth associated historical project information d =I d / (t(d)+u); where, I d F d The number of project identifiers obtained by intersecting with G;

[0085] Step S540: If H d If the matching degree is greater than the preset threshold, it is confirmed that the information of the project to be reviewed has not passed the review; otherwise, the information of the project to be reviewed will be sent to the duplicate checking blockchain.

[0086] In addition, step S540 also includes steps S541 to S543:

[0087] Step S541: If the matching degree of the project information to be reviewed and each associated historical project information is less than or equal to a preset matching degree threshold, the project information to be reviewed and each associated historical project information are sent to each information node;

[0088] In order to further verify the project information to be reviewed, when the matching degree between the project information to be reviewed and each related historical project information is less than or equal to the preset matching degree threshold, the project information to be reviewed and each related historical project information will be sent to each information node, so that each information node can verify the project information to be reviewed again according to its own verification standards to improve the verification accuracy.

[0089] Step S542: Obtain the verification result identifier returned by each information node;

[0090] When the verification result identifier is 1, it means that the verification result of the information node that sent the verification result identifier on the item to be reviewed is passed;

[0091] When the verification result identifier is 0, it means that the verification result of the information node that sent the verification result identifier on the information of the item to be reviewed is not passed;

[0092] Step S543: among several verification result identifiers, if the ratio of the number of verification result identifiers that are 0 to the total number of verification result identifiers is greater than a preset verification result ratio threshold, it is confirmed that the information of the item to be reviewed has not passed the review.

[0093] The project application information duplication checking method based on blockchain of the present invention obtains several historical project information of the to-be-audited application subject corresponding to the to-be-audited project information, and several historical project information of the associated application subject that has an associated relationship with the to-be-audited application subject, analyzes the to-be-audited project information and several preset key project information, obtains the to-be-audited project identifier corresponding to the to-be-audited project information and several key project identifiers corresponding to each key project information, determines the associated historical project information that has an associated relationship with the to-be-audited project identifier from several historical project information according to the to-be-audited project identifier and several key project identifiers, traverses several associated historical project information, and if the matching degree between the to-be-audited project information and any associated historical project information is greater than a preset matching degree threshold, then confirms that the to-be-audited project information and the associated historical project information are similar, and determines that the to-be-audited project information has not passed the audit. By analyzing the to-be-audited project information, determining the associated historical project information that has an associated relationship with the to-be-audited project information from several historical project information, and then determining whether the to-be-audited project information has passed the audit according to the matching degree between each associated historical project information and the to-be-audited project information, so as to verify the to-be-audited project information.

[0094] An embodiment of the present invention further provides a computer program product, which includes program code. When the program product is run on an electronic device, the program code is used to enable the electronic device to execute the steps of the method according to various exemplary embodiments of the present invention described above in this specification.

[0095] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0096] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0097] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.

[0098] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".

[0099] The electronic device according to this embodiment of the present invention is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0100] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor mentioned above, the at least one storage device mentioned above, and a bus connecting different system components (including storage devices and processors).

[0101] The storage stores program codes, which can be executed by the processor, so that the processor executes the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification.

[0102] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).

[0103] The storage may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.

[0104] The bus may represent one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

[0105] The electronic device may also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), one or more devices that enable a user to interact with the electronic device, and / or any device that enables the electronic device to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface. Furthermore, the electronic device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter.

[0106] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0107] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.

[0108] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0109] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0110] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0111] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0112] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0113] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0114] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A method for checking duplicate project application information based on blockchain, characterized in that: Applied to an information duplication checking system, the information duplication checking system is connected to a duplication checking blockchain, and the duplication checking blockchain is connected to a plurality of information nodes; The method comprises the following steps: Step S100: in response to receiving the information of the project to be reviewed, determining the reporting subject to be reviewed corresponding to the information of the project to be reviewed; Step S200, obtaining some historical project information of the applicant to be reviewed, and some historical project information of associated applicants that have an associated relationship with the applicant to be reviewed; the historical project information is project information that has passed review and project information that is being reviewed submitted by the applicant within a historical period; Step S300: Analyze the project information to be reviewed and several preset key project information to obtain the project identification corresponding to the project information to be reviewed and several key project identifications corresponding to each of the key project information; the key project information is the project application requirement information; and the several key project identifications corresponding to the key project information have mutually exclusive association relationships; Step S400: determining, from the plurality of historical project information, associated historical project information having an associated relationship with the identification of the project to be reviewed according to the identification of the project to be reviewed and a plurality of key project identifications; Step S500, traverse several of the related historical project information, if the matching degree between the project information to be reviewed and any of the related historical project information is greater than a preset matching degree threshold, confirm that the project information to be reviewed has not passed the review; otherwise, send the project information to be reviewed to the duplicate checking blockchain.

2. The method according to claim 1, characterized in that The step S200 includes: Step S210: Obtain some historical project information of the applicant to be reviewed, and obtain a first historical project information list A=(A1, A2, ..., A i ,...,A n ); where i = 1, 2, ..., n; n is the number of historical project information of the applicant to be reviewed; A i The i-th historical project information of the applicant to be reviewed; Step S220: Obtain some historical project information of each associated reporting entity to obtain a second historical project information list set B = (B1, B2, ..., B j ,...,B k );B j =(B j1 ,B j2 ,...,B je ,...,B jf(j) ); where j = 1, 2, ..., k; k is the number of associated reporting entities that have an associated relationship with the reporting entity to be reviewed; B j is the list of historical project information corresponding to the jth associated reporting entity; e=1,2,...,f(j); f(j) is the number of historical project information of the jth associated reporting entity; B je The e-th historical project information of the j-th related reporting entity; Step S230: Integrate the first history item information list A and the second history item information list B to obtain a third history item information list C = (C1, C2, ..., C p ,...,C q ), where p = 1, 2, ..., q, and q = n + ∑ k j＝1 f(j);C p The pth historical project information is obtained by integrating the first historical project information list A and the second historical project information list set B.

3. The method according to claim 2, characterized in that The step S300 includes: Step S310: Perform a subject word analysis on the project information to be reviewed to obtain at least one project identification corresponding to the project information to be reviewed; Step S320: Perform a topic word analysis on each key project information to obtain at least one key project identifier corresponding to each key project information.

4. The method according to claim 3, characterized in that The step S400 includes: Step S410: clustering the plurality of key project information according to the key project identifier corresponding to each of the key project information to obtain a plurality of key project information groups; each of the key project information groups corresponds to a key project identifier; and the key project identifiers corresponding to the plurality of key project information in the same key project information group are the same; Step S420: determining the key project information corresponding to the project information to be reviewed as the target project information; Step S430, determining a plurality of key project information included in the key project information group where the target project information is located as the first project information; Step S440: Determine associated historical project information from the plurality of historical project information according to the plurality of first project information and key project information corresponding to each of the historical project information.

5. The method according to claim 4, characterized in that The step S410 includes: Step S411: Obtain the key project identifier corresponding to each key project information, and obtain a key project identifier list set D = (D1, D2, ..., D a ,...,D b );D a =(D a1 ,D a2 ,...,D ag ,...,D ah(a) ); wherein a=1,2,...,b; b is the number of key project information; D a is the key project identification list corresponding to the a-th key project information; g = 1, 2, ..., h(a); h(a) is the number of key project identifications corresponding to the a-th key project information; D ag is the g-th key item identifier corresponding to the a-th key item information; Step S412: Select any two key item identification lists D from the key item identification list set D. a and D c , if D a Any key item ID and D c If any key item identifier is the same, the ath key item information and the cth key item information are determined as the same key item information group; wherein c = 1, 2, ..., b; and c ≠ a; the ath key item information corresponds to h(a) key item information groups.

6. The method according to claim 5, characterized in that The step S440 includes: Step S441: Obtain key project information corresponding to each of the historical project information to obtain a key project information list E=(E1, E2, ..., E p ,...,E q ), where E p is the key project information corresponding to the pth historical project information; Step S442, traverse the key project information list E, if E p If the pth historical project information is the same as any of the first project information, the pth historical project information is determined as the associated historical project information.

7. The method according to claim 6, characterized in that The step S500 includes: Step S510: Perform a topic word analysis on each of the related historical project information to obtain the related historical project identifier corresponding to each of the related historical project information, and determine the related historical project identifier list set F = (F1, F2, ..., F d ,...,F r );F d =(F d1 ,F d2 ,...,F ds ,...,F dt(d) ), wherein d = 1, 2, ..., r, and r is the number of associated historical project information; F d is a list of associated historical project identifiers corresponding to the d-th associated historical project information; s=1,2,...,t(d); t(d) is the number of associated historical project identifiers corresponding to the d-th associated historical project information; F ds is the sth associated historical item identifier corresponding to the dth associated historical item information; Step S520: Obtain the project IDs corresponding to the project information to be reviewed, and obtain a list of project IDs to be reviewed G = (G1, G2, ..., G m ,...,G u ); wherein m = 1, 2, ..., u; u is the number of pending project identifiers corresponding to the pending project information; G m The mth pending review item identifier corresponding to the pending review item information; Step S530: According to F d and G, determine the matching degree H between the pending project information and the dth associated historical project information d =I d / (t(d)+u); where, I d F d The number of project identifiers obtained by intersecting with G; Step S540: If H d If the matching degree is greater than a preset threshold, it is confirmed that the information of the project to be reviewed has not passed the review; otherwise, the information of the project to be reviewed is sent to the duplicate checking blockchain.

8. The method according to claim 7, characterized in that The step S540 further includes: Step S541: If the matching degree between the project information to be reviewed and each of the associated historical project information is less than or equal to a preset matching degree threshold, the project information to be reviewed and each of the associated historical project information are sent to each of the information nodes; Step S542, obtaining the verification result identifier returned by each of the information nodes; when the verification result identifier is 1, it indicates that the verification result of the information node sending the verification result identifier on the information of the item to be reviewed is passed; when the verification result identifier is 0, it indicates that the verification result of the information node sending the verification result identifier on the information of the item to be reviewed is not passed; Step S543: among several verification result identifiers, if the ratio of the number of verification result identifiers that are 0 to the total number of verification result identifiers is greater than a preset verification result ratio threshold, it is confirmed that the information of the item to be reviewed has not passed the review.

9. A non-transitory computer-readable storage medium, wherein at least one instruction or at least one program is stored in the storage medium, characterized in that: The at least one instruction or the at least one program is loaded and executed by the processor to implement the blockchain-based project declaration information duplication checking method as described in any one of claims 1-8.

10. An electronic device, characterized in that: The invention comprises a processor and the non-transitory computer-readable storage medium as claimed in claim 9.

Images