{"as_of":"2026-08-15T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7583f5e99224ecde0a15326d582d3d76f4aaf74c7643fe5ce55748c9773e5d2","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:59:23.565876Z","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-03T08:17:45.772573Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-08-07T05:59:23.565876Z","title":"Optimizing ml training with metagradient descent","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.06656","last_updated":"2025-09-09T20:12:30Z","snapshot_observed_at":"2026-08-14T02:13:24.252155Z","submitted_at":"2025-06-07T04:19:21Z","title":"Rescaled Influence Functions: Accurate Data Attribution in High Dimension","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:59:23.565876Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2506.06656"},"observation_digest":"sha256:82df7062c567fe689ea24f7152402bbf5ccac2bbd6b7ed7033e12d07d1b21644","observation_id":"b56acc0a-63b6-4bac-9816-13317182492c","resolution":{"observed_at":"2026-08-07T05:59:23.565876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-08-07T05:01:13.570335Z","title":"Optimizing ml training with metagradient descent","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10038","last_updated":"2025-06-10T22:37:39Z","snapshot_observed_at":"2026-08-09T04:36:51.228004Z","submitted_at":"2025-06-10T22:37:39Z","title":"Ambient Diffusion Omni: Training Good Models with Bad Data","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:13.570335Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2506.10038"},"observation_digest":"sha256:fb0e63783adebe897244b8a3a6f636426e30093152cae29b4479f1c421d42dfe","observation_id":"aa85e7e3-0c7f-4065-9d18-86d5f756d2d2","resolution":{"observed_at":"2026-08-07T05:01:13.570335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":"2503.13751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-07-03T08:17:45.772573Z","title":"Optimizing ml training with metagradient descent.arXiv preprint arXiv:2503.13751","venue":null,"work_id":"66aeda2f-1f9e-437a-9232-be5d72a03ff6","year":2025},"citing_paper":{"arxiv_id":"2512.12572","last_updated":"2026-05-15T21:16:17Z","snapshot_observed_at":"2026-08-15T12:18:00.276841Z","submitted_at":"2025-12-14T06:33:52Z","title":"On the Accuracy of Newton Step and Influence Function Data Attributions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T17:47:21.976868Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2512.12572"},"observation_digest":"sha256:7b75d21dfe2a63c8661d18828c7547bb973200025d7435dd4635b3664910e482","observation_id":"d598a2ec-91af-4bee-9bc0-e66be976e966","resolution":{"observed_at":"2026-05-21T17:50:26.331937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":"2503.13751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-07-03T08:17:45.772573Z","title":"Optimizing ml training with metagradient descent.arXiv preprint arXiv:2503.13751","venue":null,"work_id":"66aeda2f-1f9e-437a-9232-be5d72a03ff6","year":2025},"citing_paper":{"arxiv_id":"2602.03783","last_updated":"2026-05-10T21:29:30Z","snapshot_observed_at":"2026-08-10T21:55:41.027597Z","submitted_at":"2026-02-03T17:43:48Z","title":"Efficient Estimation of Kernel Surrogate Models for Task Attribution","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T07:57:57.953637Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2602.03783"},"observation_digest":"sha256:022abdf2fb5056f0e8c948d49583edd25967966366a1c770f411b2ff5c21d964","observation_id":"b8a621c9-dc4e-48df-8b4c-9552b452d0e0","resolution":{"observed_at":"2026-05-16T08:00:44.852492Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":"2503.13751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-07-03T08:17:45.772573Z","title":"Optimizing ml training with metagradient descent.arXiv preprint arXiv:2503.13751","venue":null,"work_id":"66aeda2f-1f9e-437a-9232-be5d72a03ff6","year":2025},"citing_paper":{"arxiv_id":"2604.07328","last_updated":"2026-06-18T15:41:59Z","snapshot_observed_at":"2026-08-15T00:09:39.904746Z","submitted_at":"2026-04-08T17:46:06Z","title":"How to sketch a learning algorithm","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T18:07:19.602053Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2604.07328"},"observation_digest":"sha256:d0ba361aa0157964b2e00fcbc717daa9a87442ff205db73b05291af416ad4407","observation_id":"728f42ec-647a-4e0c-915e-39c5d955d83b","resolution":{"observed_at":"2026-05-11T05:30:56.486611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":"2503.13751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-07-03T08:17:45.772573Z","title":"Optimizing ml training with metagradient descent.arXiv preprint arXiv:2503.13751","venue":null,"work_id":"66aeda2f-1f9e-437a-9232-be5d72a03ff6","year":2025},"citing_paper":{"arxiv_id":"2604.13130","last_updated":"2026-04-13T22:27:31Z","snapshot_observed_at":"2026-08-15T16:42:10.035385Z","submitted_at":"2026-04-13T22:27:31Z","title":"Generalization Guarantees on Data-Driven Tuning of Gradient Descent with Langevin Updates","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T15:13:18.231802Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2604.13130"},"observation_digest":"sha256:fc99eba4237866668f7150c6af36198fa97d4240f38ba1375b7bfee2d73fd28b","observation_id":"334f4691-5898-4fcb-ab71-673c33427254","resolution":{"observed_at":"2026-05-11T11:01:04.333596Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":"2503.13751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-07-03T08:17:45.772573Z","title":"Optimizing ml training with metagradient descent.arXiv preprint arXiv:2503.13751","venue":null,"work_id":"66aeda2f-1f9e-437a-9232-be5d72a03ff6","year":2025},"citing_paper":{"arxiv_id":"2605.08144","last_updated":"2026-05-02T19:43:16Z","snapshot_observed_at":"2026-08-13T14:04:31.314668Z","submitted_at":"2026-05-02T19:43:16Z","title":"NoiseRater: Meta-Learned Noise Valuation for Diffusion Model Training","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T01:44:04.922621Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2605.08144"},"observation_digest":"sha256:85092e8ea3c5013eb147df209bb4a65aa56699cee300d54a8f17d1465dc3fe6c","observation_id":"bafecd07-4277-4272-bf18-b27931587a08","resolution":{"observed_at":"2026-05-12T01:46:13.878540Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":"2503.13751","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-07-03T08:17:45.772573Z","title":"Optimizing ml training with metagradient descent.arXiv preprint arXiv:2503.13751","venue":null,"work_id":"66aeda2f-1f9e-437a-9232-be5d72a03ff6","year":2025},"citing_paper":{"arxiv_id":"2606.11660","last_updated":"2026-06-10T04:56:45Z","snapshot_observed_at":"2026-08-06T07:45:14.579703Z","submitted_at":"2026-06-10T04:56:45Z","title":"Bergson: An Open Source Library for Data Attribution","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T10:48:50.888928Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2606.11660"},"observation_digest":"sha256:62184c947c927a5422f46c6d2d61d4676ebc0c36249b9f9259a072af379e95fe","observation_id":"062b9e3b-bdcb-4adb-ae86-03b18228c5e8","resolution":{"observed_at":"2026-07-03T08:17:45.773887Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.13751","snapshot_observed_at":"2026-08-01T17:46:56.130355Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17550","last_updated":"2026-07-20T04:51:20Z","snapshot_observed_at":"2026-08-14T22:33:02.601350Z","submitted_at":"2026-07-20T04:51:20Z","title":"(A)iSpy: Parasitic Trojans for Machine Learning Infrastructure","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T17:46:56.130355Z"},"links":{"cited_paper":"/paper/2503.13751","citing_paper":"/paper/2607.17550"},"observation_digest":"sha256:ba88fb074df9cbbfe25f836a78cb28e8bdc050265895023ba6b2d81cf93928b8","observation_id":"afb53d47-211d-446b-8a47-8809ce7e5e90","resolution":{"observed_at":"2026-08-01T17:46:56.130355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.13751/citation-record","integrity":"/paper/2503.13751/integrity","json":"/paper/2503.13751/citation-record.json","paper":"/paper/2503.13751"},"outbound":[],"paper":{"arxiv_id":"2503.13751","last_updated":"2025-03-17T22:18:24Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T14:15:19.240051Z","submitted_at":"2025-03-17T22:18:24Z","title":"Optimizing ML Training with Metagradient Descent"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2503.13751."}