{"as_of":"2026-08-22T02:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52865c52699954380ca276daa86440ce08c94470b678b99212a25f54adc3f573","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:20:38.068417Z","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-12T11:20:40.036429Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.00091","last_updated":"2022-02-28T20:52:24Z","snapshot_observed_at":"2026-08-16T17:17:58.973370Z","submitted_at":"2022-02-28T20:52:24Z","title":"Dynamic N:M Fine-grained Structured Sparse Attention Mechanism","version":1},"cited_work":{"arxiv_id":"2203.00091","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.00091","snapshot_observed_at":"2026-08-12T11:20:40.036429Z","title":"Dynamic N:M Fine-grained Structured Sparse Attention Mechanism","venue":"cs.LG","work_id":"8fded5fa-7d89-4fb0-b1af-e93d1da53116","year":2022},"citing_paper":{"arxiv_id":"2411.18376","last_updated":"2024-11-27T14:25:00Z","snapshot_observed_at":"2026-08-18T05:01:20.838152Z","submitted_at":"2024-11-27T14:25:00Z","title":"Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T11:20:38.068417Z"},"links":{"cited_paper":"/paper/2203.00091","citing_paper":"/paper/2411.18376"},"observation_digest":"sha256:659c3e839bf211a204baa710a57b9f24f000ffd579bd315d62b62a46d69066fd","observation_id":"bf8ead35-a488-4171-89bb-00e1b6e08c53","resolution":{"observed_at":"2026-08-12T11:20:40.045719Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2203.00091/citation-record","integrity":"/paper/2203.00091/integrity","json":"/paper/2203.00091/citation-record.json","paper":"/paper/2203.00091"},"outbound":[],"paper":{"arxiv_id":"2203.00091","last_updated":"2022-02-28T20:52:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:17:58.973370Z","submitted_at":"2022-02-28T20:52:24Z","title":"Dynamic N:M Fine-grained Structured Sparse Attention Mechanism"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2203.00091."}