{"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":"/method/safran","slug":"safran","name":"SAFRAN","full_name":"SAFRAN - Scalable and fast non-redundant rule application","full_name_withheld":false,"description_markdown":"SAFRAN is a rule application framework which aggregates rules through a scalable clustering algorithm.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","paper":"/paper/scalable-and-interpretable-rule-based-link","first_author":"Simon Ott","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/scalable-and-interpretable-rule-based-link"},"source":{"url":"https://arxiv.org/abs/2012.05750v1","title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Rule-based systems","url":"/methods/category/rule-based-systems","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":"/paper/safran-an-interpretable-rule-based-link","slug":"safran-an-interpretable-rule-based-link","title":"SAFRAN: An interpretable, rule-based link prediction method outperforming embedding models","date":"2021-09-16","arxiv_id":"2109.08002","n_code_links":1,"syntology":null},{"paper":"/paper/scalable-and-interpretable-rule-based-link","slug":"scalable-and-interpretable-rule-based-link","title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","date":"2020-12-10","arxiv_id":"2012.05750","n_code_links":1,"syntology":null}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":2,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":2},{"task":"/task/link-prediction","name":"Link Prediction","papers":2},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1}],"tasks_shown":4,"n_tasks":4,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/safran"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=SAFRAN","read_at":"2026-10-05T01:01:30+00:00","query":"SAFRAN","kind":"paper","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2109.08002"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2012.05750","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2109.08002","citations":45},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'SAFRAN'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2109.08002","page":"/paper/safran-an-interpretable-rule-based-link","syntology_url":"https://syntology.ai/paper/2109.08002","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2109.08002: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:2109.08002, not a method entry. About another paper: this answer is about arXiv:2109.08002, while the archive credits arXiv:2012.05750.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"278bb59913da7df325fc174aec87881f8bf4315d920251a64aea3f8954b369a0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}