{"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/bigcn","slug":"bigcn","name":"BiGCN","full_name":"Bi-Directional Graph Convolutional Network","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks","paper":"/paper/rumor-detection-on-social-media-with-bi","first_author":"Tian Bian","n_authors":7,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/rumor-detection-on-social-media-with-bi"},"source":{"url":"https://arxiv.org/abs/2001.06362v1","title":"Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":"/paper/bigcn-leveraging-cell-and-gene-similarities","slug":"bigcn-leveraging-cell-and-gene-similarities","title":"BiGCN: Leveraging Cell and Gene Similarities for Single-cell Transcriptome Imputation with Bi-Graph Convolutional Networks","date":"2024-04-10","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/user-preference-aware-fake-news-detection","slug":"user-preference-aware-fake-news-detection","title":"User Preference-aware Fake News Detection","date":"2021-04-25","arxiv_id":"2104.12259","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["safe-graph/GNN-FakeNews"],"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"]}}},{"paper":null,"slug":"bigcn-a-bi-directional-low-pass-filtering-1","title":"BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network","date":"2021-01-14","arxiv_id":"2101.05519","n_code_links":0,"syntology":null},{"paper":"/paper/rumor-detection-on-social-media-with-bi","slug":"rumor-detection-on-social-media-with-bi","title":"Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks","date":"2020-01-17","arxiv_id":"2001.06362","n_code_links":2,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":3,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"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":1,"papers_where_code_ran_first_page":"/method/bigcn/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/bigcn/papers/ran/1","json":"/method/bigcn/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/fact-checking","name":"Fact Checking","papers":1},{"task":"/task/fake-news-detection","name":"Fake News Detection","papers":1},{"task":"/task/graph-classification","name":"Graph Classification","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/imputation","name":"Imputation","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/misinformation","name":"Misinformation","papers":1},{"task":"/task/node-classification","name":"Node Classification","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":2},{"year":"2024","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/bigcn"},"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=BiGCN","read_at":"2026-10-05T00:53:08+00:00","query":"BiGCN","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2001.06362","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2101.05519","title":"BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network","citations":8,"named_by":["title_prefix"],"bearer_name":"BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network","ask_with":"have('2101.05519')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'BiGCN' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network' (arXiv:2101.05519, 8 citations). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network” (arXiv:2101.05519, 8 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"9b0572e5d3939cab2af6d4b8f4efef9cc8205ac9c97d9303989395454eb29547","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}