{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/can-llms-be-good-graph-judger-for-knowledge","title":"Can LLMs be Good Graph Judge for Knowledge Graph Construction?","arxiv_id":"2411.17388","date":"2024-11-26","proceeding":null,"authors":["Haoyu Huang","Chong Chen","Zeang Sheng","Yang Li","Wentao Zhang"],"abstract":"In real-world scenarios, most of the data obtained from the information retrieval (IR) system is unstructured. Converting natural language sentences into structured Knowledge Graphs (KGs) remains a critical challenge. We identified three limitations with respect to existing KG construction methods: (1) There could be a large amount of noise in real-world documents, which could result in extracting messy information. (2) Naive LLMs usually extract inaccurate knowledge from some domain-specific documents. (3) Hallucination phenomenon cannot be overlooked when directly using LLMs to construct KGs. In this paper, we propose \\textbf{GraphJudge}, a KG construction framework to address the aforementioned challenges. In this framework, we designed an entity-centric strategy to eliminate the noise information in the documents. And we fine-tuned a LLM as a graph judge to finally enhance the quality of generated KGs. Experiments conducted on two general and one domain-specific text-graph pair datasets demonstrate state-of-the-art performance against various baseline methods with strong generalization abilities. Our code is available at \\href{https://github.com/hhy-huang/GraphJudge}{https://github.com/hhy-huang/GraphJudge}.","url_abs":"https://arxiv.org/abs/2411.17388v3","url_pdf":"https://arxiv.org/pdf/2411.17388v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"can-llms-be-good-graph-judger-for-knowledge","repo_url":"https://github.com/hhy-huang/graphjudge","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"hallucination","task_name":"Hallucination"},{"task_slug":"information-retrieval","task_name":"Information Retrieval"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"graph-construction","task_name":"graph construction"}],"methods":[{"method_slug":"aware","method_name":"AWARE"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2411.17388","atlas_url":"https://app.syntology.ai/?focus=2411.17388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17388"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.17388"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.17388"},"call":"get_harvested_code_for_paper(arxiv_id=\"2411.17388\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2411.17388"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2411.17388\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2411.17388"},"call":"get_concepts_for_paper(arxiv_id=\"2411.17388\")"}],"by_repo":[{"repo":"hhy-huang/graphjudge","kind":"official","samples":9,"ran":9,"instrument":3,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2411.17388.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2411.17388.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hhy-huang/graphjudge","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":6,"ran_draft_wrong":3},"n_samples":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":9,"ran":9,"n_ran_checked":6,"n_instrument":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing","signature_not_shown":"the graph records a signature for this sample and it is not shown; signature_not_shown_because names why, as the export's field-exclusion reason","signature_not_shown_because":{"signature_is_harness_object_repr":"an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape"}},"n_ran_with_level_date":9,"n_ran_without_level_date":0,"n_ran_signature_not_shown":1,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"fa9b6da71c2092cf","code_sha256_prefix":"fa9b6da71c2092cf","entry":"api_model","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"chat/run_chatgpt.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/chat/run_chatgpt.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"prompt:str/0/str, system_prompt:str/0/str, history_messages:list/1/dict","fixture_out_type":"coroutine","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fa9b6da71c2092cf"}},{"code_sha256":"33e9d014a6ae7fde","code_sha256_prefix":"33e9d014a6ae7fde","entry":"api_model","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"chat/run_chatgpt_entity.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/chat/run_chatgpt_entity.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"prompt:str/0/str, system_prompt:str/0/str, history_messages:list/1/dict","fixture_out_type":"coroutine","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"33e9d014a6ae7fde"}},{"code_sha256":"0d1ca82eaad4ea6d","code_sha256_prefix":"0d1ca82eaad4ea6d","entry":"denoise_text","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"chat/run_chatgpt_entity.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/chat/run_chatgpt_entity.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"texts:list/1/str, entities_list:list/1/list","fixture_out_type":"coroutine","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0d1ca82eaad4ea6d"}},{"code_sha256":"5cc881bcb8e83712","code_sha256_prefix":"5cc881bcb8e83712","entry":"extract_entities","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"chat/run_chatgpt_entity.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/chat/run_chatgpt_entity.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"texts:list/1/str","fixture_out_type":"coroutine","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":"/code/extract-entities","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5cc881bcb8e83712"}},{"code_sha256":"e9255fb036722c39","code_sha256_prefix":"e9255fb036722c39","entry":"generate_advanced_prompt","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"graph_judger/lora_infer_batch.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/graph_judger/lora_infer_batch.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"instruction:str/0/str, input:NoneType/0/?","fixture_out_type":"str","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e9255fb036722c39"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e9255fb036722c39"}},{"code_sha256":"e96ec96db9ef37ba","code_sha256_prefix":"e96ec96db9ef37ba","entry":"generate_prompt","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"graph_judger/lora_infer.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/graph_judger/lora_infer.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"instruction:str/0/str, input:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T23:53:12.863503+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e96ec96db9ef37ba"},"code_page":"/code/generate-prompt","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e96ec96db9ef37ba"}},{"code_sha256":"fa02d989f7ad994f","code_sha256_prefix":"fa02d989f7ad994f","entry":"generate_prompt","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"graph_judger/lora_infer_batch.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/graph_judger/lora_infer_batch.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"instruction:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T23:53:12.863503+00:00","retrieve_with":{"tool":"get_code","code_sha256":"fa02d989f7ad994f"},"code_page":"/code/generate-prompt","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fa02d989f7ad994f"}},{"code_sha256":"6f1e024958dca36b","code_sha256_prefix":"6f1e024958dca36b","entry":"get_chatgpt_completion","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"chat/run_chatgpt_gj.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/chat/run_chatgpt_gj.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_object_repr","fixture_out_type":"coroutine","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6f1e024958dca36b"}},{"code_sha256":"d47506b71865ea46","code_sha256_prefix":"d47506b71865ea46","entry":"process_input","repo":"hhy-huang/graphjudge","repo_kind":"official","path":"graph_judger/bert_classifier_infer.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/graph_judger/bert_classifier_infer.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"instruction:str/0/str, input_text:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T15:11:32.249708+00:00","retrieve_with":{"tool":"get_code","code_sha256":"d47506b71865ea46"},"code_page":"/code/process-input","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d47506b71865ea46"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5c128ba5754a1954416fd67aa6f00d8b8965722d3c1da243b2039f313f4b4bbb","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}