{"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":"/task/graph-construction/papers/ran/1","list_of":"/task/graph-construction","task":"graph construction","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,38],"of":38,"counts":{"archive_papers_tagged":561,"with_a_code_link":220,"where_syntology_ran_a_sample":38,"not_listed_spam_title":0,"listed":561,"listed_where_code_ran":38,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":31,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-construction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/autoschemakg-autonomous-knowledge-graph","slug":"autoschemakg-autonomous-knowledge-graph","title":"AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora","date":"2025-05-29","arxiv_id":"2505.23628","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autoschemakg-autonomous-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2505.23628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23628"}},"official":{"repos":["hkust-knowcomp/autoschemakg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ras-retrieval-and-structuring-for-knowledge","slug":"ras-retrieval-and-structuring-for-knowledge","title":"RAS: Retrieval-And-Structuring for Knowledge-Intensive LLM Generation","date":"2025-02-16","arxiv_id":"2502.10996","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ras-retrieval-and-structuring-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2502.10996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10996"}},"official":{"repos":["pat-jj/ras","pat-jj/Retrieval-And-Structure"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["community","official"]}}},{"url":"/paper/sepsiscalc-integrating-clinical-calculators","slug":"sepsiscalc-integrating-clinical-calculators","title":"SepsisCalc: Integrating Clinical Calculators into Early Sepsis Prediction via Dynamic Temporal Graph Construction","date":"2024-12-31","arxiv_id":"2501.00190","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sepsiscalc-integrating-clinical-calculators#ran","syntology_url":"https://syntology.ai/paper/2501.00190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.00190"}},"official":{"repos":["yinchangchang/sepsiscalc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mast3r-slam-real-time-dense-slam-with-3d","slug":"mast3r-slam-real-time-dense-slam-with-3d","title":"MASt3R-SLAM: Real-Time Dense SLAM with 3D Reconstruction Priors","date":"2024-12-16","arxiv_id":"2412.12392","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mast3r-slam-real-time-dense-slam-with-3d#ran","syntology_url":"https://syntology.ai/paper/2412.12392","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12392"}},"official":null}},{"url":"/paper/can-llms-be-good-graph-judger-for-knowledge","slug":"can-llms-be-good-graph-judger-for-knowledge","title":"Can LLMs be Good Graph Judge for Knowledge Graph Construction?","date":"2024-11-26","arxiv_id":"2411.17388","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-llms-be-good-graph-judger-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2411.17388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17388"}},"official":{"repos":["hhy-huang/graphjudge"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graphusion-a-rag-framework-for-knowledge","slug":"graphusion-a-rag-framework-for-knowledge","title":"Graphusion: A RAG Framework for Knowledge Graph Construction with a Global Perspective","date":"2024-10-23","arxiv_id":"2410.17600","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphusion-a-rag-framework-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2410.17600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17600"}},"official":{"repos":["irenezihuili/graphusion"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/st-usleepnet-a-spatial-temporal-coupling","slug":"st-usleepnet-a-spatial-temporal-coupling","title":"ST-USleepNet: A Spatial-Temporal Coupling Prominence Network for Multi-Channel Sleep Staging","date":"2024-08-21","arxiv_id":"2408.11884","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/st-usleepnet-a-spatial-temporal-coupling#ran","syntology_url":"https://syntology.ai/paper/2408.11884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11884"}},"official":{"repos":["majy-yuji/st-usleepnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/medical-graph-rag-towards-safe-medical-large","slug":"medical-graph-rag-towards-safe-medical-large","title":"Medical Graph RAG: Towards Safe Medical Large Language Model via Graph Retrieval-Augmented Generation","date":"2024-08-08","arxiv_id":"2408.04187","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/medical-graph-rag-towards-safe-medical-large#ran","syntology_url":"https://syntology.ai/paper/2408.04187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.04187"}},"official":{"repos":["medicinetoken/medical-graph-rag"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mindsearch-mimicking-human-minds-elicits-deep","slug":"mindsearch-mimicking-human-minds-elicits-deep","title":"MindSearch: Mimicking Human Minds Elicits Deep AI Searcher","date":"2024-07-29","arxiv_id":"2407.20183","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mindsearch-mimicking-human-minds-elicits-deep#ran","syntology_url":"https://syntology.ai/paper/2407.20183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20183"}},"official":{"repos":["internlm/mindsearch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/emt-a-novel-transformer-for-generalized-cross","slug":"emt-a-novel-transformer-for-generalized-cross","title":"EmT: A Novel Transformer for Generalized Cross-subject EEG Emotion Recognition","date":"2024-06-26","arxiv_id":"2406.18345","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/emt-a-novel-transformer-for-generalized-cross#ran","syntology_url":"https://syntology.ai/paper/2406.18345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18345"}},"official":{"repos":["yi-ding-cs/emt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-weather-forecasting-with","slug":"probabilistic-weather-forecasting-with","title":"Probabilistic Weather Forecasting with Hierarchical Graph Neural Networks","date":"2024-06-07","arxiv_id":"2406.04759","repositories_listed":4,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/probabilistic-weather-forecasting-with#ran","syntology_url":"https://syntology.ai/paper/2406.04759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04759"}},"official":{"repos":["mllam/neural-lam"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/banglaautokg-automatic-bangla-knowledge-graph","slug":"banglaautokg-automatic-bangla-knowledge-graph","title":"BanglaAutoKG: Automatic Bangla Knowledge Graph Construction with Semantic Neural Graph Filtering","date":"2024-04-04","arxiv_id":"2404.03528","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/banglaautokg-automatic-bangla-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2404.03528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03528"}},"official":{"repos":["azminewasi/banglaautokg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/urbankgent-a-unified-large-language-model","slug":"urbankgent-a-unified-large-language-model","title":"UrbanKGent: A Unified Large Language Model Agent Framework for Urban Knowledge Graph Construction","date":"2024-02-10","arxiv_id":"2402.06861","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/urbankgent-a-unified-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.06861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06861"}},"official":{"repos":["usail-hkust/urbankgent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cagra-highly-parallel-graph-construction-and","slug":"cagra-highly-parallel-graph-construction-and","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","date":"2023-08-29","arxiv_id":"2308.15136","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":8,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cagra-highly-parallel-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2308.15136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15136"}},"official":{"repos":["rapidsai/raft"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-graph-prompting-for-multi-document","slug":"knowledge-graph-prompting-for-multi-document","title":"Knowledge Graph Prompting for Multi-Document Question Answering","date":"2023-08-22","arxiv_id":"2308.11730","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-prompting-for-multi-document#ran","syntology_url":"https://syntology.ai/paper/2308.11730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11730"}},"official":{"repos":["yuwvandy/kg-llm-mdqa"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/codekgc-code-language-model-for-generative","slug":"codekgc-code-language-model-for-generative","title":"CodeKGC: Code Language Model for Generative Knowledge Graph Construction","date":"2023-04-18","arxiv_id":"2304.09048","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/codekgc-code-language-model-for-generative#ran","syntology_url":"https://syntology.ai/paper/2304.09048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09048"}},"official":{"repos":["zjunlp/deepke"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mcts-geb-monte-carlo-tree-search-is-a-good-e","slug":"mcts-geb-monte-carlo-tree-search-is-a-good-e","title":"MCTS-GEB: Monte Carlo Tree Search is a Good E-graph Builder","date":"2023-03-08","arxiv_id":"2303.04651","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mcts-geb-monte-carlo-tree-search-is-a-good-e#ran","syntology_url":"https://syntology.ai/paper/2303.04651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04651"}},"official":{"repos":["ucamrl/eqs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-semantic-scholar-open-data-platform","slug":"the-semantic-scholar-open-data-platform","title":"The Semantic Scholar Open Data Platform","date":"2023-01-24","arxiv_id":"2301.10140","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-semantic-scholar-open-data-platform#ran","syntology_url":"https://syntology.ai/paper/2301.10140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10140"}},"official":{"repos":["allenai/s2aff"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/schema-aware-reference-as-prompt-improves","slug":"schema-aware-reference-as-prompt-improves","title":"Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction","date":"2022-10-19","arxiv_id":"2210.10709","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/schema-aware-reference-as-prompt-improves#ran","syntology_url":"https://syntology.ai/paper/2210.10709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10709"}},"official":{"repos":["zjunlp/RAP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/oversquashing-in-gnns-through-the-lens-of","slug":"oversquashing-in-gnns-through-the-lens-of","title":"Oversquashing in GNNs through the lens of information contraction and graph expansion","date":"2022-08-06","arxiv_id":"2208.03471","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/oversquashing-in-gnns-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2208.03471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03471"}},"official":{"repos":["kedar2/oversquashing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-graph-enhanced-click-model-for-web-search-1","slug":"a-graph-enhanced-click-model-for-web-search-1","title":"A Graph-Enhanced Click Model for Web Search","date":"2022-06-17","arxiv_id":"2206.08621","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-graph-enhanced-click-model-for-web-search-1#ran","syntology_url":"https://syntology.ai/paper/2206.08621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08621"}},"official":{"repos":["chiangel/graphcm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-scale-representation-learning-on-1","slug":"multi-scale-representation-learning-on-1","title":"Multi-Scale Representation Learning on Proteins","date":"2022-04-04","arxiv_id":"2204.02337","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-scale-representation-learning-on-1#ran","syntology_url":"https://syntology.ai/paper/2204.02337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02337"}},"official":null}},{"url":"/paper/bern2-an-advanced-neural-biomedical-named","slug":"bern2-an-advanced-neural-biomedical-named","title":"BERN2: an advanced neural biomedical named entity recognition and normalization tool","date":"2022-01-06","arxiv_id":"2201.02080","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bern2-an-advanced-neural-biomedical-named#ran","syntology_url":"https://syntology.ai/paper/2201.02080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.02080"}},"official":{"repos":["dmis-lab/bern2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sgtr-end-to-end-scene-graph-generation-with","slug":"sgtr-end-to-end-scene-graph-generation-with","title":"SGTR: End-to-end Scene Graph Generation with Transformer","date":"2021-12-24","arxiv_id":"2112.12970","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sgtr-end-to-end-scene-graph-generation-with#ran","syntology_url":"https://syntology.ai/paper/2112.12970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.12970"}},"official":{"repos":["scarecrow0/sgtr"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/3d-transformer-molecular-representation-with","slug":"3d-transformer-molecular-representation-with","title":"Molformer: Motif-based Transformer on 3D Heterogeneous Molecular Graphs","date":"2021-10-04","arxiv_id":"2110.01191","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/3d-transformer-molecular-representation-with#ran","syntology_url":"https://syntology.ai/paper/2110.01191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.01191"}},"official":{"repos":["smiles724/3d-transformer","smiles724/molformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-sparse-r-cnn-for-direct-scene","slug":"structured-sparse-r-cnn-for-direct-scene","title":"Structured Sparse R-CNN for Direct Scene Graph Generation","date":"2021-06-21","arxiv_id":"2106.10815","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-sparse-r-cnn-for-direct-scene#ran","syntology_url":"https://syntology.ai/paper/2106.10815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10815"}},"official":{"repos":["mcg-nju/structured-sparse-rcnn"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/graph-neural-networks-for-natural-language","slug":"graph-neural-networks-for-natural-language","title":"Graph Neural Networks for Natural Language Processing: A Survey","date":"2021-06-10","arxiv_id":"2106.06090","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-natural-language#ran","syntology_url":"https://syntology.ai/paper/2106.06090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06090"}},"official":{"repos":["graph4ai/graph4nlp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-nlp-knowledge-graph-construction","slug":"end-to-end-nlp-knowledge-graph-construction","title":"End-to-End NLP Knowledge Graph Construction","date":"2021-06-02","arxiv_id":"2106.01167","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-nlp-knowledge-graph-construction#ran","syntology_url":"https://syntology.ai/paper/2106.01167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01167"}},"official":null}},{"url":"/paper/diakg-an-annotated-diabetes-dataset-for","slug":"diakg-an-annotated-diabetes-dataset-for","title":"DiaKG: an Annotated Diabetes Dataset for Medical Knowledge Graph Construction","date":"2021-05-31","arxiv_id":"2105.15033","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diakg-an-annotated-diabetes-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2105.15033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.15033"}},"official":{"repos":["changdejie/diaKG-code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-semantic-graph-construction-and","slug":"dynamic-semantic-graph-construction-and","title":"Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering","date":"2021-05-25","arxiv_id":"2105.11776","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/dynamic-semantic-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2105.11776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11776"}},"official":{"repos":["wwxu21/AMR-SG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/charged-particle-tracking-via-edge","slug":"charged-particle-tracking-via-edge","title":"Charged particle tracking via edge-classifying interaction networks","date":"2021-03-30","arxiv_id":"2103.16701","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/charged-particle-tracking-via-edge#ran","syntology_url":"https://syntology.ai/paper/2103.16701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16701"}},"official":{"repos":["GageDeZoort/interaction_network_paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/robust-point-cloud-registration-framework","slug":"robust-point-cloud-registration-framework","title":"Robust Point Cloud Registration Framework Based on Deep Graph Matching","date":"2021-03-07","arxiv_id":"2103.04256","repositories_listed":2,"syntology":{"n":38,"n_ran":26,"n_constructed":6,"n_ran_checked":20,"n_instrument":6,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":38,"phrase":"26 ran (of which 6 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 6 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/robust-point-cloud-registration-framework#ran","syntology_url":"https://syntology.ai/paper/2103.04256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.04256"}},"official":{"repos":["fukexue/RGM"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":8,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/location-aware-graph-convolutional-networks","slug":"location-aware-graph-convolutional-networks","title":"Location-aware Graph Convolutional Networks for Video Question Answering","date":"2020-08-07","arxiv_id":"2008.09105","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/location-aware-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2008.09105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09105"}},"official":{"repos":["SunDoge/L-GCN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-relational-reasoning-graph-network-for","slug":"deep-relational-reasoning-graph-network-for","title":"Deep Relational Reasoning Graph Network for Arbitrary Shape Text Detection","date":"2020-03-17","arxiv_id":"2003.07493","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-relational-reasoning-graph-network-for#ran","syntology_url":"https://syntology.ai/paper/2003.07493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07493"}},"official":{"repos":["GXYM/DRRG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-segment-3d-point-clouds-in-2d","slug":"learning-to-segment-3d-point-clouds-in-2d","title":"Learning to Segment 3D Point Clouds in 2D Image Space","date":"2020-03-12","arxiv_id":"2003.05593","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-to-segment-3d-point-clouds-in-2d#ran","syntology_url":"https://syntology.ai/paper/2003.05593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05593"}},"official":null}},{"url":"/paper/comet-commonsense-transformers-for-automatic","slug":"comet-commonsense-transformers-for-automatic","title":"COMET: Commonsense Transformers for Automatic Knowledge Graph Construction","date":"2019-06-12","arxiv_id":"1906.05317","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/comet-commonsense-transformers-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1906.05317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05317"}},"official":null}},{"url":"/paper/towards-dynamic-computation-graphs-via-sparse","slug":"towards-dynamic-computation-graphs-via-sparse","title":"Towards Dynamic Computation Graphs via Sparse Latent Structure","date":"2018-09-03","arxiv_id":"1809.00653","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-dynamic-computation-graphs-via-sparse#ran","syntology_url":"https://syntology.ai/paper/1809.00653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00653"}},"official":{"repos":["vene/sparsemap"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynet-the-dynamic-neural-network-toolkit","slug":"dynet-the-dynamic-neural-network-toolkit","title":"DyNet: The Dynamic Neural Network Toolkit","date":"2017-01-15","arxiv_id":"1701.03980","repositories_listed":4,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dynet-the-dynamic-neural-network-toolkit#ran","syntology_url":"https://syntology.ai/paper/1701.03980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.03980"}},"official":{"repos":["clab/dynet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}}],"record_sha256":"f469c3c63601b1fd9d8b26bd7df0f7bc7a2cf8bd65677490c3aec7bbbd3aa572","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}