{"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-embedding/papers/ran/1","list_of":"/task/graph-embedding","task":"Graph Embedding","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,92],"of":92,"counts":{"archive_papers_tagged":1192,"with_a_code_link":533,"where_syntology_ran_a_sample":92,"not_listed_spam_title":0,"listed":1192,"listed_where_code_ran":92,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":83,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":83,"listed_every_run_a_failure_of_syntologys_instrument":9,"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-embedding/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/gder-safeguarding-efficiency-balancing-and","slug":"gder-safeguarding-efficiency-balancing-and","title":"GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning","date":"2024-10-17","arxiv_id":"2410.13761","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":4,"n_ran_checked":10,"n_instrument":2,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":18,"phrase":"12 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/gder-safeguarding-efficiency-balancing-and#ran","syntology_url":"https://syntology.ai/paper/2410.13761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13761"}},"official":{"repos":["ins1stenc3/gder"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-embedding-by-normalizing","slug":"knowledge-graph-embedding-by-normalizing","title":"Knowledge Graph Embedding by Normalizing Flows","date":"2024-09-30","arxiv_id":"2409.19977","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/knowledge-graph-embedding-by-normalizing#ran","syntology_url":"https://syntology.ai/paper/2409.19977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19977"}},"official":{"repos":["changyi7231/nfe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-continual-knowledge-graph-embedding","slug":"fast-and-continual-knowledge-graph-embedding","title":"Fast and Continual Knowledge Graph Embedding via Incremental LoRA","date":"2024-07-08","arxiv_id":"2407.05705","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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/fast-and-continual-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2407.05705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05705"}},"official":{"repos":["seukgcode/fastkge"],"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/uniglm-training-one-unified-language-model","slug":"uniglm-training-one-unified-language-model","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","date":"2024-06-17","arxiv_id":"2406.12052","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":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) · 2 unverified","sample_list":"/paper/uniglm-training-one-unified-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12052"}},"official":{"repos":["nyushcs/uniglm"],"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/duplex-dual-gat-for-complex-embedding-of","slug":"duplex-dual-gat-for-complex-embedding-of","title":"DUPLEX: Dual GAT for Complex Embedding of Directed Graphs","date":"2024-06-08","arxiv_id":"2406.05391","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/duplex-dual-gat-for-complex-embedding-of#ran","syntology_url":"https://syntology.ai/paper/2406.05391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05391"}},"official":{"repos":["alipay/duplex"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/valid-conformal-prediction-for-dynamic-gnns","slug":"valid-conformal-prediction-for-dynamic-gnns","title":"Valid Conformal Prediction for Dynamic GNNs","date":"2024-05-29","arxiv_id":"2405.19230","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"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) · 6 unverified","sample_list":"/paper/valid-conformal-prediction-for-dynamic-gnns#ran","syntology_url":"https://syntology.ai/paper/2405.19230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19230"}},"official":{"repos":["edwarddavis1/valid_conformal_for_dynamic_gnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/a-canonization-perspective-on-invariant-and","slug":"a-canonization-perspective-on-invariant-and","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","date":"2024-05-28","arxiv_id":"2405.18378","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-canonization-perspective-on-invariant-and#ran","syntology_url":"https://syntology.ai/paper/2405.18378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18378"}},"official":{"repos":["PKU-ML/canonicalization","georgemlp/canonicalization"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open","slug":"kg-fit-knowledge-graph-fine-tuning-upon-open","title":"KG-FIT: Knowledge Graph Fine-Tuning Upon Open-World Knowledge","date":"2024-05-26","arxiv_id":"2405.16412","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/kg-fit-knowledge-graph-fine-tuning-upon-open#ran","syntology_url":"https://syntology.ai/paper/2405.16412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16412"}},"official":{"repos":["pat-jj/KG-FIT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalizing-knowledge-graph-embedding-with","slug":"generalizing-knowledge-graph-embedding-with","title":"Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization","date":"2024-05-14","arxiv_id":"2405.08540","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/generalizing-knowledge-graph-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2405.08540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.08540"}},"official":{"repos":["xxrep/golde"],"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/towards-continual-knowledge-graph-embedding","slug":"towards-continual-knowledge-graph-embedding","title":"Towards Continual Knowledge Graph Embedding via Incremental Distillation","date":"2024-05-07","arxiv_id":"2405.04453","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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-continual-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2405.04453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04453"}},"official":{"repos":["seukgcode/incde"],"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/testam-a-time-enhanced-spatio-temporal","slug":"testam-a-time-enhanced-spatio-temporal","title":"TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts","date":"2024-03-05","arxiv_id":"2403.02600","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/testam-a-time-enhanced-spatio-temporal#ran","syntology_url":"https://syntology.ai/paper/2403.02600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02600"}},"official":{"repos":["hyunwookl/testam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"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/laplacian-canonization-a-minimalist-approach-1","slug":"laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","arxiv_id":"2310.18716","repositories_listed":3,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/laplacian-canonization-a-minimalist-approach-1#ran","syntology_url":"https://syntology.ai/paper/2310.18716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18716"}},"official":{"repos":["GeorgeMLP/basis-invariance-synthetic-experiment","pku-ml/laplaciancanonization","georgemlp/laplacian-canonization"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/speed-streaming-partition-and-parallel","slug":"speed-streaming-partition-and-parallel","title":"SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embedding","date":"2023-08-27","arxiv_id":"2308.14129","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/speed-streaming-partition-and-parallel#ran","syntology_url":"https://syntology.ai/paper/2308.14129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14129"}},"official":{"repos":["chenxi1228/SPEED"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/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/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","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":3,"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/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}},"official":{"repos":["Dandy5721/GNN-PDE-COV"],"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/ingram-inductive-knowledge-graph-embedding","slug":"ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ingram-inductive-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2305.19987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19987"}},"official":{"repos":["bdi-lab/ingram"],"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/hyperbolic-diffusion-embedding-and-distance","slug":"hyperbolic-diffusion-embedding-and-distance","title":"Hyperbolic Diffusion Embedding and Distance for Hierarchical Representation Learning","date":"2023-05-30","arxiv_id":"2305.18962","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyperbolic-diffusion-embedding-and-distance#ran","syntology_url":"https://syntology.ai/paper/2305.18962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18962"}},"official":{"repos":["ya-wei0/hyperbolicdiffusiondistance"],"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/node-embedding-from-neural-hamiltonian-orbits","slug":"node-embedding-from-neural-hamiltonian-orbits","title":"Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks","date":"2023-05-30","arxiv_id":"2305.18965","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/node-embedding-from-neural-hamiltonian-orbits#ran","syntology_url":"https://syntology.ai/paper/2305.18965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18965"}},"official":{"repos":["zknus/hamiltonian-gnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/cs-tgn-community-search-via-temporal-graph","slug":"cs-tgn-community-search-via-temporal-graph","title":"CS-TGN: Community Search via Temporal Graph Neural Networks","date":"2023-03-15","arxiv_id":"2303.08964","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cs-tgn-community-search-via-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2303.08964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.08964"}},"official":{"repos":["joint-em/cs-tgn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-representations-of-bi-level","slug":"learning-representations-of-bi-level","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","date":"2023-02-06","arxiv_id":"2302.02601","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":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/learning-representations-of-bi-level#ran","syntology_url":"https://syntology.ai/paper/2302.02601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02601"}},"official":{"repos":["bdi-lab/bive"],"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/robust-attributed-graph-alignment-via-joint","slug":"robust-attributed-graph-alignment-via-joint","title":"Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport","date":"2023-01-30","arxiv_id":"2301.12721","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-attributed-graph-alignment-via-joint#ran","syntology_url":"https://syntology.ai/paper/2301.12721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12721"}},"official":{"repos":["squareroot3/slotalign"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bess-balanced-entity-sampling-and-sharing-for","slug":"bess-balanced-entity-sampling-and-sharing-for","title":"BESS: Balanced Entity Sampling and Sharing for Large-Scale Knowledge Graph Completion","date":"2022-11-22","arxiv_id":"2211.12281","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bess-balanced-entity-sampling-and-sharing-for#ran","syntology_url":"https://syntology.ai/paper/2211.12281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12281"}},"official":{"repos":["graphcore/distributed-kge-poplar"],"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":["listed","official"]}}},{"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/parameter-free-dynamic-graph-embedding-for","slug":"parameter-free-dynamic-graph-embedding-for","title":"Parameter-free Dynamic Graph Embedding for Link Prediction","date":"2022-10-15","arxiv_id":"2210.08189","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 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) · 2 unverified","sample_list":"/paper/parameter-free-dynamic-graph-embedding-for#ran","syntology_url":"https://syntology.ai/paper/2210.08189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08189"}},"official":{"repos":["fudancisl/freegem"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-analogical-reasoning-over","slug":"multimodal-analogical-reasoning-over","title":"Multimodal Analogical Reasoning over Knowledge Graphs","date":"2022-10-01","arxiv_id":"2210.00312","repositories_listed":2,"syntology":{"n":27,"n_ran":17,"n_constructed":2,"n_ran_checked":14,"n_instrument":3,"n_unverified":10,"n_honours":1,"n_violates":1,"n_no_contract":12,"n_pointer_only":2,"phrase":"17 ran (of which 2 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/multimodal-analogical-reasoning-over#ran","syntology_url":"https://syntology.ai/paper/2210.00312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00312"}},"official":{"repos":["zjunlp/MKG_Analogy"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":10,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/meim-multi-partition-embedding-interaction","slug":"meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meim-multi-partition-embedding-interaction#ran","syntology_url":"https://syntology.ai/paper/2209.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15597"}},"official":{"repos":["tranhungnghiep/meim-kge"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/from-local-to-global-spectral-inspired-graph","slug":"from-local-to-global-spectral-inspired-graph","title":"From Local to Global: Spectral-Inspired Graph Neural Networks","date":"2022-09-24","arxiv_id":"2209.12054","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"7 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-local-to-global-spectral-inspired-graph#ran","syntology_url":"https://syntology.ai/paper/2209.12054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12054"}},"official":{"repos":["nhuang37/spectral-inspired-gnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/i-know-what-you-do-not-know-knowledge-graph","slug":"i-know-what-you-do-not-know-knowledge-graph","title":"I Know What You Do Not Know: Knowledge Graph Embedding via Co-distillation Learning","date":"2022-08-21","arxiv_id":"2208.09828","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/i-know-what-you-do-not-know-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2208.09828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.09828"}},"official":{"repos":["nju-websoft/cole"],"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/disenhcn-disentangled-hypergraph","slug":"disenhcn-disentangled-hypergraph","title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","date":"2022-08-14","arxiv_id":"2208.06794","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disenhcn-disentangled-hypergraph#ran","syntology_url":"https://syntology.ai/paper/2208.06794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06794"}},"official":{"repos":["yf-li15/DisenHCN"],"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/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/on-the-surprising-behaviour-of-node2vec","slug":"on-the-surprising-behaviour-of-node2vec","title":"On the Surprising Behaviour of node2vec","date":"2022-06-16","arxiv_id":"2206.08252","repositories_listed":1,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/on-the-surprising-behaviour-of-node2vec#ran","syntology_url":"https://syntology.ai/paper/2206.08252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08252"}},"official":{"repos":["aidos-lab/node2vec-surprises"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/pie-a-parameter-and-inference-efficient","slug":"pie-a-parameter-and-inference-efficient","title":"PIE: a Parameter and Inference Efficient Solution for Large Scale Knowledge Graph Embedding Reasoning","date":"2022-04-29","arxiv_id":"2204.13957","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pie-a-parameter-and-inference-efficient#ran","syntology_url":"https://syntology.ai/paper/2204.13957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13957"}},"official":{"repos":["alipay/parameter_inference_efficient_pie"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/transher-translating-knowledge-graph","slug":"transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","arxiv_id":"2204.13221","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/transher-translating-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2204.13221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13221"}},"official":{"repos":["yizhilll/transher"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/augmenting-knowledge-graphs-for-better-link","slug":"augmenting-knowledge-graphs-for-better-link","title":"Augmenting Knowledge Graphs for Better Link Prediction","date":"2022-03-26","arxiv_id":"2203.13965","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/augmenting-knowledge-graphs-for-better-link#ran","syntology_url":"https://syntology.ai/paper/2203.13965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13965"}},"official":{"repos":["otamio/kga"],"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/hierarchical-nearest-neighbor-graph-embedding","slug":"hierarchical-nearest-neighbor-graph-embedding","title":"Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction","date":"2022-03-24","arxiv_id":"2203.12997","repositories_listed":1,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/hierarchical-nearest-neighbor-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2203.12997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12997"}},"official":{"repos":["koulakis/h-nne"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-to-sequence-knowledge-graph-1","slug":"sequence-to-sequence-knowledge-graph-1","title":"Sequence-to-Sequence Knowledge Graph Completion and Question Answering","date":"2022-03-19","arxiv_id":"2203.10321","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/sequence-to-sequence-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2203.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10321"}},"official":{"repos":["apoorvumang/kgt5"],"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/a-unified-framework-for-rank-based-evaluation","slug":"a-unified-framework-for-rank-based-evaluation","title":"A Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs","date":"2022-03-14","arxiv_id":"2203.07544","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-unified-framework-for-rank-based-evaluation#ran","syntology_url":"https://syntology.ai/paper/2203.07544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.07544"}},"official":{"repos":["pykeen/pykeen","pykeen/ranking-metrics-manuscript"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simkgc-simple-contrastive-knowledge-graph","slug":"simkgc-simple-contrastive-knowledge-graph","title":"SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models","date":"2022-03-04","arxiv_id":"2203.02167","repositories_listed":2,"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":3,"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/simkgc-simple-contrastive-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2203.02167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02167"}},"official":{"repos":["intfloat/simkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/house-knowledge-graph-embedding-with","slug":"house-knowledge-graph-embedding-with","title":"HousE: Knowledge Graph Embedding with Householder Parameterization","date":"2022-02-16","arxiv_id":"2202.07919","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/house-knowledge-graph-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2202.07919","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07919"}},"official":{"repos":["anrep/house"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-pooling-through-the-lens-of","slug":"revisiting-pooling-through-the-lens-of","title":"Revisiting Global Pooling through the Lens of Optimal Transport","date":"2022-01-23","arxiv_id":"2201.09191","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/revisiting-pooling-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2201.09191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.09191"}},"official":null}},{"url":"/paper/representing-long-range-context-for-graph-1","slug":"representing-long-range-context-for-graph-1","title":"Representing Long-Range Context for Graph Neural Networks with Global Attention","date":"2022-01-21","arxiv_id":"2201.08821","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/representing-long-range-context-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.08821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.08821"}},"official":{"repos":["ucbrise/graphtrans"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-laplacian-eigenmaps-1","slug":"contrastive-laplacian-eigenmaps-1","title":"Contrastive Laplacian Eigenmaps","date":"2022-01-14","arxiv_id":"2201.05493","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/contrastive-laplacian-eigenmaps-1#ran","syntology_url":"https://syntology.ai/paper/2201.05493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05493"}},"official":{"repos":["allenhaozhu/coles"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/implications-of-topological-imbalance-for","slug":"implications-of-topological-imbalance-for","title":"Implications of Topological Imbalance for Representation Learning on Biomedical Knowledge Graphs","date":"2021-12-13","arxiv_id":"2112.06567","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implications-of-topological-imbalance-for#ran","syntology_url":"https://syntology.ai/paper/2112.06567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.06567"}},"official":{"repos":["astrazeneca/biomedical-kg-topological-imbalance"],"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/poisoning-knowledge-graph-embeddings-via-1","slug":"poisoning-knowledge-graph-embeddings-via-1","title":"Poisoning Knowledge Graph Embeddings via Relation Inference Patterns","date":"2021-11-11","arxiv_id":"2111.06345","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/poisoning-knowledge-graph-embeddings-via-1#ran","syntology_url":"https://syntology.ai/paper/2111.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06345"}},"official":{"repos":["perubhardwaj/inferenceattack"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/graph-encoder-embedding","slug":"graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","date":"2021-09-27","arxiv_id":"2109.13098","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-encoder-embedding#ran","syntology_url":"https://syntology.ai/paper/2109.13098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13098"}},"official":{"repos":["cshen6/graphemd","cshen6/graphnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-knowledge-graph-completion-using-box","slug":"temporal-knowledge-graph-completion-using-box","title":"Temporal Knowledge Graph Completion using Box Embeddings","date":"2021-09-18","arxiv_id":"2109.08970","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":2,"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/temporal-knowledge-graph-completion-using-box#ran","syntology_url":"https://syntology.ai/paper/2109.08970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08970"}},"official":null}},{"url":"/paper/eclare-extreme-classification-with-label","slug":"eclare-extreme-classification-with-label","title":"ECLARE: Extreme Classification with Label Graph Correlations","date":"2021-07-31","arxiv_id":"2108.00261","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/eclare-extreme-classification-with-label#ran","syntology_url":"https://syntology.ai/paper/2108.00261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00261"}},"official":{"repos":["Extreme-classification/ECLARE"],"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/learning-embeddings-from-knowledge-graphs","slug":"learning-embeddings-from-knowledge-graphs","title":"Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes","date":"2021-05-18","arxiv_id":"2105.08683","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-embeddings-from-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2105.08683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08683"}},"official":{"repos":["Accenture/AmpliGraph"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/an-adversarial-transfer-network-for-knowledge","slug":"an-adversarial-transfer-network-for-knowledge","title":"An Adversarial Transfer Network for Knowledge Representation Learning","date":"2021-04-30","arxiv_id":"2104.14757","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/an-adversarial-transfer-network-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2104.14757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14757"}},"official":{"repos":["LemonNoel/ATransN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-box-embeddings-for-uncertain","slug":"probabilistic-box-embeddings-for-uncertain","title":"Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoning","date":"2021-04-09","arxiv_id":"2104.04597","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/probabilistic-box-embeddings-for-uncertain#ran","syntology_url":"https://syntology.ai/paper/2104.04597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04597"}},"official":{"repos":["stasl0217/beurre"],"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/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gnn-rl-compression-topology-aware-network","slug":"gnn-rl-compression-topology-aware-network","title":"Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learning","date":"2021-02-05","arxiv_id":"2102.03214","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gnn-rl-compression-topology-aware-network#ran","syntology_url":"https://syntology.ai/paper/2102.03214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03214"}},"official":{"repos":["yusx-swapp/gnn-rl-model-compression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-graph-embeddings-for-compositional","slug":"learning-graph-embeddings-for-compositional","title":"Learning Graph Embeddings for Compositional Zero-shot Learning","date":"2021-02-03","arxiv_id":"2102.01987","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":11,"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) · 5 unverified","sample_list":"/paper/learning-graph-embeddings-for-compositional#ran","syntology_url":"https://syntology.ai/paper/2102.01987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.01987"}},"official":{"repos":["ExplainableML/czsl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/on-using-classification-datasets-to-evaluate","slug":"on-using-classification-datasets-to-evaluate","title":"On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insights","date":"2020-12-23","arxiv_id":"2012.12931","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/on-using-classification-datasets-to-evaluate#ran","syntology_url":"https://syntology.ai/paper/2012.12931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12931"}},"official":{"repos":["LingxiaoShawn/GLOD-Issues"],"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/quaternion-graph-neural-networks","slug":"quaternion-graph-neural-networks","title":"Quaternion Graph Neural Networks","date":"2020-08-12","arxiv_id":"2008.05089","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/quaternion-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.05089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05089"}},"official":{"repos":["daiquocnguyen/QGNN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/pykeen-1-0-a-python-library-for-training-and","slug":"pykeen-1-0-a-python-library-for-training-and","title":"PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings","date":"2020-07-28","arxiv_id":"2007.14175","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pykeen-1-0-a-python-library-for-training-and#ran","syntology_url":"https://syntology.ai/paper/2007.14175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14175"}},"official":{"repos":["pykeen/pykeen"],"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/adaptive-graph-encoder-for-attributed-graph","slug":"adaptive-graph-encoder-for-attributed-graph","title":"Adaptive Graph Encoder for Attributed Graph Embedding","date":"2020-07-03","arxiv_id":"2007.01594","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-graph-encoder-for-attributed-graph#ran","syntology_url":"https://syntology.ai/paper/2007.01594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01594"}},"official":{"repos":["thunlp/AGE"],"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/characterizing-the-expressive-power-of","slug":"characterizing-the-expressive-power-of","title":"Expressive Power of Invariant and Equivariant Graph Neural Networks","date":"2020-06-28","arxiv_id":"2006.15646","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":4,"n_ran_checked":6,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/characterizing-the-expressive-power-of#ran","syntology_url":"https://syntology.ai/paper/2006.15646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15646"}},"official":{"repos":["mlelarge/graph_neural_net"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["community","official"]}}},{"url":"/paper/bringing-light-into-the-dark-a-large-scale","slug":"bringing-light-into-the-dark-a-large-scale","title":"Bringing Light Into the Dark: A Large-scale Evaluation of Knowledge Graph Embedding Models Under a Unified Framework","date":"2020-06-23","arxiv_id":"2006.13365","repositories_listed":2,"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/bringing-light-into-the-dark-a-large-scale#ran","syntology_url":"https://syntology.ai/paper/2006.13365","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13365"}},"official":{"repos":["pykeen/benchmarking"],"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/iterative-deep-graph-learning-for-graph-1","slug":"iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","arxiv_id":"2006.13009","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/iterative-deep-graph-learning-for-graph-1#ran","syntology_url":"https://syntology.ai/paper/2006.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13009"}},"official":{"repos":["hugochan/IDGL"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-multi-relational-graph","slug":"generalized-multi-relational-graph","title":"Knowledge Embedding Based Graph Convolutional Network","date":"2020-06-12","arxiv_id":"2006.07331","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/generalized-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/2006.07331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07331"}},"official":{"repos":["Maysir/GEM-GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/se-kge-a-location-aware-knowledge-graph","slug":"se-kge-a-location-aware-knowledge-graph","title":"SE-KGE: A Location-Aware Knowledge Graph Embedding Model for Geographic Question Answering and Spatial Semantic Lifting","date":"2020-04-25","arxiv_id":"2004.14171","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/se-kge-a-location-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2004.14171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14171"}},"official":null}},{"url":"/paper/vgcn-bert-augmenting-bert-with-graph","slug":"vgcn-bert-augmenting-bert-with-graph","title":"VGCN-BERT: Augmenting BERT with Graph Embedding for Text Classification","date":"2020-04-12","arxiv_id":"2004.05707","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vgcn-bert-augmenting-bert-with-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05707"}},"official":{"repos":["Louis-udm/VGCN-BERT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-hierarchy-aware-knowledge-graph","slug":"learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","repositories_listed":9,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-hierarchy-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1911.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09419"}},"official":{"repos":["MIRALab-USTC/KGE-HAKE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"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/combinatorial-optimization-by-graph-pointer","slug":"combinatorial-optimization-by-graph-pointer","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","date":"2019-11-12","arxiv_id":"1911.04936","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-by-graph-pointer#ran","syntology_url":"https://syntology.ai/paper/1911.04936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04936"}},"official":{"repos":["qiang-ma/graph-pointer-network"],"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/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composition-based-multi-relational-graph#ran","syntology_url":"https://syntology.ai/paper/1911.03082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03082"}},"official":{"repos":["malllabiisc/CompGCN"],"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":["listed","official"]}}},{"url":"/paper/coke-contextualized-knowledge-graph-embedding","slug":"coke-contextualized-knowledge-graph-embedding","title":"CoKE: Contextualized Knowledge Graph Embedding","date":"2019-11-06","arxiv_id":"1911.02168","repositories_listed":3,"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/coke-contextualized-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/1911.02168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02168"}},"official":{"repos":["PaddlePaddle/Research","PaddlePaddle/models"],"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/unsupervised-universal-self-attention-network","slug":"unsupervised-universal-self-attention-network","title":"Universal Graph Transformer Self-Attention Networks","date":"2019-09-26","arxiv_id":"1909.11855","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-universal-self-attention-network#ran","syntology_url":"https://syntology.ai/paper/1909.11855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11855"}},"official":{"repos":["daiquocnguyen/Graph-Transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ego-cnn-distributed-egocentric","slug":"ego-cnn-distributed-egocentric","title":"Ego-CNN: Distributed, Egocentric Representations of Graphs for Detecting Critical Structures","date":"2019-06-23","arxiv_id":"1906.09602","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ego-cnn-distributed-egocentric#ran","syntology_url":"https://syntology.ai/paper/1906.09602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09602"}},"official":{"repos":["rutzeng/EgoCNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/attributed-graph-clustering-a-deep","slug":"attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/graph-embedding-on-biomedical-networks","slug":"graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-embedding-on-biomedical-networks#ran","syntology_url":"https://syntology.ai/paper/1906.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05017"}},"official":{"repos":["xiangyue9607/BioNEV"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-view-knowledge-graph-embedding-for","slug":"multi-view-knowledge-graph-embedding-for","title":"Multi-view Knowledge Graph Embedding for Entity Alignment","date":"2019-06-06","arxiv_id":"1906.02390","repositories_listed":1,"syntology":{"n":21,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/multi-view-knowledge-graph-embedding-for#ran","syntology_url":"https://syntology.ai/paper/1906.02390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02390"}},"official":{"repos":["nju-websoft/MultiKE"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/compositional-fairness-constraints-for-graph","slug":"compositional-fairness-constraints-for-graph","title":"Compositional Fairness Constraints for Graph Embeddings","date":"2019-05-25","arxiv_id":"1905.10674","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-fairness-constraints-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10674"}},"official":{"repos":["joeybose/Flexible-Fairness-Constraints"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-u-nets","slug":"graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","arxiv_id":"1905.05178","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-u-nets#ran","syntology_url":"https://syntology.ai/paper/1905.05178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05178"}},"official":{"repos":["HongyangGao/gunet"],"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/190501669","slug":"190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"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":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) · 3 unverified","sample_list":"/paper/190501669#ran","syntology_url":"https://syntology.ai/paper/1905.01669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01669"}},"official":{"repos":["cenyk1230/GATNE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-stage-self-supervised-learning-for","slug":"multi-stage-self-supervised-learning-for","title":"Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labels","date":"2019-02-28","arxiv_id":"1902.11038","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/multi-stage-self-supervised-learning-for#ran","syntology_url":"https://syntology.ai/paper/1902.11038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.11038"}},"official":null}},{"url":"/paper/rotate-knowledge-graph-embedding-by","slug":"rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rotate-knowledge-graph-embedding-by#ran","syntology_url":"https://syntology.ai/paper/1902.10197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.10197"}},"official":{"repos":["DeepGraphLearning/KnowledgeGraphEmbedding"],"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/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiating-concepts-and-instances-for","slug":"differentiating-concepts-and-instances-for","title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","date":"2018-11-12","arxiv_id":"1811.04588","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 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) · 6 unverified","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}},"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-the-semantic-content-of","slug":"exploring-the-semantic-content-of","title":"Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study","date":"2018-06-19","arxiv_id":"1806.07464","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-the-semantic-content-of#ran","syntology_url":"https://syntology.ai/paper/1806.07464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07464"}},"official":{"repos":["sbonner0/unsupervised-graph-embedding","sbonner0/unsupervised-graph-embeddings"],"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/kbgan-adversarial-learning-for-knowledge","slug":"kbgan-adversarial-learning-for-knowledge","title":"KBGAN: Adversarial Learning for Knowledge Graph Embeddings","date":"2017-11-11","arxiv_id":"1711.04071","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kbgan-adversarial-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1711.04071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04071"}},"official":{"repos":["cai-lw/KBGAN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"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/premise-selection-for-theorem-proving-by-deep","slug":"premise-selection-for-theorem-proving-by-deep","title":"Premise Selection for Theorem Proving by Deep Graph Embedding","date":"2017-09-28","arxiv_id":"1709.09994","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/premise-selection-for-theorem-proving-by-deep#ran","syntology_url":"https://syntology.ai/paper/1709.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.09994"}},"official":{"repos":["princeton-vl/FormulaNet"],"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/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/poincare-embeddings-for-learning-hierarchical","slug":"poincare-embeddings-for-learning-hierarchical","title":"Poincaré Embeddings for Learning Hierarchical Representations","date":"2017-05-22","arxiv_id":"1705.08039","repositories_listed":9,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 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; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/poincare-embeddings-for-learning-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1705.08039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08039"}},"official":null}},{"url":"/paper/struc2vec-learning-node-representations-from","slug":"struc2vec-learning-node-representations-from","title":"struc2vec: Learning Node Representations from Structural Identity","date":"2017-04-11","arxiv_id":"1704.03165","repositories_listed":5,"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/struc2vec-learning-node-representations-from#ran","syntology_url":"https://syntology.ai/paper/1704.03165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.03165"}},"official":{"repos":["leoribeiro/struc2vec"],"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/learning-combinatorial-optimization","slug":"learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","arxiv_id":"1704.01665","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-combinatorial-optimization#ran","syntology_url":"https://syntology.ai/paper/1704.01665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01665"}},"official":{"repos":["Hanjun-Dai/graph_comb_opt"],"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/line-large-scale-information-network","slug":"line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"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/line-large-scale-information-network#ran","syntology_url":"https://syntology.ai/paper/1503.03578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.03578"}},"official":{"repos":["tangjianpku/LINE"],"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":"63d35afce6229c1471589207fbb86c634207bc3a6ac3e8fcbb9c927199a7b7c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}