{"as_of":"2026-08-08T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25eb05968d832a1f8af8c449d34ef8d55003ff625ed15d9a8c308d0fc23e33de","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-08T06:32:00.761636+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-07T12:46:45.377901Z","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:46:47.904211Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.01253","last_updated":"2025-03-04T08:59:26Z","snapshot_observed_at":"2026-08-07T17:34:36.283288Z","submitted_at":"2025-03-03T07:29:46Z","title":"NM-SpMM: Accelerating Matrix Multiplication Using N:M Sparsity with GPGPU","version":2},"cited_work":{"arxiv_id":"2503.01253","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.01253","snapshot_observed_at":"2026-08-07T12:46:47.904211Z","title":"NM-SpMM: Accelerating Matrix Multiplication Using N:M Sparsity with GPGPU","venue":"cs.DC","work_id":"a5f7e11a-f046-4ba7-8fa7-1a25e60f4c54","year":2025},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-07T21:24:51.840797Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:45.377901Z"},"links":{"cited_paper":"/paper/2503.01253","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:e90429c767863c9a870a701e99988a2c3998b8a3bcb00d65eee56e7b0de16b9f","observation_id":"976b74cf-9585-4876-94e4-e4dc744cbd38","resolution":{"observed_at":"2026-08-07T12:46:47.950556Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.01253/citation-record","integrity":"/paper/2503.01253/integrity","json":"/paper/2503.01253/citation-record.json","paper":"/paper/2503.01253"},"outbound":[],"paper":{"arxiv_id":"2503.01253","last_updated":"2025-03-04T08:59:26Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T17:34:36.283288Z","submitted_at":"2025-03-03T07:29:46Z","title":"NM-SpMM: Accelerating Matrix Multiplication Using N:M Sparsity with GPGPU"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2503.01253."}