{"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/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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":21,"of":21,"of_with_code":9,"tagged_in_all":21,"counts":{"archive_papers_tagged":21,"with_a_code_link":9,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":21,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":2,"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"},"items":[{"url":"/paper/csgdn-contrastive-signed-graph-diffusion","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"3 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/se-sgformer-a-self-explainable-signed-graph#ran","syntology_url":"https://syntology.ai/paper/2408.08754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08754"}},"official":{"repos":["liule66/SE-SGformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/csg-curriculum-representation-learning-for","slug":"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","slug":"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":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sssnet-semi-supervised-signed-network#ran","syntology_url":"https://syntology.ai/paper/2110.06623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.06623"}},"official":{"repos":["sherylhyx/sssnet_signed_clustering"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/signed-bipartite-graph-neural-networks","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/signed-bipartite-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2108.09638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09638"}},"official":{"repos":["huangjunjie-cs/SBGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/decoupled-variational-embedding-for-signed","slug":"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","slug":"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","slug":"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","slug":"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},{"url":null,"slug":"kan-kan-buff-signed-graph-neural-networks","title":"KAN KAN Buff Signed Graph Neural Networks?","date":"2025-01-01","arxiv_id":"2501.00709","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-and-lightweight-representation","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","date":"2024-12-25","arxiv_id":"2412.18720","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-spring-neural-odes-for-link-sign","title":"Graph Spring Neural ODEs for Link Sign Prediction","date":"2024-12-17","arxiv_id":"2412.12916","repositories_listed":0,"syntology":null},{"url":null,"slug":"dropedge-not-foolproof-effective-augmentation","title":"DropEdge not Foolproof: Effective Augmentation Method for Signed Graph Neural Networks","date":"2024-09-29","arxiv_id":"2409.19620","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarially-robust-signed-graph-contrastive","title":"Adversarial Robustness of Link Sign Prediction in Signed Graphs","date":"2024-01-19","arxiv_id":"2401.10590","repositories_listed":0,"syntology":null},{"url":null,"slug":"sga-a-graph-augmentation-method-for-signed","title":"SGA: A Graph Augmentation Method for Signed Graph Neural Networks","date":"2023-10-15","arxiv_id":"2310.09705","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-signed-subgraph-encoding-approach-via","title":"A Signed Subgraph Encoding Approach via Linear Optimization for Link Sign Prediction","date":"2023-05-17","arxiv_id":"2305.09869","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-convolution-for-signed-directed","title":"A Graph Convolution for Signed Directed Graphs","date":"2022-08-23","arxiv_id":"2208.11511","repositories_listed":0,"syntology":null},{"url":null,"slug":"signed-graph-neural-networks-a-frequency","title":"Signed Graph Neural Networks: A Frequency Perspective","date":"2022-08-15","arxiv_id":"2208.07323","repositories_listed":0,"syntology":null},{"url":null,"slug":"signed-link-representation-in-continuous-time","title":"Representation Learning in Continuous-Time Dynamic Signed Networks","date":"2022-07-07","arxiv_id":"2207.03408","repositories_listed":0,"syntology":null},{"url":null,"slug":"wsgat-weighted-and-signed-graph-attention","title":"wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction","date":"2021-09-21","arxiv_id":"2109.11519","repositories_listed":0,"syntology":null},{"url":null,"slug":"signed-graph-diffusion-network-1","title":"Signed Graph Diffusion Network","date":"2020-12-28","arxiv_id":"2012.14191","repositories_listed":0,"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"},"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)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/link-sign-prediction-on-bitcoin-alpha","since_archive":"/sota/link-sign-prediction-on-bitcoin-alpha#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/task/link-sign-prediction/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/link-sign-prediction/papers/ran/1","json":"/task/link-sign-prediction/papers/ran/1.json","rows":3}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"a3e71a0edaaf49a251a6d5a120544dffeddca516366b0dd78171d79691583702","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}