{"as_of":"2026-08-18T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34cf41af81a8a76929af3d60e225e627bff19401fd604c9aef1e1ddf79c6cbd5","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:31:43.140140Z","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-07T04:15:18.705647Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.09844","last_updated":"2022-02-27T07:42:30Z","snapshot_observed_at":"2026-08-16T17:20:00.575217Z","submitted_at":"2022-02-20T15:52:08Z","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09844","snapshot_observed_at":"2026-08-15T20:31:43.140140Z","title":"Sparsity winning twice: Better robust generalization from more efficient training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12803","last_updated":"2025-05-19T07:32:06Z","snapshot_observed_at":"2026-08-18T00:41:55.459190Z","submitted_at":"2025-05-19T07:32:06Z","title":"Informed Mixing -- Improving Open Set Recognition via Attribution-based Augmentation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T20:31:43.140140Z"},"links":{"cited_paper":"/paper/2202.09844","citing_paper":"/paper/2505.12803"},"observation_digest":"sha256:8015499e440673019a89bc15134f4bf082329a71ae8298a4044ac92780d3b3f4","observation_id":"9d2ce34d-811b-4584-bceb-01cc3ec6ccf6","resolution":{"observed_at":"2026-08-15T20:31:43.140140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09844","last_updated":"2022-02-27T07:42:30Z","snapshot_observed_at":"2026-08-16T17:20:00.575217Z","submitted_at":"2022-02-20T15:52:08Z","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.09844","snapshot_observed_at":"2026-08-07T13:12:59.672324Z","title":"Sparsity winning twice: Better robust generaliztion from more efficient training,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.22486","last_updated":"2025-05-28T15:36:02Z","snapshot_observed_at":"2026-08-16T05:30:50.070048Z","submitted_at":"2025-05-28T15:36:02Z","title":"Understanding Adversarial Training with Energy-based Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:12:59.672324Z"},"links":{"cited_paper":"/paper/2202.09844","citing_paper":"/paper/2505.22486"},"observation_digest":"sha256:0d4633efa61bb2062c89f67d8db78f6498869f71a9206eab69cb3a19f3db8c88","observation_id":"8ce0a46a-f246-49b5-8b15-3ab9c510bcb5","resolution":{"observed_at":"2026-08-07T13:12:59.672324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.09844","last_updated":"2022-02-27T07:42:30Z","snapshot_observed_at":"2026-08-16T17:20:00.575217Z","submitted_at":"2022-02-20T15:52:08Z","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","version":3},"cited_work":{"arxiv_id":"2202.09844","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.09844","snapshot_observed_at":"2026-08-07T04:15:18.705647Z","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","venue":"cs.CV","work_id":"0312bc34-58f2-4544-a5de-e27cb9edd0e2","year":2022},"citing_paper":{"arxiv_id":"2506.11449","last_updated":"2025-06-13T04:01:34Z","snapshot_observed_at":"2026-08-13T04:33:16.496512Z","submitted_at":"2025-06-13T04:01:34Z","title":"Dynamic Sparse Training of Diagonally Sparse Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:15:12.355089Z"},"links":{"cited_paper":"/paper/2202.09844","citing_paper":"/paper/2506.11449"},"observation_digest":"sha256:5849d04467dce1e890a3418e05bd7379cdefe13b76a4a9c64f3edff5adbe0f2e","observation_id":"57136f77-88a8-4ef1-80eb-f5a0bff34629","resolution":{"observed_at":"2026-08-07T04:15:18.709283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.09844/citation-record","integrity":"/paper/2202.09844/integrity","json":"/paper/2202.09844/citation-record.json","paper":"/paper/2202.09844"},"outbound":[],"paper":{"arxiv_id":"2202.09844","last_updated":"2022-02-27T07:42:30Z","latest_version":3,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T17:20:00.575217Z","submitted_at":"2022-02-20T15:52:08Z","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2202.09844."}