{"as_of":"2026-08-07T08:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f19d5ccb00381625ae2020beabb26aa679eab13d7d0a2323ae612569a324cd30","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:26:54.822164Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2509.08058/citation-record","integrity":"/paper/2509.08058/integrity","json":"/paper/2509.08058/citation-record.json","paper":"/paper/2509.08058"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.04898","last_updated":"2021-02-24T22:53:31Z","snapshot_observed_at":"2026-07-06T10:32:06.735077Z","submitted_at":"2021-01-13T06:15:56Z","title":"Unlearnable Examples: Making Personal Data Unexploitable","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.04898","snapshot_observed_at":"2026-08-04T21:26:54.795316Z","title":"Unlearnable examples: Making personal data unexploitable.arXiv preprint arXiv:2101.04898,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.795316Z"},"links":{"cited_paper":"/paper/2101.04898","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:8ea28cedf92b8ec41d96d76231b977f7d74ae4f59027ef65086c51bc136cfb24","observation_id":"93a520dc-18ef-4455-a7c4-cb33b1aa377c","resolution":{"observed_at":"2026-08-04T21:26:54.795316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02178","last_updated":"2019-12-04T18:58:26Z","snapshot_observed_at":"2026-07-06T08:42:06.688732Z","submitted_at":"2019-12-04T18:58:26Z","title":"Fantastic Generalization Measures and Where to Find Them","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.02178","snapshot_observed_at":"2026-08-04T21:26:54.798785Z","title":"Fantastic generalization measures and where to find them.arXiv preprint arXiv:1912.02178,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.798785Z"},"links":{"cited_paper":"/paper/1912.02178","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:c21c8784dfc84935d18699ddca726beeafcfc15aad70920b6559399e7b6eec30","observation_id":"352fd9d4-b7de-4a55-82d3-855098ac7f82","resolution":{"observed_at":"2026-08-04T21:26:54.798785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.04836","last_updated":"2017-02-09T20:38:16Z","snapshot_observed_at":"2026-07-06T05:10:58.923264Z","submitted_at":"2016-09-15T20:03:06Z","title":"On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.04836","snapshot_observed_at":"2026-08-04T21:26:54.802229Z","title":"On large-batch training for deep learning: Generalization gap and sharp minima.arXiv preprint arXiv:1609.04836,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.802229Z"},"links":{"cited_paper":"/paper/1609.04836","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:959b83c1d0b2cdb6fc2ad8843e597dbeeffaa6cc0d03e92c98eac065589f4847","observation_id":"c981be75-2632-4537-81ee-7ed74a1eb7fd","resolution":{"observed_at":"2026-08-04T21:26:54.802229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03258","last_updated":"2023-08-07T02:30:47Z","snapshot_observed_at":"2026-07-06T16:03:10.517945Z","submitted_at":"2023-08-07T02:30:47Z","title":"APBench: A Unified Benchmark for Availability Poisoning Attacks and Defenses","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03258","snapshot_observed_at":"2026-08-04T21:26:54.806956Z","title":"Apbench: A unified benchmark for availability poisoning attacks and defenses.arXiv preprint arXiv:2308.03258, 2023a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.806956Z"},"links":{"cited_paper":"/paper/2308.03258","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:a2ed139df6e072052f61e12f4301daa2931a4b839b6f48ce6bd92834f357e285","observation_id":"2b4e3783-ca31-4bcf-be64-7cb7f79ff10d","resolution":{"observed_at":"2026-08-04T21:26:54.806956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05729","last_updated":"2023-01-05T08:42:35Z","snapshot_observed_at":"2026-07-06T14:16:48.496031Z","submitted_at":"2022-11-10T17:56:38Z","title":"How Does Sharpness-Aware Minimization Minimize Sharpness?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.05729","snapshot_observed_at":"2026-08-04T21:26:54.811746Z","title":"How does sharpness-aware minimization minimize sharpness?arXiv preprint arXiv:2211.05729,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.811746Z"},"links":{"cited_paper":"/paper/2211.05729","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:757b82d241e3f35c987e4aac18dfa4d183b11b3bafc2a32c57a79703216ffe9d","observation_id":"b55009c8-b8da-41df-a1de-08f2bf865600","resolution":{"observed_at":"2026-08-04T21:26:54.811746Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:26:54.967877Z","title":"Entropy-sgd: Biasing gradient descent into wide valleys.Journal of Statistical Mechanics: Theory and Experiment, 2019(12): 124018,","venue":null,"work_id":"8a8eda32-faa7-4804-ba20-252e9762904c","year":2019},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.776180Z"},"links":{"citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:b55ac41b372caf7e7762b583015ddaedcf57c542fd9d82ac41a11a50f63d763d","observation_id":"4e072e93-aaad-4148-bc3a-08df46635c05","resolution":{"observed_at":"2026-08-04T21:26:54.971593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.04552","last_updated":"2017-11-29T14:51:40Z","snapshot_observed_at":"2026-07-06T05:55:22.966528Z","submitted_at":"2017-08-15T15:21:53Z","title":"Improved Regularization of Convolutional Neural Networks with Cutout","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.04552","snapshot_observed_at":"2026-08-04T21:26:54.780115Z","title":"Improved regularization of convolutional neural networks with cutout.arXiv preprint arXiv:1708.04552,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.780115Z"},"links":{"cited_paper":"/paper/1708.04552","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:a34c5890d55afbf752f2623d6b5f835dd09fe927d5c2863e2eb88313a3a77f68","observation_id":"d3c04130-cea2-4484-a71e-f68c11479ecc","resolution":{"observed_at":"2026-08-04T21:26:54.780115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.11008","last_updated":"2017-10-19T03:39:56Z","snapshot_observed_at":"2026-07-06T05:36:05.666091Z","submitted_at":"2017-03-31T17:56:41Z","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.11008","snapshot_observed_at":"2026-08-04T21:26:54.783878Z","title":"Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data.arXiv preprint arXiv:1703.11008,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.783878Z"},"links":{"cited_paper":"/paper/1703.11008","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:b435ab5c73b69a0fec7d23705eb9db555fdfee89669094843e1da05b75a1dfe9","observation_id":"881fbf3a-8956-4431-9e28-1421ecdeddb5","resolution":{"observed_at":"2026-08-04T21:26:54.783878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.09412","last_updated":"2018-04-27T21:39:25Z","snapshot_observed_at":"2026-07-06T06:06:04.571585Z","submitted_at":"2017-10-25T18:30:49Z","title":"mixup: Beyond Empirical Risk Minimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.09412","snapshot_observed_at":"2026-08-04T21:26:54.819244Z","title":"mixup: Beyond empirical risk minimization.arXiv preprint arXiv:1710.09412,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.819244Z"},"links":{"cited_paper":"/paper/1710.09412","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:b3f24a923692912eaadfd83a02d3efffea6e6be7f3c98923be484e1239991186","observation_id":"571bd8bd-0a82-4cb8-8093-4d62e96f20bd","resolution":{"observed_at":"2026-08-04T21:26:54.819244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.01412","last_updated":"2021-04-29T16:44:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-10-03T19:02:10Z","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.01412","snapshot_observed_at":"2026-08-04T21:26:54.788193Z","title":"Sharpness-aware minimiza- tion for efficiently improving generalization.arXiv preprint arXiv:2010.01412,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.788193Z"},"links":{"cited_paper":"/paper/2010.01412","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:6fdd0cee6bdc0ef7c20e86b4c5de86d46d32d649ef94ea36bdd3173a261116e8","observation_id":"b5b46ce6-0690-435b-955e-c85722b2b3cf","resolution":{"observed_at":"2026-08-04T21:26:54.788193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.14533","last_updated":"2022-03-28T07:13:51Z","snapshot_observed_at":"2026-08-05T10:39:51.303535Z","submitted_at":"2022-03-28T07:13:51Z","title":"Robust Unlearnable Examples: Protecting Data Against Adversarial Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.14533","snapshot_observed_at":"2026-08-04T21:26:54.791630Z","title":"Robust unlearnable examples: Protecting data against adversarial learning.arXiv preprint arXiv:2203.14533,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.791630Z"},"links":{"cited_paper":"/paper/2203.14533","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:f2389cec42af29c0b82712d8f5bd1131b1a56b71a38827fe5f429d5a7633208b","observation_id":"91040169-e574-4899-9c3e-a7d11a4488eb","resolution":{"observed_at":"2026-08-04T21:26:54.791630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12141","last_updated":"2023-02-26T13:59:47Z","snapshot_observed_at":"2026-08-02T13:21:16.471985Z","submitted_at":"2022-05-24T15:17:52Z","title":"One-Pixel Shortcut: on the Learning Preference of Deep Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12141","snapshot_observed_at":"2026-08-04T21:26:54.815536Z","title":"One-pixel shortcut: on the learning preference of deep neural networks.arXiv preprint arXiv:2205.12141,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.815536Z"},"links":{"cited_paper":"/paper/2205.12141","citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:8dc44d310ae6783ef2adbaf5ed772e40e7c429ea141d0a3fd36408ef966734df","observation_id":"fa44f295-c7ff-4a30-a689-12bb603a05db","resolution":{"observed_at":"2026-08-04T21:26:54.815536Z","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":"7960.00083","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T21:26:54.847124Z","title":null,"venue":null,"work_id":"bfa881a1-49e7-4fbb-8e33-5b13c96ba853","year":2018},"citing_paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T21:26:54.822164Z"},"links":{"citing_paper":"/paper/2509.08058"},"observation_digest":"sha256:103699c501a8b8ff399abb0df662a61bb4146b092b4e7bfd19094935516a8dec","observation_id":"40f12fbe-79c9-454f-8ac8-cb9e5e1a9c6f","resolution":{"observed_at":"2026-08-04T21:26:54.852703Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.08058","last_updated":"2025-09-09T18:01:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T06:18:44.948986Z","submitted_at":"2025-09-09T18:01:10Z","title":"How Far Are We from True Unlearnability?"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":13},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2509.08058."}