{"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-representation-learning/papers/ran/1","list_of":"/task/graph-representation-learning","task":"Graph Representation Learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":2,"rows_per_page":100,"rows":[1,100],"of":129,"counts":{"archive_papers_tagged":982,"with_a_code_link":479,"where_syntology_ran_a_sample":129,"not_listed_spam_title":0,"listed":982,"listed_where_code_ran":129,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":115,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":115,"listed_every_run_a_failure_of_syntologys_instrument":14,"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-representation-learning/papers/ran/1","prev":null,"next":"/task/graph-representation-learning/papers/ran/2","papers":[{"url":"/paper/grape-heterogeneous-graph-representation","slug":"grape-heterogeneous-graph-representation","title":"GRAPE: Heterogeneous Graph Representation Learning for Genetic Perturbation with Coding and Non-Coding Biotype","date":"2025-05-06","arxiv_id":"2505.03853","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/grape-heterogeneous-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2505.03853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03853"}},"official":null}},{"url":"/paper/towards-quantifying-long-range-interactions","slug":"towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","date":"2025-03-12","arxiv_id":"2503.09008","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":3,"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/towards-quantifying-long-range-interactions#ran","syntology_url":"https://syntology.ai/paper/2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"}},"official":{"repos":["leonresearch/city-networks"],"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/spectro-riemannian-graph-neural-networks","slug":"spectro-riemannian-graph-neural-networks","title":"Spectro-Riemannian Graph Neural Networks","date":"2025-02-01","arxiv_id":"2502.00401","repositories_listed":0,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spectro-riemannian-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2502.00401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00401"}},"official":null}},{"url":"/paper/mamba-based-graph-convolutional-networks","slug":"mamba-based-graph-convolutional-networks","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","date":"2025-01-26","arxiv_id":"2501.15461","repositories_listed":0,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mamba-based-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2501.15461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15461"}},"official":null}},{"url":"/paper/deep-modularity-networks-with-diversity","slug":"deep-modularity-networks-with-diversity","title":"Deep Modularity Networks with Diversity--Preserving Regularization","date":"2025-01-23","arxiv_id":"2501.13451","repositories_listed":0,"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":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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/deep-modularity-networks-with-diversity#ran","syntology_url":"https://syntology.ai/paper/2501.13451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13451"}},"official":null}},{"url":"/paper/enhancing-graph-representation-learning-with-1","slug":"enhancing-graph-representation-learning-with-1","title":"Enhancing Graph Representation Learning with Localized Topological Features","date":"2025-01-15","arxiv_id":"2501.09178","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/enhancing-graph-representation-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2501.09178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09178"}},"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":0,"ran_from_kinds":["official"]}}},{"url":"/paper/why-does-dropping-edges-usually-outperform","slug":"why-does-dropping-edges-usually-outperform","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","date":"2024-12-11","arxiv_id":"2412.08128","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/why-does-dropping-edges-usually-outperform#ran","syntology_url":"https://syntology.ai/paper/2412.08128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08128"}},"official":{"repos":["hyzhang98/epagcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grokformer-graph-fourier-kolmogorov-arnold","slug":"grokformer-graph-fourier-kolmogorov-arnold","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","date":"2024-11-26","arxiv_id":"2411.17296","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"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 3 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/grokformer-graph-fourier-kolmogorov-arnold#ran","syntology_url":"https://syntology.ai/paper/2411.17296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17296"}},"official":{"repos":["GGA23/GrokFormer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-conditional-distribution","slug":"self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","arxiv_id":"2411.15206","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-conditional-distribution#ran","syntology_url":"https://syntology.ai/paper/2411.15206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15206"}},"official":{"repos":["chenjie20/SSCDL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diss-l-ect-dissecting-graph-data-with-local","slug":"diss-l-ect-dissecting-graph-data-with-local","title":"Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms","date":"2024-10-03","arxiv_id":"2410.02622","repositories_listed":2,"syntology":{"n":10,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/diss-l-ect-dissecting-graph-data-with-local#ran","syntology_url":"https://syntology.ai/paper/2410.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02622"}},"official":{"repos":["aidos-lab/Diss-l-ECT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/neuropath-a-neural-pathway-transformer-for","slug":"neuropath-a-neural-pathway-transformer-for","title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","date":"2024-09-26","arxiv_id":"2409.17510","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/when-heterophily-meets-heterogeneous-graphs","slug":"when-heterophily-meets-heterogeneous-graphs","title":"When Heterophily Meets Heterogeneous Graphs: Latent Graphs Guided Unsupervised Representation Learning","date":"2024-09-01","arxiv_id":"2409.00687","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":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/when-heterophily-meets-heterogeneous-graphs#ran","syntology_url":"https://syntology.ai/paper/2409.00687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.00687"}},"official":{"repos":["zxlearningdeep/latgrl"],"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/2408-03195","slug":"2408-03195","title":"RELIEF: Reinforcement Learning Empowered Graph Feature Prompt Tuning","date":"2024-08-06","arxiv_id":"2408.03195","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":15,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/2408-03195#ran","syntology_url":"https://syntology.ai/paper/2408.03195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03195"}},"official":{"repos":["JasonZhujp/RELIEF"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/polyformer-scalable-node-wise-filters-via","slug":"polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","arxiv_id":"2407.14459","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":14,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/polyformer-scalable-node-wise-filters-via#ran","syntology_url":"https://syntology.ai/paper/2407.14459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.14459"}},"official":{"repos":["air029/polyformer"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-external-attention-enhanced-transformer","slug":"graph-external-attention-enhanced-transformer","title":"Graph External Attention Enhanced Transformer","date":"2024-05-31","arxiv_id":"2405.21061","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-external-attention-enhanced-transformer#ran","syntology_url":"https://syntology.ai/paper/2405.21061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.21061"}},"official":{"repos":["icm1018/geaet"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/injecting-hamiltonian-architectural-bias-into","slug":"injecting-hamiltonian-architectural-bias-into","title":"Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networks","date":"2024-05-27","arxiv_id":"2405.17163","repositories_listed":0,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/injecting-hamiltonian-architectural-bias-into#ran","syntology_url":"https://syntology.ai/paper/2405.17163","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17163"}},"official":null}},{"url":"/paper/gcondenser-benchmarking-graph-condensation","slug":"gcondenser-benchmarking-graph-condensation","title":"GCondenser: Benchmarking Graph Condensation","date":"2024-05-23","arxiv_id":"2405.14246","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gcondenser-benchmarking-graph-condensation#ran","syntology_url":"https://syntology.ai/paper/2405.14246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14246"}},"official":{"repos":["superallen13/GCondenser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pac-bayesian-generalization-bounds-for-2","slug":"pac-bayesian-generalization-bounds-for-2","title":"PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning","date":"2024-05-10","arxiv_id":"2405.06418","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pac-bayesian-generalization-bounds-for-2#ran","syntology_url":"https://syntology.ai/paper/2405.06418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06418"}},"official":{"repos":["bdi-lab/reed"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-graph-odes-for-irregularly-sampled","slug":"temporal-graph-odes-for-irregularly-sampled","title":"Temporal Graph ODEs for Irregularly-Sampled Time Series","date":"2024-04-30","arxiv_id":"2404.19508","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/temporal-graph-odes-for-irregularly-sampled#ran","syntology_url":"https://syntology.ai/paper/2404.19508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19508"}},"official":{"repos":["gravins/tg-ode"],"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/bounding-the-expected-robustness-of-graph","slug":"bounding-the-expected-robustness-of-graph","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","date":"2024-04-27","arxiv_id":"2404.17947","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bounding-the-expected-robustness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2404.17947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17947"}},"official":{"repos":["sennadir/gcorn"],"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/unleashing-the-potential-of-fractional","slug":"unleashing-the-potential-of-fractional","title":"Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND","date":"2024-04-26","arxiv_id":"2404.17099","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unleashing-the-potential-of-fractional#ran","syntology_url":"https://syntology.ai/paper/2404.17099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17099"}},"official":{"repos":["zknus/iclr2024-frond","zknus/torchfde"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gtc-gnn-transformer-co-contrastive-learning","slug":"gtc-gnn-transformer-co-contrastive-learning","title":"GTC: GNN-Transformer Co-contrastive Learning for Self-supervised Heterogeneous Graph Representation","date":"2024-03-22","arxiv_id":"2403.15520","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gtc-gnn-transformer-co-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2403.15520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15520"}},"official":{"repos":["phd-lanyu/gtc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-graph-representation-with-knowledge","slug":"dynamic-graph-representation-with-knowledge","title":"Dynamic Graph Representation with Knowledge-aware Attention for Histopathology Whole Slide Image Analysis","date":"2024-03-12","arxiv_id":"2403.07719","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-graph-representation-with-knowledge#ran","syntology_url":"https://syntology.ai/paper/2403.07719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07719"}},"official":{"repos":["wonderlandxd/wikg"],"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/decoupling-weighing-and-selecting-for","slug":"decoupling-weighing-and-selecting-for","title":"Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks","date":"2024-03-03","arxiv_id":"2403.01400","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"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) · 2 unverified","sample_list":"/paper/decoupling-weighing-and-selecting-for#ran","syntology_url":"https://syntology.ai/paper/2403.01400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01400"}},"official":{"repos":["tianyufan0504/was"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/two-trades-is-not-baffled-condense-graph-via","slug":"two-trades-is-not-baffled-condense-graph-via","title":"Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching","date":"2024-02-07","arxiv_id":"2402.04924","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":1,"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/two-trades-is-not-baffled-condense-graph-via#ran","syntology_url":"https://syntology.ai/paper/2402.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04924"}},"official":{"repos":["nus-hpc-ai-lab/ctrl"],"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-is-worth-k-words-euclideanizing-graph","slug":"a-graph-is-worth-k-words-euclideanizing-graph","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","date":"2024-02-04","arxiv_id":"2402.02464","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-graph-is-worth-k-words-euclideanizing-graph#ran","syntology_url":"https://syntology.ai/paper/2402.02464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02464"}},"official":{"repos":["A4Bio/GraphsGPT"],"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/l2g2g-a-scalable-local-to-global-network","slug":"l2g2g-a-scalable-local-to-global-network","title":"L2G2G: a Scalable Local-to-Global Network Embedding with Graph Autoencoders","date":"2024-02-02","arxiv_id":"2402.01614","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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/l2g2g-a-scalable-local-to-global-network#ran","syntology_url":"https://syntology.ai/paper/2402.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01614"}},"official":{"repos":["tonyauyeung/local2gae2global"],"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/graph-contrastive-learning-with-cohesive","slug":"graph-contrastive-learning-with-cohesive","title":"Graph Contrastive Learning with Cohesive Subgraph Awareness","date":"2024-01-31","arxiv_id":"2401.17580","repositories_listed":1,"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":0,"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/graph-contrastive-learning-with-cohesive#ran","syntology_url":"https://syntology.ai/paper/2401.17580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17580"}},"official":{"repos":["wuyucheng2002/ctaug"],"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/product-manifold-representations-for-learning","slug":"product-manifold-representations-for-learning","title":"Product Manifold Representations for Learning on Biological Pathways","date":"2024-01-27","arxiv_id":"2401.15478","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/product-manifold-representations-for-learning#ran","syntology_url":"https://syntology.ai/paper/2401.15478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15478"}},"official":{"repos":["mcneela/mixed-curvature-gcn","mcneela/mixed-curvature-pathways"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/motif-aware-riemannian-graph-neural-network","slug":"motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","arxiv_id":"2401.01232","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/motif-aware-riemannian-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2401.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01232"}},"official":{"repos":["riemanngraph/motifrgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diffkg-knowledge-graph-diffusion-model-for","slug":"diffkg-knowledge-graph-diffusion-model-for","title":"DiffKG: Knowledge Graph Diffusion Model for Recommendation","date":"2023-12-28","arxiv_id":"2312.16890","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffkg-knowledge-graph-diffusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2312.16890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16890"}},"official":{"repos":["hkuds/diffkg"],"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/pc-conv-unifying-homophily-and-heterophily","slug":"pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","arxiv_id":"2312.14438","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":14,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pc-conv-unifying-homophily-and-heterophily#ran","syntology_url":"https://syntology.ai/paper/2312.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14438"}},"official":{"repos":["uestclbh/pc-conv"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/puma-efficient-continual-graph-learning-with","slug":"puma-efficient-continual-graph-learning-with","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","date":"2023-12-22","arxiv_id":"2312.14439","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/puma-efficient-continual-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2312.14439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14439"}},"official":{"repos":["superallen13/puma"],"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/graph-invariant-learning-with-subgraph-co","slug":"graph-invariant-learning-with-subgraph-co","title":"Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution Generalization","date":"2023-12-18","arxiv_id":"2312.10988","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/graph-invariant-learning-with-subgraph-co#ran","syntology_url":"https://syntology.ai/paper/2312.10988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10988"}},"official":{"repos":["bupt-gamma/igm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-initialization-of-graph-neural","slug":"on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02622","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-initialization-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2312.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02622"}},"official":{"repos":["lspongebobjh/virgo_icml2023"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/normed-spaces-for-graph-embedding","slug":"normed-spaces-for-graph-embedding","title":"Normed Spaces for Graph Embedding","date":"2023-12-03","arxiv_id":"2312.01502","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":5,"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/normed-spaces-for-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2312.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01502"}},"official":{"repos":["andyweizhao/graphs-normed-spaces"],"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/recurrent-distance-encoding-neural-networks","slug":"recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","arxiv_id":"2312.01538","repositories_listed":1,"syntology":{"n":21,"n_ran":12,"n_constructed":2,"n_ran_checked":9,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":21,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/recurrent-distance-encoding-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2312.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01538"}},"official":{"repos":["skeletondyh/gred"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/multigprompt-for-multi-task-pre-training-and","slug":"multigprompt-for-multi-task-pre-training-and","title":"MultiGPrompt for Multi-Task Pre-Training and Prompting on Graphs","date":"2023-11-28","arxiv_id":"2312.03731","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multigprompt-for-multi-task-pre-training-and#ran","syntology_url":"https://syntology.ai/paper/2312.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03731"}},"official":{"repos":["nashchou/multigprompt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-graph-prompt-toward-a-unification","slug":"generalized-graph-prompt-toward-a-unification","title":"Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphs","date":"2023-11-26","arxiv_id":"2311.15317","repositories_listed":2,"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/generalized-graph-prompt-toward-a-unification#ran","syntology_url":"https://syntology.ai/paper/2311.15317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15317"}},"official":{"repos":["gmcmt/graph_prompt_extension"],"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/hgclip-exploring-vision-language-models-with-1","slug":"hgclip-exploring-vision-language-models-with-1","title":"HGCLIP: Exploring Vision-Language Models with Graph Representations for Hierarchical Understanding","date":"2023-11-23","arxiv_id":"2311.14064","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hgclip-exploring-vision-language-models-with-1#ran","syntology_url":"https://syntology.ai/paper/2311.14064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14064"}},"official":{"repos":["richard-peng-xia/HGCLIP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/does-invariant-graph-learning-via-environment-1","slug":"does-invariant-graph-learning-via-environment-1","title":"Does Invariant Graph Learning via Environment Augmentation Learn Invariance?","date":"2023-10-29","arxiv_id":"2310.19035","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/does-invariant-graph-learning-via-environment-1#ran","syntology_url":"https://syntology.ai/paper/2310.19035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19035"}},"official":null}},{"url":"/paper/prompt-tuning-for-multi-view-graph","slug":"prompt-tuning-for-multi-view-graph","title":"Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networks","date":"2023-10-16","arxiv_id":"2310.10362","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/prompt-tuning-for-multi-view-graph#ran","syntology_url":"https://syntology.ai/paper/2310.10362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10362"}},"official":{"repos":["gongchenghua/self-pro"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/does-graph-distillation-see-like-vision","slug":"does-graph-distillation-see-like-vision","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","date":"2023-10-13","arxiv_id":"2310.09192","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/does-graph-distillation-see-like-vision#ran","syntology_url":"https://syntology.ai/paper/2310.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09192"}},"official":{"repos":["ringbdstack/sgdd","suchun-sv/sgdd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-contrastive-learning-meets-graph-meta","slug":"graph-contrastive-learning-meets-graph-meta","title":"Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks","date":"2023-09-19","arxiv_id":"2309.10376","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-contrastive-learning-meets-graph-meta#ran","syntology_url":"https://syntology.ai/paper/2309.10376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.10376"}},"official":{"repos":["haoliu-cola/cola"],"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/pure-message-passing-can-estimate-common","slug":"pure-message-passing-can-estimate-common","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","date":"2023-09-02","arxiv_id":"2309.00976","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pure-message-passing-can-estimate-common#ran","syntology_url":"https://syntology.ai/paper/2309.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00976"}},"official":{"repos":["Barcavin/efficient-node-labelling"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}},"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"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/expert-knowledge-aware-image-difference-graph","slug":"expert-knowledge-aware-image-difference-graph","title":"Expert Knowledge-Aware Image Difference Graph Representation Learning for Difference-Aware Medical Visual Question Answering","date":"2023-07-22","arxiv_id":"2307.11986","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":5,"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/expert-knowledge-aware-image-difference-graph#ran","syntology_url":"https://syntology.ai/paper/2307.11986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11986"}},"official":{"repos":["holipori/mimic-diff-vqa"],"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/neural-architecture-retrieval","slug":"neural-architecture-retrieval","title":"Neural Architecture Retrieval","date":"2023-07-16","arxiv_id":"2307.07919","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-architecture-retrieval#ran","syntology_url":"https://syntology.ai/paper/2307.07919","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07919"}},"official":{"repos":["terrypei/nnretrieval"],"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/improving-heterogeneous-graph-learning-with","slug":"improving-heterogeneous-graph-learning-with","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","date":"2023-07-10","arxiv_id":"2307.04514","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-heterogeneous-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2307.04514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04514"}},"official":{"repos":["sharecodesubmission/weighted_product_manifold"],"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/histopathology-whole-slide-image-analysis-1","slug":"histopathology-whole-slide-image-analysis-1","title":"Histopathology Whole Slide Image Analysis with Heterogeneous Graph Representation Learning","date":"2023-07-09","arxiv_id":"2307.04189","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"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/histopathology-whole-slide-image-analysis-1#ran","syntology_url":"https://syntology.ai/paper/2307.04189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04189"}},"official":{"repos":["hku-medai/wsi-hgnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"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/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/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"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) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-graph-representation-learning","slug":"towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","arxiv_id":"2305.06102","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.06102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06102"}},"official":{"repos":["qslim/pdf"],"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/deep-graph-representation-learning-and","slug":"deep-graph-representation-learning-and","title":"Deep Graph Representation Learning and Optimization for Influence Maximization","date":"2023-05-01","arxiv_id":"2305.02200","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":3,"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/deep-graph-representation-learning-and#ran","syntology_url":"https://syntology.ai/paper/2305.02200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02200"}},"official":{"repos":["triplej0079/deepim"],"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/ftm-a-frame-level-timeline-modeling-method","slug":"ftm-a-frame-level-timeline-modeling-method","title":"FTM: A Frame-level Timeline Modeling Method for Temporal Graph Representation Learning","date":"2023-02-23","arxiv_id":"2302.11814","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/ftm-a-frame-level-timeline-modeling-method#ran","syntology_url":"https://syntology.ai/paper/2302.11814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11814"}},"official":{"repos":["yeeeqichen/ftm"],"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/learnable-topological-features-for","slug":"learnable-topological-features-for","title":"Learnable Topological Features for Phylogenetic Inference via Graph Neural Networks","date":"2023-02-17","arxiv_id":"2302.08840","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":6,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"9 ran (of which 6 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) · 2 unverified","sample_list":"/paper/learnable-topological-features-for#ran","syntology_url":"https://syntology.ai/paper/2302.08840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08840"}},"official":{"repos":["zcrabbit/vbpi-gnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/increase-inductive-graph-representation","slug":"increase-inductive-graph-representation","title":"INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging","date":"2023-02-06","arxiv_id":"2302.02738","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/increase-inductive-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2302.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02738"}},"official":{"repos":["zhengchuanpan/increase"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs","slug":"a-generalization-of-vit-mlp-mixer-to-graphs","title":"A Generalization of ViT/MLP-Mixer to Graphs","date":"2022-12-27","arxiv_id":"2212.13350","repositories_listed":3,"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-generalization-of-vit-mlp-mixer-to-graphs#ran","syntology_url":"https://syntology.ai/paper/2212.13350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13350"}},"official":{"repos":["XiaoxinHe/Graph-ViT-MLPMixer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/fairmile-a-multi-level-framework-for-fair-and","slug":"fairmile-a-multi-level-framework-for-fair-and","title":"FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning","date":"2022-11-17","arxiv_id":"2211.09925","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairmile-a-multi-level-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2211.09925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09925"}},"official":{"repos":["heyuntian/fairmile"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-graphon-neural-representation","slug":"implicit-graphon-neural-representation","title":"Implicit Graphon Neural Representation","date":"2022-11-07","arxiv_id":"2211.03329","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graphon-neural-representation#ran","syntology_url":"https://syntology.ai/paper/2211.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03329"}},"official":{"repos":["mishne-lab/ignr"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-causal-augmentation-for-graph","slug":"adversarial-causal-augmentation-for-graph","title":"Unleashing the Power of Graph Data Augmentation on Covariate Distribution Shift","date":"2022-11-05","arxiv_id":"2211.02843","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/adversarial-causal-augmentation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2211.02843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02843"}},"official":{"repos":["yongduosui/aia"],"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/transformers-over-directed-acyclic-graphs-1","slug":"transformers-over-directed-acyclic-graphs-1","title":"Transformers over Directed Acyclic Graphs","date":"2022-10-24","arxiv_id":"2210.13148","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transformers-over-directed-acyclic-graphs-1#ran","syntology_url":"https://syntology.ai/paper/2210.13148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13148"}},"official":null}},{"url":"/paper/graph-coloring-via-neural-networks-for","slug":"graph-coloring-via-neural-networks-for","title":"Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction","date":"2022-10-21","arxiv_id":"2210.12158","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-coloring-via-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2210.12158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12158"}},"official":{"repos":["xuehansheng/neurhap"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"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/periodic-graph-transformers-for-crystal","slug":"periodic-graph-transformers-for-crystal","title":"Periodic Graph Transformers for Crystal Material Property Prediction","date":"2022-09-23","arxiv_id":"2209.11807","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/periodic-graph-transformers-for-crystal#ran","syntology_url":"https://syntology.ai/paper/2209.11807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11807"}},"official":{"repos":["YKQ98/Matformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}},"official":{"repos":["lrnzgiusti/can"],"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/public-wisdom-matters-discourse-aware","slug":"public-wisdom-matters-discourse-aware","title":"Public Wisdom Matters! Discourse-Aware Hyperbolic Fourier Co-Attention for Social-Text Classification","date":"2022-09-15","arxiv_id":"2209.13017","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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/public-wisdom-matters-discourse-aware#ran","syntology_url":"https://syntology.ai/paper/2209.13017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.13017"}},"official":{"repos":["LCS2-IIITD/Hyphen"],"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/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/scaling-up-dynamic-graph-representation","slug":"scaling-up-dynamic-graph-representation","title":"Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks","date":"2022-08-15","arxiv_id":"2208.10364","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaling-up-dynamic-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2208.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10364"}},"official":{"repos":["edisonleeeee/spikenet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-subgraph-contrast-for-self","slug":"generative-subgraph-contrast-for-self","title":"Generative Subgraph Contrast for Self-Supervised Graph Representation Learning","date":"2022-07-25","arxiv_id":"2207.11996","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/generative-subgraph-contrast-for-self#ran","syntology_url":"https://syntology.ai/paper/2207.11996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11996"}},"official":{"repos":["yh-han/gsc"],"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/model-aware-contrastive-learning-towards","slug":"model-aware-contrastive-learning-towards","title":"Model-Aware Contrastive Learning: Towards Escaping the Dilemmas","date":"2022-07-16","arxiv_id":"2207.07874","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/model-aware-contrastive-learning-towards#ran","syntology_url":"https://syntology.ai/paper/2207.07874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.07874"}},"official":{"repos":["chenhaoxing/MACL_ICML2023"],"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-representation-learning-framework-for-1","slug":"a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","arxiv_id":"2206.13176","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"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; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-representation-learning-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.13176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13176"}},"official":{"repos":["yifan-h/pge"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/boosting-graph-structure-learning-with-dummy","slug":"boosting-graph-structure-learning-with-dummy","title":"Boosting Graph Structure Learning with Dummy Nodes","date":"2022-06-17","arxiv_id":"2206.08561","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/boosting-graph-structure-learning-with-dummy#ran","syntology_url":"https://syntology.ai/paper/2206.08561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08561"}},"official":{"repos":["hkust-knowcomp/dummynode4graphlearning"],"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/taxonomy-of-benchmarks-in-graph","slug":"taxonomy-of-benchmarks-in-graph","title":"Taxonomy of Benchmarks in Graph Representation Learning","date":"2022-06-15","arxiv_id":"2206.07729","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/taxonomy-of-benchmarks-in-graph#ran","syntology_url":"https://syntology.ai/paper/2206.07729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07729"}},"official":{"repos":["g-taxonomy-workgroup/gtaxogym"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-and-scaling-up-graph-contrastive","slug":"rethinking-and-scaling-up-graph-contrastive","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","date":"2022-06-03","arxiv_id":"2206.01535","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-and-scaling-up-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2206.01535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01535"}},"official":{"repos":["zyzisastudyreallyhardguy/graph-group-discrimination"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","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/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}},"official":{"repos":["zjunlp/relphormer"],"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/using-constraint-programming-and-graph","slug":"using-constraint-programming-and-graph","title":"Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies","date":"2022-05-02","arxiv_id":"2205.01240","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"4 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/using-constraint-programming-and-graph#ran","syntology_url":"https://syntology.ai/paper/2205.01240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01240"}},"official":{"repos":["mikhail247/iamax"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/simplicial-attention-networks-1","slug":"simplicial-attention-networks-1","title":"Simplicial Attention Networks","date":"2022-04-20","arxiv_id":"2204.09455","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplicial-attention-networks-1#ran","syntology_url":"https://syntology.ai/paper/2204.09455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09455"}},"official":{"repos":["ggoh29/simplicial-neural-network-benchmark"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-modal-graph-learning-for-disease-1","slug":"multi-modal-graph-learning-for-disease-1","title":"Multi-modal Graph Learning for Disease Prediction","date":"2022-03-11","arxiv_id":"2203.05880","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/multi-modal-graph-learning-for-disease-1#ran","syntology_url":"https://syntology.ai/paper/2203.05880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05880"}},"official":{"repos":["ssgood/mmgl"],"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/algorithm-and-system-co-design-for-efficient","slug":"algorithm-and-system-co-design-for-efficient","title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","date":"2022-02-28","arxiv_id":"2202.13538","repositories_listed":3,"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/algorithm-and-system-co-design-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2202.13538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13538"}},"official":{"repos":["graph-com/surel"],"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/structure-aware-transformer-for-graph","slug":"structure-aware-transformer-for-graph","title":"Structure-Aware Transformer for Graph Representation Learning","date":"2022-02-07","arxiv_id":"2202.03036","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structure-aware-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2202.03036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03036"}},"official":{"repos":["borgwardtlab/sat"],"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":["listed","official"]}}},{"url":"/paper/a-variational-edge-partition-model-for","slug":"a-variational-edge-partition-model-for","title":"A Variational Edge Partition Model for Supervised Graph Representation Learning","date":"2022-02-07","arxiv_id":"2202.03233","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":6,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"7 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-variational-edge-partition-model-for#ran","syntology_url":"https://syntology.ai/paper/2202.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03233"}},"official":{"repos":["yh-utmsb/vepm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-self-attention-for-learning-graph","slug":"graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","arxiv_id":"2201.12787","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-self-attention-for-learning-graph#ran","syntology_url":"https://syntology.ai/paper/2201.12787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12787"}},"official":{"repos":["lenscloth/grpe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/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/investigating-expressiveness-of-transformer","slug":"investigating-expressiveness-of-transformer","title":"How Expressive are Transformers in Spectral Domain for Graphs?","date":"2022-01-23","arxiv_id":"2201.09332","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/investigating-expressiveness-of-transformer#ran","syntology_url":"https://syntology.ai/paper/2201.09332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.09332"}},"official":{"repos":["ansonb/FeTA_TMLR"],"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-compact-representations-of-neural","slug":"learning-compact-representations-of-neural","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","date":"2021-10-01","arxiv_id":"2110.00684","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-compact-representations-of-neural#ran","syntology_url":"https://syntology.ai/paper/2110.00684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00684"}},"official":{"repos":["jayroxis/dam-pytorch"],"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","unlocated"]}}},{"url":"/paper/autogcl-automated-graph-contrastive-learning","slug":"autogcl-automated-graph-contrastive-learning","title":"AutoGCL: Automated Graph Contrastive Learning via Learnable View Generators","date":"2021-09-21","arxiv_id":"2109.10259","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autogcl-automated-graph-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2109.10259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.10259"}},"official":{"repos":["Somedaywilldo/AutoGCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-trend-networks-for-recommendations","slug":"graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","arxiv_id":"2108.05552","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-trend-networks-for-recommendations#ran","syntology_url":"https://syntology.ai/paper/2108.05552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05552"}},"official":{"repos":["wenqifan03/gtn-sigir2022"],"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/evaluating-modules-in-graph-contrastive","slug":"evaluating-modules-in-graph-contrastive","title":"Evaluating Modules in Graph Contrastive Learning","date":"2021-06-15","arxiv_id":"2106.08171","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/evaluating-modules-in-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.08171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08171"}},"official":{"repos":["thunlp/opengcl"],"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/graph-neural-networks-for-natural-language","slug":"graph-neural-networks-for-natural-language","title":"Graph Neural Networks for Natural Language Processing: A Survey","date":"2021-06-10","arxiv_id":"2106.06090","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-for-natural-language#ran","syntology_url":"https://syntology.ai/paper/2106.06090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06090"}},"official":{"repos":["graph4ai/graph4nlp"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-graph-level-representation-1","slug":"self-supervised-graph-level-representation-1","title":"Self-supervised Graph-level Representation Learning with Local and Global Structure","date":"2021-06-08","arxiv_id":"2106.04113","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-supervised-graph-level-representation-1#ran","syntology_url":"https://syntology.ai/paper/2106.04113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04113"}},"official":{"repos":["DeepGraphLearning/GraphLoG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-scale-contrastive-siamese-networks-for","slug":"multi-scale-contrastive-siamese-networks-for","title":"Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning","date":"2021-05-12","arxiv_id":"2105.05682","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-scale-contrastive-siamese-networks-for#ran","syntology_url":"https://syntology.ai/paper/2105.05682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.05682"}},"official":{"repos":["GRAND-Lab/MERIT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unignn-a-unified-framework-for-graph-and","slug":"unignn-a-unified-framework-for-graph-and","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","date":"2021-05-03","arxiv_id":"2105.00956","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unignn-a-unified-framework-for-graph-and#ran","syntology_url":"https://syntology.ai/paper/2105.00956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.00956"}},"official":{"repos":["OneForward/UniGNN"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/biased-edge-dropout-for-enhancing-fairness-in","slug":"biased-edge-dropout-for-enhancing-fairness-in","title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","date":"2021-04-29","arxiv_id":"2104.14210","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/biased-edge-dropout-for-enhancing-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2104.14210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14210"}},"official":null}},{"url":"/paper/qa-gnn-reasoning-with-language-models-and","slug":"qa-gnn-reasoning-with-language-models-and","title":"QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering","date":"2021-04-13","arxiv_id":"2104.06378","repositories_listed":6,"syntology":{"n":25,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":17,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/qa-gnn-reasoning-with-language-models-and#ran","syntology_url":"https://syntology.ai/paper/2104.06378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06378"}},"official":{"repos":["michiyasunaga/qagnn","worksheets.codalab.org/worksheets/0xf215deb05edf44a2ac353c711f52a25f"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/e-graphsage-a-graph-neural-network-based","slug":"e-graphsage-a-graph-neural-network-based","title":"E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoT","date":"2021-03-30","arxiv_id":"2103.16329","repositories_listed":3,"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/e-graphsage-a-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2103.16329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16329"}},"official":{"repos":["waimorris/E-GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"790c3e329d17919cf980d94df565cb3fefe2b92bff335fb6d462fc3b4a06154e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}