{"url":"/task/link-sign-prediction","name":"Link Sign Prediction","slug":"link-sign-prediction","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":21,"papers_with_code":9,"benchmarks":3,"benchmark_tables_in_archive":3,"benchmark_tables_shown":3,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/link-sign-prediction-on-bitcoin-alpha","slug":"link-sign-prediction-on-bitcoin-alpha","dataset":"Bitcoin-Alpha","dataset_url":null,"rows_in_archive":2,"metrics":["AUC","Accuracy","Macro-F1"],"first_row_in_archive_order":{"model":"SiGAT","paper_title":"Signed Graph Attention Networks","paper_url":"/paper/signed-graph-attention-networks","paper_date":"2019-06-26","arxiv_id":"1906.10958","code_links":[{"title":"huangjunjie95/SiGAT","url":"https://github.com/huangjunjie95/SiGAT"}],"syntology":null}},{"leaderboard":"/sota/link-sign-prediction-on-epinions","slug":"link-sign-prediction-on-epinions","dataset":"Epinions","dataset_url":"/dataset/epinions","rows_in_archive":2,"metrics":["AUC","Accuracy","Macro-F1"],"first_row_in_archive_order":{"model":"SiGAT","paper_title":"Signed Graph Attention Networks","paper_url":"/paper/signed-graph-attention-networks","paper_date":"2019-06-26","arxiv_id":"1906.10958","code_links":[{"title":"huangjunjie95/SiGAT","url":"https://github.com/huangjunjie95/SiGAT"}],"syntology":null}},{"leaderboard":"/sota/link-sign-prediction-on-slashdot","slug":"link-sign-prediction-on-slashdot","dataset":"Slashdot","dataset_url":"/dataset/slashdot","rows_in_archive":2,"metrics":["AUC","Accuracy","Macro-F1"],"first_row_in_archive_order":{"model":"SiGAT","paper_title":"Signed Graph Attention Networks","paper_url":"/paper/signed-graph-attention-networks","paper_date":"2019-06-26","arxiv_id":"1906.10958","code_links":[{"title":"huangjunjie95/SiGAT","url":"https://github.com/huangjunjie95/SiGAT"}],"syntology":null}}],"datasets":[{"url":"/dataset/slashdot","name":"Slashdot","full_name":"","num_papers_in_archive":57},{"url":"/dataset/epinions","name":"Epinions","full_name":null,"num_papers_in_archive":54}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":9,"of":9,"tagged_in_all":21,"items":[{"url":"/paper/csgdn-contrastive-signed-graph-diffusion","title":"CSGDN: Contrastive Signed Graph Diffusion Network for Predicting Crop Gene-phenotype Associations","date":"2024-10-10","arxiv_id":"2410.07511","repositories_listed":1,"syntology":null},{"url":"/paper/se-sgformer-a-self-explainable-signed-graph","title":"Self-Explainable Graph Transformer for Link Sign Prediction","date":"2024-08-16","arxiv_id":"2408.08754","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_unverified":6,"n_pointer_only":9}},{"url":"/paper/csg-curriculum-representation-learning-for","title":"Enhancing Signed Graph Neural Networks through Curriculum-Based Training","date":"2023-10-17","arxiv_id":"2310.11083","repositories_listed":1,"syntology":null},{"url":"/paper/sssnet-semi-supervised-signed-network","title":"SSSNET: Semi-Supervised Signed Network Clustering","date":"2021-10-13","arxiv_id":"2110.06623","repositories_listed":1,"syntology":{"n":13,"n_ran":1,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/signed-bipartite-graph-neural-networks","title":"Signed Bipartite Graph Neural Networks","date":"2021-08-22","arxiv_id":"2108.09638","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/decoupled-variational-embedding-for-signed","title":"Decoupled Variational Embedding for Signed Directed Networks","date":"2020-08-28","arxiv_id":"2008.12450","repositories_listed":1,"syntology":null},{"url":"/paper/learning-opinion-dynamics-from-social-traces","title":"Learning Opinion Dynamics From Social Traces","date":"2020-06-02","arxiv_id":"2006.01673","repositories_listed":1,"syntology":null},{"url":"/paper/signed-graph-attention-networks","title":"Signed Graph Attention Networks","date":"2019-06-26","arxiv_id":"1906.10958","repositories_listed":1,"syntology":null},{"url":"/paper/deep-network-embedding-for-graph","title":"Deep Network Embedding for Graph Representation Learning in Signed Networks","date":"2019-01-07","arxiv_id":"1901.01718","repositories_listed":1,"syntology":null}],"syntology_records":3,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}