{"as_of":"2026-08-09T23:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:49e9a4a1e2f0fb85973a22031d243b1dff8615c26c4aa889c824ee2bd98f4cb7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:43:24.760660Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T09:11:21.121296Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11750","last_updated":"2020-07-20T16:15:42Z","snapshot_observed_at":"2026-08-09T20:52:27.866727Z","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-09T11:22:28.299850Z","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:3a4686ac7b63525badff5f4bede5994807ba002f72494fb16f211854fc504d2e","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":{"arxiv_id":"2002.11750","last_updated":"2020-07-20T16:15:42Z","snapshot_observed_at":"2026-08-09T20:52:27.866727Z","submitted_at":"2020-02-26T19:15:46Z","title":"On Certifying Robustness against Backdoor Attacks via Randomized Smoothing","version":4},"cited_work":{"arxiv_id":"2002.11750","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11750","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On certifying robustness against backdoor attacks via randomized smoothing.ArXiv, abs/2002.11750","venue":null,"work_id":"25fb2954-ee91-4a27-902d-5d1d5c9d0279","year":2002},"citing_paper":{"arxiv_id":"2512.20865","last_updated":"2026-07-27T20:22:02Z","snapshot_observed_at":"2026-08-03T14:28:13.709835Z","submitted_at":"2025-12-24T00:49:47Z","title":"Robustness Certificates for Neural Networks Against Data Poisoning and Evasion Attacks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T20:32:13.535102Z"},"links":{"cited_paper":"/paper/2002.11750","citing_paper":"/paper/2512.20865"},"observation_digest":"sha256:6928afa33da0669959c6a9363acdb09bda7142f1fb51baa55d66d216781ab398","observation_id":"e623fea3-ccde-4d3b-b4a1-b4d67ea2138a","resolution":{"observed_at":"2026-05-16T20:33:24.355994Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2002.11750","last_updated":"2020-07-20T16:15:42Z","snapshot_observed_at":"2026-08-09T20:52:27.866727Z","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-03T14:28:31.566173Z","title":"On certifying robustness against backdoor attacks via randomized smoothing.arXiv preprint arXiv:2002.11750,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2512.20865","last_updated":"2026-07-27T20:22:02Z","snapshot_observed_at":"2026-08-03T14:28:13.709835Z","submitted_at":"2025-12-24T00:49:47Z","title":"Robustness Certificates for Neural Networks Against Data Poisoning and Evasion Attacks","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T14:28:31.566173Z"},"links":{"cited_paper":"/paper/2002.11750","citing_paper":"/paper/2512.20865"},"observation_digest":"sha256:26699a81ef8bef33ef87c9d6fe014b3a15734a3de52766edc3dbcfe7945d56dc","observation_id":"3cedfa2c-6a64-46be-ae97-a367de72ff3e","resolution":{"observed_at":"2026-08-03T14:28:31.566173Z","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-08-09T20:52:27.866727Z","submitted_at":"2020-02-26T19:15:46Z","title":"On Certifying Robustness against Backdoor Attacks via Randomized Smoothing","version":4},"cited_work":{"arxiv_id":"2002.11750","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11750","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On certifying robustness against backdoor attacks via randomized smoothing.ArXiv, abs/2002.11750","venue":null,"work_id":"25fb2954-ee91-4a27-902d-5d1d5c9d0279","year":2002},"citing_paper":{"arxiv_id":"2605.21780","last_updated":"2026-05-20T22:17:29Z","snapshot_observed_at":"2026-07-06T23:32:10.472558Z","submitted_at":"2026-05-20T22:17:29Z","title":"Provable Robustness against Backdoor Attacks via the Primal-Dual Perspective on Differential Privacy","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-22T09:10:05.320094Z"},"links":{"cited_paper":"/paper/2002.11750","citing_paper":"/paper/2605.21780"},"observation_digest":"sha256:990fe2dfccf74ef42f41a219d17e7582d5725ca59ac6530df49e5478ddc0379a","observation_id":"88036cc7-d5de-4b55-93a5-0d4d4e03e4f8","resolution":{"observed_at":"2026-05-22T09:11:21.123598Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2002.11750/citation-record","integrity":"/paper/2002.11750/integrity","json":"/paper/2002.11750/citation-record.json","paper":"/paper/2002.11750"},"outbound":[],"paper":{"arxiv_id":"2002.11750","last_updated":"2020-07-20T16:15:42Z","latest_version":4,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-09T20:52:27.866727Z","submitted_at":"2020-02-26T19:15:46Z","title":"On Certifying Robustness against Backdoor Attacks via Randomized Smoothing"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2002.11750."}