{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5B7WKE7X3IBIRIHCKXGT24UH2X","short_pith_number":"pith:5B7WKE7X","schema_version":"1.0","canonical_sha256":"e87f6513f7da0288a0e255cd3d7287d5e325ca4068d96ecd8b72544194fc212d","source":{"kind":"arxiv","id":"2201.02733","version":2},"attestation_state":"computed","paper":{"title":"Testing the Robustness of a BiLSTM-based Structural Story Classifier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Aftab Hussain, Sai Durga Prasad Nanduri, Sneha Seenuvasavarathan","submitted_at":"2022-01-03T00:27:05Z","abstract_excerpt":"The growing prevalence of counterfeit stories on the internet has fostered significant interest towards fast and scalable detection of fake news in the machine learning community. While several machine learning techniques for this purpose have emerged, we observe that there is a need to evaluate the impact of noise on these techniques' performance, where noise constitutes news articles being mistakenly labeled as fake (or real). This work takes a step in that direction, where we examine the impact of noise on a state-of-the-art, structural model based on BiLSTM (Bidirectional Long-Short Term M"},"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":"2201.02733","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-01-03T00:27:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e731343f813e75451ac4365f5d084682259f50e48ce7d03593ba365273c3c1a","abstract_canon_sha256":"9e9e88bd872cd6be2e1d8fc1a5df8a198173cba08bbb183300f9583396f225f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:24.488337Z","signature_b64":"Em3Zhrrm64BLfn/h4eC1OuPIwBA0SaprZhLcDf/5nytWLoJ9vNZpS4uvdBoiFdlHxxoS9LokxNEo6MAR/1W0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e87f6513f7da0288a0e255cd3d7287d5e325ca4068d96ecd8b72544194fc212d","last_reissued_at":"2026-07-05T04:24:24.487819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:24.487819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing the Robustness of a BiLSTM-based Structural Story Classifier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Aftab Hussain, Sai Durga Prasad Nanduri, Sneha Seenuvasavarathan","submitted_at":"2022-01-03T00:27:05Z","abstract_excerpt":"The growing prevalence of counterfeit stories on the internet has fostered significant interest towards fast and scalable detection of fake news in the machine learning community. While several machine learning techniques for this purpose have emerged, we observe that there is a need to evaluate the impact of noise on these techniques' performance, where noise constitutes news articles being mistakenly labeled as fake (or real). This work takes a step in that direction, where we examine the impact of noise on a state-of-the-art, structural model based on BiLSTM (Bidirectional Long-Short Term M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02733","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/2201.02733/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":"2201.02733","created_at":"2026-07-05T04:24:24.487875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.02733v2","created_at":"2026-07-05T04:24:24.487875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02733","created_at":"2026-07-05T04:24:24.487875+00:00"},{"alias_kind":"pith_short_12","alias_value":"5B7WKE7X3IBI","created_at":"2026-07-05T04:24:24.487875+00:00"},{"alias_kind":"pith_short_16","alias_value":"5B7WKE7X3IBIRIHC","created_at":"2026-07-05T04:24:24.487875+00:00"},{"alias_kind":"pith_short_8","alias_value":"5B7WKE7X","created_at":"2026-07-05T04:24:24.487875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19164","citing_title":"GradualDiff-Fed: A Federated Learning Specialized Framework for Large Language Model","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X","json":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X.json","graph_json":"https://pith.science/api/pith-number/5B7WKE7X3IBIRIHCKXGT24UH2X/graph.json","events_json":"https://pith.science/api/pith-number/5B7WKE7X3IBIRIHCKXGT24UH2X/events.json","paper":"https://pith.science/paper/5B7WKE7X"},"agent_actions":{"view_html":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X","download_json":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X.json","view_paper":"https://pith.science/paper/5B7WKE7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.02733&json=true","fetch_graph":"https://pith.science/api/pith-number/5B7WKE7X3IBIRIHCKXGT24UH2X/graph.json","fetch_events":"https://pith.science/api/pith-number/5B7WKE7X3IBIRIHCKXGT24UH2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X/action/storage_attestation","attest_author":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X/action/author_attestation","sign_citation":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X/action/citation_signature","submit_replication":"https://pith.science/pith/5B7WKE7X3IBIRIHCKXGT24UH2X/action/replication_record"}},"created_at":"2026-07-05T04:24:24.487875+00:00","updated_at":"2026-07-05T04:24:24.487875+00:00"}