{"as_of":"2026-08-05T22:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0451285862f9d625d6a33da89dcf476880ff0bfdb20d49b19ef88aed5fa25e4","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-05T06:32:48.257954+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-07-01T06:36:48.524846Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T11:56:56.100072Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.05705","last_updated":"2024-07-23T12:13:44Z","snapshot_observed_at":"2026-08-05T15:39:30.148142Z","submitted_at":"2023-12-09T23:13:32Z","title":"Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC","version":4},"cited_work":{"arxiv_id":"2312.05705","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.05705","snapshot_observed_at":"2026-07-02T11:56:56.100072Z","title":"arXiv preprint arXiv:2312.05705 , year=","venue":null,"work_id":"5bfec8bc-56d2-4381-8c6f-6007b8072e91","year":null},"citing_paper":{"arxiv_id":"2606.06418","last_updated":"2026-06-04T17:22:58Z","snapshot_observed_at":"2026-08-02T08:47:15.917924Z","submitted_at":"2026-06-04T17:22:58Z","title":"Double Preconditioning (DoPr): Optimization for Test-Time Performance, not Validation Loss","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-06-28T02:35:39.845487Z"},"links":{"cited_paper":"/paper/2312.05705","citing_paper":"/paper/2606.06418"},"observation_digest":"sha256:4975f18e6a5851cb603e251f72dce43de772db0fd397bd4c57e7c91770bfec90","observation_id":"cc8540e1-6702-4379-9ce7-5eb5c3a84c6d","resolution":{"observed_at":"2026-07-02T11:56:56.101416Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05705","last_updated":"2024-07-23T12:13:44Z","snapshot_observed_at":"2026-08-05T15:39:30.148142Z","submitted_at":"2023-12-09T23:13:32Z","title":"Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC","version":4},"cited_work":{"arxiv_id":"2312.05705","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.05705","snapshot_observed_at":"2026-07-02T11:56:56.100072Z","title":"arXiv preprint arXiv:2312.05705 , year=","venue":null,"work_id":"5bfec8bc-56d2-4381-8c6f-6007b8072e91","year":null},"citing_paper":{"arxiv_id":"2606.30813","last_updated":"2026-06-29T18:37:34Z","snapshot_observed_at":"2026-08-04T02:17:52.840024Z","submitted_at":"2026-06-29T18:37:34Z","title":"Gradient Smoothing: Coupling Layer-wise Updates for Improved Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-01T06:36:48.524846Z"},"links":{"cited_paper":"/paper/2312.05705","citing_paper":"/paper/2606.30813"},"observation_digest":"sha256:9d09139b9a66cae0114f760fdf3aaf9fe8d913f7c355841be03c62257d8c263e","observation_id":"c2b5d7ac-1f58-4e1e-a6bb-19126741aa7f","resolution":{"observed_at":"2026-07-01T09:25:41.261298Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.05705/citation-record","integrity":"/paper/2312.05705/integrity","json":"/paper/2312.05705/citation-record.json","paper":"/paper/2312.05705"},"outbound":[],"paper":{"arxiv_id":"2312.05705","last_updated":"2024-07-23T12:13:44Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T15:39:30.148142Z","submitted_at":"2023-12-09T23:13:32Z","title":"Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.05705."}