{"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/3","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":12,"rows_per_page":100,"rows":[201,300],"of":1192,"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","prev":"/task/graph-embedding/papers/2","next":"/task/graph-embedding/papers/4","papers":[{"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/knowledge-graph-embeddings-in-the-biomedical","slug":"knowledge-graph-embeddings-in-the-biomedical","title":"Knowledge Graph Embeddings in the Biomedical Domain: Are They Useful? A Look at Link Prediction, Rule Learning, and Downstream Polypharmacy Tasks","date":"2023-05-31","arxiv_id":"2305.19979","repositories_listed":1,"syntology":null},{"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/representation-learning-on-hyper-relational","slug":"representation-learning-on-hyper-relational","title":"Representation Learning on Hyper-Relational and Numeric Knowledge Graphs with Transformers","date":"2023-05-29","arxiv_id":"2305.18256","repositories_listed":1,"syntology":null},{"url":"/paper/an-investigation-of-evaluation-metrics-for","slug":"an-investigation-of-evaluation-metrics-for","title":"An Investigation of Evaluation Metrics for Automated Medical Note Generation","date":"2023-05-27","arxiv_id":"2305.17364","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-turn-your-knowledge-graph-embeddings-1","slug":"how-to-turn-your-knowledge-graph-embeddings-1","title":"How to Turn Your Knowledge Graph Embeddings into Generative Models","date":"2023-05-25","arxiv_id":"2305.15944","repositories_listed":1,"syntology":null},{"url":"/paper/3d-rotation-and-translation-for-hyperbolic","slug":"3d-rotation-and-translation-for-hyperbolic","title":"3D Rotation and Translation for Hyperbolic Knowledge Graph Embedding","date":"2023-05-22","arxiv_id":"2305.13015","repositories_listed":1,"syntology":null},{"url":"/paper/friendly-neighbors-contextualized-sequence-to","slug":"friendly-neighbors-contextualized-sequence-to","title":"Friendly Neighbors: Contextualized Sequence-to-Sequence Link Prediction","date":"2023-05-22","arxiv_id":"2305.13059","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-effect-of-hard-negative","slug":"investigating-the-effect-of-hard-negative","title":"HaSa: Hardness and Structure-Aware Contrastive Knowledge Graph Embedding","date":"2023-05-17","arxiv_id":"2305.10563","repositories_listed":1,"syntology":null},{"url":"/paper/connector-0-5-a-unified-framework-for-graph","slug":"connector-0-5-a-unified-framework-for-graph","title":"Connector 0.5: A unified framework for graph representation learning","date":"2023-04-25","arxiv_id":"2304.13195","repositories_listed":1,"syntology":null},{"url":"/paper/modality-aware-negative-sampling-for-multi","slug":"modality-aware-negative-sampling-for-multi","title":"Modality-Aware Negative Sampling for Multi-modal Knowledge Graph Embedding","date":"2023-04-23","arxiv_id":"2304.11618","repositories_listed":1,"syntology":null},{"url":"/paper/graph-embedding-augmented-skill-rating-system","slug":"graph-embedding-augmented-skill-rating-system","title":"Graph Embedding Augmented Skill Rating System","date":"2023-04-17","arxiv_id":"2304.08257","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-with-3d-compound","slug":"knowledge-graph-embedding-with-3d-compound","title":"Knowledge Graph Embedding with 3D Compound Geometric Transformations","date":"2023-04-01","arxiv_id":"2304.00378","repositories_listed":1,"syntology":null},{"url":"/paper/synergistic-graph-fusion-via-encoder","slug":"synergistic-graph-fusion-via-encoder","title":"Synergistic Graph Fusion via Encoder Embedding","date":"2023-03-31","arxiv_id":"2303.18051","repositories_listed":1,"syntology":null},{"url":"/paper/from-axioms-over-graphs-to-vectors-and-back","slug":"from-axioms-over-graphs-to-vectors-and-back","title":"From axioms over graphs to vectors, and back again: evaluating the properties of graph-based ontology embeddings","date":"2023-03-29","arxiv_id":"2303.16519","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-graph-embedding-with-information","slug":"distributed-graph-embedding-with-information","title":"Distributed Graph Embedding with Information-Oriented Random Walks","date":"2023-03-28","arxiv_id":"2303.15702","repositories_listed":1,"syntology":null},{"url":"/paper/gett-qa-graph-embedding-based-t2t-transformer","slug":"gett-qa-graph-embedding-based-t2t-transformer","title":"GETT-QA: Graph Embedding based T2T Transformer for Knowledge Graph Question Answering","date":"2023-03-23","arxiv_id":"2303.13284","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-transformer-for-point-cloud-based","slug":"revisiting-transformer-for-point-cloud-based","title":"SGFormer: Semantic Graph Transformer for Point Cloud-based 3D Scene Graph Generation","date":"2023-03-20","arxiv_id":"2303.11048","repositories_listed":1,"syntology":null},{"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/ness-learning-node-embeddings-from-static","slug":"ness-learning-node-embeddings-from-static","title":"NESS: Node Embeddings from Static SubGraphs","date":"2023-03-15","arxiv_id":"2303.08958","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-matters-robustness-of-bias","slug":"diversity-matters-robustness-of-bias","title":"Diversity matters: Robustness of bias measurements in Wikidata","date":"2023-02-27","arxiv_id":"2302.14027","repositories_listed":1,"syntology":null},{"url":"/paper/a-parameter-free-graph-reduction-for-spectral","slug":"a-parameter-free-graph-reduction-for-spectral","title":"A parameter-free graph reduction for spectral clustering and SpectralNet","date":"2023-02-25","arxiv_id":"2302.13165","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-tree-similarity-metric-for","slug":"random-projection-tree-similarity-metric-for","title":"Random projection tree similarity metric for SpectralNet","date":"2023-02-25","arxiv_id":"2302.13168","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-density-based","slug":"approximate-spectral-clustering-density-based","title":"Approximate spectral clustering density-based similarity for noisy datasets","date":"2023-02-22","arxiv_id":"2302.11298","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-with","slug":"approximate-spectral-clustering-with","title":"Approximate spectral clustering with eigenvector selection and self-tuned $k$","date":"2023-02-22","arxiv_id":"2302.11297","repositories_listed":1,"syntology":null},{"url":"/paper/graph-construction-using-principal-axis-trees","slug":"graph-construction-using-principal-axis-trees","title":"Graph Construction using Principal Axis Trees for Simple Graph Convolution","date":"2023-02-22","arxiv_id":"2302.12000","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-forest-initialization-for","slug":"random-projection-forest-initialization-for","title":"Random Projection Forest Initialization for Graph Convolutional Networks","date":"2023-02-22","arxiv_id":"2302.12001","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-k-nearest-neighbor-graph-for-a","slug":"refining-a-k-nearest-neighbor-graph-for-a","title":"Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering","date":"2023-02-22","arxiv_id":"2302.11296","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-probabilistic-spatiotemporal-framework","slug":"a-deep-probabilistic-spatiotemporal-framework","title":"A Deep Probabilistic Spatiotemporal Framework for Dynamic Graph Representation Learning with Application to Brain Disorder Identification","date":"2023-02-14","arxiv_id":"2302.07243","repositories_listed":1,"syntology":null},{"url":"/paper/tiger-temporal-interaction-graph-embedding","slug":"tiger-temporal-interaction-graph-embedding","title":"TIGER: Temporal Interaction Graph Embedding with Restarts","date":"2023-02-13","arxiv_id":"2302.06057","repositories_listed":1,"syntology":null},{"url":"/paper/improving-dis-agreement-detection-with","slug":"improving-dis-agreement-detection-with","title":"Improving (Dis)agreement Detection with Inductive Social Relation Information From Comment-Reply Interactions","date":"2023-02-08","arxiv_id":"2302.03950","repositories_listed":1,"syntology":null},{"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/entity-agnostic-representation-learning-for","slug":"entity-agnostic-representation-learning-for","title":"Entity-Agnostic Representation Learning for Parameter-Efficient Knowledge Graph Embedding","date":"2023-02-03","arxiv_id":"2302.01849","repositories_listed":1,"syntology":null},{"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/topologically-regularized-data-embeddings","slug":"topologically-regularized-data-embeddings","title":"Topologically Regularized Data Embeddings","date":"2023-01-09","arxiv_id":"2301.03338","repositories_listed":1,"syntology":null},{"url":"/paper/analogical-inference-enhanced-knowledge-graph","slug":"analogical-inference-enhanced-knowledge-graph","title":"Analogical Inference Enhanced Knowledge Graph Embedding","date":"2023-01-03","arxiv_id":"2301.00982","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/analogical-inference-enhanced-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2301.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00982"}},"official":{"repos":["zjukg/ankge"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/predicting-missing-annotations-in-gene","slug":"predicting-missing-annotations-in-gene","title":"Predicting missing annotations in Gene Ontology with Knowledge Graph Embeddings and True Path Rule","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-over-different-types-of-knowledge","slug":"reasoning-over-different-types-of-knowledge","title":"A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal","date":"2022-12-12","arxiv_id":"2212.05767","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-relation-aware-neighborhood","slug":"efficient-relation-aware-neighborhood","title":"Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition","date":"2022-12-11","arxiv_id":"2212.05581","repositories_listed":1,"syntology":null},{"url":"/paper/dissimilar-nodes-improve-graph-active","slug":"dissimilar-nodes-improve-graph-active","title":"Dissimilar Nodes Improve Graph Active Learning","date":"2022-12-05","arxiv_id":"2212.01968","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-refinement-based-on-triplet","slug":"knowledge-graph-refinement-based-on-triplet","title":"Knowledge Graph Refinement based on Triplet BERT-Networks","date":"2022-11-18","arxiv_id":"2211.10460","repositories_listed":1,"syntology":null},{"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/a-robust-feature-reinforcement-framework-for","slug":"a-robust-feature-reinforcement-framework-for","title":"A robust feature reinforcement framework for heterogeneous graphs neural networks","date":"2022-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hgv4risk-hierarchical-global-view-guided","slug":"hgv4risk-hierarchical-global-view-guided","title":"HGV4Risk: Hierarchical Global View-guided Sequence Representation Learning for Risk Prediction","date":"2022-11-15","arxiv_id":"2211.07956","repositories_listed":1,"syntology":null},{"url":"/paper/deepe-a-deep-neural-network-for-knowledge","slug":"deepe-a-deep-neural-network-for-knowledge","title":"DeepE: a deep neural network for knowledge graph embedding","date":"2022-11-09","arxiv_id":"2211.04620","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-wikidata-s-edit-history-in","slug":"leveraging-wikidata-s-edit-history-in","title":"Leveraging Wikidata's edit history in knowledge graph refinement tasks","date":"2022-10-27","arxiv_id":"2210.15495","repositories_listed":1,"syntology":null},{"url":"/paper/rule-neural-symbolic-knowledge-graph","slug":"rule-neural-symbolic-knowledge-graph","title":"RulE: Knowledge Graph Reasoning with Rule Embedding","date":"2022-10-24","arxiv_id":"2210.14905","repositories_listed":1,"syntology":null},{"url":"/paper/dycsc-modeling-the-evolutionary-process-of","slug":"dycsc-modeling-the-evolutionary-process-of","title":"DyCSC: Modeling the Evolutionary Process of Dynamic Networks Based on Cluster Structure","date":"2022-10-23","arxiv_id":"2210.12690","repositories_listed":1,"syntology":null},{"url":"/paper/along-the-time-timeline-traced-embedding-for","slug":"along-the-time-timeline-traced-embedding-for","title":"Along the Time: Timeline-traced Embedding for Temporal Knowledge Graph Completion","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/metafill-text-infilling-for-meta-path","slug":"metafill-text-infilling-for-meta-path","title":"MetaFill: Text Infilling for Meta-Path Generation on Heterogeneous Information Networks","date":"2022-10-14","arxiv_id":"2210.07488","repositories_listed":1,"syntology":null},{"url":"/paper/entity-aware-negative-sampling-with-auxiliary","slug":"entity-aware-negative-sampling-with-auxiliary","title":"Entity Aware Negative Sampling with Auxiliary Loss of False Negative Prediction for Knowledge Graph Embedding","date":"2022-10-12","arxiv_id":"2210.06242","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-code-summarization-by-embedding-code","slug":"boosting-code-summarization-by-embedding-code","title":"Boosting Code Summarization by Embedding Code Structures","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-hierarchy-aware-quaternion-knowledge","slug":"learning-hierarchy-aware-quaternion-knowledge","title":"Learning Hierarchy-Aware Quaternion Knowledge Graph Embeddings with Representing Relations as 3D Rotations","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/embedding-based-entity-alignment-using","slug":"embedding-based-entity-alignment-using","title":"Embedding-Based Entity Alignment Using Relation Structural Similarity","date":"2022-09-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/geolocation-of-cultural-heritage-using-multi","slug":"geolocation-of-cultural-heritage-using-multi","title":"Geolocation of Cultural Heritage using Multi-View Knowledge Graph Embedding","date":"2022-09-08","arxiv_id":"2209.03638","repositories_listed":1,"syntology":null},{"url":"/paper/repurposing-knowledge-graph-embeddings-for","slug":"repurposing-knowledge-graph-embeddings-for","title":"Repurposing Knowledge Graph Embeddings for Triple Representation via Weak Supervision","date":"2022-08-22","arxiv_id":"2208.10328","repositories_listed":1,"syntology":null},{"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/localized-sparse-incomplete-multi-view","slug":"localized-sparse-incomplete-multi-view","title":"Localized Sparse Incomplete Multi-view Clustering","date":"2022-08-05","arxiv_id":"2208.02998","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-knowledge-graph-embedding-and","slug":"integrating-knowledge-graph-embedding-and","title":"Integrating Knowledge Graph embedding and pretrained Language Models in Hypercomplex Spaces","date":"2022-08-04","arxiv_id":"2208.02743","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-symbolic-computing-with-spiking-neural","slug":"neuro-symbolic-computing-with-spiking-neural","title":"Neuro-symbolic computing with spiking neural networks","date":"2022-08-04","arxiv_id":"2208.02576","repositories_listed":1,"syntology":null},{"url":"/paper/m-text-kg-a-library-for-multi-source","slug":"m-text-kg-a-library-for-multi-source","title":"$μ\\text{KG}$: A Library for Multi-source Knowledge Graph Embeddings and Applications","date":"2022-07-23","arxiv_id":"2207.11442","repositories_listed":1,"syntology":null},{"url":"/paper/a-flexible-pagerank-based-graph-embedding","slug":"a-flexible-pagerank-based-graph-embedding","title":"A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings","date":"2022-07-22","arxiv_id":"2207.11321","repositories_listed":1,"syntology":null},{"url":"/paper/scara-scalable-graph-neural-networks-with","slug":"scara-scalable-graph-neural-networks-with","title":"SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization","date":"2022-07-19","arxiv_id":"2207.09179","repositories_listed":1,"syntology":null},{"url":"/paper/dhge-dual-view-hyper-relational-knowledge","slug":"dhge-dual-view-hyper-relational-knowledge","title":"DHGE: Dual-View Hyper-Relational Knowledge Graph Embedding for Link Prediction and Entity Typing","date":"2022-07-18","arxiv_id":"2207.08562","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-graph-neural-networks-for","slug":"distributed-graph-neural-networks-for","title":"Graph Neural Networks for Distributed Power Allocation in Wireless Networks: Aggregation Over-the-Air","date":"2022-07-18","arxiv_id":"2207.08498","repositories_listed":1,"syntology":null},{"url":"/paper/hardware-agnostic-computation-for-large-scale","slug":"hardware-agnostic-computation-for-large-scale","title":"Hardware-agnostic Computation for Large-scale Knowledge Graph Embeddings","date":"2022-07-18","arxiv_id":"2207.08544","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-graph-learning-via","slug":"differentially-private-graph-learning-via","title":"Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank","date":"2022-07-14","arxiv_id":"2207.06944","repositories_listed":1,"syntology":null},{"url":"/paper/the-dlcc-node-classification-benchmark-for","slug":"the-dlcc-node-classification-benchmark-for","title":"The DLCC Node Classification Benchmark for Analyzing Knowledge Graph Embeddings","date":"2022-07-13","arxiv_id":"2207.06014","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-graph-distance-based-on-l-1","slug":"wasserstein-graph-distance-based-on-l-1","title":"Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees","date":"2022-07-09","arxiv_id":"2207.04216","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-the-effects-of-hyperparameters-on","slug":"assessing-the-effects-of-hyperparameters-on","title":"Assessing the Effects of Hyperparameters on Knowledge Graph Embedding Quality","date":"2022-07-01","arxiv_id":"2207.00473","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-2","slug":"learning-to-borrow-relation-representation-2","title":"Learning to Borrow– Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/comprehensive-analysis-of-negative-sampling","slug":"comprehensive-analysis-of-negative-sampling","title":"Comprehensive Analysis of Negative Sampling in Knowledge Graph Representation Learning","date":"2022-06-21","arxiv_id":"2206.10140","repositories_listed":1,"syntology":null},{"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/embedding-graphs-on-grassmann-manifold","slug":"embedding-graphs-on-grassmann-manifold","title":"Embedding Graphs on Grassmann Manifold","date":"2022-05-30","arxiv_id":"2205.15068","repositories_listed":1,"syntology":null},{"url":"/paper/text-based-automatic-personality-prediction","slug":"text-based-automatic-personality-prediction","title":"Text-Based Automatic Personality Prediction Using KGrAt-Net; A Knowledge Graph Attention Network Classifier","date":"2022-05-27","arxiv_id":"2205.13780","repositories_listed":1,"syntology":null},{"url":"/paper/kronecker-decomposition-for-knowledge-graph","slug":"kronecker-decomposition-for-knowledge-graph","title":"Kronecker Decomposition for Knowledge Graph Embeddings","date":"2022-05-13","arxiv_id":"2205.06560","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-knowledge-graph-embedding","slug":"explainable-knowledge-graph-embedding","title":"Explainable Knowledge Graph Embedding: Inference Reconciliation for Knowledge Inferences Supporting Robot Actions","date":"2022-05-04","arxiv_id":"2205.01836","repositories_listed":1,"syntology":null},{"url":"/paper/cogkge-a-knowledge-graph-embedding-toolkit","slug":"cogkge-a-knowledge-graph-embedding-toolkit","title":"CogKGE: A Knowledge Graph Embedding Toolkit and Benchmark for Representing Multi-source and Heterogeneous Knowledge","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-hyper-parameter-search-for-1","slug":"efficient-hyper-parameter-search-for-1","title":"Efficient Hyper-parameter Search for Knowledge Graph Embedding","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-1","slug":"learning-to-borrow-relation-representation-1","title":"Learning to Borrow -- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-04-27","arxiv_id":"2204.13097","repositories_listed":1,"syntology":null},{"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/temporal-knowledge-graph-reasoning-with-low","slug":"temporal-knowledge-graph-reasoning-with-low","title":"Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations","date":"2022-04-10","arxiv_id":"2204.04783","repositories_listed":1,"syntology":null},{"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/cluster-algebras-network-science-and-machine","slug":"cluster-algebras-network-science-and-machine","title":"Cluster Algebras: Network Science and Machine Learning","date":"2022-03-25","arxiv_id":"2203.13847","repositories_listed":1,"syntology":null},{"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/knowledge-graph-embedding-methods-for-entity","slug":"knowledge-graph-embedding-methods-for-entity","title":"Knowledge Graph Embedding Methods for Entity Alignment: An Experimental Review","date":"2022-03-17","arxiv_id":"2203.09280","repositories_listed":1,"syntology":null},{"url":"/paper/linking-theories-and-methods-in-cognitive","slug":"linking-theories-and-methods-in-cognitive","title":"Linking Theories and Methods in Cognitive Sciences via Joint Embedding of the Scientific Literature: The Example of Cognitive Control","date":"2022-03-16","arxiv_id":"2203.11016","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-memory-sparse-kernels-for-machine","slug":"distributed-memory-sparse-kernels-for-machine","title":"Distributed-Memory Sparse Kernels for Machine Learning","date":"2022-03-15","arxiv_id":"2203.07673","repositories_listed":1,"syntology":null},{"url":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","repositories_listed":1,"syntology":null},{"url":"/paper/cake-a-scalable-commonsense-aware-framework","slug":"cake-a-scalable-commonsense-aware-framework","title":"CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion","date":"2022-02-25","arxiv_id":"2202.13785","repositories_listed":1,"syntology":null},{"url":"/paper/neuralkg-an-open-source-library-for-diverse","slug":"neuralkg-an-open-source-library-for-diverse","title":"NeuralKG: An Open Source Library for Diverse Representation Learning of Knowledge Graphs","date":"2022-02-25","arxiv_id":"2202.12571","repositories_listed":1,"syntology":null},{"url":"/paper/arm3d-attention-based-relation-module-for","slug":"arm3d-attention-based-relation-module-for","title":"ARM3D: Attention-based relation module for indoor 3D object detection","date":"2022-02-20","arxiv_id":"2202.09715","repositories_listed":1,"syntology":null},{"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/graph-neural-network-for-local-corruption","slug":"graph-neural-network-for-local-corruption","title":"Robust Graph Representation Learning for Local Corruption Recovery","date":"2022-02-10","arxiv_id":"2202.04936","repositories_listed":1,"syntology":null}],"record_sha256":"6db3c43c11ff1e2604fe443d997f6fb2ef3f302c1f3b7d1086eb5648d4b2da88","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}