{"as_of":"2026-08-09T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aaa85e5ff5a50dd7ed0e47352b71d4da02810f897c5c077e73f2f5365e8e4fdc","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:43:24.861099Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.06892/citation-record","integrity":"/paper/2502.06892/integrity","json":"/paper/2502.06892/citation-record.json","paper":"/paper/2502.06892"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.464754Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.464754Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:c5195327ec1e6a69dab29517608e935292ac805fb14eaa6b78ff861430b9b650","observation_id":"00b5e9b5-7002-44a4-8515-5be0b96f5869","resolution":{"observed_at":"2026-08-08T17:43:24.464754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.744068Z","title":"Fast and precise certification of transformers","venue":null,"work_id":"dc05a67e-3128-491e-8d43-c17c810c14bf","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.484849Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:f34f1337e56c1af934d70d424e49a1eb0003dde764315e50204ee9ebdc29bb42","observation_id":"884a2cbc-5269-4c0d-9a27-563d874706a8","resolution":{"observed_at":"2026-08-08T17:43:25.747857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.731464Z","title":"Mitigating backdoor attacks in lstm-based text classification systems by backdoor keyword identification","venue":null,"work_id":"4901fe84-6348-479f-9f6b-47149d613b11","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.504812Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:707f262fc4bd3b231ba2fc93a1f928254500565a5cdaac0b68b5f867861f7b56","observation_id":"05626bde-6126-4af8-940d-99cc5e5267b2","resolution":{"observed_at":"2026-08-08T17:43:25.735504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.718777Z","title":"Badpre: Task-agnostic backdoor attacks to pre-trained nlp foundation models","venue":null,"work_id":"3a5443df-30cb-42fd-97a4-9907f9d4294c","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.523122Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:70e1382dcac5a12819ff0be57a88ff28c89fb6fc179ca2c1e1b323bce5942b9e","observation_id":"6d3c4d2f-86ab-430a-8e9d-933ba343c448","resolution":{"observed_at":"2026-08-08T17:43:25.722812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.704675Z","title":"Badnl: Backdoor attacks against nlp models with semantic-preserving improvements","venue":null,"work_id":"58aeea39-078c-4ac7-9009-fbd237623ffc","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.535970Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:36f2e1502617ac6f7859dfcb43c4df48c9f0a7473d4dbfcaa62ceaa40c25d9bb","observation_id":"e9278386-e483-489c-80da-47fda6bd9fe7","resolution":{"observed_at":"2026-08-08T17:43:25.709445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.18945","last_updated":"2025-03-03T06:34:48Z","snapshot_observed_at":"2026-07-06T17:37:17.675101Z","submitted_at":"2024-02-29T08:20:49Z","title":"SynGhost: Invisible and Universal Task-agnostic Backdoor Attack via Syntactic Transfer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.18945","snapshot_observed_at":"2026-08-08T17:43:24.541222Z","title":"Syntactic ghost: An imperceptible general-purpose backdoor attacks on pre-trained language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.541222Z"},"links":{"cited_paper":"/paper/2402.18945","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:a1b1b70fc9fd1f349fa9cd07c1d5577a9a55c84d02a8a354cd866be321f15333","observation_id":"9629dbfd-dbda-4a14-80c3-e44b9020ba17","resolution":{"observed_at":"2026-08-08T17:43:24.541222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.689678Z","title":"Certified adversarial robustness via randomized smoothing","venue":null,"work_id":"d56d24e3-1e0d-400f-b0f7-bf405d86e8ee","year":2019},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.546140Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:35f3f08a33451deb0f1bc1c519c5c580c8636f4d3f5f77278c4288766f1a5e64","observation_id":"832a48f5-471a-4f4c-a4fa-9c27204f8b82","resolution":{"observed_at":"2026-08-08T17:43:25.694625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.674679Z","title":"A unified evaluation of textual backdoor learning: Frameworks and benchmarks","venue":null,"work_id":"d526bd2d-1064-455d-8d0b-e22d0251e113","year":2022},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.551383Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:5d2c37937846164d8ebb9569fcfa87121acdc8b83c47c5cd3ff1b82050a91a62","observation_id":"ca2e0958-0fe7-4ac6-a5af-b95f8d0dfb07","resolution":{"observed_at":"2026-08-08T17:43:25.679405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.660114Z","title":"A backdoor attack against lstm-based text classification systems","venue":null,"work_id":"9757ed36-e1f0-4b8e-ba74-03064ee485cc","year":2019},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.555967Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:742cefcbee1a032e26ed7f5dd9fbfadbee97e3b28470212ca19fd25fd5e363b7","observation_id":"16fe3508-ab75-4d9d-9e7f-bebfecd268fd","resolution":{"observed_at":"2026-08-08T17:43:25.664833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.644743Z","title":"A technique for computer detection and correction of spelling errors","venue":null,"work_id":"705c4503-4de3-4a94-8479-9c4dcca50f1f","year":1964},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.560494Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:d32b0baefe57a3401a18bb6487231013429b75a34f61133dcef4311832a9df27","observation_id":"2896a4dd-9186-4c32-8c6b-358bd37bf600","resolution":{"observed_at":"2026-08-08T17:43:25.649563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.630130Z","title":"Cert-rnn: Towards certifying the robustness of recurrent neural networks","venue":null,"work_id":"5fdc8694-d56a-48ca-a5d4-d52cd79b7934","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.565034Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:a6acfd4eb7ea0546d5477362f8514c818a40fad7d5e9190cdab1801c3e69a974","observation_id":"780808f4-5df8-40ca-a838-476059a68f61","resolution":{"observed_at":"2026-08-08T17:43:25.635212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-08T17:43:24.569567Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.569567Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:49e498351a85f479e72894d881d4122279cefac6be47efdee0ff9e25cd740afb","observation_id":"857776c4-4c6f-40bb-a74d-1561a1080c84","resolution":{"observed_at":"2026-08-08T17:43:24.569567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.616375Z","title":"Large scale crowdsourcing and characterization of twitter abusive behavior","venue":null,"work_id":"e216bf96-a356-4417-bf92-dd76f1b6e074","year":2018},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.574359Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:f9595ccf9821e8ddb045b4403f319db801ed0baba4c8e85a3d4b0688b0758bd7","observation_id":"7cdbece0-798b-45b8-bafb-8f6dccdad253","resolution":{"observed_at":"2026-08-08T17:43:25.620714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06862","last_updated":"2022-02-14T16:46:23Z","snapshot_observed_at":"2026-08-03T00:38:28.953357Z","submitted_at":"2022-02-14T16:46:23Z","title":"Threats to Pre-trained Language Models: Survey and Taxonomy","version":1},"cited_work":{"arxiv_id":"2202.06862","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.06862","snapshot_observed_at":"2026-08-08T17:43:25.145129Z","title":"Threats to Pre-trained Language Models: Survey and Taxonomy","venue":"cs.CR","work_id":"27faf17a-5b86-4aea-b907-324d67a54f27","year":2022},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.579458Z"},"links":{"cited_paper":"/paper/2202.06862","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:ad7614f316f102606e9dee79cd5d9077b7a247192fe82a4f0fa4f2d8c1d784f7","observation_id":"086b7f21-dc21-4266-b1fd-21b27170c5cb","resolution":{"observed_at":"2026-08-08T17:43:25.150435Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.584276Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.584276Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:3e585241530c16e5e58123abab6d8a19f3c612f91bd816c8c7fc58473c0b1d59","observation_id":"3e411604-3366-4934-b8c5-f215e8fd1170","resolution":{"observed_at":"2026-08-08T17:43:24.584276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.594420Z","title":"Achieving verified robustness to symbol substitutions via interval bound propagation","venue":null,"work_id":"745f8ace-1c1f-4e48-bb2c-f97ae4a0e6d6","year":2019},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.590032Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:bc467d63da777a6e7a504731f162652c1cf19e72ef71e56705f545460c86d994","observation_id":"20a547fe-ebfe-4a8c-a0e6-d794b9d9adef","resolution":{"observed_at":"2026-08-08T17:43:25.598698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12274","last_updated":"2024-04-18T15:47:00Z","snapshot_observed_at":"2026-07-06T18:02:15.186390Z","submitted_at":"2024-04-18T15:47:00Z","title":"Advancing the Robustness of Large Language Models through Self-Denoised Smoothing","version":1},"cited_work":{"arxiv_id":"2404.12274","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.12274","snapshot_observed_at":"2026-08-08T17:43:25.105682Z","title":"Advancing the Robustness of Large Language Models through Self-Denoised Smoothing","venue":"cs.CL","work_id":"10212fe3-c3d6-4dde-a978-663f3f073f5d","year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.594506Z"},"links":{"cited_paper":"/paper/2404.12274","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:fe8dda1e84f287eb79b4b31b9d29046285e9360c05f60cf667783ed75eb14667","observation_id":"54f4aaac-de99-42b2-9c0f-2bc31ad5c99f","resolution":{"observed_at":"2026-08-08T17:43:25.115510Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.581215Z","title":"Certified robustness to adversarial word substitutions","venue":null,"work_id":"18cf48de-5fda-4021-9496-a7511f84ef15","year":2019},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.599257Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:d3419343ec99652752c0ffd15ee654991742399241fae381cb2c288a4c728ec5","observation_id":"ae12e00d-ea79-494e-85aa-81333f7ef68c","resolution":{"observed_at":"2026-08-08T17:43:25.585610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.603206Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.603206Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:04ac97712fef36ea57a38e28b803331331b8c07dd085fec327c2186d7b8a59ca","observation_id":"5e65f38d-0fe5-4c2e-a7e8-eff9836236d1","resolution":{"observed_at":"2026-08-08T17:43:24.603206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.608471Z","title":"On information and sufficiency","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.608471Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:293b14e4b0d539fa7cc6dca1bd0cb463b52fec75362804633c86f996675bab47","observation_id":"a26346c7-3b24-420e-837b-3b67fef45327","resolution":{"observed_at":"2026-08-08T17:43:24.608471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.550024Z","title":"Weight poisoning attacks on pretrained models","venue":null,"work_id":"ed39f7c2-eaa0-4315-b992-24f825ddcbe9","year":2020},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.648891Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:2831cfc80552fa5e56cefed40481fd2f05e48cfd79ad1aa625b00946ad335880","observation_id":"aefc3474-130d-440b-beb0-accfda82f06a","resolution":{"observed_at":"2026-08-08T17:43:25.554084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.535670Z","title":"Newsweeder: Learning to filter netnews","venue":null,"work_id":"39d1a2c7-3bb9-4129-9ba1-3f83b315cc9b","year":1995},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.710822Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:c326274fc40dc937a544666acf950e91478587a3efc4233892f2db894e0f52ff","observation_id":"49884ec4-54c4-4ca1-9ac0-55de99c695e8","resolution":{"observed_at":"2026-08-08T17:43:25.541079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.521820Z","title":"Binary codes capable of correcting deletions, insertions, and reversals","venue":null,"work_id":"bb6c2a70-4f5f-49c3-983e-6a05da96079b","year":1966},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.714825Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:f0d8b68818b46e163ebbcb31ee2067713dfa18a1c32633890b27a098a0bb1a36","observation_id":"e813bb58-9554-4180-9662-d1cf73d572bb","resolution":{"observed_at":"2026-08-08T17:43:25.526316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.507999Z","title":"Backdoor attacks on pre-trained models by layerwise weight poisoning","venue":null,"work_id":"960b0c36-e12e-4208-aa70-e6ff8eacb464","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.718563Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:de965622df94b46c2ba4d6f026f9894ccceb71ac5edb6fb3ed782a50f5cb198f","observation_id":"34a395a6-78b0-4103-bc92-f34eddb0cc9d","resolution":{"observed_at":"2026-08-08T17:43:25.512518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-08T17:43:24.722282Z","title":"Roberta: A robustly optimized bert pretraining approach","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.722282Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:c8f7021dfcd12593b311de9761817e330b0dd31e5b9c6d99eac4a23e5858a9e8","observation_id":"1e5c96f4-00c3-424a-957d-947d1ccbca33","resolution":{"observed_at":"2026-08-08T17:43:24.722282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01873","last_updated":"2024-06-05T15:53:01Z","snapshot_observed_at":"2026-07-06T18:24:52.604412Z","submitted_at":"2024-06-04T01:02:22Z","title":"CR-UTP: Certified Robustness against Universal Text Perturbations on Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.01873","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.01873","snapshot_observed_at":"2026-08-08T17:43:24.989598Z","title":"CR-UTP: Certified Robustness against Universal Text Perturbations on Large Language Models","venue":"cs.CL","work_id":"7174f621-2930-4f53-95ba-06845e8906a0","year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.726553Z"},"links":{"cited_paper":"/paper/2406.01873","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:72339b1613a6af1cb627287dcfa0bf783959e07962e157a298f3d6a9b687c2b4","observation_id":"1faaf594-1bac-4127-80a3-f1cf098259c3","resolution":{"observed_at":"2026-08-08T17:43:24.996083Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.730657Z","title":"Learning word vectors for sentiment analysis","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.730657Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:aca9f8e41f486baadf0a76b492bee1395d30c5d03cb08206db39e7ddef2f9531","observation_id":"2c6a231b-1378-4320-ab9f-df3ac7dbb173","resolution":{"observed_at":"2026-08-08T17:43:24.730657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.11225","last_updated":"2023-11-25T02:59:46Z","snapshot_observed_at":"2026-08-05T16:51:29.366737Z","submitted_at":"2023-11-19T04:42:16Z","title":"TextGuard: Provable Defense against Backdoor Attacks on Text Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.11225","snapshot_observed_at":"2026-08-08T17:43:24.734540Z","title":"Textguard: Provable defense against backdoor attacks on text classification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.734540Z"},"links":{"cited_paper":"/paper/2311.11225","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:d778453979bb5b9768392305b6f63e210f924143fac9ed6671282bff112f7aee","observation_id":"b2d64ae5-bd58-4378-aa97-f3fab945aa9c","resolution":{"observed_at":"2026-08-08T17:43:24.734540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.484522Z","title":"Onion: A simple and effective defense against textual backdoor attacks","venue":null,"work_id":"45c02faa-1d58-40ec-9c4f-c2e8c6c55a55","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.738495Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:9104cea43c399271bf9f782bba077e2414bef4595d81167261d113455f95d391","observation_id":"3ce8d0e1-86dd-4534-913b-d6fbafb34918","resolution":{"observed_at":"2026-08-08T17:43:25.489060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.470754Z","title":"Hidden killer: Invisible textual backdoor attacks with syntactic trigger","venue":null,"work_id":"2c13f825-cc0b-4ca7-84ce-8cf3ba23b98f","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.742267Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:be91fcdb54c7423521018d456e1ad918fe6b8215834cccd77273cbfbae91999d","observation_id":"439096aa-d2f3-4455-8e14-1b1421c35e09","resolution":{"observed_at":"2026-08-08T17:43:25.475274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.456470Z","title":"Turn the combination lock: Learnable textual backdoor attacks via word substitution","venue":null,"work_id":"a2a1410a-a2b1-467c-ba10-50c97e659d1b","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.745846Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:f4e33c54ac9e300526f742a9d9c8426727b0113ac1c0c3ae80fa00072fcf30f8","observation_id":"9db24ed0-d71b-4569-8053-8319ed37d858","resolution":{"observed_at":"2026-08-08T17:43:25.461082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.442489Z","title":"Backdoor pre-trained models can transfer to all","venue":null,"work_id":"8cef6bf7-d149-4a14-96c9-7245911f3dba","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.749429Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:6a74ea32d0685fa0b6fd9012e7ee3b0a036c6f257ecea8daa3a59c0c4b4ce573","observation_id":"9aabcf6a-0f9a-42bb-9e42-73a0bb4880e2","resolution":{"observed_at":"2026-08-08T17:43:25.447182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.753109Z","title":"Recursive deep models for semantic compositionality over a sentiment treebank","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.753109Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:c699fdc8c09fce32882b73fda32ece73d27bd5176a4a1e586d9ef155beb27c01","observation_id":"684207f7-bd1b-4b28-87be-30c75f977459","resolution":{"observed_at":"2026-08-08T17:43:24.753109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-08T17:43:24.756804Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.756804Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:cc426f0d074f1b4694eac8800a1faa85619fdcd1748225262204c703beffa503","observation_id":"c00b0cff-6406-42c6-95b9-50a1ffd0ad04","resolution":{"observed_at":"2026-08-08T17:43:24.756804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11750","last_updated":"2020-07-20T16:15:42Z","snapshot_observed_at":"2026-07-06T09:00:23.866491Z","submitted_at":"2020-02-26T19:15:46Z","title":"On Certifying Robustness against Backdoor Attacks via Randomized Smoothing","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11750","snapshot_observed_at":"2026-08-08T17:43:24.760660Z","title":"On certifying robustness against backdoor attacks via randomized smoothing","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.760660Z"},"links":{"cited_paper":"/paper/2002.11750","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:8646dd8e2c8509a31e8c0c792480eb6d7f29769fddf1d800b1ac049a8097af20","observation_id":"21363a7f-fb8d-4ebe-bcaf-c17ed3734b21","resolution":{"observed_at":"2026-08-08T17:43:24.760660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.419921Z","title":"Certified robustness to word substitution attack with differential privacy","venue":null,"work_id":"5942b57c-5f81-4f7f-a908-c447d3554a29","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.765902Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:e5887c691702043d61edb555591ce91d4db18ee8ac018bf93e1bbdb20c32febc","observation_id":"af410a92-0d88-4efb-9e82-a72659142b81","resolution":{"observed_at":"2026-08-08T17:43:25.424046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.406710Z","title":"Robustness-aware word embedding improves certified robustness to adversarial word substitutions","venue":null,"work_id":"4dd9746a-0222-4e25-a60b-17374a384118","year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.770579Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:405b339862e99aad0ab025f76fe4e8299d2d3439ec620bb11a48342eb9755484","observation_id":"e4a46545-b3ab-4206-a9b9-627614bec2c9","resolution":{"observed_at":"2026-08-08T17:43:25.411043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.392241Z","title":"Rab: Provable robustness against backdoor attacks","venue":null,"work_id":"d11f03c6-9717-4b8a-86b4-2c0d86a2c101","year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.775457Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:feb4b1756ceb4ab35005060d93302a3960e8ac5966af5ae8536cc2b46ee30e37","observation_id":"6d0c6798-2cd9-492c-af33-9001e0993add","resolution":{"observed_at":"2026-08-08T17:43:25.397293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.378311Z","title":"Crfl: Certifiably robust federated learning against backdoor attacks","venue":null,"work_id":"ff6729a0-98c2-4f50-8dba-46f4178335ac","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.780138Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:fe45d7c1daaef2a00942e549e92f119a418ab1f0574d98747b0b55e540fea142","observation_id":"e901b5e5-8850-43cf-96d6-25b78cdfb22d","resolution":{"observed_at":"2026-08-08T17:43:25.382529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.365496Z","title":"Bite: Textual backdoor attacks with iterative trigger injection","venue":null,"work_id":"0213e5dc-fdf7-4c4b-901c-496638015942","year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.784846Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:90fa49d2e2018055a8a5f46773fe80e23eeb779e59709915bc224596ce9532c3","observation_id":"f1c083b1-3d8a-46d8-ad83-53539a500937","resolution":{"observed_at":"2026-08-08T17:43:25.369558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.352469Z","title":"Be careful about poisoned word embeddings: Exploring the vulnerability of the embedding layers in nlp models","venue":null,"work_id":"8c0e4f2f-0814-44a1-8f27-14b92cba6bfc","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.789714Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:b291c9a318f3ff83b28f618e8410e022be97ab3dc0f1028d276accc27f22b697","observation_id":"0129ba34-744a-41fa-bba1-c019629a5c5d","resolution":{"observed_at":"2026-08-08T17:43:25.356571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.339371Z","title":"Rap: Robustness-aware perturbations for defending against backdoor attacks on nlp models","venue":null,"work_id":"d685d95b-9825-4700-b64b-dceaa4aeef01","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.794048Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:7925fa079c7338102834b4eee49a8a026166e92ffa8bbcd20f93002e28a34b40","observation_id":"c24c7006-fbb2-44cc-98b1-c7805e3b2b88","resolution":{"observed_at":"2026-08-08T17:43:25.343464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.325680Z","title":"Safer: A structure-free approach for certified robustness to adversarial word substitutions","venue":null,"work_id":"67c060d5-ee06-4d17-86ba-a103338359f7","year":2020},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.798293Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:a01d5ef833ed3d97d067e68079f162bf17c31331b0ae95a0f445b2cac94df983","observation_id":"811005e4-7fe7-4210-9458-ea841acffe84","resolution":{"observed_at":"2026-08-08T17:43:25.330625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.802925Z","title":"Semeval-2019 task 6: Identifying and categorizing offensive language in social media (offenseval)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.802925Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:f840748135b4d15241fd989a7475c1c2ca990e3c850882768916aada3b515dca","observation_id":"a5dc6609-2195-4df4-8cbb-249103a48e5e","resolution":{"observed_at":"2026-08-08T17:43:24.802925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.298792Z","title":"Certified robustness to text adversarial attacks by randomized [mask]","venue":null,"work_id":"b88c5a4c-4a7d-4ddf-8827-4e143c9f4345","year":null},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.807693Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:0cbdc15c41001d8e269c728cf917832b3226ae401baa7baffb33e5ac5769988f","observation_id":"312e2345-2fdd-4ac1-a6ec-d2dfff4e45a6","resolution":{"observed_at":"2026-08-08T17:43:25.303495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.812581Z","title":"Character-level convolutional networks for text classification","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.812581Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:025d6644f018320de6312a218d66bb62b0eafcaf553be387a426882f8ced98fb","observation_id":"cef4db56-48d3-448c-8242-a6debb71f720","resolution":{"observed_at":"2026-08-08T17:43:24.812581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.273641Z","title":"Trojaning language models for fun and profit","venue":null,"work_id":"7b5762f2-884f-4ab6-b785-b97f686df4f8","year":2021},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.816784Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:3e39f569a8f68ea11ff8b6d046ab8cd0ed1607fc3e589da064f95d5bd884d31d","observation_id":"49ca8bee-c2a5-46fd-bc8a-bd6a496d897d","resolution":{"observed_at":"2026-08-08T17:43:25.278331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.258847Z","title":"Text-crs: A generalized certified robustness framework against textual adversarial attacks","venue":null,"work_id":"628f4399-291f-4969-98e6-d97ca93ad568","year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.821444Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:cb224e4cf2b677134e3a7073dad54f6c6b7d566cb896e66cfdb715c4f0461904","observation_id":"ede714ba-3973-4aae-a2d4-751813776b43","resolution":{"observed_at":"2026-08-08T17:43:25.263857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.238780Z","title":"Random smooth-based certified defense against text adversarial attack","venue":null,"work_id":"f4659d7f-998f-4283-a75d-7e9c03d08b4c","year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.825985Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:144363cf7495c03db76af5438a05af95d83bf9ccb5cc0126e2c9fcd990f8f46b","observation_id":"6f1040fc-9eb7-41ed-85cb-73dbaae08c25","resolution":{"observed_at":"2026-08-08T17:43:25.247916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07171","last_updated":"2023-07-14T05:40:24Z","snapshot_observed_at":"2026-07-06T15:53:57.519425Z","submitted_at":"2023-07-14T05:40:24Z","title":"Certified Robustness for Large Language Models with Self-Denoising","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.07171","snapshot_observed_at":"2026-08-08T17:43:24.830390Z","title":"Certified robustness for large language models with self-denoising","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.830390Z"},"links":{"cited_paper":"/paper/2307.07171","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:258b8ca361e6ce1a3aeaff06abbc784fe814bb5e1e912086d768c4d27a671a8a","observation_id":"bdf6d03d-f83b-47cf-8651-1ae4ad5df79f","resolution":{"observed_at":"2026-08-08T17:43:24.830390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.224007Z","title":"Certified robustness against natural language attacks by causal intervention","venue":null,"work_id":"12c90a41-41e1-4997-9cbb-568edf1c9be5","year":2022},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.835167Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:15f2f7d47c3c4c3c417a438c346115f2a28a650675619f0323de02ae6fdf0031","observation_id":"35e2492d-6065-447b-a01a-6db1d943f88e","resolution":{"observed_at":"2026-08-08T17:43:25.228939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12168","last_updated":"2024-03-29T12:12:30Z","snapshot_observed_at":"2026-08-06T19:16:12.768633Z","submitted_at":"2024-02-19T14:22:54Z","title":"Defending Against Weight-Poisoning Backdoor Attacks for Parameter-Efficient Fine-Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12168","snapshot_observed_at":"2026-08-08T17:43:24.844859Z","title":"Defending against weight-poisoning backdoor attacks for parameter-efficient fine-tuning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.844859Z"},"links":{"cited_paper":"/paper/2402.12168","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:72c28d72a9117748b9fe73a7bd14b80797824d2a20fb2ea612357f9d24d8ce43","observation_id":"9909c6b8-19a9-45bd-92c7-d908ade9326e","resolution":{"observed_at":"2026-08-08T17:43:24.844859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:25.208768Z","title":"Moderate-fitting as a natural backdoor defender for pre-trained language models","venue":null,"work_id":"64c5d6d3-d5b6-4b6e-b1ee-739a55330148","year":2022},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.848893Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:5cc10963911e63ce5d6b33b7dd85095373eed4b9215099e4bc90dffcc1796222","observation_id":"0bc981d4-ce1b-4f45-9926-d7fe02f2ad0f","resolution":{"observed_at":"2026-08-08T17:43:25.214058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.852617Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.852617Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:3255ad265cdfef3b819c60f0bb4327eb8c60fda2276289f9065ff806498ca1e1","observation_id":"3e495699-67c5-4fed-b617-b36584aed68a","resolution":{"observed_at":"2026-08-08T17:43:24.852617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T17:43:24.856921Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.856921Z"},"links":{"citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:f7eb20fc41f5703ffbb09d21e95e76196bc2e3fddc12cb019d1e38b392507ee8","observation_id":"3539ce4e-c4ef-42ed-bbd3-eccf26facc59","resolution":{"observed_at":"2026-08-08T17:43:24.856921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01219","last_updated":"2023-11-10T11:28:53Z","snapshot_observed_at":"2026-08-02T15:05:54.493547Z","submitted_at":"2023-05-02T06:19:36Z","title":"Prompt as Triggers for Backdoor Attack: Examining the Vulnerability in Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.01219","snapshot_observed_at":"2026-08-08T17:43:24.861099Z","title":"Ken Lang","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-08T17:43:24.861099Z"},"links":{"cited_paper":"/paper/2305.01219","citing_paper":"/paper/2502.06892"},"observation_digest":"sha256:bf7af81b7830756471b7814306f9d5bea8e41ed81fea0a9cb5bafdaf66f1a4d6","observation_id":"ce4d46fb-e9dc-4ef1-820f-3fe58b5014c4","resolution":{"observed_at":"2026-08-08T17:43:24.861099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06892","last_updated":"2025-02-09T12:03:59Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T17:35:17.510835Z","submitted_at":"2025-02-09T12:03:59Z","title":"Certifying Language Model Robustness with Fuzzed Randomized Smoothing: An Efficient Defense Against Backdoor Attacks"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":3,"verified_fuzzy":34},"total_outbound_references":56},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2502.06892."}