{"as_of":"2026-08-08T21:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b42b3b8436fdbb9b5e5091e952e45aaedef252dcaa14f5d096ef9f8674e7ed43","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:10:20.597441Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.00329/citation-record","integrity":"/paper/2602.00329/integrity","json":"/paper/2602.00329/citation-record.json","paper":"/paper/2602.00329"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-03T06:10:20.239074Z","title":"Pointer sentinel mixture models.arXiv preprint arXiv:1609.07843,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.239074Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:ccd882833733cd3dbe115f4dab40ca357a7da3e88263d0a2e858bd34469f7d36","observation_id":"2e3d8915-f2a3-4a4b-8bd5-3a0efc50cbce","resolution":{"observed_at":"2026-08-03T06:10:20.239074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:10:20.349785Z","title":"A multilinear sampling algorithm to estimate shapley values","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.349785Z"},"links":{"citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:b0bf47584a5254c12cb81713ccfd3edeaf73b63d283152dd7d79cb0d91c444b9","observation_id":"0142d050-fd9c-4146-a6ba-75cfcb736374","resolution":{"observed_at":"2026-08-03T06:10:20.349785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.04059","last_updated":"2025-07-05T14:46:42Z","snapshot_observed_at":"2026-08-07T12:31:08.588633Z","submitted_at":"2025-07-05T14:46:42Z","title":"Attributing Data for Sharpness-Aware Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.04059","snapshot_observed_at":"2026-08-03T06:10:20.420575Z","title":"Attributing data for sharpness-aware minimization.CoRR, abs/2507.04059, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.420575Z"},"links":{"cited_paper":"/paper/2507.04059","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:867a7e8fc1c4b79cafa35186b7d57b58d1807976c6f6418a8e1008e0b24bbd4a","observation_id":"1319ece6-7896-4d51-b873-a37d8ec87ba1","resolution":{"observed_at":"2026-08-03T06:10:20.420575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-03T06:10:20.485622Z","title":"Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter.arXiv preprint arXiv:1910.01108,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":1951,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.485622Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:a5938b35b0efbb92ebd050c0a3e8ec06396cdbdca1c41ca61fd31a988165b521","observation_id":"a20931e6-86a3-4a63-9895-3f8c5ea16edc","resolution":{"observed_at":"2026-08-03T06:10:20.485622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11431","last_updated":"2023-02-22T15:13:45Z","snapshot_observed_at":"2026-08-07T23:37:25.901914Z","submitted_at":"2023-02-22T15:13:45Z","title":"A Note on \"Towards Efficient Data Valuation Based on the Shapley Value''","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11431","snapshot_observed_at":"2026-08-03T06:10:20.590137Z","title":"Data banzhaf: A robust data valuation framework for machine learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.590137Z"},"links":{"cited_paper":"/paper/2302.11431","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:bbee740056654ad18e45af2e471ea1895cd20e2b4024dd220198dc2fec463879","observation_id":"0d9c79e5-970d-40f1-986a-b7353575043b","resolution":{"observed_at":"2026-08-03T06:10:20.590137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14049","last_updated":"2022-01-18T23:18:59Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:55Z","title":"Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14049","snapshot_observed_at":"2026-08-03T06:10:20.128537Z","title":"Beta shapley: a unified and noise-reduced data valuation framework for machine learning.arXiv preprint arXiv:2110.14049,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.128537Z"},"links":{"cited_paper":"/paper/2110.14049","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:b45200b9245714ff99504b01d0c99fee3f107446232da427061f8972c13901ea","observation_id":"6faa665d-c973-4992-804a-acd4a4577cab","resolution":{"observed_at":"2026-08-03T06:10:20.128537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03296","last_updated":"2023-08-07T04:47:42Z","snapshot_observed_at":"2026-07-06T16:03:14.694457Z","submitted_at":"2023-08-07T04:47:42Z","title":"Studying Large Language Model Generalization with Influence Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03296","snapshot_observed_at":"2026-08-03T06:10:19.887693Z","title":"Studying large language model generalization with influence functions.arXiv preprint arXiv:2308.03296,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:19.887693Z"},"links":{"cited_paper":"/paper/2308.03296","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:918b8a5a08e1597f181ccc8c907663a780ae9af4c9aebf50e30e58aaf3a40ff1","observation_id":"5c8fade5-6a53-4363-9df6-80b59c18130c","resolution":{"observed_at":"2026-08-03T06:10:19.887693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:10:20.597441Z","title":"partial_same","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.597441Z"},"links":{"citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:a4749c842477084326f8e4783122ca4c8d59bf7916eb7def0dfd1387be7996fa","observation_id":"25e1f9a5-3ef0-46dc-8131-30f66c276b22","resolution":{"observed_at":"2026-08-03T06:10:20.597441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-03T06:10:20.071199Z","title":"Towards efficient data valuation based on the shapley value","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.071199Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:806f68de67bbc68b136dc1cf4987d9bb455f8b91c594ea4aa186d401706ca164","observation_id":"7fa31a97-aa96-422b-a9a2-ec1a5aa544ae","resolution":{"observed_at":"2026-08-03T06:10:20.071199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11667","last_updated":"2025-01-31T23:36:04Z","snapshot_observed_at":"2026-08-08T05:43:45.182949Z","submitted_at":"2024-11-18T15:45:41Z","title":"Dissecting Representation Misalignment in Contrastive Learning via Influence Function","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11667","snapshot_observed_at":"2026-08-03T06:10:19.970874Z","title":"Ferenc Ill´es and P´eter Ker´enyi","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:19.970874Z"},"links":{"cited_paper":"/paper/2411.11667","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:bde4bcee2eacff08c24f7b04f437db1fed2e14d27adc0029a4c74ffc05814d55","observation_id":"ee931607-5fde-471b-a40c-a18c1d7fd8b9","resolution":{"observed_at":"2026-08-03T06:10:19.970874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T05:44:04.990003Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":10},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2602.00329."}