{"as_of":"2026-08-22T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54503fd318d13e602f29190c9c52735268b5cf06bd33449146bd64123a4bd2bc","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.210674Z","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:39.729114Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.03356","last_updated":"2021-11-18T08:51:42Z","snapshot_observed_at":"2026-08-21T18:15:24.321111Z","submitted_at":"2021-07-07T17:01:34Z","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","version":5},"cited_work":{"arxiv_id":"2107.03356","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.03356","snapshot_observed_at":"2026-08-12T11:20:39.729114Z","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","venue":"cs.LG","work_id":"e0104e49-f99a-4865-a0b9-5fff8acb68fa","year":2021},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-12T11:20:38.210674Z"},"links":{"cited_paper":"/paper/2107.03356","citing_paper":"/paper/2411.18376"},"observation_digest":"sha256:a99fc4b39900c9fc9ee12ba89692ab0644c04029508602e59e07a69d48c5055d","observation_id":"07dd09a9-7aaa-48e2-b362-7842e7c071e4","resolution":{"observed_at":"2026-08-12T11:20:39.735567Z","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/2107.03356/citation-record","integrity":"/paper/2107.03356/integrity","json":"/paper/2107.03356/citation-record.json","paper":"/paper/2107.03356"},"outbound":[],"paper":{"arxiv_id":"2107.03356","last_updated":"2021-11-18T08:51:42Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-21T18:15:24.321111Z","submitted_at":"2021-07-07T17:01:34Z","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information"},"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:2107.03356."}