{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HFT5ZELH2KXG6B5CJRYMWZIRLC","short_pith_number":"pith:HFT5ZELH","schema_version":"1.0","canonical_sha256":"3967dc9167d2ae6f07a24c70cb651158b72262f1b992441bc5f5bb35db91f8d4","source":{"kind":"arxiv","id":"1901.11196","version":2},"attestation_state":"computed","paper":{"title":"EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jason Wei, Kai Zou","submitted_at":"2019-01-31T03:20:52Z","abstract_excerpt":"We present EDA: easy data augmentation techniques for boosting performance on text classification tasks. EDA consists of four simple but powerful operations: synonym replacement, random insertion, random swap, and random deletion. On five text classification tasks, we show that EDA improves performance for both convolutional and recurrent neural networks. EDA demonstrates particularly strong results for smaller datasets; on average, across five datasets, training with EDA while using only 50% of the available training set achieved the same accuracy as normal training with all available data. W"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.11196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-31T03:20:52Z","cross_cats_sorted":[],"title_canon_sha256":"515faa245aefbfef5b73b116c867742756604845955392488d193a299c4d274a","abstract_canon_sha256":"cfd31cc54817ba27081dd0b0e4ced8b6553a9a977aa4824ad6ff79cda3f6c982"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:30.343718Z","signature_b64":"Npy2YrJwLdsOKPVjLPuZpvVzupkMVs1bSOEm6/Tab2QUc2MyIF1Njq2nNqESlXXag2y8bLWboxd2MoaqaIKmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3967dc9167d2ae6f07a24c70cb651158b72262f1b992441bc5f5bb35db91f8d4","last_reissued_at":"2026-07-04T23:59:30.343257Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:30.343257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jason Wei, Kai Zou","submitted_at":"2019-01-31T03:20:52Z","abstract_excerpt":"We present EDA: easy data augmentation techniques for boosting performance on text classification tasks. EDA consists of four simple but powerful operations: synonym replacement, random insertion, random swap, and random deletion. On five text classification tasks, we show that EDA improves performance for both convolutional and recurrent neural networks. EDA demonstrates particularly strong results for smaller datasets; on average, across five datasets, training with EDA while using only 50% of the available training set achieved the same accuracy as normal training with all available data. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11196","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.11196/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.11196","created_at":"2026-07-04T23:59:30.343307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.11196v2","created_at":"2026-07-04T23:59:30.343307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11196","created_at":"2026-07-04T23:59:30.343307+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFT5ZELH2KXG","created_at":"2026-07-04T23:59:30.343307+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFT5ZELH2KXG6B5C","created_at":"2026-07-04T23:59:30.343307+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFT5ZELH","created_at":"2026-07-04T23:59:30.343307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":18,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18555","citing_title":"Rethinking Text-to-Image as Semantic-Aware Data Augmentation for Indoor Scene Recognition","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10610","citing_title":"Small Data, Big Noise: Adversarial Training for Robust Parameter-Efficient Fine-Tuning","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01825","citing_title":"ROGLE: Robust Global-Local Alignment with Automated Region Supervision for Text-Based Person Search","ref_index":176,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08157","citing_title":"Cross Paraphrastic Invariance Learning for Hallucination Detection","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04306","citing_title":"Organizational Control Layer: Governance Infrastructure at the Execution Boundary of LLM Agent Systems","ref_index":155,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01825","citing_title":"ROGLE: Robust Global-Local Alignment with Automated Region Supervision for Text-Based Person Search","ref_index":176,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30857","citing_title":"Multilingual Polarization Detection Using Transformer-Based Models with Class Weighting and Threshold Tuning","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2502.16022","citing_title":"Enhancing LLMs for Identifying and Prioritizing Important Medical Jargons from Electronic Health Record Notes Utilizing Data Augmentation: A Comparative Study","ref_index":99,"is_internal_anchor":false},{"citing_arxiv_id":"2508.15202","citing_title":"Fin-PRM: A Domain-Specialized Process Reward Model for Financial Reasoning in Large Language Models","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2511.20657","citing_title":"Intelligent Agents with Emotional Intelligence: Current Trends, Challenges, and Future Prospects","ref_index":272,"is_internal_anchor":false},{"citing_arxiv_id":"2303.09014","citing_title":"ART: Automatic multi-step reasoning and tool-use for large language models","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2201.10005","citing_title":"Text and Code Embeddings by Contrastive Pre-Training","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03259","citing_title":"From Pre-trained Models to Large Language Models: A Comprehensive Survey of AI-Driven Psychological Computing","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02377","citing_title":"What Are Adversaries Doing? Automating Tactics, Techniques, and Procedures Extraction: A Systematic Review","ref_index":160,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26923","citing_title":"ClassEval-Pro: A Cross-Domain Benchmark for Class-Level Code Generation","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20168","citing_title":"Duluth at SemEval-2026 Task 6: DeBERTa with LLM-Augmented Data for Unmasking Political Question Evasions","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18759","citing_title":"Model-Agnostic Meta Learning for Class Imbalance Adaptation","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18539","citing_title":"Transition-Matrix Regularization for Next Dialogue Act Prediction in Counselling Conversations","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC","json":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC.json","graph_json":"https://pith.science/api/pith-number/HFT5ZELH2KXG6B5CJRYMWZIRLC/graph.json","events_json":"https://pith.science/api/pith-number/HFT5ZELH2KXG6B5CJRYMWZIRLC/events.json","paper":"https://pith.science/paper/HFT5ZELH"},"agent_actions":{"view_html":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC","download_json":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC.json","view_paper":"https://pith.science/paper/HFT5ZELH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.11196&json=true","fetch_graph":"https://pith.science/api/pith-number/HFT5ZELH2KXG6B5CJRYMWZIRLC/graph.json","fetch_events":"https://pith.science/api/pith-number/HFT5ZELH2KXG6B5CJRYMWZIRLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC/action/storage_attestation","attest_author":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC/action/author_attestation","sign_citation":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC/action/citation_signature","submit_replication":"https://pith.science/pith/HFT5ZELH2KXG6B5CJRYMWZIRLC/action/replication_record"}},"created_at":"2026-07-04T23:59:30.343307+00:00","updated_at":"2026-07-04T23:59:30.343307+00:00"}