{"as_of":"2026-08-14T19:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cf2a047b50f05ab6c17e7ce7c5641e8f9bf25ca06e6f7f3b8cb71e1d74e0b12","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:28:28.926599Z","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-08T11:46:48.230378Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2201.10285","last_updated":"2022-10-14T09:21:48Z","snapshot_observed_at":"2026-08-14T17:01:55.568099Z","submitted_at":"2022-01-25T12:56:17Z","title":"Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.10285","snapshot_observed_at":"2026-08-11T13:28:28.926599Z","title":"Efficient approximations of the fisher matrix in neural networks using kronecker product singular value decomposition","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13148","last_updated":"2025-02-21T18:59:37Z","snapshot_observed_at":"2026-08-14T17:31:00.554747Z","submitted_at":"2024-12-17T18:13:18Z","title":"SWAN: SGD with Normalization and Whitening Enables Stateless LLM Training","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T13:28:28.926599Z"},"links":{"cited_paper":"/paper/2201.10285","citing_paper":"/paper/2412.13148"},"observation_digest":"sha256:c7c385938d11af8f6e220a1a91e37bbcb0fb3a80d197e6327f89f812c14219c8","observation_id":"ed262b40-e69e-451b-a28b-995efa0b4727","resolution":{"observed_at":"2026-08-11T13:28:28.926599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.10285","last_updated":"2022-10-14T09:21:48Z","snapshot_observed_at":"2026-08-14T17:01:55.568099Z","submitted_at":"2022-01-25T12:56:17Z","title":"Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition","version":6},"cited_work":{"arxiv_id":"2201.10285","doi":null,"metadata_source":"pith","pith_arxiv_id":"2201.10285","snapshot_observed_at":"2026-08-08T11:46:48.230378Z","title":"Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition","venue":"cs.NE","work_id":"3ebe46bc-be2c-474b-b475-2b769b7e28cc","year":2022},"citing_paper":{"arxiv_id":"2502.07752","last_updated":"2025-02-20T18:48:58Z","snapshot_observed_at":"2026-08-09T14:50:36.312825Z","submitted_at":"2025-02-11T18:27:19Z","title":"Towards Efficient Optimizer Design for LLM via Structured Fisher Approximation with a Low-Rank Extension","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-08T11:46:47.587382Z"},"links":{"cited_paper":"/paper/2201.10285","citing_paper":"/paper/2502.07752"},"observation_digest":"sha256:7e11c98381406aacee9932601b1bd2484e564f954b632787f574b331d5f5f1ae","observation_id":"8d0ec684-065f-49f1-905a-3d8e8d99d594","resolution":{"observed_at":"2026-08-08T11:46:48.234529Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2201.10285/citation-record","integrity":"/paper/2201.10285/integrity","json":"/paper/2201.10285/citation-record.json","paper":"/paper/2201.10285"},"outbound":[],"paper":{"arxiv_id":"2201.10285","last_updated":"2022-10-14T09:21:48Z","latest_version":6,"primary_category":"cs.NE","snapshot_observed_at":"2026-08-14T17:01:55.568099Z","submitted_at":"2022-01-25T12:56:17Z","title":"Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.10285."}