{"as_of":"2026-08-09T12:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88f01049b601d499f287debcd37bbaabf21ce1272624df735b60f735e3b5eea0","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-09T06:31:02.800959+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:43.006169Z","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:48.152319Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.14623","last_updated":"2023-02-28T15:03:18Z","snapshot_observed_at":"2026-08-07T21:24:18.883326Z","submitted_at":"2023-02-28T15:03:18Z","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2302.14623","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.14623","snapshot_observed_at":"2026-08-07T12:46:48.152319Z","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","venue":"cs.LG","work_id":"644878b5-19ab-42aa-b0df-7ea15e6b6273","year":2023},"citing_paper":{"arxiv_id":"2505.23949","last_updated":"2025-05-29T18:59:43Z","snapshot_observed_at":"2026-08-09T00:04:12.371578Z","submitted_at":"2025-05-29T18:59:43Z","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:46:43.006169Z"},"links":{"cited_paper":"/paper/2302.14623","citing_paper":"/paper/2505.23949"},"observation_digest":"sha256:eab0d571730dc56736e4a9f36fca3bc098657f3ed6aaa74c384608d690cf2427","observation_id":"a9651dbc-92c8-4822-912f-e78517e79537","resolution":{"observed_at":"2026-08-07T12:46:48.209452Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2302.14623/citation-record","integrity":"/paper/2302.14623/integrity","json":"/paper/2302.14623/citation-record.json","paper":"/paper/2302.14623"},"outbound":[],"paper":{"arxiv_id":"2302.14623","last_updated":"2023-02-28T15:03:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T21:24:18.883326Z","submitted_at":"2023-02-28T15:03:18Z","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization"},"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 1 inbound Pith citation observation for arXiv:2302.14623."}