{"as_of":"2026-08-14T22:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0220a59357283a70911a6c2f822adaf8c69f164f14791b603d7d82e45f0751a2","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:31:33.256015Z","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-05-11T06:15:59.164578Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-08-11T23:31:33.256015Z","title":"Information complexity of stochastic convex optimization: Applications to generalization and memorization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.02432","last_updated":"2024-12-03T12:57:08Z","snapshot_observed_at":"2026-08-14T17:27:21.342515Z","submitted_at":"2024-12-03T12:57:08Z","title":"Improved Localized Machine Unlearning Through the Lens of Memorization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T23:31:33.256015Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2412.02432"},"observation_digest":"sha256:c765116c2d68fa2aba93efd4f2212222904aadb37453396757002935a8b3625b","observation_id":"a466dec7-15c4-4d07-9a66-eb6a66ca664e","resolution":{"observed_at":"2026-08-11T23:31:33.256015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-08-11T18:45:40.868623Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.07684","last_updated":"2024-12-10T17:18:33Z","snapshot_observed_at":"2026-08-14T07:03:13.814701Z","submitted_at":"2024-12-10T17:18:33Z","title":"The Pitfalls of Memorization: When Memorization Hurts Generalization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T18:45:40.868623Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2412.07684"},"observation_digest":"sha256:fe9174671b51cd293da728732f8a16159645379fac4b8192a2c49e4845d51de9","observation_id":"fc2fb313-7f45-4365-80bb-add938c32120","resolution":{"observed_at":"2026-08-11T18:45:40.868623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-08-08T20:08:57.275663Z","title":"Information complexity of stochastic convex optimization: Applications to generalization and memorization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05159","last_updated":"2025-05-27T16:54:17Z","snapshot_observed_at":"2026-08-14T04:57:22.818850Z","submitted_at":"2025-02-07T18:41:21Z","title":"A Lightweight Method to Disrupt Memorized Sequences in LLM","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T20:08:57.275663Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2502.05159"},"observation_digest":"sha256:45ae800fed1b38ea2870dc13dafdfa018c52368fdb05be6b5ca30fcea305ea78","observation_id":"89d0b8c9-37f5-4fad-afc5-bfc94d30165e","resolution":{"observed_at":"2026-08-08T20:08:57.275663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-08-06T14:56:03.906871Z","title":"Information complexity of stochastic convex optimization: Applications to generalization and memorization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17895","last_updated":"2025-07-23T19:46:08Z","snapshot_observed_at":"2026-08-14T20:22:41.201269Z","submitted_at":"2025-07-23T19:46:08Z","title":"Lower Bounds for Public-Private Learning under Distribution Shift","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T14:56:03.906871Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2507.17895"},"observation_digest":"sha256:96d1b7b758450b665288598ca35e5c13291b85bffbd89b2079b41b9e9800d553","observation_id":"9757a501-e865-4b83-96d9-6bca12f90fc4","resolution":{"observed_at":"2026-08-06T14:56:03.906871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":"2402.09327","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information complexity of stochastic convex optimization: Applications to generalization and memorization","venue":null,"work_id":"de767f62-d55b-4150-8d11-c8d373b6bbc3","year":2024},"citing_paper":{"arxiv_id":"2604.07962","last_updated":"2026-04-09T08:24:52Z","snapshot_observed_at":"2026-07-06T22:57:09.435331Z","submitted_at":"2026-04-09T08:24:52Z","title":"Is your algorithm unlearning or untraining?","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T18:06:08.962042Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2604.07962"},"observation_digest":"sha256:8fd28d43842bb370eec437a679a41155c651f75e2cd5b88daff886e895ebbdd8","observation_id":"d5cd5cde-afc1-4784-bc59-a4b2b0b59e78","resolution":{"observed_at":"2026-05-11T05:30:59.279716Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":"2402.09327","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information complexity of stochastic convex optimization: Applications to generalization and memorization","venue":null,"work_id":"de767f62-d55b-4150-8d11-c8d373b6bbc3","year":2024},"citing_paper":{"arxiv_id":"2604.08519","last_updated":"2026-04-09T17:55:50Z","snapshot_observed_at":"2026-08-12T23:12:37.728031Z","submitted_at":"2026-04-09T17:55:50Z","title":"Cram Less to Fit More: Training Data Pruning Improves Memorization of Facts","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-10T17:42:31.465077Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2604.08519"},"observation_digest":"sha256:9e3569fbf61b47f116d011778d76b7f53e79e87999b83dedc6889301fcd57b8a","observation_id":"ac394751-4551-4077-90bb-27bdf6ff6b42","resolution":{"observed_at":"2026-05-11T06:15:59.168795Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09327","snapshot_observed_at":"2026-08-06T00:43:05.484211Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01032","last_updated":"2026-08-02T06:27:55Z","snapshot_observed_at":"2026-08-14T18:42:23.631146Z","submitted_at":"2026-08-02T06:27:55Z","title":"The Fourth Quadrant: A Stylized View of Benign Misfitting","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T00:43:05.484211Z"},"links":{"cited_paper":"/paper/2402.09327","citing_paper":"/paper/2608.01032"},"observation_digest":"sha256:758eb0766a0b4f44b2e45abdf92c8e158bdb2cf97dac63fc01e7868728c18070","observation_id":"dc1b8b78-18a6-44f6-a55d-f07aa0abdfc0","resolution":{"observed_at":"2026-08-06T00:43:05.484211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09327/citation-record","integrity":"/paper/2402.09327/integrity","json":"/paper/2402.09327/citation-record.json","paper":"/paper/2402.09327"},"outbound":[],"paper":{"arxiv_id":"2402.09327","last_updated":"2024-07-18T17:37:59Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:18:56.331547Z","submitted_at":"2024-02-14T17:17:30Z","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization"},"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 7 inbound Pith citation observations for arXiv:2402.09327."}