{"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/text-classification-1/papers/2","list_of":"/task/text-classification-1","task":"text-classification","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":31,"rows_per_page":100,"rows":[101,200],"of":3054,"counts":{"archive_papers_tagged":3054,"with_a_code_link":1083,"where_syntology_ran_a_sample":204,"not_listed_spam_title":0,"listed":3054,"listed_where_code_ran":204,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":161,"every_run_a_failure_of_syntologys_instrument":43,"listed_with_a_run_with_no_instrument_failure":161,"listed_every_run_a_failure_of_syntologys_instrument":43,"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"},"first_page":"/task/text-classification-1","prev":"/task/text-classification-1","next":"/task/text-classification-1/papers/3","papers":[{"url":"/paper/sampling-bias-in-deep-active-classification","slug":"sampling-bias-in-deep-active-classification","title":"Sampling Bias in Deep Active Classification: An Empirical Study","date":"2019-09-20","arxiv_id":"1909.09389","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sampling-bias-in-deep-active-classification#ran","syntology_url":"https://syntology.ai/paper/1909.09389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09389"}},"official":{"repos":["drimpossible/Sampling-Bias-Active-Learning","Xtra-Computing/thundersvm"],"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"]}}},{"url":"/paper/message-passing-attention-networks-for","slug":"message-passing-attention-networks-for","title":"Message Passing Attention Networks for Document Understanding","date":"2019-08-17","arxiv_id":"1908.06267","repositories_listed":2,"syntology":null},{"url":"/paper/few-shot-text-classification-with","slug":"few-shot-text-classification-with","title":"Few-shot Text Classification with Distributional Signatures","date":"2019-08-16","arxiv_id":"1908.06039","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1908.06039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06039"}},"official":{"repos":["YujiaBao/Distributional-Signatures"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/delta-a-deep-learning-based-language","slug":"delta-a-deep-learning-based-language","title":"DELTA: A DEep learning based Language Technology plAtform","date":"2019-08-02","arxiv_id":"1908.01853","repositories_listed":2,"syntology":null},{"url":"/paper/robust-to-noise-models-in-natural-language","slug":"robust-to-noise-models-in-natural-language","title":"Robust to Noise Models in Natural Language Processing Tasks","date":"2019-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/episodic-memory-in-lifelong-language-learning","slug":"episodic-memory-in-lifelong-language-learning","title":"Episodic Memory in Lifelong Language Learning","date":"2019-06-03","arxiv_id":"1906.01076","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/episodic-memory-in-lifelong-language-learning#ran","syntology_url":"https://syntology.ai/paper/1906.01076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01076"}},"official":null}},{"url":"/paper/text-classification-algorithms-a-survey","slug":"text-classification-algorithms-a-survey","title":"Text Classification Algorithms: A Survey","date":"2019-04-17","arxiv_id":"1904.08067","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/text-classification-algorithms-a-survey#ran","syntology_url":"https://syntology.ai/paper/1904.08067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08067"}},"official":{"repos":["kk7nc/Text_Classification"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/integrating-semantic-knowledge-to-tackle-zero","slug":"integrating-semantic-knowledge-to-tackle-zero","title":"Integrating Semantic Knowledge to Tackle Zero-shot Text Classification","date":"2019-03-29","arxiv_id":"1903.12626","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/integrating-semantic-knowledge-to-tackle-zero#ran","syntology_url":"https://syntology.ai/paper/1903.12626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12626"}},"official":{"repos":["JingqingZ/KG4ZeroShotText"],"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/gans-for-semi-supervised-opinion-spam","slug":"gans-for-semi-supervised-opinion-spam","title":"GANs for Semi-Supervised Opinion Spam Detection","date":"2019-03-19","arxiv_id":"1903.08289","repositories_listed":2,"syntology":null},{"url":"/paper/categorical-metadata-representation-for","slug":"categorical-metadata-representation-for","title":"Categorical Metadata Representation for Customized Text Classification","date":"2019-02-14","arxiv_id":"1902.05196","repositories_listed":2,"syntology":null},{"url":"/paper/funnelling-a-new-ensemble-method-for","slug":"funnelling-a-new-ensemble-method-for","title":"Funnelling: A New Ensemble Method for Heterogeneous Transfer Learning and its Application to Cross-Lingual Text Classification","date":"2019-01-31","arxiv_id":"1901.11459","repositories_listed":2,"syntology":null},{"url":"/paper/glyce-glyph-vectors-for-chinese-character","slug":"glyce-glyph-vectors-for-chinese-character","title":"Glyce: Glyph-vectors for Chinese Character Representations","date":"2019-01-29","arxiv_id":"1901.10125","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glyce-glyph-vectors-for-chinese-character#ran","syntology_url":"https://syntology.ai/paper/1901.10125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10125"}},"official":{"repos":["ShannonAI/glyce"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-convolutional-neural-networks","slug":"understanding-convolutional-neural-networks","title":"Understanding Convolutional Neural Networks for Text Classification","date":"2018-09-21","arxiv_id":"1809.08037","repositories_listed":2,"syntology":null},{"url":"/paper/frage-frequency-agnostic-word-representation","slug":"frage-frequency-agnostic-word-representation","title":"FRAGE: Frequency-Agnostic Word Representation","date":"2018-09-18","arxiv_id":"1809.06858","repositories_listed":2,"syntology":null},{"url":"/paper/stance-prediction-for-russian-data-and","slug":"stance-prediction-for-russian-data-and","title":"Stance Prediction for Russian: Data and Analysis","date":"2018-09-05","arxiv_id":"1809.01574","repositories_listed":2,"syntology":null},{"url":"/paper/learning-representations-for-soft-skill","slug":"learning-representations-for-soft-skill","title":"Learning Representations for Soft Skill Matching","date":"2018-07-20","arxiv_id":"1807.07741","repositories_listed":2,"syntology":null},{"url":"/paper/representation-learning-of-entities-and","slug":"representation-learning-of-entities-and","title":"Representation Learning of Entities and Documents from Knowledge Base Descriptions","date":"2018-06-08","arxiv_id":"1806.02960","repositories_listed":2,"syntology":null},{"url":"/paper/information-aggregation-via-dynamic-routing","slug":"information-aggregation-via-dynamic-routing","title":"Information Aggregation via Dynamic Routing for Sequence Encoding","date":"2018-06-05","arxiv_id":"1806.01501","repositories_listed":2,"syntology":null},{"url":"/paper/diverse-few-shot-text-classification-with","slug":"diverse-few-shot-text-classification-with","title":"Diverse Few-Shot Text Classification with Multiple Metrics","date":"2018-05-19","arxiv_id":"1805.07513","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diverse-few-shot-text-classification-with#ran","syntology_url":"https://syntology.ai/paper/1805.07513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07513"}},"official":{"repos":["Gorov/DiverseFewShot_Amazon"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/contextual-augmentation-data-augmentation-by","slug":"contextual-augmentation-data-augmentation-by","title":"Contextual Augmentation: Data Augmentation by Words with Paradigmatic Relations","date":"2018-05-16","arxiv_id":"1805.06201","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/contextual-augmentation-data-augmentation-by#ran","syntology_url":"https://syntology.ai/paper/1805.06201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06201"}},"official":{"repos":["pfnet-research/contextual_augmentation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/sopa-bridging-cnns-rnns-and-weighted-finite","slug":"sopa-bridging-cnns-rnns-and-weighted-finite","title":"SoPa: Bridging CNNs, RNNs, and Weighted Finite-State Machines","date":"2018-05-15","arxiv_id":"1805.06061","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sopa-bridging-cnns-rnns-and-weighted-finite#ran","syntology_url":"https://syntology.ai/paper/1805.06061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06061"}},"official":{"repos":["Noahs-ARK/soft_patterns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/textual-membership-queries","slug":"textual-membership-queries","title":"Textual Membership Queries","date":"2018-05-11","arxiv_id":"1805.04609","repositories_listed":2,"syntology":null},{"url":"/paper/joint-embedding-of-words-and-labels-for-text","slug":"joint-embedding-of-words-and-labels-for-text","title":"Joint Embedding of Words and Labels for Text Classification","date":"2018-05-10","arxiv_id":"1805.04174","repositories_listed":2,"syntology":null},{"url":"/paper/black-box-generation-of-adversarial-text","slug":"black-box-generation-of-adversarial-text","title":"Black-box Generation of Adversarial Text Sequences to Evade Deep Learning Classifiers","date":"2018-01-13","arxiv_id":"1801.04354","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/black-box-generation-of-adversarial-text#ran","syntology_url":"https://syntology.ai/paper/1801.04354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.04354"}},"official":{"repos":["QData/deepWordBug"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hotflip-white-box-adversarial-examples-for","slug":"hotflip-white-box-adversarial-examples-for","title":"HotFlip: White-Box Adversarial Examples for Text Classification","date":"2017-12-19","arxiv_id":"1712.06751","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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","sample_list":"/paper/hotflip-white-box-adversarial-examples-for#ran","syntology_url":"https://syntology.ai/paper/1712.06751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.06751"}},"official":null}},{"url":"/paper/towards-better-understanding-of-gradient","slug":"towards-better-understanding-of-gradient","title":"Towards better understanding of gradient-based attribution methods for Deep Neural Networks","date":"2017-11-16","arxiv_id":"1711.06104","repositories_listed":2,"syntology":null},{"url":"/paper/learning-character-level-compositionality","slug":"learning-character-level-compositionality","title":"Learning Character-level Compositionality with Visual Features","date":"2017-04-17","arxiv_id":"1704.04859","repositories_listed":2,"syntology":null},{"url":"/paper/generative-and-discriminative-text","slug":"generative-and-discriminative-text","title":"Generative and Discriminative Text Classification with Recurrent Neural Networks","date":"2017-03-06","arxiv_id":"1703.01898","repositories_listed":2,"syntology":null},{"url":"/paper/rationale-augmented-convolutional-neural","slug":"rationale-augmented-convolutional-neural","title":"Rationale-Augmented Convolutional Neural Networks for Text Classification","date":"2016-05-14","arxiv_id":"1605.04469","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-short-text-classification-with","slug":"sequential-short-text-classification-with","title":"Sequential Short-Text Classification with Recurrent and Convolutional Neural Networks","date":"2016-03-12","arxiv_id":"1603.03827","repositories_listed":2,"syntology":null},{"url":"/paper/expectation-backpropagation-parameter-free","slug":"expectation-backpropagation-parameter-free","title":"Expectation Backpropagation: Parameter-Free Training of Multilayer Neural Networks with Continuous or Discrete Weights","date":"2014-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/naive-bayes-and-text-classification-i","slug":"naive-bayes-and-text-classification-i","title":"Naive Bayes and Text Classification I - Introduction and Theory","date":"2014-10-16","arxiv_id":"1410.5329","repositories_listed":2,"syntology":null},{"url":"/paper/evaluation-measures-for-hierarchical","slug":"evaluation-measures-for-hierarchical","title":"Evaluation Measures for Hierarchical Classification: a unified view and novel approaches","date":"2013-06-28","arxiv_id":"1306.6802","repositories_listed":2,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evaluation-measures-for-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1306.6802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1306.6802"}},"official":null}},{"url":"/paper/latent-dirichlet-allocation","slug":"latent-dirichlet-allocation","title":"Latent Dirichlet Allocation","date":"2003-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/making-language-model-a-hierarchical","slug":"making-language-model-a-hierarchical","title":"Making Language Model a Hierarchical Classifier and Generator","date":"2025-07-17","arxiv_id":"2507.12930","repositories_listed":1,"syntology":null},{"url":"/paper/gnn-cnn-an-efficient-hybrid-model-of-1","slug":"gnn-cnn-an-efficient-hybrid-model-of-1","title":"GNN-CNN: An Efficient Hybrid Model of Convolutional and Graph Neural Networks for Text Representation","date":"2025-07-10","arxiv_id":"2507.07414","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-of-misinformation-classification","slug":"robustness-of-misinformation-classification","title":"Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttack","date":"2025-06-30","arxiv_id":"2506.23661","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-candidates-then-distill-a-teacher","slug":"prompt-candidates-then-distill-a-teacher","title":"Prompt Candidates, then Distill: A Teacher-Student Framework for LLM-driven Data Annotation","date":"2025-06-04","arxiv_id":"2506.03857","repositories_listed":1,"syntology":null},{"url":"/paper/guarded-query-routing-for-large-language","slug":"guarded-query-routing-for-large-language","title":"Guarded Query Routing for Large Language Models","date":"2025-05-20","arxiv_id":"2505.14524","repositories_listed":1,"syntology":null},{"url":"/paper/prl-prompts-from-reinforcement-learning","slug":"prl-prompts-from-reinforcement-learning","title":"PRL: Prompts from Reinforcement Learning","date":"2025-05-20","arxiv_id":"2505.14412","repositories_listed":1,"syntology":null},{"url":"/paper/the-ripple-effect-on-unforeseen-complications","slug":"the-ripple-effect-on-unforeseen-complications","title":"The Ripple Effect: On Unforeseen Complications of Backdoor Attacks","date":"2025-05-16","arxiv_id":"2505.11586","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-ripple-effect-on-unforeseen-complications#ran","syntology_url":"https://syntology.ai/paper/2505.11586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.11586"}},"official":{"repos":["zhangrui4041/backdoor_complications"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fnbench-benchmarking-robust-federated","slug":"fnbench-benchmarking-robust-federated","title":"FNBench: Benchmarking Robust Federated Learning against Noisy Labels","date":"2025-05-10","arxiv_id":"2505.06684","repositories_listed":1,"syntology":null},{"url":"/paper/short-circuiting-shortcuts-mechanistic","slug":"short-circuiting-shortcuts-mechanistic","title":"Short-circuiting Shortcuts: Mechanistic Investigation of Shortcuts in Text Classification","date":"2025-05-09","arxiv_id":"2505.06032","repositories_listed":1,"syntology":null},{"url":"/paper/kg-htc-integrating-knowledge-graphs-into-llms","slug":"kg-htc-integrating-knowledge-graphs-into-llms","title":"KG-HTC: Integrating Knowledge Graphs into LLMs for Effective Zero-shot Hierarchical Text Classification","date":"2025-05-08","arxiv_id":"2505.05583","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-cooperative-rationalization-the","slug":"adversarial-cooperative-rationalization-the","title":"Adversarial Cooperative Rationalization: The Risk of Spurious Correlations in Even Clean Datasets","date":"2025-05-04","arxiv_id":"2505.02118","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/adversarial-cooperative-rationalization-the#ran","syntology_url":"https://syntology.ai/paper/2505.02118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.02118"}},"official":{"repos":["jugechengzi/rationalization-a2i"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-ensemble-strategy-for-llm-inference","slug":"a-simple-ensemble-strategy-for-llm-inference","title":"A Simple Ensemble Strategy for LLM Inference: Towards More Stable Text Classification","date":"2025-04-26","arxiv_id":"2504.18884","repositories_listed":1,"syntology":null},{"url":"/paper/automated-bug-report-prioritization-in-large","slug":"automated-bug-report-prioritization-in-large","title":"Automated Bug Report Prioritization in Large Open-Source Projects","date":"2025-04-22","arxiv_id":"2504.15912","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-training-approach-for-text","slug":"a-new-training-approach-for-text","title":"A new training approach for text classification in Mental Health: LatentGLoss","date":"2025-04-09","arxiv_id":"2504.07245","repositories_listed":1,"syntology":null},{"url":"/paper/linguistic-interpretability-of-transformer","slug":"linguistic-interpretability-of-transformer","title":"Linguistic Interpretability of Transformer-based Language Models: a systematic review","date":"2025-04-09","arxiv_id":"2504.08001","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-the-next-token-towards-prompt-robust","slug":"beyond-the-next-token-towards-prompt-robust","title":"Beyond the Next Token: Towards Prompt-Robust Zero-Shot Classification via Efficient Multi-Token Prediction","date":"2025-04-04","arxiv_id":"2504.03159","repositories_listed":1,"syntology":null},{"url":"/paper/a-thorough-benchmark-of-automatic-text","slug":"a-thorough-benchmark-of-automatic-text","title":"A thorough benchmark of automatic text classification: From traditional approaches to large language models","date":"2025-04-02","arxiv_id":"2504.01930","repositories_listed":1,"syntology":null},{"url":"/paper/sun-shine-a-large-language-model-for-tibetan","slug":"sun-shine-a-large-language-model-for-tibetan","title":"Sun-Shine: A Large Language Model for Tibetan Culture","date":"2025-03-24","arxiv_id":"2503.18288","repositories_listed":1,"syntology":null},{"url":"/paper/corrective-in-context-learning-evaluating","slug":"corrective-in-context-learning-evaluating","title":"Corrective In-Context Learning: Evaluating Self-Correction in Large Language Models","date":"2025-03-20","arxiv_id":"2503.16022","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-bi-elman-attention-networks-dbean","slug":"dynamic-bi-elman-attention-networks-dbean","title":"Dynamic Bi-Elman Attention Networks: A Dual-Directional Context-Aware Test-Time Learning for Text Classification","date":"2025-03-19","arxiv_id":"2503.15469","repositories_listed":1,"syntology":null},{"url":"/paper/micro-text-classification-based-on-balanced","slug":"micro-text-classification-based-on-balanced","title":"Micro Text Classification Based on Balanced Positive-Unlabeled Learning","date":"2025-03-17","arxiv_id":"2503.13562","repositories_listed":1,"syntology":null},{"url":"/paper/cognitive-mental-llm-leveraging-reasoning-in","slug":"cognitive-mental-llm-leveraging-reasoning-in","title":"Cognitive-Mental-LLM: Evaluating Reasoning in Large Language Models for Mental Health Prediction via Online Text","date":"2025-03-13","arxiv_id":"2503.10095","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-free-from-mmi-a-new-frontier-in","slug":"breaking-free-from-mmi-a-new-frontier-in","title":"Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilization","date":"2025-03-08","arxiv_id":"2503.06202","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/breaking-free-from-mmi-a-new-frontier-in#ran","syntology_url":"https://syntology.ai/paper/2503.06202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.06202"}},"official":{"repos":["jugechengzi/Rationalization-N2R"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-activations-as-conformal-predictors","slug":"sparse-activations-as-conformal-predictors","title":"Sparse Activations as Conformal Predictors","date":"2025-02-20","arxiv_id":"2502.14773","repositories_listed":1,"syntology":null},{"url":"/paper/token-level-density-based-uncertainty","slug":"token-level-density-based-uncertainty","title":"Token-Level Density-Based Uncertainty Quantification Methods for Eliciting Truthfulness of Large Language Models","date":"2025-02-20","arxiv_id":"2502.14427","repositories_listed":1,"syntology":null},{"url":"/paper/language-models-can-predict-their-own","slug":"language-models-can-predict-their-own","title":"Language Models Can Predict Their Own Behavior","date":"2025-02-18","arxiv_id":"2502.13329","repositories_listed":1,"syntology":null},{"url":"/paper/task-informed-anti-curriculum-by-masking","slug":"task-informed-anti-curriculum-by-masking","title":"Task-Informed Anti-Curriculum by Masking Improves Downstream Performance on Text","date":"2025-02-18","arxiv_id":"2502.12953","repositories_listed":1,"syntology":null},{"url":"/paper/adasplash-adaptive-sparse-flash-attention","slug":"adasplash-adaptive-sparse-flash-attention","title":"AdaSplash: Adaptive Sparse Flash Attention","date":"2025-02-17","arxiv_id":"2502.12082","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/adasplash-adaptive-sparse-flash-attention#ran","syntology_url":"https://syntology.ai/paper/2502.12082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.12082"}},"official":{"repos":["deep-spin/adasplash"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/measuring-diversity-in-synthetic-datasets","slug":"measuring-diversity-in-synthetic-datasets","title":"Measuring Diversity in Synthetic Datasets","date":"2025-02-12","arxiv_id":"2502.08512","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":2,"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/measuring-diversity-in-synthetic-datasets#ran","syntology_url":"https://syntology.ai/paper/2502.08512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.08512"}},"official":{"repos":["bluewhalelab/dcscore"],"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","unlocated"]}}},{"url":"/paper/synthetic-artifact-auditing-tracing-llm","slug":"synthetic-artifact-auditing-tracing-llm","title":"Synthetic Artifact Auditing: Tracing LLM-Generated Synthetic Data Usage in Downstream Applications","date":"2025-02-02","arxiv_id":"2502.00808","repositories_listed":1,"syntology":null},{"url":"/paper/a-transformer-based-autoregressive-decoder","slug":"a-transformer-based-autoregressive-decoder","title":"A Transformer-based Autoregressive Decoder Architecture for Hierarchical Text Classification","date":"2025-01-23","arxiv_id":"2501.13598","repositories_listed":1,"syntology":null},{"url":"/paper/regularization-semi-supervision-and","slug":"regularization-semi-supervision-and","title":"Regularization, Semi-supervision, and Supervision for a Plausible Attention-Based Explanation","date":"2025-01-22","arxiv_id":"2501.12775","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-graph-contrastive-learning-framework","slug":"a-simple-graph-contrastive-learning-framework","title":"A Simple Graph Contrastive Learning Framework for Short Text Classification","date":"2025-01-16","arxiv_id":"2501.09219","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/a-simple-graph-contrastive-learning-framework#ran","syntology_url":"https://syntology.ai/paper/2501.09219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09219"}},"official":{"repos":["keaml-jlu/simstc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/boosting-short-text-classification-with-multi","slug":"boosting-short-text-classification-with-multi","title":"Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning","date":"2025-01-16","arxiv_id":"2501.09214","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/boosting-short-text-classification-with-multi#ran","syntology_url":"https://syntology.ai/paper/2501.09214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09214"}},"official":{"repos":["keaml-jlu/mi-delight"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-marvels-of-deep-learning-in","slug":"multimodal-marvels-of-deep-learning-in","title":"Multimodal Marvels of Deep Learning in Medical Diagnosis: A Comprehensive Review of COVID-19 Detection","date":"2025-01-16","arxiv_id":"2501.09506","repositories_listed":1,"syntology":null},{"url":"/paper/robust-hybrid-classical-quantum-transfer","slug":"robust-hybrid-classical-quantum-transfer","title":"Robust Hybrid Classical-Quantum Transfer Learning Model for Text Classification Using GPT-Neo 125M with LoRA & SMOTE Enhancement","date":"2025-01-12","arxiv_id":"2501.10435","repositories_listed":1,"syntology":null},{"url":"/paper/a-nearly-optimal-single-loop-algorithm-for","slug":"a-nearly-optimal-single-loop-algorithm-for","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-12-28","arxiv_id":"2412.20017","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-nearly-optimal-single-loop-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2412.20017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.20017"}},"official":{"repos":["MingruiLiu-ML-Lab/Single-Loop-bilevel-Optimizer-under-Unbounded-Smoothness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-experimental-evaluation-of-japanese","slug":"an-experimental-evaluation-of-japanese","title":"An Experimental Evaluation of Japanese Tokenizers for Sentiment-Based Text Classification","date":"2024-12-23","arxiv_id":"2412.17361","repositories_listed":1,"syntology":null},{"url":"/paper/resource-aware-arabic-llm-creation-model","slug":"resource-aware-arabic-llm-creation-model","title":"Resource-Aware Arabic LLM Creation: Model Adaptation, Integration, and Multi-Domain Testing","date":"2024-12-23","arxiv_id":"2412.17548","repositories_listed":1,"syntology":null},{"url":"/paper/lh-mix-local-hierarchy-correlation-guided","slug":"lh-mix-local-hierarchy-correlation-guided","title":"LH-Mix: Local Hierarchy Correlation Guided Mixup over Hierarchical Prompt Tuning","date":"2024-12-22","arxiv_id":"2412.16963","repositories_listed":1,"syntology":null},{"url":"/paper/token-level-graphs-for-short-text","slug":"token-level-graphs-for-short-text","title":"Token-Level Graphs for Short Text Classification","date":"2024-12-17","arxiv_id":"2412.12754","repositories_listed":1,"syntology":null},{"url":"/paper/your-next-state-of-the-art-could-come-from","slug":"your-next-state-of-the-art-could-come-from","title":"Your Next State-of-the-Art Could Come from Another Domain: A Cross-Domain Analysis of Hierarchical Text Classification","date":"2024-12-17","arxiv_id":"2412.12744","repositories_listed":1,"syntology":null},{"url":"/paper/bda-bangla-text-data-augmentation-framework","slug":"bda-bangla-text-data-augmentation-framework","title":"BDA: Bangla Text Data Augmentation Framework","date":"2024-12-11","arxiv_id":"2412.08753","repositories_listed":1,"syntology":null},{"url":"/paper/concept-bottleneck-large-language-models","slug":"concept-bottleneck-large-language-models","title":"Concept Bottleneck Large Language Models","date":"2024-12-11","arxiv_id":"2412.07992","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/concept-bottleneck-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2412.07992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.07992"}},"official":{"repos":["trustworthy-ml-lab/cb-llms"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-granularity-tibetan-textual-adversarial","slug":"multi-granularity-tibetan-textual-adversarial","title":"Multi-Granularity Tibetan Textual Adversarial Attack Method Based on Masked Language Model","date":"2024-12-03","arxiv_id":"2412.02343","repositories_listed":1,"syntology":null},{"url":"/paper/concept-based-continuous-prompts-for","slug":"concept-based-continuous-prompts-for","title":"Concept Based Continuous Prompts for Interpretable Text Classification","date":"2024-12-02","arxiv_id":"2412.01644","repositories_listed":1,"syntology":null},{"url":"/paper/lightweight-contenders-navigating-semi","slug":"lightweight-contenders-navigating-semi","title":"Lightweight Contenders: Navigating Semi-Supervised Text Mining through Peer Collaboration and Self Transcendence","date":"2024-12-01","arxiv_id":"2412.00883","repositories_listed":1,"syntology":null},{"url":"/paper/textclass-benchmark-a-continuous-elo-rating","slug":"textclass-benchmark-a-continuous-elo-rating","title":"TextClass Benchmark: A Continuous Elo Rating of LLMs in Social Sciences","date":"2024-11-30","arxiv_id":"2412.00539","repositories_listed":1,"syntology":null},{"url":"/paper/llm-teacher-student-framework-for-text","slug":"llm-teacher-student-framework-for-text","title":"LLM Teacher-Student Framework for Text Classification With No Manually Annotated Data: A Case Study in IPTC News Topic Classification","date":"2024-11-29","arxiv_id":"2411.19638","repositories_listed":1,"syntology":null},{"url":"/paper/a-supervised-machine-learning-approach-for-2","slug":"a-supervised-machine-learning-approach-for-2","title":"A Supervised Machine Learning Approach for Assessing Grant Peer Review Reports","date":"2024-11-25","arxiv_id":"2411.16662","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-multi-graph-learning-with","slug":"contrastive-multi-graph-learning-with","title":"Contrastive Multi-graph Learning with Neighbor Hierarchical Sifting for Semi-supervised Text Classification","date":"2024-11-25","arxiv_id":"2411.16787","repositories_listed":1,"syntology":null},{"url":"/paper/combining-autoregressive-and-autoencoder","slug":"combining-autoregressive-and-autoencoder","title":"Combining Autoregressive and Autoencoder Language Models for Text Classification","date":"2024-11-20","arxiv_id":"2411.13282","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-text-classification-htc-vs","slug":"hierarchical-text-classification-htc-vs","title":"Hierarchical Text Classification (HTC) vs. eXtreme Multilabel Classification (XML): Two Sides of the Same Medal","date":"2024-11-20","arxiv_id":"2411.13687","repositories_listed":1,"syntology":null},{"url":"/paper/guideq-framework-for-guided-questioning-for","slug":"guideq-framework-for-guided-questioning-for","title":"GUIDEQ: Framework for Guided Questioning for progressive informational collection and classification","date":"2024-11-08","arxiv_id":"2411.05991","repositories_listed":1,"syntology":null},{"url":"/paper/a-library-perspective-on-supervised-text","slug":"a-library-perspective-on-supervised-text","title":"A Library Perspective on Supervised Text Processing in Digital Libraries: An Investigation in the Biomedical Domain","date":"2024-11-06","arxiv_id":"2411.12752","repositories_listed":1,"syntology":null},{"url":"/paper/confidence-calibration-of-classifiers-with","slug":"confidence-calibration-of-classifiers-with","title":"Confidence Calibration of Classifiers with Many Classes","date":"2024-11-05","arxiv_id":"2411.02988","repositories_listed":1,"syntology":{"n":18,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/confidence-calibration-of-classifiers-with#ran","syntology_url":"https://syntology.ai/paper/2411.02988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02988"}},"official":{"repos":["allglc/tva-calibration"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/towards-robust-text-classification-mitigating","slug":"towards-robust-text-classification-mitigating","title":"Fighting Spurious Correlations in Text Classification via a Causal Learning Perspective","date":"2024-11-01","arxiv_id":"2411.01045","repositories_listed":1,"syntology":null},{"url":"/paper/discern-decoding-systematic-errors-in-natural","slug":"discern-decoding-systematic-errors-in-natural","title":"DISCERN: Decoding Systematic Errors in Natural Language for Text Classifiers","date":"2024-10-29","arxiv_id":"2410.22239","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":11,"phrase":"6 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; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/discern-decoding-systematic-errors-in-natural#ran","syntology_url":"https://syntology.ai/paper/2410.22239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22239"}},"official":{"repos":["rrmenon10/DISCERN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-quantum-natural-language","slug":"multimodal-quantum-natural-language","title":"Multimodal Quantum Natural Language Processing: A Novel Framework for using Quantum Methods to Analyse Real Data","date":"2024-10-29","arxiv_id":"2411.05023","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-on-discriminative","slug":"graph-neural-networks-on-discriminative","title":"Graph Neural Networks on Discriminative Graphs of Words","date":"2024-10-27","arxiv_id":"2410.20469","repositories_listed":1,"syntology":null},{"url":"/paper/ensembling-finetuned-language-models-for-text","slug":"ensembling-finetuned-language-models-for-text","title":"Ensembling Finetuned Language Models for Text Classification","date":"2024-10-25","arxiv_id":"2410.19889","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ensembling-finetuned-language-models-for-text#ran","syntology_url":"https://syntology.ai/paper/2410.19889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.19889"}},"official":{"repos":["sebastianpinedaar/finetuning_text_classifiers"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autotrain-no-code-training-for-state-of-the","slug":"autotrain-no-code-training-for-state-of-the","title":"AutoTrain: No-code training for state-of-the-art models","date":"2024-10-21","arxiv_id":"2410.15735","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-concept-bottleneck-models-with-llm","slug":"bayesian-concept-bottleneck-models-with-llm","title":"Bayesian Concept Bottleneck Models with LLM Priors","date":"2024-10-21","arxiv_id":"2410.15555","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":2,"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/bayesian-concept-bottleneck-models-with-llm#ran","syntology_url":"https://syntology.ai/paper/2410.15555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15555"}},"official":{"repos":["jjfeng/bc-llm"],"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/natural-language-processing-for-human","slug":"natural-language-processing-for-human","title":"Natural Language Processing for Human Resources: A Survey","date":"2024-10-21","arxiv_id":"2410.16498","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-backdoor-attacks-for-llms-with","slug":"unlearning-backdoor-attacks-for-llms-with","title":"Unlearning Backdoor Attacks for LLMs with Weak-to-Strong Knowledge Distillation","date":"2024-10-18","arxiv_id":"2410.14425","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/unlearning-backdoor-attacks-for-llms-with#ran","syntology_url":"https://syntology.ai/paper/2410.14425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14425"}},"official":{"repos":["shuaizhao95/Unlearning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/risk-of-text-backdoor-attacks-under-dataset","slug":"risk-of-text-backdoor-attacks-under-dataset","title":"Risk of Text Backdoor Attacks Under Dataset Distillation","date":"2024-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"30f84aaf899e8524f7c2e30a7cb41e2a18c5c3c05e4ba3cf5aed15b4a3a6bfad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}