{"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/inductive-link-prediction/papers/ran/1","list_of":"/task/inductive-link-prediction","task":"Inductive 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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,5],"of":5,"counts":{"archive_papers_tagged":32,"with_a_code_link":23,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/inductive-link-prediction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/neighborhood-aware-scalable-temporal-network","slug":"neighborhood-aware-scalable-temporal-network","title":"Neighborhood-aware Scalable Temporal Network Representation Learning","date":"2022-09-02","arxiv_id":"2209.01084","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/neighborhood-aware-scalable-temporal-network#ran","syntology_url":"https://syntology.ai/paper/2209.01084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.01084"}},"official":{"repos":["graph-com/neighborhood-aware-temporal-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/subgraph-neighboring-relations-infomax-for","slug":"subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","arxiv_id":"2208.00850","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":7,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/subgraph-neighboring-relations-infomax-for#ran","syntology_url":"https://syntology.ai/paper/2208.00850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.00850"}},"official":{"repos":["Tebmer/SNRI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/topology-aware-correlations-between-relations","slug":"topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","arxiv_id":"2103.03642","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/topology-aware-correlations-between-relations#ran","syntology_url":"https://syntology.ai/paper/2103.03642","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03642"}},"official":{"repos":["MIRALab-USTC/KG-TACT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-link-prediction-for-nodes-having","slug":"inductive-link-prediction-for-nodes-having","title":"Inductive Link Prediction for Nodes Having Only Attribute Information","date":"2020-07-16","arxiv_id":"2007.08053","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/inductive-link-prediction-for-nodes-having#ran","syntology_url":"https://syntology.ai/paper/2007.08053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08053"}},"official":{"repos":["working-yuhao/DEAL"],"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"]}}}],"record_sha256":"e2648b4de43bec981c51377ca3df00a84a2aa2b76856b7d279c539bfa74e3393","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}