{"as_of":"2026-08-10T21:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9100202d2f003e1ea0222b2b4d001fe4c23f926410a85458fbfce1284e4c5fff","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-10T06:31:04.303077+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-06T15:54:42.424199Z","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-02T16:17:08.354831Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-08-06T15:54:42.424199Z","title":"Magic: Near-optimal data attribution for deep learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.14740","last_updated":"2025-07-19T20:18:51Z","snapshot_observed_at":"2026-08-08T04:14:02.730591Z","submitted_at":"2025-07-19T20:18:51Z","title":"Better Training Data Attribution via Better Inverse Hessian-Vector Products","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T15:54:42.424199Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2507.14740"},"observation_digest":"sha256:f859dce06829b8d0b4bc6af8a4e30773f12bd370dad432d7c09256fb69f3b51b","observation_id":"4c7db193-a0bf-4e0e-85a7-89e3682e91f4","resolution":{"observed_at":"2026-08-06T15:54:42.424199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-08-04T07:22:05.367970Z","title":"Magic: Near-optimal data attribution for deep learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27313","last_updated":"2026-08-02T16:40:30Z","snapshot_observed_at":"2026-08-08T04:38:26.888452Z","submitted_at":"2025-10-31T09:39:12Z","title":"LLM generation novelty through the lens of semantic similarity","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:05.367970Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2510.27313"},"observation_digest":"sha256:7041b26414fb2f2a231025e6b7f528d600a1fd3a6ff1bd852ac80e5e99a45ae3","observation_id":"589b7f10-d0f3-4193-a0e8-645a5b32c470","resolution":{"observed_at":"2026-08-04T07:22:05.367970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":"2504.16430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-02T16:17:08.354831Z","title":"Andrew Ilyas and Logan Engstrom","venue":null,"work_id":"c484e9f7-e12f-4fd7-adad-0297d799a472","year":2025},"citing_paper":{"arxiv_id":"2602.03783","last_updated":"2026-05-10T21:29:30Z","snapshot_observed_at":"2026-07-06T22:44:23.981940Z","submitted_at":"2026-02-03T17:43:48Z","title":"Efficient Estimation of Kernel Surrogate Models for Task Attribution","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T07:57:57.953637Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2602.03783"},"observation_digest":"sha256:88d46241ee50af2f180cd0a7f164e1b001cbfbd15480fe68830585e4ae66fee2","observation_id":"cf6fc1fa-11cb-4836-a304-ed9e132e9fde","resolution":{"observed_at":"2026-05-16T08:00:44.858296Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":"2504.16430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-02T16:17:08.354831Z","title":"Andrew Ilyas and Logan Engstrom","venue":null,"work_id":"c484e9f7-e12f-4fd7-adad-0297d799a472","year":2025},"citing_paper":{"arxiv_id":"2604.07328","last_updated":"2026-06-18T15:41:59Z","snapshot_observed_at":"2026-08-04T16:54:21.056199Z","submitted_at":"2026-04-08T17:46:06Z","title":"How to sketch a learning algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T18:07:19.602053Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2604.07328"},"observation_digest":"sha256:cf9f3f33b51f7c4e2594c062b07ca1016f575738c7b3d4adc82008c03fb38d44","observation_id":"ece4c010-1723-45db-b8eb-2aad9ad3324b","resolution":{"observed_at":"2026-05-11T05:30:56.453850Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":"2504.16430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-02T16:17:08.354831Z","title":"Andrew Ilyas and Logan Engstrom","venue":null,"work_id":"c484e9f7-e12f-4fd7-adad-0297d799a472","year":2025},"citing_paper":{"arxiv_id":"2605.18814","last_updated":"2026-05-12T09:50:45Z","snapshot_observed_at":"2026-08-03T23:45:53.132135Z","submitted_at":"2026-05-12T09:50:45Z","title":"How Faithful Is Trajectory-Based Data Attribution? Error Sources, Remedies, and Practical Guidelines","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T23:12:08.842805Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2605.18814"},"observation_digest":"sha256:ac9326035dcebc559dad161b045a6d3e923bd7d88ce97c1f381b12b897d720de","observation_id":"11c75c0c-7f29-4b56-afba-2bdccf6d5149","resolution":{"observed_at":"2026-05-20T23:13:50.446204Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":"2504.16430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-02T16:17:08.354831Z","title":"Andrew Ilyas and Logan Engstrom","venue":null,"work_id":"c484e9f7-e12f-4fd7-adad-0297d799a472","year":2025},"citing_paper":{"arxiv_id":"2606.06533","last_updated":"2026-06-03T17:58:14Z","snapshot_observed_at":"2026-08-08T13:41:57.990661Z","submitted_at":"2026-06-03T17:58:14Z","title":"Position: Don't Just \"Fix it in Post\": A Science of AI Must Study Training Dynamics","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T06:26:22.502014Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2606.06533"},"observation_digest":"sha256:506ec512f420e68dd0efbf78d127058cb09f3de92b3fee5dc9a9bac5220edc1a","observation_id":"0877e611-a7e8-44be-a61b-f9f97bcfde6f","resolution":{"observed_at":"2026-07-02T07:56:47.951304Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":"2504.16430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-02T16:17:08.354831Z","title":"Andrew Ilyas and Logan Engstrom","venue":null,"work_id":"c484e9f7-e12f-4fd7-adad-0297d799a472","year":2025},"citing_paper":{"arxiv_id":"2606.24890","last_updated":"2026-07-12T16:43:51Z","snapshot_observed_at":"2026-08-07T04:54:34.963444Z","submitted_at":"2026-04-30T02:18:50Z","title":"Small edits, large models: How Wikipedia advocacy shapes LLM values","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-01T09:03:09.977131Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2606.24890"},"observation_digest":"sha256:fea4d13c46d80287f840f39a4291cb564d483976261212b7d4412d206b373e54","observation_id":"2ac5f64b-8551-47a0-9bdc-da75901720b0","resolution":{"observed_at":"2026-07-01T09:05:36.485562Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-14T19:23:22.815333Z","title":"MAGIC: Near-optimal data attribution for deep learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.24890","last_updated":"2026-07-12T16:43:51Z","snapshot_observed_at":"2026-08-07T04:54:34.963444Z","submitted_at":"2026-04-30T02:18:50Z","title":"Small edits, large models: How Wikipedia advocacy shapes LLM values","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T19:23:22.815333Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2606.24890"},"observation_digest":"sha256:81510ee3f6d2dfa8ac69cd1ebf83b403d04b46282c2df185b0692347d458ef72","observation_id":"56ead02d-163d-4a52-9e1a-53f1a5415b7b","resolution":{"observed_at":"2026-07-14T19:23:22.815333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning","version":1},"cited_work":{"arxiv_id":"2504.16430","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.16430","snapshot_observed_at":"2026-07-02T16:17:08.354831Z","title":"Andrew Ilyas and Logan Engstrom","venue":null,"work_id":"c484e9f7-e12f-4fd7-adad-0297d799a472","year":2025},"citing_paper":{"arxiv_id":"2607.00510","last_updated":"2026-07-01T06:45:02Z","snapshot_observed_at":"2026-08-08T20:03:36.054987Z","submitted_at":"2026-07-01T06:45:02Z","title":"Prototype Language Models","version":1},"reference_index":163,"source":"arxiv_source","source_observed_at":"2026-07-02T16:13:43.039645Z"},"links":{"cited_paper":"/paper/2504.16430","citing_paper":"/paper/2607.00510"},"observation_digest":"sha256:73d94d3c098310b40f49e7264edf120d7f91f4e4f6548a138a1e915042714187","observation_id":"24ec7b89-af0a-4242-aa7d-bde8c7fb848c","resolution":{"observed_at":"2026-07-02T16:17:08.356434Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.16430/citation-record","integrity":"/paper/2504.16430/integrity","json":"/paper/2504.16430/citation-record.json","paper":"/paper/2504.16430"},"outbound":[],"paper":{"arxiv_id":"2504.16430","last_updated":"2025-04-23T05:32:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T16:00:00.424817Z","submitted_at":"2025-04-23T05:32:37Z","title":"MAGIC: Near-Optimal Data Attribution for Deep Learning"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2504.16430."}