{"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/link-prediction/papers/4","list_of":"/task/link-prediction","task":"Link Prediction","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":4,"pages_in_order":20,"rows_per_page":100,"rows":[301,400],"of":1949,"counts":{"archive_papers_tagged":1949,"with_a_code_link":974,"where_syntology_ran_a_sample":233,"not_listed_spam_title":0,"listed":1949,"listed_where_code_ran":233,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":206,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":206,"listed_every_run_a_failure_of_syntologys_instrument":27,"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/link-prediction","prev":"/task/link-prediction/papers/3","next":"/task/link-prediction/papers/5","papers":[{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/repeat-aware-neighbor-sampling-for-dynamic","slug":"repeat-aware-neighbor-sampling-for-dynamic","title":"Repeat-Aware Neighbor Sampling for Dynamic Graph Learning","date":"2024-05-24","arxiv_id":"2405.17473","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/repeat-aware-neighbor-sampling-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2405.17473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17473"}},"official":{"repos":["Hope-Rita/RepeatMixer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/retrieval-augmented-language-model-for","slug":"retrieval-augmented-language-model-for","title":"Retrieval-Augmented Language Model for Extreme Multi-Label Knowledge Graph Link Prediction","date":"2024-05-21","arxiv_id":"2405.12656","repositories_listed":1,"syntology":null},{"url":"/paper/pull-pu-learning-based-accurate-link","slug":"pull-pu-learning-based-accurate-link","title":"Accurate Link Prediction for Edge-Incomplete Graphs via PU Learning","date":"2024-05-20","arxiv_id":"2405.11911","repositories_listed":1,"syntology":null},{"url":"/paper/perception-inspired-graph-convolution-for","slug":"perception-inspired-graph-convolution-for","title":"Perception-Inspired Graph Convolution for Music Understanding Tasks","date":"2024-05-15","arxiv_id":"2405.09224","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/perception-inspired-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2405.09224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.09224"}},"official":{"repos":["manoskary/musgconv"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-survey-of-large-language-models-for-graphs","slug":"a-survey-of-large-language-models-for-graphs","title":"A Survey of Large Language Models for Graphs","date":"2024-05-10","arxiv_id":"2405.08011","repositories_listed":1,"syntology":null},{"url":"/paper/geocontrastnet-contrastive-key-value-edge","slug":"geocontrastnet-contrastive-key-value-edge","title":"GeoContrastNet: Contrastive Key-Value Edge Learning for Language-Agnostic Document Understanding","date":"2024-05-06","arxiv_id":"2405.03104","repositories_listed":1,"syntology":null},{"url":"/paper/slotgat-slot-based-message-passing-for","slug":"slotgat-slot-based-message-passing-for","title":"SlotGAT: Slot-based Message Passing for Heterogeneous Graph Neural Network","date":"2024-05-03","arxiv_id":"2405.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/slotgat-slot-based-message-passing-for#ran","syntology_url":"https://syntology.ai/paper/2405.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01927"}},"official":{"repos":["scottjiao/slotgat_icml23"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/biomedrag-a-retrieval-augmented-large","slug":"biomedrag-a-retrieval-augmented-large","title":"BiomedRAG: A Retrieval Augmented Large Language Model for Biomedicine","date":"2024-05-01","arxiv_id":"2405.00465","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/biomedrag-a-retrieval-augmented-large#ran","syntology_url":"https://syntology.ai/paper/2405.00465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00465"}},"official":{"repos":["toneli/petailor-for-bio-triple-extraction"],"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/causaldisco-causal-discovery-using-knowledge","slug":"causaldisco-causal-discovery-using-knowledge","title":"CausalLP: Learning causal relations with weighted knowledge graph link prediction","date":"2024-04-23","arxiv_id":"2405.02327","repositories_listed":1,"syntology":null},{"url":"/paper/progressive-knowledge-graph-completion","slug":"progressive-knowledge-graph-completion","title":"Progressive Knowledge Graph Completion","date":"2024-04-15","arxiv_id":"2404.09897","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-attention-models-for-multi","slug":"hierarchical-attention-models-for-multi","title":"Hierarchical Attention Models for Multi-Relational Graphs","date":"2024-04-14","arxiv_id":"2404.09365","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-heterogeneity-among-factor-tensors","slug":"mitigating-heterogeneity-among-factor-tensors","title":"Mitigating Heterogeneity among Factor Tensors via Lie Group Manifolds for Tensor Decomposition Based Temporal Knowledge Graph Embedding","date":"2024-04-14","arxiv_id":"2404.09155","repositories_listed":1,"syntology":null},{"url":"/paper/generative-contrastive-heterogeneous-graph","slug":"generative-contrastive-heterogeneous-graph","title":"Generative-Contrastive Heterogeneous Graph Neural Network","date":"2024-04-03","arxiv_id":"2404.02810","repositories_listed":1,"syntology":null},{"url":"/paper/glemos-benchmark-for-instantaneous-graph-1","slug":"glemos-benchmark-for-instantaneous-graph-1","title":"GLEMOS: Benchmark for Instantaneous Graph Learning Model Selection","date":"2024-04-02","arxiv_id":"2404.01578","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/glemos-benchmark-for-instantaneous-graph-1#ran","syntology_url":"https://syntology.ai/paper/2404.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01578"}},"official":{"repos":["facebookresearch/glemos"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/mpxgat-an-attention-based-deep-learning-model","slug":"mpxgat-an-attention-based-deep-learning-model","title":"MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding","date":"2024-03-28","arxiv_id":"2403.19246","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-based-negative-sampling-on-graphs","slug":"diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","arxiv_id":"2403.17259","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/diffusion-based-negative-sampling-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2403.17259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17259"}},"official":{"repos":["ntkien1904/dmns"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-one-shot-subgraph-reasoning-on","slug":"less-is-more-one-shot-subgraph-reasoning-on","title":"Less is More: One-shot Subgraph Reasoning on Large-scale Knowledge Graphs","date":"2024-03-15","arxiv_id":"2403.10231","repositories_listed":1,"syntology":null},{"url":"/paper/repohyper-better-context-retrieval-is-all-you","slug":"repohyper-better-context-retrieval-is-all-you","title":"RepoHyper: Search-Expand-Refine on Semantic Graphs for Repository-Level Code Completion","date":"2024-03-10","arxiv_id":"2403.06095","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/repohyper-better-context-retrieval-is-all-you#ran","syntology_url":"https://syntology.ai/paper/2403.06095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06095"}},"official":{"repos":["fsoft-ai4code/repohyper"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/task-oriented-gnns-training-on-large","slug":"task-oriented-gnns-training-on-large","title":"Task-Oriented GNNs Training on Large Knowledge Graphs for Accurate and Efficient Modeling","date":"2024-03-09","arxiv_id":"2403.05752","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-invariant-learning-for-dynamic-1","slug":"spectral-invariant-learning-for-dynamic-1","title":"Spectral Invariant Learning for Dynamic Graphs under Distribution Shifts","date":"2024-03-08","arxiv_id":"2403.05026","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/spectral-invariant-learning-for-dynamic-1#ran","syntology_url":"https://syntology.ai/paper/2403.05026","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05026"}},"official":{"repos":["wondergo2017/sild"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-perspective-improvement-of-knowledge","slug":"multi-perspective-improvement-of-knowledge","title":"Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models","date":"2024-03-04","arxiv_id":"2403.01972","repositories_listed":1,"syntology":null},{"url":"/paper/opengraph-towards-open-graph-foundation","slug":"opengraph-towards-open-graph-foundation","title":"OpenGraph: Towards Open Graph Foundation Models","date":"2024-03-02","arxiv_id":"2403.01121","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/opengraph-towards-open-graph-foundation#ran","syntology_url":"https://syntology.ai/paper/2403.01121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01121"}},"official":{"repos":["hkuds/opengraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sstkg-simple-spatio-temporal-knowledge-graph","slug":"sstkg-simple-spatio-temporal-knowledge-graph","title":"SSTKG: Simple Spatio-Temporal Knowledge Graph for Intepretable and Versatile Dynamic Information Embedding","date":"2024-02-19","arxiv_id":"2402.12132","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/sstkg-simple-spatio-temporal-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2402.12132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12132"}},"official":{"repos":["Hippopotamus0308/SSTKG"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/expressive-higher-order-link-prediction","slug":"expressive-higher-order-link-prediction","title":"Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking","date":"2024-02-17","arxiv_id":"2402.11339","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":13,"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) · 0 unverified","sample_list":"/paper/expressive-higher-order-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2402.11339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11339"}},"official":{"repos":["simonzhang00/hypergraphsymmetrybreaking"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unlink-to-unlearn-simplifying-edge-unlearning","slug":"unlink-to-unlearn-simplifying-edge-unlearning","title":"Unlink to Unlearn: Simplifying Edge Unlearning in GNNs","date":"2024-02-16","arxiv_id":"2402.10695","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unlink-to-unlearn-simplifying-edge-unlearning#ran","syntology_url":"https://syntology.ai/paper/2402.10695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10695"}},"official":{"repos":["sumsky21/unlink-to-unlearn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/node-duplication-improves-cold-start-link","slug":"node-duplication-improves-cold-start-link","title":"Node Duplication Improves Cold-start Link Prediction","date":"2024-02-15","arxiv_id":"2402.09711","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/node-duplication-improves-cold-start-link#ran","syntology_url":"https://syntology.ai/paper/2402.09711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09711"}},"official":{"repos":["snap-research/nodedup"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-inference-acceleration-by-learning-mlps","slug":"graph-inference-acceleration-by-learning-mlps","title":"SimMLP: Training MLPs on Graphs without Supervision","date":"2024-02-14","arxiv_id":"2402.08918","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-position-embedding-of-graphs","slug":"hierarchical-position-embedding-of-graphs","title":"Hierarchical Position Embedding of Graphs with Landmarks and Clustering for Link Prediction","date":"2024-02-13","arxiv_id":"2402.08174","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-link-predictors","slug":"mixture-of-link-predictors","title":"Mixture of Link Predictors on Graphs","date":"2024-02-13","arxiv_id":"2402.08583","repositories_listed":1,"syntology":null},{"url":"/paper/multi-label-zero-shot-product-attribute-value","slug":"multi-label-zero-shot-product-attribute-value","title":"Multi-Label Zero-Shot Product Attribute-Value Extraction","date":"2024-02-13","arxiv_id":"2402.08802","repositories_listed":1,"syntology":null},{"url":"/paper/netinfof-framework-measuring-and-exploiting","slug":"netinfof-framework-measuring-and-exploiting","title":"NetInfoF Framework: Measuring and Exploiting Network Usable Information","date":"2024-02-12","arxiv_id":"2402.07999","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/netinfof-framework-measuring-and-exploiting#ran","syntology_url":"https://syntology.ai/paper/2402.07999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07999"}},"official":{"repos":["amazon-science/network-usable-info-framework"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/link-aware-link-prediction-over-temporal","slug":"link-aware-link-prediction-over-temporal","title":"Link-aware link prediction over temporal graph by pattern recognition","date":"2024-02-11","arxiv_id":"2402.07199","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-information-bottleneck","slug":"dynamic-graph-information-bottleneck","title":"Dynamic Graph Information Bottleneck","date":"2024-02-09","arxiv_id":"2402.06716","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-graph-information-bottleneck#ran","syntology_url":"https://syntology.ai/paper/2402.06716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06716"}},"official":{"repos":["ringbdstack/dgib"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/twig-towards-pre-hoc-hyperparameter","slug":"twig-towards-pre-hoc-hyperparameter","title":"TWIG: Towards pre-hoc Hyperparameter Optimisation and Cross-Graph Generalisation via Simulated KGE Models","date":"2024-02-08","arxiv_id":"2402.06097","repositories_listed":1,"syntology":null},{"url":"/paper/masked-graph-autoencoder-with-non-discrete","slug":"masked-graph-autoencoder-with-non-discrete","title":"Masked Graph Autoencoder with Non-discrete Bandwidths","date":"2024-02-06","arxiv_id":"2402.03814","repositories_listed":1,"syntology":null},{"url":"/paper/automated-cognate-detection-as-a-supervised","slug":"automated-cognate-detection-as-a-supervised","title":"Automated Cognate Detection as a Supervised Link Prediction Task with Cognate Transformer","date":"2024-02-05","arxiv_id":"2402.02926","repositories_listed":1,"syntology":null},{"url":"/paper/neural-scaling-laws-on-graphs","slug":"neural-scaling-laws-on-graphs","title":"Towards Neural Scaling Laws on Graphs","date":"2024-02-03","arxiv_id":"2402.02054","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-scaling-laws-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2402.02054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02054"}},"official":{"repos":["liu-jingzhe/graph-scaling-laws"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/no-need-to-look-back-an-efficient-and","slug":"no-need-to-look-back-an-efficient-and","title":"Scalable and Efficient Temporal Graph Representation Learning via Forward Recent Sampling","date":"2024-02-03","arxiv_id":"2402.01964","repositories_listed":1,"syntology":null},{"url":"/paper/prototypical-contrastive-learning-through","slug":"prototypical-contrastive-learning-through","title":"Prototypical Contrastive Learning through Alignment and Uniformity for Recommendation","date":"2024-02-03","arxiv_id":"2402.02079","repositories_listed":1,"syntology":null},{"url":"/paper/rendering-graphs-for-graph-reasoning-in","slug":"rendering-graphs-for-graph-reasoning-in","title":"GITA: Graph to Visual and Textual Integration for Vision-Language Graph Reasoning","date":"2024-02-03","arxiv_id":"2402.02130","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rendering-graphs-for-graph-reasoning-in#ran","syntology_url":"https://syntology.ai/paper/2402.02130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02130"}},"official":{"repos":["WEIYanbin1999/GITA"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-document-level-relation-extraction","slug":"revisiting-document-level-relation-extraction","title":"Revisiting Document-Level Relation Extraction with Context-Guided Link Prediction","date":"2024-01-22","arxiv_id":"2401.11800","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-ontologies-via-incoprorating","slug":"embedding-ontologies-via-incoprorating","title":"Embedding Ontologies via Incorporating Extensional and Intensional Knowledge","date":"2024-01-20","arxiv_id":"2402.01677","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-condensation-for-large-scale","slug":"disentangled-condensation-for-large-scale","title":"Disentangled Condensation for Large-scale Graphs","date":"2024-01-18","arxiv_id":"2401.12231","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-link-prediction-using-graph","slug":"temporal-link-prediction-using-graph","title":"Temporal Link Prediction Using Graph Embedding Dynamics","date":"2024-01-15","arxiv_id":"2401.07516","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-convolutional-networks-with-1","slug":"improving-graph-convolutional-networks-with-1","title":"Improving Graph Convolutional Networks with Transformer Layer in social-based items recommendation","date":"2024-01-12","arxiv_id":"2401.06436","repositories_listed":1,"syntology":null},{"url":"/paper/bringing-back-the-context-camera-trap-species","slug":"bringing-back-the-context-camera-trap-species","title":"Reviving the Context: Camera Trap Species Classification as Link Prediction on Multimodal Knowledge Graphs","date":"2023-12-31","arxiv_id":"2401.00608","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-aggregations-for-high","slug":"hierarchical-aggregations-for-high","title":"Hierarchical Aggregations for High-Dimensional Multiplex Graph Embedding","date":"2023-12-28","arxiv_id":"2312.16834","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coarsening-via-convolution-matching-for","slug":"graph-coarsening-via-convolution-matching-for","title":"Graph Coarsening via Convolution Matching for Scalable Graph Neural Network Training","date":"2023-12-24","arxiv_id":"2312.15520","repositories_listed":1,"syntology":null},{"url":"/paper/do-similar-entities-have-similar-embeddings","slug":"do-similar-entities-have-similar-embeddings","title":"Do Similar Entities have Similar Embeddings?","date":"2023-12-16","arxiv_id":"2312.10370","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-link-prediction-in-knowledge-graphs","slug":"inductive-link-prediction-in-knowledge-graphs","title":"Inductive Link Prediction in Knowledge Graphs using Path-based Neural Networks","date":"2023-12-16","arxiv_id":"2312.10293","repositories_listed":1,"syntology":null},{"url":"/paper/neste-modeling-nested-relational-structures","slug":"neste-modeling-nested-relational-structures","title":"NestE: Modeling Nested Relational Structures for Knowledge Graph Reasoning","date":"2023-12-14","arxiv_id":"2312.09219","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-denoise-unreliable-interactions","slug":"learning-to-denoise-unreliable-interactions","title":"Learning to Denoise Biomedical Knowledge Graph for Robust Molecular Interaction Prediction","date":"2023-12-09","arxiv_id":"2312.06682","repositories_listed":1,"syntology":null},{"url":"/paper/dyport-dynamic-importance-based-hypothesis","slug":"dyport-dynamic-importance-based-hypothesis","title":"Dyport: Dynamic Importance-based Hypothesis Generation Benchmarking Technique","date":"2023-12-06","arxiv_id":"2312.03303","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-initialization-of-graph-neural","slug":"on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02622","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-initialization-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2312.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02622"}},"official":{"repos":["lspongebobjh/virgo_icml2023"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/expressive-sign-equivariant-networks-for-1","slug":"expressive-sign-equivariant-networks-for-1","title":"Expressive Sign Equivariant Networks for Spectral Geometric Learning","date":"2023-12-04","arxiv_id":"2312.02339","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 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) · 3 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/expressive-sign-equivariant-networks-for-1#ran","syntology_url":"https://syntology.ai/paper/2312.02339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02339"}},"official":{"repos":["cptq/sign-equivariant-nets"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":3,"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/new-perspectives-on-the-evaluation-of-link","slug":"new-perspectives-on-the-evaluation-of-link","title":"New Perspectives on the Evaluation of Link Prediction Algorithms for Dynamic Graphs","date":"2023-11-30","arxiv_id":"2311.18486","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-time-granularity-on-temporal-graphs","slug":"exploring-time-granularity-on-temporal-graphs","title":"Exploring Time Granularity on Temporal Graphs for Dynamic Link Prediction in Real-world Networks","date":"2023-11-21","arxiv_id":"2311.12255","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-time-granularity-on-temporal-graphs#ran","syntology_url":"https://syntology.ai/paper/2311.12255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.12255"}},"official":{"repos":["silencex12138/time-granularity-on-temporal-graphs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/cross-view-graph-consistency-learning-for","slug":"cross-view-graph-consistency-learning-for","title":"Cross-View Graph Consistency Learning for Invariant Graph Representations","date":"2023-11-20","arxiv_id":"2311.11821","repositories_listed":1,"syntology":null},{"url":"/paper/causal-question-answering-with-reinforcement","slug":"causal-question-answering-with-reinforcement","title":"Causal Question Answering with Reinforcement Learning","date":"2023-11-05","arxiv_id":"2311.02760","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-network-learning-for-large-scale","slug":"cooperative-network-learning-for-large-scale","title":"Cooperative Network Learning for Large-Scale and Decentralized Graphs","date":"2023-11-03","arxiv_id":"2311.02117","repositories_listed":1,"syntology":null},{"url":"/paper/combating-bilateral-edge-noise-for-robust-1","slug":"combating-bilateral-edge-noise-for-robust-1","title":"Combating Bilateral Edge Noise for Robust Link Prediction","date":"2023-11-02","arxiv_id":"2311.01196","repositories_listed":1,"syntology":{"n":34,"n_ran":20,"n_constructed":2,"n_ran_checked":16,"n_instrument":4,"n_unverified":14,"n_honours":2,"n_violates":1,"n_no_contract":13,"n_pointer_only":19,"phrase":"20 ran (of which 2 constructed an object rather than computing a result; 16 with no instrument failure: 2 honoured, 1 violated, 13 with no contract checked; 4 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/combating-bilateral-edge-noise-for-robust-1#ran","syntology_url":"https://syntology.ai/paper/2311.01196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01196"}},"official":{"repos":["tmlr-group/rgib"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/a-study-on-knowledge-graph-embeddings-and","slug":"a-study-on-knowledge-graph-embeddings-and","title":"A Study on Knowledge Graph Embeddings and Graph Neural Networks for Web Of Things","date":"2023-10-23","arxiv_id":"2310.14866","repositories_listed":1,"syntology":null},{"url":"/paper/universal-knowledge-graph-embeddings","slug":"universal-knowledge-graph-embeddings","title":"Universal Knowledge Graph Embeddings","date":"2023-10-23","arxiv_id":"2310.14899","repositories_listed":1,"syntology":null},{"url":"/paper/towards-enhancing-relational-rules-for","slug":"towards-enhancing-relational-rules-for","title":"Towards Enhancing Relational Rules for Knowledge Graph Link Prediction","date":"2023-10-20","arxiv_id":"2310.13411","repositories_listed":1,"syntology":null},{"url":"/paper/pretraining-language-models-with-text","slug":"pretraining-language-models-with-text","title":"Pretraining Language Models with Text-Attributed Heterogeneous Graphs","date":"2023-10-19","arxiv_id":"2310.12580","repositories_listed":1,"syntology":null},{"url":"/paper/a-benchmark-for-semi-inductive-link","slug":"a-benchmark-for-semi-inductive-link","title":"A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs","date":"2023-10-18","arxiv_id":"2310.11917","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-pairwise-encodings-for-link","slug":"adaptive-pairwise-encodings-for-link","title":"LPFormer: An Adaptive Graph Transformer for Link Prediction","date":"2023-10-17","arxiv_id":"2310.11009","repositories_listed":1,"syntology":null},{"url":"/paper/locally-differentially-private-graph","slug":"locally-differentially-private-graph","title":"Privacy-Preserving Graph Embedding based on Local Differential Privacy","date":"2023-10-17","arxiv_id":"2310.11060","repositories_listed":1,"syntology":null},{"url":"/paper/negative-sampling-with-adaptive-denoising","slug":"negative-sampling-with-adaptive-denoising","title":"Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding","date":"2023-10-15","arxiv_id":"2310.09781","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-link-prediction-via-gnn-layers","slug":"efficient-link-prediction-via-gnn-layers","title":"Efficient Link Prediction via GNN Layers Induced by Negative Sampling","date":"2023-10-14","arxiv_id":"2310.09516","repositories_listed":1,"syntology":null},{"url":"/paper/expanding-the-vocabulary-of-bert-for","slug":"expanding-the-vocabulary-of-bert-for","title":"Expanding the Vocabulary of BERT for Knowledge Base Construction","date":"2023-10-12","arxiv_id":"2310.08291","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-perspective-on-demystifying-gnn","slug":"a-topological-perspective-on-demystifying-gnn","title":"A Topological Perspective on Demystifying GNN-Based Link Prediction Performance","date":"2023-10-06","arxiv_id":"2310.04612","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-topological-perspective-on-demystifying-gnn#ran","syntology_url":"https://syntology.ai/paper/2310.04612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04612"}},"official":{"repos":["yuwvandy/topo_lp_gnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-foundation-models-for-knowledge-graph","slug":"towards-foundation-models-for-knowledge-graph","title":"Towards Foundation Models for Knowledge Graph Reasoning","date":"2023-10-06","arxiv_id":"2310.04562","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-foundation-models-for-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2310.04562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04562"}},"official":{"repos":["DeepGraphLearning/ULTRA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/deephgcn-toward-deeper-hyperbolic-graph","slug":"deephgcn-toward-deeper-hyperbolic-graph","title":"DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networks","date":"2023-10-03","arxiv_id":"2310.02027","repositories_listed":1,"syntology":null},{"url":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1","slug":"deep-insights-into-noisy-pseudo-labeling-on-1","title":"Deep Insights into Noisy Pseudo Labeling on Graph Data","date":"2023-10-02","arxiv_id":"2310.01634","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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/deep-insights-into-noisy-pseudo-labeling-on-1#ran","syntology_url":"https://syntology.ai/paper/2310.01634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01634"}},"official":{"repos":["AcEbt/CPL"],"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/dine-dimensional-interpretability-of-node","slug":"dine-dimensional-interpretability-of-node","title":"DINE: Dimensional Interpretability of Node Embeddings","date":"2023-10-02","arxiv_id":"2310.01162","repositories_listed":1,"syntology":null},{"url":"/paper/etgraph-a-pioneering-dataset-bridging","slug":"etgraph-a-pioneering-dataset-bridging","title":"EX-Graph: A Pioneering Dataset Bridging Ethereum and X","date":"2023-10-02","arxiv_id":"2310.01015","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-link-prediction-a-data-perspective","slug":"revisiting-link-prediction-a-data-perspective","title":"Revisiting Link Prediction: A Data Perspective","date":"2023-10-01","arxiv_id":"2310.00793","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/revisiting-link-prediction-a-data-perspective#ran","syntology_url":"https://syntology.ai/paper/2310.00793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00793"}},"official":{"repos":["juanhui28/heart"],"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/networked-inequality-preferential-attachment","slug":"networked-inequality-preferential-attachment","title":"Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Prediction","date":"2023-09-29","arxiv_id":"2309.17417","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/networked-inequality-preferential-attachment#ran","syntology_url":"https://syntology.ai/paper/2309.17417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.17417"}},"official":{"repos":["arjunsubramonian/link_bias_amplification"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-pre-trained-language-models-for-2","slug":"leveraging-pre-trained-language-models-for-2","title":"Leveraging Pre-trained Language Models for Time Interval Prediction in Text-Enhanced Temporal Knowledge Graphs","date":"2023-09-28","arxiv_id":"2309.16357","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-prompting-with-large-language","slug":"graph-neural-prompting-with-large-language","title":"Graph Neural Prompting with Large Language Models","date":"2023-09-27","arxiv_id":"2309.15427","repositories_listed":1,"syntology":null},{"url":"/paper/kermit-knowledge-graph-completion-of-enhanced","slug":"kermit-knowledge-graph-completion-of-enhanced","title":"KERMIT: Knowledge Graph Completion of Enhanced Relation Modeling with Inverse Transformation","date":"2023-09-26","arxiv_id":"2309.14770","repositories_listed":1,"syntology":null},{"url":"/paper/touchup-g-improving-feature-representation","slug":"touchup-g-improving-feature-representation","title":"TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning","date":"2023-09-25","arxiv_id":"2309.13885","repositories_listed":1,"syntology":null},{"url":"/paper/event-prediction-using-case-based-reasoning","slug":"event-prediction-using-case-based-reasoning","title":"Event Prediction using Case-Based Reasoning over Knowledge Graphs","date":"2023-09-21","arxiv_id":"2309.12423","repositories_listed":1,"syntology":null},{"url":"/paper/human-action-co-occurrence-in-lifestyle-vlogs","slug":"human-action-co-occurrence-in-lifestyle-vlogs","title":"Human Action Co-occurrence in Lifestyle Vlogs using Graph Link Prediction","date":"2023-09-12","arxiv_id":"2309.06219","repositories_listed":1,"syntology":null},{"url":"/paper/2309-05865","slug":"2309-05865","title":"Force-directed graph embedding with hops distance","date":"2023-09-11","arxiv_id":"2309.05865","repositories_listed":1,"syntology":null},{"url":"/paper/circle-feature-graphormer-can-circle-features","slug":"circle-feature-graphormer-can-circle-features","title":"Circle Feature Graphormer: Can Circle Features Stimulate Graph Transformer?","date":"2023-09-11","arxiv_id":"2309.06574","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learning-on-multimodal-knowledge","slug":"end-to-end-learning-on-multimodal-knowledge","title":"End-to-End Learning on Multimodal Knowledge Graphs","date":"2023-09-03","arxiv_id":"2309.01169","repositories_listed":1,"syntology":null},{"url":"/paper/pure-message-passing-can-estimate-common","slug":"pure-message-passing-can-estimate-common","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","date":"2023-09-02","arxiv_id":"2309.00976","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pure-message-passing-can-estimate-common#ran","syntology_url":"https://syntology.ai/paper/2309.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00976"}},"official":{"repos":["Barcavin/efficient-node-labelling"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-text-based-approach-for-link-prediction-on","slug":"a-text-based-approach-for-link-prediction-on","title":"A Text-based Approach For Link Prediction on Wikipedia Articles","date":"2023-09-01","arxiv_id":"2309.00317","repositories_listed":1,"syntology":null},{"url":"/paper/benchtemp-a-general-benchmark-for-evaluating","slug":"benchtemp-a-general-benchmark-for-evaluating","title":"BenchTemp: A General Benchmark for Evaluating Temporal Graph Neural Networks","date":"2023-08-31","arxiv_id":"2308.16385","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchtemp-a-general-benchmark-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2308.16385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16385"}},"official":{"repos":["qianghuangwhu/benchtemp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/companion-animal-disease-diagnostics-based-on","slug":"companion-animal-disease-diagnostics-based-on","title":"Companion Animal Disease Diagnostics based on Literal-aware Medical Knowledge Graph Representation Learning","date":"2023-08-31","arxiv_id":"2309.03219","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-for-wikipedia-articles-as-a","slug":"link-prediction-for-wikipedia-articles-as-a","title":"Link Prediction for Wikipedia Articles as a Natural Language Inference Task","date":"2023-08-31","arxiv_id":"2308.16469","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-membership-latent-distance-model-for","slug":"a-hybrid-membership-latent-distance-model-for","title":"A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks","date":"2023-08-29","arxiv_id":"2308.15293","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-imbalanced-learning-on-graphs","slug":"a-survey-of-imbalanced-learning-on-graphs","title":"A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions","date":"2023-08-26","arxiv_id":"2308.13821","repositories_listed":1,"syntology":null},{"url":"/paper/relational-concept-based-models","slug":"relational-concept-based-models","title":"Relational Concept Bottleneck Models","date":"2023-08-23","arxiv_id":"2308.11991","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/relational-concept-based-models#ran","syntology_url":"https://syntology.ai/paper/2308.11991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11991"}},"official":{"repos":["diligmic/rcbm-neurips2024"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/spear-and-shield-adversarial-attacks-and","slug":"spear-and-shield-adversarial-attacks-and","title":"Spear and Shield: Adversarial Attacks and Defense Methods for Model-Based Link Prediction on Continuous-Time Dynamic Graphs","date":"2023-08-21","arxiv_id":"2308.10779","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-instability-of-graph-neural","slug":"geometric-instability-of-graph-neural","title":"Geometric instability of graph neural networks on large graphs","date":"2023-08-19","arxiv_id":"2308.10099","repositories_listed":1,"syntology":null}],"record_sha256":"0b62512d32ea4f0e016c768a6c17d0199bc25ad9b801fff7a49967d1c04b3f79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}