{"as_of":"2026-08-09T13:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c675301b8393d2dc857ff7235d866e1f885b6d900c403460c01401f51db423a1","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:12:08.327489Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T12:12:14.713293Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.11435","last_updated":"2021-09-08T01:57:12Z","snapshot_observed_at":"2026-08-09T04:47:54.779249Z","submitted_at":"2019-08-23T13:40:06Z","title":"Improving Adversarial Robustness via Attention and Adversarial Logit Pairing","version":2},"cited_work":{"arxiv_id":"1908.11435","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.11435","snapshot_observed_at":"2026-08-07T12:12:14.713293Z","title":"Improving Adversarial Robustness via Attention and Adversarial Logit Pairing","venue":"cs.LG","work_id":"479101c9-cadd-4d4e-ab80-4f3cf672b65a","year":2019},"citing_paper":{"arxiv_id":"2506.00325","last_updated":"2025-05-31T00:37:28Z","snapshot_observed_at":"2026-08-09T01:58:35.331124Z","submitted_at":"2025-05-31T00:37:28Z","title":"Towards Effective and Efficient Adversarial Defense with Diffusion Models for Robust Visual Tracking","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:12:08.327489Z"},"links":{"cited_paper":"/paper/1908.11435","citing_paper":"/paper/2506.00325"},"observation_digest":"sha256:a2e5a7720a83818d5da088d66667971987f856b5fa2d5aca3d0ccc29b0b890b0","observation_id":"f3b43817-2f82-4f22-82e8-e650360dec80","resolution":{"observed_at":"2026-08-07T12:12:14.776638Z","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":{"arxiv_id":"1908.11435","last_updated":"2021-09-08T01:57:12Z","snapshot_observed_at":"2026-08-09T04:47:54.779249Z","submitted_at":"2019-08-23T13:40:06Z","title":"Improving Adversarial Robustness via Attention and Adversarial Logit Pairing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.11435","snapshot_observed_at":"2026-08-04T16:59:54.080314Z","title":"Goodman, X","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2509.11220","last_updated":"2025-09-14T11:44:43Z","snapshot_observed_at":"2026-08-09T10:08:55.588730Z","submitted_at":"2025-09-14T11:44:43Z","title":"ANROT-HELANet: Adverserially and Naturally Robust Attention-Based Aggregation Network via The Hellinger Distance for Few-Shot Classification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T16:59:54.080314Z"},"links":{"cited_paper":"/paper/1908.11435","citing_paper":"/paper/2509.11220"},"observation_digest":"sha256:dc2c353fcb6bfd3efcfb587d2fc2b2fcfef46f8a49f9d023d19fcae417112fd7","observation_id":"5292629c-93d5-45a4-9bc5-83a328cf0da6","resolution":{"observed_at":"2026-08-04T16:59:54.080314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1908.11435/citation-record","integrity":"/paper/1908.11435/integrity","json":"/paper/1908.11435/citation-record.json","paper":"/paper/1908.11435"},"outbound":[],"paper":{"arxiv_id":"1908.11435","last_updated":"2021-09-08T01:57:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T04:47:54.779249Z","submitted_at":"2019-08-23T13:40:06Z","title":"Improving Adversarial Robustness via Attention and Adversarial Logit Pairing"},"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 2 inbound Pith citation observations for arXiv:1908.11435."}