{"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/2","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":2,"pages_in_order":4,"rows_per_page":100,"rows":[101,200],"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":"/task/graph-neural-network/papers/ran/1","next":"/task/graph-neural-network/papers/ran/3","papers":[{"url":"/paper/are-graph-neural-networks-optimal","slug":"are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","arxiv_id":"2310.00526","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":13,"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) · 7 unverified","sample_list":"/paper/are-graph-neural-networks-optimal#ran","syntology_url":"https://syntology.ai/paper/2310.00526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00526"}},"official":{"repos":["penlu/bespoke-gnn4do"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/controlling-continuous-relaxation-for","slug":"controlling-continuous-relaxation-for","title":"Controlling Continuous Relaxation for Combinatorial Optimization","date":"2023-09-29","arxiv_id":"2309.16965","repositories_listed":1,"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":6,"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/controlling-continuous-relaxation-for#ran","syntology_url":"https://syntology.ai/paper/2309.16965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16965"}},"official":{"repos":["Yuma-Ichikawa/CRA4CO"],"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":["official"]}}},{"url":"/paper/networked-inequality-preferential-attachment","slug":"networked-inequality-preferential-attachment","title":"Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Prediction","date":"2023-09-29","arxiv_id":"2309.17417","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/networked-inequality-preferential-attachment#ran","syntology_url":"https://syntology.ai/paper/2309.17417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17417"}},"official":{"repos":["arjunsubramonian/link_bias_amplification"],"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/muse-gnn-learning-unified-gene-representation","slug":"muse-gnn-learning-unified-gene-representation","title":"MuSe-GNN: Learning Unified Gene Representation From Multimodal Biological Graph Data","date":"2023-09-29","arxiv_id":"2310.02275","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/muse-gnn-learning-unified-gene-representation#ran","syntology_url":"https://syntology.ai/paper/2310.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02275"}},"official":{"repos":["helloworldlty/muse-gnn"],"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/graph-enhanced-optimizers-for-structure-aware","slug":"graph-enhanced-optimizers-for-structure-aware","title":"Graph-enhanced Optimizers for Structure-aware Recommendation Embedding Evolution","date":"2023-09-24","arxiv_id":"2310.03032","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-enhanced-optimizers-for-structure-aware#ran","syntology_url":"https://syntology.ai/paper/2310.03032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03032"}},"official":{"repos":["mtandhj/sevo"],"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/higt-hierarchical-interaction-graph","slug":"higt-hierarchical-interaction-graph","title":"HIGT: Hierarchical Interaction Graph-Transformer for Whole Slide Image Analysis","date":"2023-09-14","arxiv_id":"2309.07400","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/higt-hierarchical-interaction-graph#ran","syntology_url":"https://syntology.ai/paper/2309.07400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07400"}},"official":{"repos":["hku-medai/higt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-the-geodesic-embedding-with-graph","slug":"learning-the-geodesic-embedding-with-graph","title":"Learning the Geodesic Embedding with Graph Neural Networks","date":"2023-09-11","arxiv_id":"2309.05613","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/learning-the-geodesic-embedding-with-graph#ran","syntology_url":"https://syntology.ai/paper/2309.05613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.05613"}},"official":{"repos":["intelligentgeometry/gegnn"],"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/domain-adaptive-message-passing-graph-neural","slug":"domain-adaptive-message-passing-graph-neural","title":"Domain-adaptive Message Passing Graph Neural Network","date":"2023-08-31","arxiv_id":"2308.16470","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/domain-adaptive-message-passing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2308.16470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16470"}},"official":{"repos":["shenxiaocam/dm_gnn"],"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/learning-bottleneck-transformer-for-event","slug":"learning-bottleneck-transformer-for-event","title":"Learning Bottleneck Transformer for Event Image-Voxel Feature Fusion based Classification","date":"2023-08-23","arxiv_id":"2308.11937","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-bottleneck-transformer-for-event#ran","syntology_url":"https://syntology.ai/paper/2308.11937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11937"}},"official":{"repos":["event-ahu/efv_event_classification"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/desco-towards-generalizable-and-scalable-deep","slug":"desco-towards-generalizable-and-scalable-deep","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","date":"2023-08-16","arxiv_id":"2308.08198","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/desco-towards-generalizable-and-scalable-deep#ran","syntology_url":"https://syntology.ai/paper/2308.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08198"}},"official":{"repos":["fuvty/DeSCo"],"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/kairos-practical-intrusion-detection-and","slug":"kairos-practical-intrusion-detection-and","title":"Kairos: Practical Intrusion Detection and Investigation using Whole-system Provenance","date":"2023-08-09","arxiv_id":"2308.05034","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":12,"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) · 5 unverified","sample_list":"/paper/kairos-practical-intrusion-detection-and#ran","syntology_url":"https://syntology.ai/paper/2308.05034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05034"}},"official":{"repos":["provenanceanalytics/kairos"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/how-curvature-enhance-the-adaptation-power-of","slug":"how-curvature-enhance-the-adaptation-power-of","title":"How Curvature Enhance the Adaptation Power of Framelet GCNs","date":"2023-07-19","arxiv_id":"2307.09768","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/how-curvature-enhance-the-adaptation-power-of#ran","syntology_url":"https://syntology.ai/paper/2307.09768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09768"}},"official":{"repos":["dshi3553usyd/curvature_enhanced_graph_convolution"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/maxcorrmgnn-a-multi-graph-neural-network","slug":"maxcorrmgnn-a-multi-graph-neural-network","title":"MaxCorrMGNN: A Multi-Graph Neural Network Framework for Generalized Multimodal Fusion of Medical Data for Outcome Prediction","date":"2023-07-13","arxiv_id":"2307.07093","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/maxcorrmgnn-a-multi-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2307.07093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07093"}},"official":null}},{"url":"/paper/a-neural-separation-algorithm-for-the-rounded","slug":"a-neural-separation-algorithm-for-the-rounded","title":"A Neural Separation Algorithm for the Rounded Capacity Inequalities","date":"2023-06-29","arxiv_id":"2306.17283","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/a-neural-separation-algorithm-for-the-rounded#ran","syntology_url":"https://syntology.ai/paper/2306.17283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17283"}},"official":{"repos":["hyeonahkimm/neuralsep"],"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/nar-former-v2-rethinking-transformer-for-1","slug":"nar-former-v2-rethinking-transformer-for-1","title":"NAR-Former V2: Rethinking Transformer for Universal Neural Network Representation Learning","date":"2023-06-19","arxiv_id":"2306.10792","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/nar-former-v2-rethinking-transformer-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.10792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10792"}},"official":{"repos":["yuny220/NAR-Former-V2"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/from-hypergraph-energy-functions-to","slug":"from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","arxiv_id":"2306.09623","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/from-hypergraph-energy-functions-to#ran","syntology_url":"https://syntology.ai/paper/2306.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09623"}},"official":{"repos":["yxzwang/phenomnn"],"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":["found_in_text","official"]}}},{"url":"/paper/why-using-either-aggregated-features-or","slug":"why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","arxiv_id":"2306.08274","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"10 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/why-using-either-aggregated-features-or#ran","syntology_url":"https://syntology.ai/paper/2306.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08274"}},"official":{"repos":["seijimaekawa/a2dug"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/von-mises-mixture-distributions-for-molecular","slug":"von-mises-mixture-distributions-for-molecular","title":"Von Mises Mixture Distributions for Molecular Conformation Generation","date":"2023-06-13","arxiv_id":"2306.07472","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/von-mises-mixture-distributions-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2306.07472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07472"}},"official":{"repos":["thejonaslab/vonmises-icml-2023"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-re-weighting-improves-graph-domain","slug":"structural-re-weighting-improves-graph-domain","title":"Structural Re-weighting Improves Graph Domain Adaptation","date":"2023-06-05","arxiv_id":"2306.03221","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/structural-re-weighting-improves-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2306.03221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03221"}},"official":{"repos":["graph-com/strurw"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/reconstructing-graph-diffusion-history-from-a","slug":"reconstructing-graph-diffusion-history-from-a","title":"Reconstructing Graph Diffusion History from a Single Snapshot","date":"2023-06-01","arxiv_id":"2306.00488","repositories_listed":1,"syntology":{"n":11,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/reconstructing-graph-diffusion-history-from-a#ran","syntology_url":"https://syntology.ai/paper/2306.00488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00488"}},"official":{"repos":["q-rz/kdd23-ditto"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/explanations-as-features-llm-based-features","slug":"explanations-as-features-llm-based-features","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","date":"2023-05-31","arxiv_id":"2305.19523","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/explanations-as-features-llm-based-features#ran","syntology_url":"https://syntology.ai/paper/2305.19523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19523"}},"official":{"repos":["XiaoxinHe/TAPE","xiaoxinhe/tape_arxiv_2023"],"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/2305-14749","slug":"2305-14749","title":"gRNAde: Geometric Deep Learning for 3D RNA inverse design","date":"2023-05-24","arxiv_id":"2305.14749","repositories_listed":3,"syntology":{"n":29,"n_ran":17,"n_constructed":1,"n_ran_checked":4,"n_instrument":13,"n_unverified":12,"n_honours":1,"n_violates":2,"n_no_contract":1,"n_pointer_only":0,"phrase":"17 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 13 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/2305-14749#ran","syntology_url":"https://syntology.ai/paper/2305.14749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14749"}},"official":{"repos":["chaitjo/geometric-rna-design"],"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":["listed","official"]}}},{"url":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","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":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) · 1 unverified","sample_list":"/paper/edge-directionality-improves-learning-on#ran","syntology_url":"https://syntology.ai/paper/2305.10498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10498"}},"official":{"repos":["emalgorithm/directed-graph-neural-network"],"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/cuts-high-dimensional-causal-discovery-from","slug":"cuts-high-dimensional-causal-discovery-from","title":"CUTS+: High-dimensional Causal Discovery from Irregular Time-series","date":"2023-05-10","arxiv_id":"2305.05890","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cuts-high-dimensional-causal-discovery-from#ran","syntology_url":"https://syntology.ai/paper/2305.05890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05890"}},"official":{"repos":["jarrycyx/unn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-controllable-adaptive-simulation-for","slug":"learning-controllable-adaptive-simulation-for","title":"Learning Controllable Adaptive Simulation for Multi-resolution Physics","date":"2023-05-01","arxiv_id":"2305.01122","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-controllable-adaptive-simulation-for#ran","syntology_url":"https://syntology.ai/paper/2305.01122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01122"}},"official":{"repos":["snap-stanford/lamp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/impact-oriented-contextual-scholar-profiling","slug":"impact-oriented-contextual-scholar-profiling","title":"Impact-Oriented Contextual Scholar Profiling using Self-Citation Graphs","date":"2023-04-24","arxiv_id":"2304.12217","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/impact-oriented-contextual-scholar-profiling#ran","syntology_url":"https://syntology.ai/paper/2304.12217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.12217"}},"official":{"repos":["visdata/geneticflow"],"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/detecting-spoilers-in-movie-reviews-with","slug":"detecting-spoilers-in-movie-reviews-with","title":"Detecting Spoilers in Movie Reviews with External Movie Knowledge and User Networks","date":"2023-04-22","arxiv_id":"2304.11411","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"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) · 4 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/detecting-spoilers-in-movie-reviews-with#ran","syntology_url":"https://syntology.ai/paper/2304.11411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.11411"}},"official":{"repos":["arthur-heng/spoiler-detection"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/topology-reasoning-for-driving-scenes","slug":"topology-reasoning-for-driving-scenes","title":"Graph-based Topology Reasoning for Driving Scenes","date":"2023-04-11","arxiv_id":"2304.05277","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/topology-reasoning-for-driving-scenes#ran","syntology_url":"https://syntology.ai/paper/2304.05277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05277"}},"official":{"repos":["opendrivelab/toponet"],"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/sgdp-a-stream-graph-neural-network-based-data","slug":"sgdp-a-stream-graph-neural-network-based-data","title":"SGDP: A Stream-Graph Neural Network Based Data Prefetcher","date":"2023-04-07","arxiv_id":"2304.03864","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":2,"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/sgdp-a-stream-graph-neural-network-based-data#ran","syntology_url":"https://syntology.ai/paper/2304.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.03864"}},"official":{"repos":["yyysjz1997/SGDP"],"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","unlocated"]}}},{"url":"/paper/gluestick-robust-image-matching-by-sticking","slug":"gluestick-robust-image-matching-by-sticking","title":"GlueStick: Robust Image Matching by Sticking Points and Lines Together","date":"2023-04-04","arxiv_id":"2304.02008","repositories_listed":2,"syntology":{"n":29,"n_ran":20,"n_constructed":10,"n_ran_checked":13,"n_instrument":7,"n_unverified":9,"n_honours":0,"n_violates":2,"n_no_contract":11,"n_pointer_only":15,"phrase":"20 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 2 violated, 11 with no contract checked; 7 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/gluestick-robust-image-matching-by-sticking#ran","syntology_url":"https://syntology.ai/paper/2304.02008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02008"}},"official":{"repos":["cvg/gluestick"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/checkerpose-progressive-dense-keypoint","slug":"checkerpose-progressive-dense-keypoint","title":"CheckerPose: Progressive Dense Keypoint Localization for Object Pose Estimation with Graph Neural Network","date":"2023-03-29","arxiv_id":"2303.16874","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":3,"n_ran_checked":4,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":12,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/checkerpose-progressive-dense-keypoint#ran","syntology_url":"https://syntology.ai/paper/2303.16874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16874"}},"official":{"repos":["ruyilian/checkerpose"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cost-sensitive-gnn-based-imbalanced-learning","slug":"cost-sensitive-gnn-based-imbalanced-learning","title":"Cost Sensitive GNN-based Imbalanced Learning for Mobile Social Network Fraud Detection","date":"2023-03-28","arxiv_id":"2303.17486","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/cost-sensitive-gnn-based-imbalanced-learning#ran","syntology_url":"https://syntology.ai/paper/2303.17486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17486"}},"official":{"repos":["xxhu94/csgnn"],"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/unsupervised-learning-for-solving-the","slug":"unsupervised-learning-for-solving-the","title":"Unsupervised Learning for Solving the Travelling Salesman Problem","date":"2023-03-19","arxiv_id":"2303.10538","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"5 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-learning-for-solving-the#ran","syntology_url":"https://syntology.ai/paper/2303.10538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10538"}},"official":{"repos":["yimengmin/UTSP"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dr-label-improving-gnn-models-for-catalysis","slug":"dr-label-improving-gnn-models-for-catalysis","title":"DR-Label: Improving GNN Models for Catalysis Systems by Label Deconstruction and Reconstruction","date":"2023-03-06","arxiv_id":"2303.02875","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dr-label-improving-gnn-models-for-catalysis#ran","syntology_url":"https://syntology.ai/paper/2303.02875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.02875"}},"official":{"repos":["bowenwang77/DR-Label"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gnndelete-a-general-strategy-for-unlearning","slug":"gnndelete-a-general-strategy-for-unlearning","title":"GNNDelete: A General Strategy for Unlearning in Graph Neural Networks","date":"2023-02-26","arxiv_id":"2302.13406","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gnndelete-a-general-strategy-for-unlearning#ran","syntology_url":"https://syntology.ai/paper/2302.13406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13406"}},"official":{"repos":["mims-harvard/gnndelete"],"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/equipocket-an-e-3-equivariant-geometric-graph","slug":"equipocket-an-e-3-equivariant-geometric-graph","title":"EquiPocket: an E(3)-Equivariant Geometric Graph Neural Network for Ligand Binding Site Prediction","date":"2023-02-23","arxiv_id":"2302.12177","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":2,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 2 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) · 3 unverified","sample_list":"/paper/equipocket-an-e-3-equivariant-geometric-graph#ran","syntology_url":"https://syntology.ai/paper/2302.12177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12177"}},"official":{"repos":["fengyuewuya/equipocket"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/lightgcl-simple-yet-effective-graph","slug":"lightgcl-simple-yet-effective-graph","title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","date":"2023-02-16","arxiv_id":"2302.08191","repositories_listed":1,"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/lightgcl-simple-yet-effective-graph#ran","syntology_url":"https://syntology.ai/paper/2302.08191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08191"}},"official":{"repos":["hkuds/lightgcl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cuts-neural-causal-discovery-from-irregular","slug":"cuts-neural-causal-discovery-from-irregular","title":"CUTS: Neural Causal Discovery from Irregular Time-Series Data","date":"2023-02-15","arxiv_id":"2302.07458","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cuts-neural-causal-discovery-from-irregular#ran","syntology_url":"https://syntology.ai/paper/2302.07458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07458"}},"official":{"repos":["jarrycyx/unn"],"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"]}}},{"url":"/paper/graph-neural-network-inspired-kernels-for","slug":"graph-neural-network-inspired-kernels-for","title":"Graph Neural Network-Inspired Kernels for Gaussian Processes in Semi-Supervised Learning","date":"2023-02-12","arxiv_id":"2302.05828","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/graph-neural-network-inspired-kernels-for#ran","syntology_url":"https://syntology.ai/paper/2302.05828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05828"}},"official":{"repos":["niuzehao/gnn-gp"],"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/reducing-so-3-convolutions-to-so-2-for","slug":"reducing-so-3-convolutions-to-so-2-for","title":"Reducing SO(3) Convolutions to SO(2) for Efficient Equivariant GNNs","date":"2023-02-07","arxiv_id":"2302.03655","repositories_listed":2,"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":2,"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/reducing-so-3-convolutions-to-so-2-for#ran","syntology_url":"https://syntology.ai/paper/2302.03655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03655"}},"official":null}},{"url":"/paper/predicting-the-silent-majority-on-graphs","slug":"predicting-the-silent-majority-on-graphs","title":"Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network","date":"2023-02-02","arxiv_id":"2302.00873","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/predicting-the-silent-majority-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2302.00873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.00873"}},"official":{"repos":["wendongbi/KT-GNN"],"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/task-agnostic-graph-neural-network-evaluation","slug":"task-agnostic-graph-neural-network-evaluation","title":"Task-Agnostic Graph Neural Network Evaluation via Adversarial Collaboration","date":"2023-01-27","arxiv_id":"2301.11517","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-agnostic-graph-neural-network-evaluation#ran","syntology_url":"https://syntology.ai/paper/2301.11517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11517"}},"official":{"repos":["victorzxy/graphac"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pdformer-propagation-delay-aware-dynamic-long","slug":"pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","arxiv_id":"2301.07945","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":6,"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 6 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; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/pdformer-propagation-delay-aware-dynamic-long#ran","syntology_url":"https://syntology.ai/paper/2301.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07945"}},"official":{"repos":["BUAABIGSCity/PDFormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-multi-robot-reinforcement","slug":"heterogeneous-multi-robot-reinforcement","title":"Heterogeneous Multi-Robot Reinforcement Learning","date":"2023-01-17","arxiv_id":"2301.07137","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/heterogeneous-multi-robot-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2301.07137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07137"}},"official":{"repos":["proroklab/hetgppo","proroklab/vectorizedmultiagentsimulator"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/crysgnn-distilling-pre-trained-knowledge-to","slug":"crysgnn-distilling-pre-trained-knowledge-to","title":"CrysGNN : Distilling pre-trained knowledge to enhance property prediction for crystalline materials","date":"2023-01-14","arxiv_id":"2301.05852","repositories_listed":1,"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":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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/crysgnn-distilling-pre-trained-knowledge-to#ran","syntology_url":"https://syntology.ai/paper/2301.05852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.05852"}},"official":{"repos":["kdmsit/crysgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deepcut-unsupervised-segmentation-using-graph","slug":"deepcut-unsupervised-segmentation-using-graph","title":"DeepCut: Unsupervised Segmentation using Graph Neural Networks Clustering","date":"2022-12-12","arxiv_id":"2212.05853","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepcut-unsupervised-segmentation-using-graph#ran","syntology_url":"https://syntology.ai/paper/2212.05853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.05853"}},"official":null}},{"url":"/paper/learning-rigid-dynamics-with-face-interaction","slug":"learning-rigid-dynamics-with-face-interaction","title":"Learning rigid dynamics with face interaction graph networks","date":"2022-12-07","arxiv_id":"2212.03574","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-rigid-dynamics-with-face-interaction#ran","syntology_url":"https://syntology.ai/paper/2212.03574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.03574"}},"official":null}},{"url":"/paper/proactive-robot-assistance-via-spatio","slug":"proactive-robot-assistance-via-spatio","title":"Proactive Robot Assistance via Spatio-Temporal Object Modeling","date":"2022-11-28","arxiv_id":"2211.15501","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/proactive-robot-assistance-via-spatio#ran","syntology_url":"https://syntology.ai/paper/2211.15501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.15501"}},"official":{"repos":["maithili/spatiotemporalobjecttracking"],"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/spatiotemporal-modeling-of-multivariate","slug":"spatiotemporal-modeling-of-multivariate","title":"Modeling Multivariate Biosignals With Graph Neural Networks and Structured State Space Models","date":"2022-11-21","arxiv_id":"2211.11176","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spatiotemporal-modeling-of-multivariate#ran","syntology_url":"https://syntology.ai/paper/2211.11176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11176"}},"official":{"repos":["tsy935/graphs4mer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-inference-of-the-lensing","slug":"hierarchical-inference-of-the-lensing","title":"Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks","date":"2022-11-15","arxiv_id":"2211.07807","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-inference-of-the-lensing#ran","syntology_url":"https://syntology.ai/paper/2211.07807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07807"}},"official":{"repos":["jiwoncpark/node-to-joy"],"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/similarity-based-feature-extraction-for-large","slug":"similarity-based-feature-extraction-for-large","title":"Similarity-based Feature Extraction for Large-scale Sparse Traffic Forecasting","date":"2022-11-13","arxiv_id":"2211.07031","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/similarity-based-feature-extraction-for-large#ran","syntology_url":"https://syntology.ai/paper/2211.07031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07031"}},"official":{"repos":["c-lyu/traffic4cast2022-tse"],"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/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","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/a-new-graph-node-classification-benchmark#ran","syntology_url":"https://syntology.ai/paper/2211.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06292"}},"official":{"repos":["nellaker-group/placenta"],"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/scalable-multi-agent-reinforcement-learning-2","slug":"scalable-multi-agent-reinforcement-learning-2","title":"Scalable Multi-Agent Reinforcement Learning through Intelligent Information Aggregation","date":"2022-11-03","arxiv_id":"2211.02127","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-multi-agent-reinforcement-learning-2#ran","syntology_url":"https://syntology.ai/paper/2211.02127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02127"}},"official":{"repos":["nsidn98/informarl"],"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/towards-better-out-of-distribution","slug":"towards-better-out-of-distribution","title":"Towards Better Out-of-Distribution Generalization of Neural Algorithmic Reasoning Tasks","date":"2022-11-01","arxiv_id":"2211.00692","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"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 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) · 2 unverified","sample_list":"/paper/towards-better-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2211.00692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.00692"}},"official":{"repos":["smahdavi4/clrs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mgnni-multiscale-graph-neural-networks-with","slug":"mgnni-multiscale-graph-neural-networks-with","title":"MGNNI: Multiscale Graph Neural Networks with Implicit Layers","date":"2022-10-15","arxiv_id":"2210.08353","repositories_listed":1,"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":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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mgnni-multiscale-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2210.08353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08353"}},"official":{"repos":["liu-jc/mgnni"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/geodesic-graph-neural-network-for-efficient","slug":"geodesic-graph-neural-network-for-efficient","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","date":"2022-10-06","arxiv_id":"2210.02636","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":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) · 4 unverified","sample_list":"/paper/geodesic-graph-neural-network-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2210.02636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02636"}},"official":{"repos":["woodcutter1998/gdgnn"],"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/deep-spatial-domain-generalization","slug":"deep-spatial-domain-generalization","title":"Deep Spatial Domain Generalization","date":"2022-10-03","arxiv_id":"2210.00729","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":2,"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/deep-spatial-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2210.00729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00729"}},"official":{"repos":["dyu62/deep-domain-generalization"],"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/on-representing-linear-programs-by-graph","slug":"on-representing-linear-programs-by-graph","title":"On Representing Linear Programs by Graph Neural Networks","date":"2022-09-25","arxiv_id":"2209.12288","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/on-representing-linear-programs-by-graph#ran","syntology_url":"https://syntology.ai/paper/2209.12288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12288"}},"official":{"repos":["liujl11git/GNN-LP"],"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/learning-rigid-body-dynamics-with-lagrangian","slug":"learning-rigid-body-dynamics-with-lagrangian","title":"Learning Articulated Rigid Body Dynamics with Lagrangian Graph Neural Network","date":"2022-09-23","arxiv_id":"2209.11588","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-rigid-body-dynamics-with-lagrangian#ran","syntology_url":"https://syntology.ai/paper/2209.11588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11588"}},"official":{"repos":["m3rg-iitd/rigid_body_dynamics_graph"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/one-model-any-csp-graph-neural-networks-as","slug":"one-model-any-csp-graph-neural-networks-as","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","date":"2022-08-22","arxiv_id":"2208.10227","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/one-model-any-csp-graph-neural-networks-as#ran","syntology_url":"https://syntology.ai/paper/2208.10227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10227"}},"official":{"repos":["toenshoff/runcsp-pytorch"],"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/mm-gnn-mix-moment-graph-neural-network","slug":"mm-gnn-mix-moment-graph-neural-network","title":"MM-GNN: Mix-Moment Graph Neural Network towards Modeling Neighborhood Feature Distribution","date":"2022-08-15","arxiv_id":"2208.07012","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mm-gnn-mix-moment-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2208.07012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.07012"}},"official":{"repos":["wendongbi/MMGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-quantification-of-sparse-travel","slug":"uncertainty-quantification-of-sparse-travel","title":"Uncertainty Quantification of Sparse Travel Demand Prediction with Spatial-Temporal Graph Neural Networks","date":"2022-08-11","arxiv_id":"2208.05908","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/uncertainty-quantification-of-sparse-travel#ran","syntology_url":"https://syntology.ai/paper/2208.05908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.05908"}},"official":{"repos":["zhuangdingyi/stzinb"],"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/learned-label-aggregation-for-weak","slug":"learned-label-aggregation-for-weak","title":"Learning Hyper Label Model for Programmatic Weak Supervision","date":"2022-07-27","arxiv_id":"2207.13545","repositories_listed":1,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/learned-label-aggregation-for-weak#ran","syntology_url":"https://syntology.ai/paper/2207.13545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.13545"}},"official":{"repos":["wurenzhi/hyper_label_model"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/posernet-refining-relative-camera-poses","slug":"posernet-refining-relative-camera-poses","title":"PoserNet: Refining Relative Camera Poses Exploiting Object Detections","date":"2022-07-19","arxiv_id":"2207.09445","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/posernet-refining-relative-camera-poses#ran","syntology_url":"https://syntology.ai/paper/2207.09445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09445"}},"official":{"repos":["iit-pavis/posernet"],"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/simplifying-clustering-with-graph-neural","slug":"simplifying-clustering-with-graph-neural","title":"Simplifying Clustering with Graph Neural Networks","date":"2022-07-18","arxiv_id":"2207.08779","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/simplifying-clustering-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2207.08779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08779"}},"official":{"repos":["filippomb/simplifying-clustering-with-graph-neural-networks"],"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/the-cosmic-graph-optimal-information","slug":"the-cosmic-graph-optimal-information","title":"The Cosmic Graph: Optimal Information Extraction from Large-Scale Structure using Catalogues","date":"2022-07-11","arxiv_id":"2207.05202","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-cosmic-graph-optimal-information#ran","syntology_url":"https://syntology.ai/paper/2207.05202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05202"}},"official":{"repos":["tlmakinen/cosmicgraphs"],"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/bagel-a-benchmark-for-assessing-graph-neural","slug":"bagel-a-benchmark-for-assessing-graph-neural","title":"BAGEL: A Benchmark for Assessing Graph Neural Network Explanations","date":"2022-06-28","arxiv_id":"2206.13983","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":2,"n_no_contract":0,"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, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bagel-a-benchmark-for-assessing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2206.13983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13983"}},"official":{"repos":["mandeep-rathee/bagel-benchmark"],"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/learning-to-control-local-search-for","slug":"learning-to-control-local-search-for","title":"Learning to Control Local Search for Combinatorial Optimization","date":"2022-06-27","arxiv_id":"2206.13181","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-control-local-search-for#ran","syntology_url":"https://syntology.ai/paper/2206.13181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13181"}},"official":{"repos":["jokofa/neurols"],"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/towards-representation-alignment-and","slug":"towards-representation-alignment-and","title":"Towards Representation Alignment and Uniformity in Collaborative Filtering","date":"2022-06-26","arxiv_id":"2206.12811","repositories_listed":2,"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":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) · 2 unverified","sample_list":"/paper/towards-representation-alignment-and#ran","syntology_url":"https://syntology.ai/paper/2206.12811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12811"}},"official":{"repos":["thuwangcy/directau"],"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/equiformer-equivariant-graph-attention","slug":"equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","arxiv_id":"2206.11990","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equiformer-equivariant-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2206.11990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11990"}},"official":{"repos":["atomicarchitects/equiformer"],"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":["listed","official"]}}},{"url":"/paper/agent-based-graph-neural-networks","slug":"agent-based-graph-neural-networks","title":"Agent-based Graph Neural Networks","date":"2022-06-22","arxiv_id":"2206.11010","repositories_listed":1,"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":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) · 3 unverified","sample_list":"/paper/agent-based-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2206.11010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11010"}},"official":{"repos":["karolismart/agentnet"],"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/nas-bench-graph-benchmarking-graph-neural","slug":"nas-bench-graph-benchmarking-graph-neural","title":"NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search","date":"2022-06-18","arxiv_id":"2206.09166","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/nas-bench-graph-benchmarking-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2206.09166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09166"}},"official":{"repos":["thumnlab/nas-bench-graph"],"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/diffusion-probabilistic-modeling-of-protein","slug":"diffusion-probabilistic-modeling-of-protein","title":"Diffusion probabilistic modeling of protein backbones in 3D for the motif-scaffolding problem","date":"2022-06-08","arxiv_id":"2206.04119","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/diffusion-probabilistic-modeling-of-protein#ran","syntology_url":"https://syntology.ai/paper/2206.04119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04119"}},"official":{"repos":["blt2114/protdiff_smcdiff"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/can-hybrid-geometric-scattering-networks-help","slug":"can-hybrid-geometric-scattering-networks-help","title":"Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?","date":"2022-06-03","arxiv_id":"2206.01506","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/can-hybrid-geometric-scattering-networks-help#ran","syntology_url":"https://syntology.ai/paper/2206.01506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01506"}},"official":{"repos":["yimengmin/geometricscatteringmaximalclique"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-graph-neural-networks-for-anomaly","slug":"rethinking-graph-neural-networks-for-anomaly","title":"Rethinking Graph Neural Networks for Anomaly Detection","date":"2022-05-31","arxiv_id":"2205.15508","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-neural-networks-for-anomaly#ran","syntology_url":"https://syntology.ai/paper/2205.15508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15508"}},"official":{"repos":["squareroot3/rethinking-anomaly-detection"],"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/geometer-graph-few-shot-class-incremental","slug":"geometer-graph-few-shot-class-incremental","title":"Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation","date":"2022-05-27","arxiv_id":"2205.13954","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/geometer-graph-few-shot-class-incremental#ran","syntology_url":"https://syntology.ai/paper/2205.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13954"}},"official":{"repos":["RobinLu1209/Geometer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/transformer-for-partial-differential","slug":"transformer-for-partial-differential","title":"Transformer for Partial Differential Equations' Operator Learning","date":"2022-05-26","arxiv_id":"2205.13671","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/transformer-for-partial-differential#ran","syntology_url":"https://syntology.ai/paper/2205.13671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13671"}},"official":{"repos":["BaratiLab/OFormer"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/physics-embedded-neural-networks-boldsymbol","slug":"physics-embedded-neural-networks-boldsymbol","title":"Physics-Embedded Neural Networks: Graph Neural PDE Solvers with Mixed Boundary Conditions","date":"2022-05-24","arxiv_id":"2205.11912","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/physics-embedded-neural-networks-boldsymbol#ran","syntology_url":"https://syntology.ai/paper/2205.11912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11912"}},"official":{"repos":["yellowshippo/penn-neurips2022"],"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/a-simple-yet-effective-svd-gcn-for-directed","slug":"a-simple-yet-effective-svd-gcn-for-directed","title":"A Simple Yet Effective SVD-GCN for Directed Graphs","date":"2022-05-19","arxiv_id":"2205.09335","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/a-simple-yet-effective-svd-gcn-for-directed#ran","syntology_url":"https://syntology.ai/paper/2205.09335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09335"}},"official":{"repos":["thisisforreview/svd-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/plane-geometry-diagram-parsing","slug":"plane-geometry-diagram-parsing","title":"Plane Geometry Diagram Parsing","date":"2022-05-19","arxiv_id":"2205.09363","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":2,"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/plane-geometry-diagram-parsing#ran","syntology_url":"https://syntology.ai/paper/2205.09363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09363"}},"official":{"repos":["mingliangzhang2018/PGDP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-graph-representation-of-molecular-ensembles","slug":"a-graph-representation-of-molecular-ensembles","title":"A graph representation of molecular ensembles for polymer property prediction","date":"2022-05-17","arxiv_id":"2205.08619","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":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) · 0 unverified","sample_list":"/paper/a-graph-representation-of-molecular-ensembles#ran","syntology_url":"https://syntology.ai/paper/2205.08619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08619"}},"official":{"repos":["coleygroup/polymer-chemprop-data"],"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/neural-symbolic-models-for-logical-queries-on","slug":"neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}},"official":{"repos":["DeepGraphLearning/GNN-QE"],"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/pocket2mol-efficient-molecular-sampling-based","slug":"pocket2mol-efficient-molecular-sampling-based","title":"Pocket2Mol: Efficient Molecular Sampling Based on 3D Protein Pockets","date":"2022-05-15","arxiv_id":"2205.07249","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/pocket2mol-efficient-molecular-sampling-based#ran","syntology_url":"https://syntology.ai/paper/2205.07249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07249"}},"official":{"repos":["pengxingang/pocket2mol"],"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/a-neural-network-architecture-for-program-1","slug":"a-neural-network-architecture-for-program-1","title":"A Neural Network Architecture for Program Understanding Inspired by Human Behaviors","date":"2022-05-10","arxiv_id":"2206.04730","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/a-neural-network-architecture-for-program-1#ran","syntology_url":"https://syntology.ai/paper/2206.04730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04730"}},"official":{"repos":["recklessronan/pgnn-ek"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/ru-net-regularized-unrolling-network-for","slug":"ru-net-regularized-unrolling-network-for","title":"RU-Net: Regularized Unrolling Network for Scene Graph Generation","date":"2022-05-03","arxiv_id":"2205.01297","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/ru-net-regularized-unrolling-network-for#ran","syntology_url":"https://syntology.ai/paper/2205.01297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01297"}},"official":{"repos":["siml3/ru-net"],"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/long-term-spatio-temporal-forecasting-via","slug":"long-term-spatio-temporal-forecasting-via","title":"Long-term Spatio-temporal Forecasting via Dynamic Multiple-Graph Attention","date":"2022-04-23","arxiv_id":"2204.11008","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":5,"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 5 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/long-term-spatio-temporal-forecasting-via#ran","syntology_url":"https://syntology.ai/paper/2204.11008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11008"}},"official":{"repos":["swsamleo/mlstgcn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/simulate-time-integrated-coarse-grained","slug":"simulate-time-integrated-coarse-grained","title":"Simulate Time-integrated Coarse-grained Molecular Dynamics with Multi-Scale Graph Networks","date":"2022-04-21","arxiv_id":"2204.10348","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simulate-time-integrated-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2204.10348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10348"}},"official":{"repos":["kyonofx/mlcgmd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generating-3d-molecules-for-target-protein","slug":"generating-3d-molecules-for-target-protein","title":"Generating 3D Molecules for Target Protein Binding","date":"2022-04-19","arxiv_id":"2204.09410","repositories_listed":2,"syntology":{"n":33,"n_ran":18,"n_constructed":10,"n_ran_checked":13,"n_instrument":5,"n_unverified":15,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":33,"phrase":"18 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/generating-3d-molecules-for-target-protein#ran","syntology_url":"https://syntology.ai/paper/2204.09410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09410"}},"official":{"repos":["divelab/graphbp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/equivariant-point-cloud-analysis-via-learning","slug":"equivariant-point-cloud-analysis-via-learning","title":"Equivariant Point Cloud Analysis via Learning Orientations for Message Passing","date":"2022-03-28","arxiv_id":"2203.14486","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":9,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"phrase":"14 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equivariant-point-cloud-analysis-via-learning#ran","syntology_url":"https://syntology.ai/paper/2203.14486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14486"}},"official":{"repos":["luost26/equivariant-orientedmp"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tgl-a-general-framework-for-temporal-gnn","slug":"tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","arxiv_id":"2203.14883","repositories_listed":2,"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":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) · 3 unverified","sample_list":"/paper/tgl-a-general-framework-for-temporal-gnn#ran","syntology_url":"https://syntology.ai/paper/2203.14883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14883"}},"official":{"repos":["amazon-research/tgl"],"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":["listed","official"]}}},{"url":"/paper/end-to-end-active-speaker-detection","slug":"end-to-end-active-speaker-detection","title":"End-to-End Active Speaker Detection","date":"2022-03-27","arxiv_id":"2203.14250","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/end-to-end-active-speaker-detection#ran","syntology_url":"https://syntology.ai/paper/2203.14250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14250"}},"official":{"repos":["fuankarion/end-to-end-asd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/learning-the-dynamics-of-physical-systems-1","slug":"learning-the-dynamics-of-physical-systems-1","title":"Learning the Dynamics of Physical Systems from Sparse Observations with Finite Element Networks","date":"2022-03-16","arxiv_id":"2203.08852","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":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) · 3 unverified","sample_list":"/paper/learning-the-dynamics-of-physical-systems-1#ran","syntology_url":"https://syntology.ai/paper/2203.08852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08852"}},"official":{"repos":["martenlienen/finite-element-networks"],"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/panoramic-human-activity-recognition","slug":"panoramic-human-activity-recognition","title":"Panoramic Human Activity Recognition","date":"2022-03-08","arxiv_id":"2203.03806","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/panoramic-human-activity-recognition#ran","syntology_url":"https://syntology.ai/paper/2203.03806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03806"}},"official":{"repos":["ruizehan/par"],"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/graph-neural-networks-for-multimodal-single","slug":"graph-neural-networks-for-multimodal-single","title":"Graph Neural Networks for Multimodal Single-Cell Data Integration","date":"2022-03-03","arxiv_id":"2203.01884","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-multimodal-single#ran","syntology_url":"https://syntology.ai/paper/2203.01884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01884"}},"official":{"repos":["omicsml/dance"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-view-graph-representation-for","slug":"multi-view-graph-representation-for","title":"Multi-View Graph Representation for Programming Language Processing: An Investigation into Algorithm Detection","date":"2022-02-25","arxiv_id":"2202.12481","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"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 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) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/multi-view-graph-representation-for#ran","syntology_url":"https://syntology.ai/paper/2202.12481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.12481"}},"official":{"repos":["githubg0/mvg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gnn-surrogate-a-hierarchical-and-adaptive","slug":"gnn-surrogate-a-hierarchical-and-adaptive","title":"GNN-Surrogate: A Hierarchical and Adaptive Graph Neural Network for Parameter Space Exploration of Unstructured-Mesh Ocean Simulations","date":"2022-02-18","arxiv_id":"2202.08956","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":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) · 1 unverified","sample_list":"/paper/gnn-surrogate-a-hierarchical-and-adaptive#ran","syntology_url":"https://syntology.ai/paper/2202.08956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08956"}},"official":{"repos":["trainsn/gnn-surrogate"],"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/space4hgnn-a-novel-modularized-and","slug":"space4hgnn-a-novel-modularized-and","title":"Space4HGNN: A Novel, Modularized and Reproducible Platform to Evaluate Heterogeneous Graph Neural Network","date":"2022-02-18","arxiv_id":"2202.09177","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/space4hgnn-a-novel-modularized-and#ran","syntology_url":"https://syntology.ai/paper/2202.09177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09177"}},"official":{"repos":["bupt-gamma/space4hgnn"],"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/instance-wise-algorithm-configuration-with","slug":"instance-wise-algorithm-configuration-with","title":"Instance-wise algorithm configuration with graph neural networks","date":"2022-02-10","arxiv_id":"2202.04910","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"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 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) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/instance-wise-algorithm-configuration-with#ran","syntology_url":"https://syntology.ai/paper/2202.04910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04910"}},"official":{"repos":["romeov/ml4co-competition"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-approximation-of-extended-persistent","slug":"neural-approximation-of-extended-persistent","title":"Neural Approximation of Graph Topological Features","date":"2022-01-28","arxiv_id":"2201.12032","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-approximation-of-extended-persistent#ran","syntology_url":"https://syntology.ai/paper/2201.12032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12032"}},"official":{"repos":["pkuyzy/TLC-GNN"],"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":["listed","official"]}}},{"url":"/paper/modeling-multi-granularity-user-intent","slug":"modeling-multi-granularity-user-intent","title":"Learning Multi-granularity User Intent Unit for Session-based Recommendation","date":"2021-12-25","arxiv_id":"2112.13197","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/modeling-multi-granularity-user-intent#ran","syntology_url":"https://syntology.ai/paper/2112.13197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13197"}},"official":{"repos":["SpaceLearner/SessionRec-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"]}}}],"record_sha256":"80cec13168d9f094d1d7ea6f8591fe0dcfbeea254e9fefce7e31dfa87dee799b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}