{"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-neural-network/papers/ran/1","list_of":"/task/graph-neural-network","task":"Graph Neural Network","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":4,"rows_per_page":100,"rows":[1,100],"of":350,"counts":{"archive_papers_tagged":3598,"with_a_code_link":1516,"where_syntology_ran_a_sample":350,"not_listed_spam_title":0,"listed":3598,"listed_where_code_ran":350,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":302,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":302,"listed_every_run_a_failure_of_syntologys_instrument":48,"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-neural-network/papers/ran/1","prev":null,"next":"/task/graph-neural-network/papers/ran/2","papers":[{"url":"/paper/generative-modeling-of-full-atom-protein","slug":"generative-modeling-of-full-atom-protein","title":"Generative Modeling of Full-Atom Protein Conformations using Latent Diffusion on Graph Embeddings","date":"2025-06-20","arxiv_id":"2506.17064","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":8,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":14,"phrase":"14 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generative-modeling-of-full-atom-protein#ran","syntology_url":"https://syntology.ai/paper/2506.17064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.17064"}},"official":{"repos":["adityasengar/ld-fpg"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/falcon-an-ml-framework-for-fully-automated","slug":"falcon-an-ml-framework-for-fully-automated","title":"FALCON: An ML Framework for Fully Automated Layout-Constrained Analog Circuit Design","date":"2025-05-28","arxiv_id":"2505.21923","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/falcon-an-ml-framework-for-fully-automated#ran","syntology_url":"https://syntology.ai/paper/2505.21923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.21923"}},"official":{"repos":["AsalMehradfar/FALCON"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-supported-dynamic-algorithm","slug":"graph-supported-dynamic-algorithm","title":"Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization","date":"2025-05-22","arxiv_id":"2505.16471","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/graph-supported-dynamic-algorithm#ran","syntology_url":"https://syntology.ai/paper/2505.16471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16471"}},"official":{"repos":["robbertreijnen/gs-modac"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/2505-10960","slug":"2505-10960","title":"Relational Graph Transformer","date":"2025-05-16","arxiv_id":"2505.10960","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"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 1 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/2505-10960#ran","syntology_url":"https://syntology.ai/paper/2505.10960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10960"}},"official":{"repos":["snap-stanford/relgt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/grape-heterogeneous-graph-representation","slug":"grape-heterogeneous-graph-representation","title":"GRAPE: Heterogeneous Graph Representation Learning for Genetic Perturbation with Coding and Non-Coding Biotype","date":"2025-05-06","arxiv_id":"2505.03853","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/grape-heterogeneous-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2505.03853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03853"}},"official":null}},{"url":"/paper/inversiongnn-a-dual-path-network-for-multi","slug":"inversiongnn-a-dual-path-network-for-multi","title":"InversionGNN: A Dual Path Network for Multi-Property Molecular Optimization","date":"2025-03-03","arxiv_id":"2503.01488","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inversiongnn-a-dual-path-network-for-multi#ran","syntology_url":"https://syntology.ai/paper/2503.01488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01488"}},"official":{"repos":["ivanniu/inversiongnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/periodic-materials-generation-using-text","slug":"periodic-materials-generation-using-text","title":"Periodic Materials Generation using Text-Guided Joint Diffusion Model","date":"2025-03-01","arxiv_id":"2503.00522","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/periodic-materials-generation-using-text#ran","syntology_url":"https://syntology.ai/paper/2503.00522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.00522"}},"official":{"repos":["kdmsit/TGDMat"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gfm-rag-graph-foundation-model-for-retrieval","slug":"gfm-rag-graph-foundation-model-for-retrieval","title":"GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation","date":"2025-02-03","arxiv_id":"2502.01113","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 9 unverified","sample_list":"/paper/gfm-rag-graph-foundation-model-for-retrieval#ran","syntology_url":"https://syntology.ai/paper/2502.01113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.01113"}},"official":{"repos":["RManLuo/gfm-rag"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/mamba-based-graph-convolutional-networks","slug":"mamba-based-graph-convolutional-networks","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","date":"2025-01-26","arxiv_id":"2501.15461","repositories_listed":0,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mamba-based-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2501.15461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15461"}},"official":null}},{"url":"/paper/pre-training-graph-neural-networks-on-1","slug":"pre-training-graph-neural-networks-on-1","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2024-12-20","arxiv_id":"2412.15589","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pre-training-graph-neural-networks-on-1#ran","syntology_url":"https://syntology.ai/paper/2412.15589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15589"}},"official":{"repos":["NSLab-CUK/S-CGIB"],"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":["listed","official"]}}},{"url":"/paper/districtnet-decision-aware-learning-for","slug":"districtnet-decision-aware-learning-for","title":"DistrictNet: Decision-aware learning for geographical districting","date":"2024-12-11","arxiv_id":"2412.08287","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 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) · 1 unverified","sample_list":"/paper/districtnet-decision-aware-learning-for#ran","syntology_url":"https://syntology.ai/paper/2412.08287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08287"}},"official":{"repos":["cheikh025/DistrictNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lie-equivariant-quantum-graph-neural-networks","slug":"lie-equivariant-quantum-graph-neural-networks","title":"Lie-Equivariant Quantum Graph Neural Networks","date":"2024-11-22","arxiv_id":"2411.15315","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 4 unverified","sample_list":"/paper/lie-equivariant-quantum-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2411.15315","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15315"}},"official":{"repos":["ml4sci/qmlhep"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-conditional-distribution","slug":"self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","arxiv_id":"2411.15206","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-conditional-distribution#ran","syntology_url":"https://syntology.ai/paper/2411.15206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15206"}},"official":{"repos":["chenjie20/SSCDL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-graph-neural-network-surrogates","slug":"towards-graph-neural-network-surrogates","title":"Graph Neural Network Surrogates to leverage Mechanistic Expert Knowledge towards Reliable and Immediate Pandemic Response","date":"2024-11-10","arxiv_id":"2411.06500","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/towards-graph-neural-network-surrogates#ran","syntology_url":"https://syntology.ai/paper/2411.06500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06500"}},"official":null}},{"url":"/paper/distributed-order-fractional-graph-operating","slug":"distributed-order-fractional-graph-operating","title":"Distributed-Order Fractional Graph Operating Network","date":"2024-11-08","arxiv_id":"2411.05274","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"8 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distributed-order-fractional-graph-operating#ran","syntology_url":"https://syntology.ai/paper/2411.05274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.05274"}},"official":{"repos":["zknus/neurips-2024-dragon"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/privacy-preserving-graph-based-machine","slug":"privacy-preserving-graph-based-machine","title":"Privacy-Preserving Graph-Based Machine Learning with Fully Homomorphic Encryption for Collaborative Anti-Money Laundering","date":"2024-11-05","arxiv_id":"2411.02926","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/privacy-preserving-graph-based-machine#ran","syntology_url":"https://syntology.ai/paper/2411.02926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02926"}},"official":{"repos":["fabecode/GraphML-FHE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spiking-graph-neural-network-on-riemannian","slug":"spiking-graph-neural-network-on-riemannian","title":"Spiking Graph Neural Network on Riemannian Manifolds","date":"2024-10-23","arxiv_id":"2410.17941","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/spiking-graph-neural-network-on-riemannian#ran","syntology_url":"https://syntology.ai/paper/2410.17941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17941"}},"official":{"repos":["ZhenhHuang/MSG"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-rewiring-for-editable-graph-neural","slug":"gradient-rewiring-for-editable-graph-neural","title":"Gradient Rewiring for Editable Graph Neural Network Training","date":"2024-10-21","arxiv_id":"2410.15556","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":8,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/gradient-rewiring-for-editable-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2410.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15556"}},"official":{"repos":["zhimengj0326/gradient_rewiring_editing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/gesubnet-gene-interaction-inference-for","slug":"gesubnet-gene-interaction-inference-for","title":"GeSubNet: Gene Interaction Inference for Disease Subtype Network Generation","date":"2024-10-17","arxiv_id":"2410.13178","repositories_listed":0,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/gesubnet-gene-interaction-inference-for#ran","syntology_url":"https://syntology.ai/paper/2410.13178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13178"}},"official":null}},{"url":"/paper/expand-and-compress-exploring-tuning","slug":"expand-and-compress-exploring-tuning","title":"Expand and Compress: Exploring Tuning Principles for Continual Spatio-Temporal Graph Forecasting","date":"2024-10-16","arxiv_id":"2410.12593","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/expand-and-compress-exploring-tuning#ran","syntology_url":"https://syntology.ai/paper/2410.12593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12593"}},"official":null}},{"url":"/paper/replay-and-forget-free-graph-class","slug":"replay-and-forget-free-graph-class","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","date":"2024-10-14","arxiv_id":"2410.10341","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 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) · 2 unverified","sample_list":"/paper/replay-and-forget-free-graph-class#ran","syntology_url":"https://syntology.ai/paper/2410.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10341"}},"official":{"repos":["mala-lab/tpp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/topotune-a-framework-for-generalized","slug":"topotune-a-framework-for-generalized","title":"TopoTune : A Framework for Generalized Combinatorial Complex Neural Networks","date":"2024-10-09","arxiv_id":"2410.06530","repositories_listed":2,"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/topotune-a-framework-for-generalized#ran","syntology_url":"https://syntology.ai/paper/2410.06530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06530"}},"official":{"repos":["geometric-intelligence/topobenchmark","pyt-team/TopoBenchmarkX"],"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/improving-temporal-link-prediction-via","slug":"improving-temporal-link-prediction-via","title":"Improving Temporal Link Prediction via Temporal Walk Matrix Projection","date":"2024-10-05","arxiv_id":"2410.04013","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/improving-temporal-link-prediction-via#ran","syntology_url":"https://syntology.ai/paper/2410.04013","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04013"}},"official":{"repos":["lxd99/tpnet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/promsec-prompt-optimization-for-secure","slug":"promsec-prompt-optimization-for-secure","title":"PromSec: Prompt Optimization for Secure Generation of Functional Source Code with Large Language Models (LLMs)","date":"2024-09-19","arxiv_id":"2409.12699","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 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) · 1 unverified","sample_list":"/paper/promsec-prompt-optimization-for-secure#ran","syntology_url":"https://syntology.ai/paper/2409.12699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.12699"}},"official":{"repos":["mahmoudkanazzal/PromSec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-graph-reordering-speed-up-graph-neural","slug":"can-graph-reordering-speed-up-graph-neural","title":"Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study","date":"2024-09-17","arxiv_id":"2409.11129","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":1,"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/can-graph-reordering-speed-up-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2409.11129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.11129"}},"official":{"repos":["nikolaimerkel/reordering"],"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/cliqueph-higher-order-information-for-graph","slug":"cliqueph-higher-order-information-for-graph","title":"CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphs","date":"2024-09-12","arxiv_id":"2409.08217","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"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, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cliqueph-higher-order-information-for-graph#ran","syntology_url":"https://syntology.ai/paper/2409.08217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.08217"}},"official":{"repos":["DavideBuffelli/CliquePH"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-graph-contrastive-learning-with-1","slug":"enhancing-graph-contrastive-learning-with-1","title":"Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation","date":"2024-09-09","arxiv_id":"2409.05633","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/enhancing-graph-contrastive-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2409.05633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05633"}},"official":{"repos":["rucaibox/cogcl"],"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/data-driven-parametrization-of-molecular","slug":"data-driven-parametrization-of-molecular","title":"Data-Driven Parametrization of Molecular Mechanics Force Fields for Expansive Chemical Space Coverage","date":"2024-08-23","arxiv_id":"2408.12817","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":0,"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/data-driven-parametrization-of-molecular#ran","syntology_url":"https://syntology.ai/paper/2408.12817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.12817"}},"official":{"repos":["bytedance/byteff"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-heterogeneous-graph-learning-on","slug":"multi-task-heterogeneous-graph-learning-on","title":"Multi-task Heterogeneous Graph Learning on Electronic Health Records","date":"2024-08-14","arxiv_id":"2408.07569","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/multi-task-heterogeneous-graph-learning-on#ran","syntology_url":"https://syntology.ai/paper/2408.07569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07569"}},"official":{"repos":["hku-medai/mult-ehr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-graph-neural-networks-for-2","slug":"interpretable-graph-neural-networks-for-2","title":"Interpretable Graph Neural Networks for Heterogeneous Tabular Data","date":"2024-08-14","arxiv_id":"2408.07661","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/interpretable-graph-neural-networks-for-2#ran","syntology_url":"https://syntology.ai/paper/2408.07661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07661"}},"official":{"repos":["amrmalkhatib/ignh"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-03195","slug":"2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","arxiv_id":"2408.03195","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":15,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/2408-03195#ran","syntology_url":"https://syntology.ai/paper/2408.03195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03195"}},"official":{"repos":["JasonZhujp/RELIEF"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/relbench-a-benchmark-for-deep-learning-on","slug":"relbench-a-benchmark-for-deep-learning-on","title":"RelBench: A Benchmark for Deep Learning on Relational Databases","date":"2024-07-29","arxiv_id":"2407.20060","repositories_listed":3,"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":3,"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/relbench-a-benchmark-for-deep-learning-on#ran","syntology_url":"https://syntology.ai/paper/2407.20060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20060"}},"official":{"repos":["snap-stanford/relbench","snap-stanford/relbench-user-study"],"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/mew-multiplexed-immunofluorescence-image","slug":"mew-multiplexed-immunofluorescence-image","title":"Mew: Multiplexed Immunofluorescence Image Analysis through an Efficient Multiplex Network","date":"2024-07-25","arxiv_id":"2407.17857","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":11,"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) · 0 unverified","sample_list":"/paper/mew-multiplexed-immunofluorescence-image#ran","syntology_url":"https://syntology.ai/paper/2407.17857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17857"}},"official":{"repos":["unites-lab/mew"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/comparing-and-contrasting-deep-learning","slug":"comparing-and-contrasting-deep-learning","title":"Comparing and Contrasting Deep Learning Weather Prediction Backbones on Navier-Stokes and Atmospheric Dynamics","date":"2024-07-19","arxiv_id":"2407.14129","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/comparing-and-contrasting-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2407.14129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.14129"}},"official":{"repos":["amazon-science/dlwp-benchmark"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-fair-graph-neural-networks-from-re","slug":"rethinking-fair-graph-neural-networks-from-re","title":"Rethinking Fair Graph Neural Networks from Re-balancing","date":"2024-07-16","arxiv_id":"2407.11624","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-fair-graph-neural-networks-from-re#ran","syntology_url":"https://syntology.ai/paper/2407.11624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11624"}},"official":{"repos":["zhixunlee/fairgb"],"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/graph-neural-network-causal-explanation-via","slug":"graph-neural-network-causal-explanation-via","title":"Graph Neural Network Causal Explanation via Neural Causal Models","date":"2024-07-12","arxiv_id":"2407.09378","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-network-causal-explanation-via#ran","syntology_url":"https://syntology.ai/paper/2407.09378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.09378"}},"official":{"repos":["armanbehnam/cxgnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-graph-semantic-and-structural","slug":"federated-graph-semantic-and-structural","title":"Federated Graph Semantic and Structural Learning","date":"2024-06-27","arxiv_id":"2406.18937","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":1,"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/federated-graph-semantic-and-structural#ran","syntology_url":"https://syntology.ai/paper/2406.18937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18937"}},"official":{"repos":["guanchengwan/fgssl"],"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/heterogeneous-causal-metapath-graph-neural","slug":"heterogeneous-causal-metapath-graph-neural","title":"Heterogeneous Causal Metapath Graph Neural Network for Gene-Microbe-Disease Association Prediction","date":"2024-06-27","arxiv_id":"2406.19156","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/heterogeneous-causal-metapath-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2406.19156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19156"}},"official":{"repos":["zkxinxin/hcmgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-admission-control-and-resource","slug":"joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"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) · 3 unverified","sample_list":"/paper/joint-admission-control-and-resource#ran","syntology_url":"https://syntology.ai/paper/2406.17334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17334"}},"official":{"repos":["geminilight/hrl-acra"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/iterative-sizing-field-prediction-for","slug":"iterative-sizing-field-prediction-for","title":"Iterative Sizing Field Prediction for Adaptive Mesh Generation From Expert Demonstrations","date":"2024-06-20","arxiv_id":"2406.14161","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/iterative-sizing-field-prediction-for#ran","syntology_url":"https://syntology.ai/paper/2406.14161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14161"}},"official":{"repos":["NiklasFreymuth/AMBER"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/moleculargpt-open-large-language-model-llm","slug":"moleculargpt-open-large-language-model-llm","title":"MolecularGPT: Open Large Language Model (LLM) for Few-Shot Molecular Property Prediction","date":"2024-06-18","arxiv_id":"2406.12950","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/moleculargpt-open-large-language-model-llm#ran","syntology_url":"https://syntology.ai/paper/2406.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12950"}},"official":{"repos":["nyushcs/moleculargpt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/logical-distillation-of-graph-neural-networks","slug":"logical-distillation-of-graph-neural-networks","title":"Logical Distillation of Graph Neural Networks","date":"2024-06-11","arxiv_id":"2406.07126","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":3,"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/logical-distillation-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2406.07126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07126"}},"official":{"repos":["lexpk/logicaldistillationofgnns"],"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/scaling-graph-convolutions-for-mobile-vision","slug":"scaling-graph-convolutions-for-mobile-vision","title":"Scaling Graph Convolutions for Mobile Vision","date":"2024-06-09","arxiv_id":"2406.05850","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/scaling-graph-convolutions-for-mobile-vision#ran","syntology_url":"https://syntology.ai/paper/2406.05850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05850"}},"official":{"repos":["sldgroup/mobilevigv2"],"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/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}},"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/aligning-transformers-with-weisfeiler-leman","slug":"aligning-transformers-with-weisfeiler-leman","title":"Aligning Transformers with Weisfeiler-Leman","date":"2024-06-05","arxiv_id":"2406.03148","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/aligning-transformers-with-weisfeiler-leman#ran","syntology_url":"https://syntology.ai/paper/2406.03148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03148"}},"official":{"repos":["luis-mueller/wl-transformers"],"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":["found_in_text","official"]}}},{"url":"/paper/selfgnn-self-supervised-graph-neural-networks","slug":"selfgnn-self-supervised-graph-neural-networks","title":"SelfGNN: Self-Supervised Graph Neural Networks for Sequential Recommendation","date":"2024-05-31","arxiv_id":"2405.20878","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/selfgnn-self-supervised-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.20878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20878"}},"official":{"repos":["hkuds/selfgnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/spatio-spectral-graph-neural-networks","slug":"spatio-spectral-graph-neural-networks","title":"Spatio-Spectral Graph Neural Networks","date":"2024-05-29","arxiv_id":"2405.19121","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/spatio-spectral-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.19121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19121"}},"official":{"repos":["sigeisler/s2gnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-sustainable-urban-mobility","slug":"enhancing-sustainable-urban-mobility","title":"Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach","date":"2024-05-26","arxiv_id":"2405.17507","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":2,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":10,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-sustainable-urban-mobility#ran","syntology_url":"https://syntology.ai/paper/2405.17507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17507"}},"official":{"repos":["cy07gn/teltomob"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/memo-meaningful-modular-controllers-via-noise","slug":"memo-meaningful-modular-controllers-via-noise","title":"MeMo: Meaningful, Modular Controllers via Noise Injection","date":"2024-05-24","arxiv_id":"2407.01567","repositories_listed":0,"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/memo-meaningful-modular-controllers-via-noise#ran","syntology_url":"https://syntology.ai/paper/2407.01567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01567"}},"official":null}},{"url":"/paper/equivariant-spatio-temporal-attentive-graph-1","slug":"equivariant-spatio-temporal-attentive-graph-1","title":"Equivariant Spatio-Temporal Attentive Graph Networks to Simulate Physical Dynamics","date":"2024-05-21","arxiv_id":"2405.12868","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/equivariant-spatio-temporal-attentive-graph-1#ran","syntology_url":"https://syntology.ai/paper/2405.12868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12868"}},"official":{"repos":["ManlioWu/ESTAG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pac-bayesian-generalization-bounds-for-2","slug":"pac-bayesian-generalization-bounds-for-2","title":"PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning","date":"2024-05-10","arxiv_id":"2405.06418","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 2 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/pac-bayesian-generalization-bounds-for-2#ran","syntology_url":"https://syntology.ai/paper/2405.06418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06418"}},"official":{"repos":["bdi-lab/reed"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/slotgat-slot-based-message-passing-for","slug":"slotgat-slot-based-message-passing-for","title":"SlotGAT: Slot-based Message Passing for Heterogeneous Graph Neural Network","date":"2024-05-03","arxiv_id":"2405.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/slotgat-slot-based-message-passing-for#ran","syntology_url":"https://syntology.ai/paper/2405.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01927"}},"official":{"repos":["scottjiao/slotgat_icml23"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cvtgad-simplified-transformer-with-cross-view","slug":"cvtgad-simplified-transformer-with-cross-view","title":"CVTGAD: Simplified Transformer with Cross-View Attention for Unsupervised Graph-level Anomaly Detection","date":"2024-05-03","arxiv_id":"2405.02359","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"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 0 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","sample_list":"/paper/cvtgad-simplified-transformer-with-cross-view#ran","syntology_url":"https://syntology.ai/paper/2405.02359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02359"}},"official":{"repos":["jindongli-ai/cvtgad"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unleashing-the-potential-of-fractional","slug":"unleashing-the-potential-of-fractional","title":"Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND","date":"2024-04-26","arxiv_id":"2404.17099","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"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) · 3 unverified","sample_list":"/paper/unleashing-the-potential-of-fractional#ran","syntology_url":"https://syntology.ai/paper/2404.17099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17099"}},"official":{"repos":["zknus/iclr2024-frond","zknus/torchfde"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/similarity-equivariant-graph-neural-networks","slug":"similarity-equivariant-graph-neural-networks","title":"Similarity Equivariant Graph Neural Networks for Homogenization of Metamaterials","date":"2024-04-26","arxiv_id":"2404.17365","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/similarity-equivariant-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2404.17365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17365"}},"official":{"repos":["fhendriks11/simegnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gradformer-graph-transformer-with-exponential","slug":"gradformer-graph-transformer-with-exponential","title":"Gradformer: Graph Transformer with Exponential Decay","date":"2024-04-24","arxiv_id":"2404.15729","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradformer-graph-transformer-with-exponential#ran","syntology_url":"https://syntology.ai/paper/2404.15729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15729"}},"official":{"repos":["liuchuang0059/gradformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/grasper-a-generalist-pursuer-for-pursuit","slug":"grasper-a-generalist-pursuer-for-pursuit","title":"Grasper: A Generalist Pursuer for Pursuit-Evasion Problems","date":"2024-04-19","arxiv_id":"2404.12626","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":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/grasper-a-generalist-pursuer-for-pursuit#ran","syntology_url":"https://syntology.ai/paper/2404.12626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12626"}},"official":{"repos":["ipadli/grasper"],"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/ribodiffusion-tertiary-structure-based-rna","slug":"ribodiffusion-tertiary-structure-based-rna","title":"RiboDiffusion: Tertiary Structure-based RNA Inverse Folding with Generative Diffusion Models","date":"2024-04-17","arxiv_id":"2404.11199","repositories_listed":1,"syntology":{"n":21,"n_ran":19,"n_constructed":0,"n_ran_checked":17,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ribodiffusion-tertiary-structure-based-rna#ran","syntology_url":"https://syntology.ai/paper/2404.11199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11199"}},"official":{"repos":["ml4bio/ribodiffusion"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-prompt-based-pre-trained-language","slug":"relational-prompt-based-pre-trained-language","title":"Relational Prompt-based Pre-trained Language Models for Social Event Detection","date":"2024-04-12","arxiv_id":"2404.08263","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/relational-prompt-based-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2404.08263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08263"}},"official":{"repos":["ringbdstack/rplm_sed"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/segment-anything-model-for-road-network-graph","slug":"segment-anything-model-for-road-network-graph","title":"Segment Anything Model for Road Network Graph Extraction","date":"2024-03-24","arxiv_id":"2403.16051","repositories_listed":1,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/segment-anything-model-for-road-network-graph#ran","syntology_url":"https://syntology.ai/paper/2403.16051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16051"}},"official":{"repos":["htcr/sam_road"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unifews-unified-entry-wise-sparsification-for","slug":"unifews-unified-entry-wise-sparsification-for","title":"Unifews: Unified Entry-Wise Sparsification for Efficient Graph Neural Network","date":"2024-03-20","arxiv_id":"2403.13268","repositories_listed":0,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unifews-unified-entry-wise-sparsification-for#ran","syntology_url":"https://syntology.ai/paper/2403.13268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13268"}},"official":null}},{"url":"/paper/distinguishing-neighborhood-representations","slug":"distinguishing-neighborhood-representations","title":"Mitigating Oversmoothing Through Reverse Process of GNNs for Heterophilic Graphs","date":"2024-03-11","arxiv_id":"2403.10543","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/distinguishing-neighborhood-representations#ran","syntology_url":"https://syntology.ai/paper/2403.10543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.10543"}},"official":{"repos":["ml-postech/reverse-gnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-generic-representation-of","slug":"towards-a-generic-representation-of","title":"Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches","date":"2024-03-09","arxiv_id":"2403.06026","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":16,"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) · 5 unverified","sample_list":"/paper/towards-a-generic-representation-of#ran","syntology_url":"https://syntology.ai/paper/2403.06026","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06026"}},"official":{"repos":["corail-research/learning-generic-csp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/subhomogeneous-deep-equilibrium-models","slug":"subhomogeneous-deep-equilibrium-models","title":"Subhomogeneous Deep Equilibrium Models","date":"2024-03-01","arxiv_id":"2403.00720","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/subhomogeneous-deep-equilibrium-models#ran","syntology_url":"https://syntology.ai/paper/2403.00720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00720"}},"official":{"repos":["COMPiLELab/SubDEQ"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diffassemble-a-unified-graph-diffusion-model","slug":"diffassemble-a-unified-graph-diffusion-model","title":"DiffAssemble: A Unified Graph-Diffusion Model for 2D and 3D Reassembly","date":"2024-02-29","arxiv_id":"2402.19302","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":2,"n_ran_checked":7,"n_instrument":1,"n_unverified":8,"n_honours":3,"n_violates":1,"n_no_contract":3,"n_pointer_only":16,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/diffassemble-a-unified-graph-diffusion-model#ran","syntology_url":"https://syntology.ai/paper/2402.19302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.19302"}},"official":{"repos":["iit-pavis/diffassemble"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-time-graph-neural-networks-for","slug":"linear-time-graph-neural-networks-for","title":"Linear-Time Graph Neural Networks for Scalable Recommendations","date":"2024-02-21","arxiv_id":"2402.13973","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/linear-time-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2402.13973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13973"}},"official":{"repos":["qwq2000/thewebconf24-ltgnn-pytorch"],"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/can-gnn-be-good-adapter-for-llms","slug":"can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","arxiv_id":"2402.12984","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-gnn-be-good-adapter-for-llms#ran","syntology_url":"https://syntology.ai/paper/2402.12984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12984"}},"official":{"repos":["zjunet/graphadapter","hxttkl/GraphAdapter"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-graph-reasoning-for-fact","slug":"heterogeneous-graph-reasoning-for-fact","title":"Heterogeneous Graph Reasoning for Fact Checking over Texts and Tables","date":"2024-02-20","arxiv_id":"2402.13028","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/heterogeneous-graph-reasoning-for-fact#ran","syntology_url":"https://syntology.ai/paper/2402.13028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13028"}},"official":{"repos":["deno-v/heterfc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/chemreasoner-heuristic-search-over-a-large","slug":"chemreasoner-heuristic-search-over-a-large","title":"ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical Feedback","date":"2024-02-15","arxiv_id":"2402.10980","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/chemreasoner-heuristic-search-over-a-large#ran","syntology_url":"https://syntology.ai/paper/2402.10980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10980"}},"official":{"repos":["pnnl/chemreasoner"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/netinfof-framework-measuring-and-exploiting","slug":"netinfof-framework-measuring-and-exploiting","title":"NetInfoF Framework: Measuring and Exploiting Network Usable Information","date":"2024-02-12","arxiv_id":"2402.07999","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/netinfof-framework-measuring-and-exploiting#ran","syntology_url":"https://syntology.ai/paper/2402.07999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07999"}},"official":{"repos":["amazon-science/network-usable-info-framework"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/core-gd-a-hierarchical-framework-for-scalable","slug":"core-gd-a-hierarchical-framework-for-scalable","title":"CoRe-GD: A Hierarchical Framework for Scalable Graph Visualization with GNNs","date":"2024-02-09","arxiv_id":"2402.06706","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/core-gd-a-hierarchical-framework-for-scalable#ran","syntology_url":"https://syntology.ai/paper/2402.06706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06706"}},"official":{"repos":["floriangroetschla/core-gd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/moco-a-learnable-meta-optimizer-for","slug":"moco-a-learnable-meta-optimizer-for","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","date":"2024-02-07","arxiv_id":"2402.04915","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/moco-a-learnable-meta-optimizer-for#ran","syntology_url":"https://syntology.ai/paper/2402.04915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04915"}},"official":{"repos":["timd3/moco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-tuning-and-inference-for-large","slug":"efficient-tuning-and-inference-for-large","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","date":"2024-01-28","arxiv_id":"2401.15569","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-tuning-and-inference-for-large#ran","syntology_url":"https://syntology.ai/paper/2401.15569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15569"}},"official":{"repos":["ZhuYun97/ENGINE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/product-manifold-representations-for-learning","slug":"product-manifold-representations-for-learning","title":"Product Manifold Representations for Learning on Biological Pathways","date":"2024-01-27","arxiv_id":"2401.15478","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/product-manifold-representations-for-learning#ran","syntology_url":"https://syntology.ai/paper/2401.15478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15478"}},"official":{"repos":["mcneela/mixed-curvature-gcn","mcneela/mixed-curvature-pathways"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-dynamics-from-multicellular-graphs","slug":"learning-dynamics-from-multicellular-graphs","title":"Learning Dynamics from Multicellular Graphs with Deep Neural Networks","date":"2024-01-22","arxiv_id":"2401.12196","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/learning-dynamics-from-multicellular-graphs#ran","syntology_url":"https://syntology.ai/paper/2401.12196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.12196"}},"official":{"repos":["guolab-cellmechanics/gnn-collective-cell-dynamics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/teltrans-applying-multi-type-telecom-data-to","slug":"teltrans-applying-multi-type-telecom-data-to","title":"TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling","date":"2024-01-06","arxiv_id":"2401.03138","repositories_listed":0,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":7,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/teltrans-applying-multi-type-telecom-data-to#ran","syntology_url":"https://syntology.ai/paper/2401.03138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.03138"}},"official":null}},{"url":"/paper/motif-aware-riemannian-graph-neural-network","slug":"motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","arxiv_id":"2401.01232","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 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) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/motif-aware-riemannian-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2401.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01232"}},"official":{"repos":["riemanngraph/motifrgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}},"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-flexible-body-collision-dynamics","slug":"learning-flexible-body-collision-dynamics","title":"Learning Flexible Body Collision Dynamics with Hierarchical Contact Mesh Transformer","date":"2023-12-19","arxiv_id":"2312.12467","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":6,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-flexible-body-collision-dynamics#ran","syntology_url":"https://syntology.ai/paper/2312.12467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.12467"}},"official":{"repos":["yuyudeep/hcmt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/higher-order-equivariant-neural-networks-for","slug":"higher-order-equivariant-neural-networks-for","title":"Higher-Order Equivariant Neural Networks for Charge Density Prediction in Materials","date":"2023-12-08","arxiv_id":"2312.05388","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/higher-order-equivariant-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2312.05388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.05388"}},"official":{"repos":["AIforGreatGood/charge3net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graphmetro-mitigating-complex-distribution","slug":"graphmetro-mitigating-complex-distribution","title":"GraphMETRO: Mitigating Complex Graph Distribution Shifts via Mixture of Aligned Experts","date":"2023-12-07","arxiv_id":"2312.04693","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graphmetro-mitigating-complex-distribution#ran","syntology_url":"https://syntology.ai/paper/2312.04693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04693"}},"official":{"repos":["wuyxin/graphmetro"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-and-interpretable-drug-drug","slug":"accurate-and-interpretable-drug-drug","title":"Accurate and interpretable drug-drug interaction prediction enabled by knowledge subgraph learning","date":"2023-11-25","arxiv_id":"2311.15056","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":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/accurate-and-interpretable-drug-drug#ran","syntology_url":"https://syntology.ai/paper/2311.15056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15056"}},"official":{"repos":["lars-research/knowddi"],"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/language-semantic-graph-guided-data-efficient","slug":"language-semantic-graph-guided-data-efficient","title":"Language Semantic Graph Guided Data-Efficient Learning","date":"2023-11-15","arxiv_id":"2311.08782","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/language-semantic-graph-guided-data-efficient#ran","syntology_url":"https://syntology.ai/paper/2311.08782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08782"}},"official":{"repos":["bit-da/lsg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fouriergnn-rethinking-multivariate-time-1","slug":"fouriergnn-rethinking-multivariate-time-1","title":"FourierGNN: Rethinking Multivariate Time Series Forecasting from a Pure Graph Perspective","date":"2023-11-10","arxiv_id":"2311.06190","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 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) · 1 unverified","sample_list":"/paper/fouriergnn-rethinking-multivariate-time-1#ran","syntology_url":"https://syntology.ai/paper/2311.06190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06190"}},"official":{"repos":["aikunyi/fouriergnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-weak-strong-experts-on-graphs","slug":"mixture-of-weak-strong-experts-on-graphs","title":"Mixture of Weak & Strong Experts on Graphs","date":"2023-11-09","arxiv_id":"2311.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixture-of-weak-strong-experts-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2311.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05185"}},"official":{"repos":["facebookresearch/mowst-gnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pepland-a-large-scale-pre-trained-peptide","slug":"pepland-a-large-scale-pre-trained-peptide","title":"PepLand: a large-scale pre-trained peptide representation model for a comprehensive landscape of both canonical and non-canonical amino acids","date":"2023-11-08","arxiv_id":"2311.04419","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pepland-a-large-scale-pre-trained-peptide#ran","syntology_url":"https://syntology.ai/paper/2311.04419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04419"}},"official":{"repos":["zhangruochi/pepland"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/brain-networks-and-intelligence-a-graph","slug":"brain-networks-and-intelligence-a-graph","title":"Brain Networks and Intelligence: A Graph Neural Network Based Approach to Resting State fMRI Data","date":"2023-11-06","arxiv_id":"2311.03520","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":2,"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/brain-networks-and-intelligence-a-graph#ran","syntology_url":"https://syntology.ai/paper/2311.03520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03520"}},"official":{"repos":["bishalth01/BrainRGIN"],"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/robust-graph-clustering-via-meta-weighting","slug":"robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","arxiv_id":"2311.00322","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-graph-clustering-via-meta-weighting#ran","syntology_url":"https://syntology.ai/paper/2311.00322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00322"}},"official":{"repos":["hyeonsoojo/metagc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/maximum-independent-set-self-training-through","slug":"maximum-independent-set-self-training-through","title":"Maximum Independent Set: Self-Training through Dynamic Programming","date":"2023-10-28","arxiv_id":"2310.18672","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/maximum-independent-set-self-training-through#ran","syntology_url":"https://syntology.ai/paper/2310.18672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18672"}},"official":{"repos":["LIONS-EPFL/dynamic-MIS"],"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/using-causality-aware-graph-neural-networks","slug":"using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","date":"2023-10-24","arxiv_id":"2310.15865","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/using-causality-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"official":{"repos":["pathpy/pathpyg"],"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/efficient-heterogeneous-graph-learning-via","slug":"efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","arxiv_id":"2310.14481","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/musegnn-interpretable-and-convergent-graph","slug":"musegnn-interpretable-and-convergent-graph","title":"MuseGNN: Interpretable and Convergent Graph Neural Network Layers at Scale","date":"2023-10-19","arxiv_id":"2310.12457","repositories_listed":0,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/musegnn-interpretable-and-convergent-graph#ran","syntology_url":"https://syntology.ai/paper/2310.12457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12457"}},"official":null}},{"url":"/paper/open-world-lifelong-graph-learning","slug":"open-world-lifelong-graph-learning","title":"Open-World Lifelong Graph Learning","date":"2023-10-19","arxiv_id":"2310.12565","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/open-world-lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2310.12565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12565"}},"official":{"repos":["bobowner/open-world-lgl"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/non-backtracking-graph-neural-networks","slug":"non-backtracking-graph-neural-networks","title":"Non-backtracking Graph Neural Networks","date":"2023-10-11","arxiv_id":"2310.07430","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/non-backtracking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.07430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07430"}},"official":{"repos":["seonghyun26/nba-gnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gmocat-a-graph-enhanced-multi-objective","slug":"gmocat-a-graph-enhanced-multi-objective","title":"GMOCAT: A Graph-Enhanced Multi-Objective Method for Computerized Adaptive Testing","date":"2023-10-11","arxiv_id":"2310.07477","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gmocat-a-graph-enhanced-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2310.07477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07477"}},"official":{"repos":["justarter/gmocat"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/neural-relational-inference-with-fast-modular-1","slug":"neural-relational-inference-with-fast-modular-1","title":"Neural Relational Inference with Fast Modular Meta-learning","date":"2023-10-10","arxiv_id":"2310.07015","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/neural-relational-inference-with-fast-modular-1#ran","syntology_url":"https://syntology.ai/paper/2310.07015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07015"}},"official":{"repos":["FerranAlet/modular-metalearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tailoring-self-attention-for-graph-via-rooted-1","slug":"tailoring-self-attention-for-graph-via-rooted-1","title":"Tailoring Self-Attention for Graph via Rooted Subtrees","date":"2023-10-08","arxiv_id":"2310.05296","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"7 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tailoring-self-attention-for-graph-via-rooted-1#ran","syntology_url":"https://syntology.ai/paper/2310.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05296"}},"official":{"repos":["lumia-group/subtree-attention"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/rayleigh-quotient-graph-neural-networks-for","slug":"rayleigh-quotient-graph-neural-networks-for","title":"Rayleigh Quotient Graph Neural Networks for Graph-level Anomaly Detection","date":"2023-10-04","arxiv_id":"2310.02861","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"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) · 5 unverified","sample_list":"/paper/rayleigh-quotient-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2310.02861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02861"}},"official":{"repos":["xydong127/rqgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/score-dynamics-scaling-molecular-dynamics","slug":"score-dynamics-scaling-molecular-dynamics","title":"Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model","date":"2023-10-02","arxiv_id":"2310.01678","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":15,"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) · 7 unverified","sample_list":"/paper/score-dynamics-scaling-molecular-dynamics#ran","syntology_url":"https://syntology.ai/paper/2310.01678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01678"}},"official":{"repos":["llnl/graphite"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}}],"record_sha256":"596f9a2154d2bdea623b33f6ee905f3d2df8dc0a6c1343a9cc7e109b314b86c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}