{"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":"/dataset/sst-2","name":"SST-2","full_name":null,"description_markdown":"The Stanford Sentiment Treebank is a corpus with fully labeled parse trees that allows for a complete analysis of the compositional effects of sentiment in language. The corpus is based on the dataset introduced by Pang and Lee (2005) and consists of 11,855 single sentences extracted from movie reviews. It was parsed with the Stanford parser and includes a total of 215,154 unique phrases from those parse trees, each annotated by 3 human judges.\r\n\r\nBinary classification experiments on full sentences (negative or somewhat negative vs somewhat positive or positive with neutral sentences discarded) refer to the dataset as SST-2 or SST binary.","description_withheld":null,"homepage":"https://github.com/YJiangcm/SST-2-sentiment-analysis","introduced_date":"2013-10-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/recursive-deep-models-for-semantic","title":"Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank","first_author":"Richard Socher","url":null},"license":null,"modalities":[],"tasks":[{"name":"Classification","url":"/task/classification-1","datasets_with_task":"/datasets/task/classification-1"},{"name":"Text Classification","url":"/task/text-classification","datasets_with_task":"/datasets/task/text-classification"},{"name":"Sentiment Analysis","url":"/task/sentiment-analysis","datasets_with_task":"/datasets/task/sentiment-analysis"},{"name":"Few-Shot Learning","url":"/task/few-shot-learning","datasets_with_task":"/datasets/task/few-shot-learning"},{"name":"Explanation Fidelity Evaluation","url":"/task/explanation-fidelity-evaluation","datasets_with_task":"/datasets/task/explanation-fidelity-evaluation"},{"name":"Chinese Sentiment Analysis","url":"/task/chinese-sentiment-analysis","datasets_with_task":"/datasets/task/chinese-sentiment-analysis"}],"languages":[],"variants":["SST-2 Binary classification","SST-2 Binary classification Dev","SST2","sst2-es-mt"],"data_loaders":[{"repo":"https://github.com/p-lambda/dsir","url":"https://github.com/p-lambda/dsir","frameworks":["pytorch"]}],"num_papers_in_archive":1808,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/classification-on-sst-2","task":"Classification","dataset_variant":"SST-2","rows":2,"metrics":["Test Accuracy"],"first_row_in_archive_order":{"model":"OPT-1.3B","paper":"/paper/achieving-dimension-free-communication-in","metrics":{"Test Accuracy":"90.78%"},"code_links":[{"title":"ZidongLiu/DeComFL","url":"https://github.com/ZidongLiu/DeComFL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-classification-on-sst-2","task":"Text Classification","dataset_variant":"SST-2","rows":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"DeBERTa","paper":"/paper/transformers-are-short-text-classifiers-a","metrics":{"Accuracy":"94.78"},"code_links":[{"title":"FKarl/short-text-classification","url":"https://github.com/FKarl/short-text-classification"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":2,"of":2,"counts":{"papers_with_a_benchmark_row":2,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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 with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/achieving-dimension-free-communication-in","slug":"achieving-dimension-free-communication-in","title":"Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization","date":"2024-05-24","arxiv_id":"2405.15861","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ZidongLiu/DeComFL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/achieving-dimension-free-communication-in#ran","syntology_url":"https://syntology.ai/paper/2405.15861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15861"}}}},{"paper":"/paper/transformers-are-short-text-classifiers-a","slug":"transformers-are-short-text-classifiers-a","title":"Transformers are Short Text Classifiers: A Study of Inductive Short Text Classifiers on Benchmarks and Real-world Datasets","date":"2022-11-30","arxiv_id":"2211.16878","rows_on_this_dataset":2,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/achieving-dimension-free-communication-in","slug":"achieving-dimension-free-communication-in","title":"Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization","date":"2024-05-24","arxiv_id":"2405.15861","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ZidongLiu/DeComFL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/achieving-dimension-free-communication-in#ran","syntology_url":"https://syntology.ai/paper/2405.15861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15861"}}}},{"paper":"/paper/transformers-are-short-text-classifiers-a","slug":"transformers-are-short-text-classifiers-a","title":"Transformers are Short Text Classifiers: A Study of Inductive Short Text Classifiers on Benchmarks and Real-world Datasets","date":"2022-11-30","arxiv_id":"2211.16878","rows_on_this_dataset":2,"code_links":1,"syntology":null}],"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/dataset/sst-2/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/sst-2/papers/ran/1","json":"/dataset/sst-2/papers/ran/1.json","rows":1}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":1,"samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":1,"papers_with_a_run_with_no_instrument_failure":1,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_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'","samples_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":17,"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/classification-on-sst-2","since_archive":"/sota/classification-on-sst-2#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/text-classification-on-sst-2","since_archive":"/sota/text-classification-on-sst-2#since-judged","papers_judged":15,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"30ffe6d073151330fcefde5422e1b3c0a43297c5d7851db6eb9e9484a2a45d83","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}