{"as_of":"2026-08-09T23:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:924c13047eb977b17aea5b2f0f4b1f2893f02299cef5e6b6df3c22bae48464b1","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:58:53.100583Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2506.06613/citation-record","integrity":"/paper/2506.06613/integrity","json":"/paper/2506.06613/citation-record.json","paper":"/paper/2506.06613"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:59:00.306238Z","title":"Polynomial time and private learning of unbounded gaussian mixture models","venue":null,"work_id":"03739351-aebb-454b-a1ba-9ad32a299cfd","year":2023},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:46.504701Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:974504a7e494b1869b3320caa5c0d9311985b10dc11deb25d254997d999c6893","observation_id":"b611708c-3113-469a-b1d8-334e0baf3bee","resolution":{"observed_at":"2026-08-07T05:59:00.390134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:59:00.053450Z","title":"Mixtures of gaussians are privately learnable with a polynomial number of samples","venue":null,"work_id":"9b9700e7-64e5-47c2-9386-1d1dd743f65d","year":2024},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:46.600230Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:61415fd7d21f06871536060efcb5a935b41eb006b238c98f2318ae7eea710222","observation_id":"ca4c66c6-9597-4145-94a1-7335eb14d705","resolution":{"observed_at":"2026-08-07T05:59:00.153375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.901861Z","title":"Nearly tight sample complexity bounds for learning mixtures of gaussians via sample compression schemes","venue":null,"work_id":"953731d1-6c42-4196-9ceb-a57ac6a60596","year":2018},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:46.748156Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:f97b46aefb9456d73f56f26b9bd79abac5faf4b82b07c495f04fb6a6a26ca8d1","observation_id":"9f853fa0-176c-4c61-974c-86dd0e16b4aa","resolution":{"observed_at":"2026-08-07T05:58:59.980031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.736360Z","title":"Near-optimal sample complexity bounds for robust learning of gaussian mixtures via compression schemes","venue":null,"work_id":"b9c3c77e-c503-4425-a9d3-78a675cd55bd","year":2020},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:46.891706Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:125d31f86344e1ae369d5dd3dcda70eadde636bcd8a529f6bc33a9d3ffd3e0f1","observation_id":"574927fb-8ff7-4214-bac4-45ae3fdaa324","resolution":{"observed_at":"2026-08-07T05:58:59.812103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.603311Z","title":"Efficient learning of simplices","venue":null,"work_id":"3aaed9ab-03c0-4c88-bcc7-dfbaf7055a5f","year":2013},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.042577Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:f22a7082e24120495ec8318ab1d879be63325065726b9341bb7a3eadaceaacff","observation_id":"638ef52f-fb72-4fee-914c-ac4924102d82","resolution":{"observed_at":"2026-08-07T05:58:59.661536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.477790Z","title":"Private and polynomial time algorithms for learning gaussians and beyond","venue":null,"work_id":"c088160f-e0ed-4585-b289-8899f0582e3a","year":2022},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.177371Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:52dba6cab322a0a03816cc7404eaae6e0c5e3fb3f236e7218b898c4aa36a50ea","observation_id":"47904d09-fbcc-4dc1-bf7b-5a9494a405e6","resolution":{"observed_at":"2026-08-07T05:58:59.547649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.320454Z","title":"Private distribution learning with public data: The view from sample compression","venue":null,"work_id":"060e3f52-2b59-4908-bcdf-cb0c0177e2d4","year":2023},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.340597Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:d653a67f6dc6e930c4a08624495c8fe76111631c8a4e66588ec4b17925ef7986","observation_id":"37b6d909-7a6e-4928-811e-ff75aecf0fdc","resolution":{"observed_at":"2026-08-07T05:58:59.398126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.205451Z","title":"Minimax rates for conditional density estimation via empirical entropy","venue":null,"work_id":"e983ed2e-8f5a-4910-982f-b2c457a6c7a4","year":2023},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.457059Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:85acc95c9b224dfb34e12e7ce22168328541f0d51d59006e7f5020f20411c45c","observation_id":"976d017b-ebff-4c14-bec6-9e0f967c2443","resolution":{"observed_at":"2026-08-07T05:58:59.261963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:59.035876Z","title":"Learning smooth shapes by probing","venue":null,"work_id":"34cb3d31-1c06-4782-b014-6baf04e42cf9","year":2007},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.577420Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:4bc2674549f61f389a099c4bb6fb86800782404bab3859f1348387e246704925","observation_id":"7a1dbc92-b395-4d8f-8d62-6eef3de9b77d","resolution":{"observed_at":"2026-08-07T05:58:59.108727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.900232Z","title":"Density estimation on an unknown submanifold","venue":null,"work_id":"1b0437b1-ceaa-40f6-a50c-3f6423b200bc","year":2021},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.695951Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:c16f084ae9a6c4f41acdc778dab9bb97cc32af0791d9d3294e575244d4cedc56","observation_id":"8c3fbfe4-c9af-492b-af88-d3ececa54961","resolution":{"observed_at":"2026-08-07T05:58:58.962862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.774684Z","title":"Sharp rate of average decay of the fourier transform of a bounded set","venue":null,"work_id":"feb92e99-f630-4f5d-a307-0ce33ae6b769","year":2003},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.830526Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:d86b538901f77a5c7a3fd95c94e13af4f0ccf5242ccdd9629e098afbf0db9bde","observation_id":"16c91562-8d7a-4a59-a20a-301b6cdd2e27","resolution":{"observed_at":"2026-08-07T05:58:58.840173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.608497Z","title":"Not all learnable distribution classes are privately learnable","venue":null,"work_id":"bd94957f-d632-4c15-85a4-3d66203723ba","year":2024},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:47.992344Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:7017fa63f74159f0506b856bdb861121838cdf24999d04cb9f19bb7a78ba59f0","observation_id":"3c075236-5fcd-49d8-b170-04dc4906aec4","resolution":{"observed_at":"2026-08-07T05:58:58.687065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.454615Z","title":"Model-based learning using a mixture of mixtures of gaussian and uniform distributions","venue":null,"work_id":"134e2899-f27b-46c4-ae6a-29768eaccd37","year":2011},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:48.168404Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:fcae36ed85921912c2595460ca22ce9a73701d9b56413d73af660a82a92a6f5f","observation_id":"887a3db6-91d9-411c-a7f5-65b67bb0518b","resolution":{"observed_at":"2026-08-07T05:58:58.506364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.320343Z","title":"Efficiently learning ising models on arbitrary graphs","venue":null,"work_id":"03bb2019-21b5-4818-ab93-9ad2ae2daf1f","year":2015},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:48.298283Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:7c8c51865337abe963ebb71ab50ede75cae0a9053604d726b08c51b06387720c","observation_id":"28182420-3790-41aa-a0a0-0574de20cb86","resolution":{"observed_at":"2026-08-07T05:58:58.381382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.185849Z","title":"A gaussian uniform mixture model for robust kalman filtering","venue":null,"work_id":"d0313faa-0625-442d-b545-25cb4f73ad65","year":2019},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:48.450355Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:8fa5b1fa5c2b648173db3fe524badf995863f6a88b5c1bbcc117734f1d452c81","observation_id":"a0c0d942-4098-4554-bb8e-062870daf79c","resolution":{"observed_at":"2026-08-07T05:58:58.249947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:58.012291Z","title":"Convex Optimization","venue":null,"work_id":"9c0008e9-e693-4257-ace6-c15d62c0f270","year":2004},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:48.611893Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:52c17d77cff7982913b5f15d70fdf7c1cc939de3a6dc81192834bee879198de3","observation_id":"1afb9dff-4cd1-439f-917b-99b38857b4ec","resolution":{"observed_at":"2026-08-07T05:58:58.091336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:57.873472Z","title":"A functional approach to data structures and its use in multidimensional searching","venue":null,"work_id":"3af02d6e-b988-4891-a04d-fe8d5539c1d3","year":1988},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:48.786316Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:997081832c5e989004fc5af8aa5f0db25651d983846e182d5296c2d4cd297055","observation_id":"65f7ea38-4cbb-4a90-98e1-62d3d1c9d6ac","resolution":{"observed_at":"2026-08-07T05:58:57.937626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:57.709327Z","title":"Learning from untrusted data","venue":null,"work_id":"31a1041d-25cd-4cf6-8a72-9880c78e0b4f","year":2017},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:48.916158Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:593f7a84ac38516340a49e247023478ee6a55df2f27e48dde3f5d83f7d960257","observation_id":"0b35e055-522b-4bf5-b321-7d88bd01e60d","resolution":{"observed_at":"2026-08-07T05:58:57.807514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:57.555503Z","title":"Computational Geometry: Algorithms and Applications","venue":null,"work_id":"6c26642d-6b23-4091-997d-86ba5d36366b","year":2008},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.018982Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:1ee3b4b650a6da9c8df43bd275aa877f7e1ee4d6af77d693565f1da2c2a3c4f8","observation_id":"5580bd71-865e-4f1c-87c3-6897a2bfa69a","resolution":{"observed_at":"2026-08-07T05:58:57.606167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:57.413958Z","title":"A probabilistic theory of pattern recognition , volume 31","venue":null,"work_id":"7d4cfec1-c77d-49d0-b93e-b05dcd82bc9e","year":2013},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.144854Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:fa80438d91ab1ba553785897821ef743e14652a5a56e7b63517edfa9e9c68b10","observation_id":"e64acad4-cfd9-431c-9a68-29355695633d","resolution":{"observed_at":"2026-08-07T05:58:57.479536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:57.259697Z","title":"Combinatorial Methods in Density Estimation","venue":null,"work_id":"dbca1504-91ce-4620-97e0-365688a17861","year":2001},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.293953Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:397e0ad71ac4a8a2cd8fc220c54293defa0c2a72db1e05834baae07001bc012d","observation_id":"65cb7b11-703f-4a83-b690-2097a010efa0","resolution":{"observed_at":"2026-08-07T05:58:57.347238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:57.118641Z","title":"The total variation distance between high-dimensional gaussians","venue":null,"work_id":"ff87a967-29d1-44dc-a949-2cd253ea277e","year":2018},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.442062Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:c18f3d123af3255bb2648dcb74f6779d29faf0d8b028a81e3380a8c8c4fb5dd2","observation_id":"8f24f6cb-b1d7-4c12-bba9-2de94300ddd6","resolution":{"observed_at":"2026-08-07T05:58:57.168284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:56.962711Z","title":"The minimax learning rates of normal and ising undirected graphical models","venue":null,"work_id":"c933c023-f0d1-46c0-846a-a0ad53142edc","year":2020},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.576348Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:3b2a5906bb94bbb6118b09bbf3fad0f548b855e550b3100751432c2262dfbf02","observation_id":"2a3adad1-ca2a-4323-a78d-492d289c372d","resolution":{"observed_at":"2026-08-07T05:58:57.037865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:56.716951Z","title":"Differential privacy","venue":null,"work_id":"9d8fa126-1345-455a-a4df-bf23e692b65d","year":2006},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.694506Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:fe23fa93fc97b6a56913620b1470884a0deda8afeaf0448c8eb89fb3a79c8993","observation_id":"a57d40d7-b0e4-4079-9a23-b91950936393","resolution":{"observed_at":"2026-08-07T05:58:56.847422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:56.504638Z","title":"On the sample complexity of adversarial multi-source pac learning","venue":null,"work_id":"b4afc189-b637-4522-bcdf-5c75be47ba04","year":2020},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:49.853353Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:139d35364309a15cc69cae1de463993313c6e24c1e3edfd183624a273b6302b9","observation_id":"c50d1183-8006-43cc-8d8c-cbd3f5b7bfa3","resolution":{"observed_at":"2026-08-07T05:58:56.599325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:56.322766Z","title":"Learning in the presence of malicious errors","venue":null,"work_id":"06ce163f-8479-4e05-bcfa-35a3c0b2aef6","year":1988},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.008305Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:a1a491346f550b77be3e2eee44c7bd767888a0d93532b8bebe594efd848982a9","observation_id":"d8a4a7c8-74aa-4c40-ba95-8a02e75892b4","resolution":{"observed_at":"2026-08-07T05:58:56.378081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:56.164282Z","title":"Relating data compression and learnability","venue":null,"work_id":"53065b44-c8d6-4095-8555-591bf7449cc6","year":1986},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.121857Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:610305a9caf26be4ea456302e04244fd9e5ff60c8e18074e5d200e77d966acab","observation_id":"31fb98f0-6226-4899-aedd-53095e164553","resolution":{"observed_at":"2026-08-07T05:58:56.227203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:56.020050Z","title":"The curse of concentration in robust learning: Evasion and poisoning attacks from concentration of measure","venue":null,"work_id":"a9af80ef-409b-4f37-83e5-751c98115b32","year":2019},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.287273Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:093fe95519c1cfbfc765886b3f1158f10bd61ccc655ba9436a8298f4f25e1cf4","observation_id":"949095ba-51c5-4d41-b9c3-5b3151622d70","resolution":{"observed_at":"2026-08-07T05:58:56.082583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:55.861500Z","title":"A brief history of generative models for power law and lognormal distributions","venue":null,"work_id":"bbdaaacf-8e2c-46b0-9bd3-81fb0e77ff15","year":2004},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.418179Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:e6b50ba4eca7a9d30b92d847bc6fc12c79ac9c50856cdfea7a010dfa23f78e01","observation_id":"76cf440a-a913-4517-ab98-74dc0618f44c","resolution":{"observed_at":"2026-08-07T05:58:55.934521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:55.738696Z","title":"Differential privacy with higher utility by exploiting coordinate-wise disparity: Laplace mechanism can beat gaussian in high dimensions","venue":null,"work_id":"5cf1dfd3-d2ba-40c9-be7c-0e3cd4e662fe","year":2025},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.554199Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:12e424cfb7f198c2410d27573282181c0a6b66ad4beb8ce5cda0d0e36609ef8f","observation_id":"7a1d13f2-eb99-4004-8235-59c61b23650d","resolution":{"observed_at":"2026-08-07T05:58:55.798983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:55.590619Z","title":"On statistical learning of simplices: Unmixing problem revisited","venue":null,"work_id":"956ea5fe-0511-4286-a78d-7006b1ed657a","year":2021},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.699383Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:a875c016f55b67d8244633e59ecef6b821ed5220f799dad81db6228d1bc969fa","observation_id":"4c36d732-7739-4b87-978e-74f7e2bdcfe5","resolution":{"observed_at":"2026-08-07T05:58:55.657902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:55.456344Z","title":null,"venue":null,"work_id":"fcb38369-30b1-4433-a060-14930b0a9e1a","year":2020},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:50.855839Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:6f904b06037876c18cf0b441293d6a7082e090e756c0505b8c2af23aceaae47f","observation_id":"55fc84a7-7220-4d29-809f-c68b4dcb2f5e","resolution":{"observed_at":"2026-08-07T05:58:55.524124Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:55.306941Z","title":"Machine learning for anomaly detection: A systematic review","venue":null,"work_id":"e679c0f3-06d3-454e-974d-f3305fa33b8f","year":2021},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.009421Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:6effbf6cbfb5ccfecc8a859f0ce9ffc0a8b9a0e627f3c5b9e4ed9bcdaff99a2b","observation_id":"df4b8343-6d88-4657-b16f-cc3e3bf31ed2","resolution":{"observed_at":"2026-08-07T05:58:55.392771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:55.173992Z","title":"Minimax estimation of smooth densities in wasserstein distance","venue":null,"work_id":"0a08b074-b25a-42c2-bd40-db936e2f91e0","year":2022},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.136403Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:2b4e71961bb948a75d9886e369875e3369e469876ad48a8be58fecb0c0f3230a","observation_id":"8d33b176-b183-4ec4-9855-cff23beac741","resolution":{"observed_at":"2026-08-07T05:58:55.244104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:54.916937Z","title":"New upper bounds in klee’s measure problem","venue":null,"work_id":"08603bea-4c04-499c-9619-11cfdb378ff8","year":1991},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.304784Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:4a1af0501e0ee33fd786b789a570c94bb7984349915ca8f56635c5d4c9e41535","observation_id":"cc222ca5-ac38-4b46-b15f-3bba08a485f9","resolution":{"observed_at":"2026-08-07T05:58:55.083624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:54.687527Z","title":"A fourier approach to mixture learning","venue":null,"work_id":"8a8dd0dc-2021-4e73-809f-0ce847bd0d1a","year":2022},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.472955Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:d51543aaf5d239d28a9fe9123d6e5044dae5da13261c0b8ddbd777c7c305b4c8","observation_id":"63551feb-d311-443e-aadf-e805f6656007","resolution":{"observed_at":"2026-08-07T05:58:54.790010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:54.532722Z","title":"Real and Complex Analysis","venue":null,"work_id":"a6843c30-7beb-44d7-853c-5fc5051d879b","year":1987},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.583013Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:235ffb383bc6cf0762e5c804293426cd5fd4b15987c7e138d71c31bc6fffc5f3","observation_id":"680a4115-6f1c-4b8c-a7d2-c43ddd538137","resolution":{"observed_at":"2026-08-07T05:58:54.587257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:54.335715Z","title":"Certifying some distributional robustness with principled adversarial training","venue":null,"work_id":"55c07c07-c35e-40d1-a6b9-9b10650976a3","year":2018},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.757448Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:881f6655dfff2129400d559ddb4f4392818273d595b3567b8711153f462f1953","observation_id":"5e560cbc-5cee-42be-ad48-14701f507ac5","resolution":{"observed_at":"2026-08-07T05:58:54.415253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:54.140001Z","title":"Sample complexity bounds for learning high-dimensional simplices in noisy regimes","venue":null,"work_id":"8808bdd0-dba8-4c91-a793-b5d821f6824b","year":2023},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:51.904412Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:984e8ce6e2c090ece7149bfb19c4e8c03f17d40fa09aaa969fecb0e1bbcdf61f","observation_id":"da899c79-9a4b-41f2-9fb2-b7bcd8202614","resolution":{"observed_at":"2026-08-07T05:58:54.247497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:53.965838Z","title":"Special functions: An introduction to the classical functions of mathematical physics","venue":null,"work_id":"4e334685-f114-45fb-9dd6-d6e3fbb0103a","year":1996},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.043533Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:ae53055b8d5e4b6b0c095c839c662e0fb887f5027e69c4a0e259fc4d641a76c6","observation_id":"85fe5374-692e-41a3-a63b-93688627f5b6","resolution":{"observed_at":"2026-08-07T05:58:54.058424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:53.768231Z","title":"Tsybakov","venue":null,"work_id":"b8e2d117-d70c-4c65-95dd-5510333d169f","year":2009},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.164161Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:fa512833a7950ec079d126139a4feb09817452e5d85d028b69868612fbbf368a","observation_id":"d815d66c-611c-4c32-baa3-ca6079620e7a","resolution":{"observed_at":"2026-08-07T05:58:53.890583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:53.518505Z","title":"Minimax rate of distribution estimation on unknown submanifolds under adversarial losses","venue":null,"work_id":"30326190-8092-4226-a61c-08d271c61506","year":2023},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.316257Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:1428032b9c39d6082282317b6b353d5e641148b7de56d74c85e601c81bf04f5f","observation_id":"3397e481-3d7d-453c-9425-a64559340a8a","resolution":{"observed_at":"2026-08-07T05:58:53.611538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:58:52.488055Z","title":"A theory of the learnable","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.488055Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:6700d88e2f921ca0bb493318f5da93c449d4cb90db0faad7fa3d707304049461","observation_id":"2b0e8f75-25f5-4d6e-b106-822a230400ba","resolution":{"observed_at":"2026-08-07T05:58:52.488055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.10231","last_updated":"2022-09-19T14:55:03Z","snapshot_observed_at":"2026-07-06T13:33:39.335167Z","submitted_at":"2022-07-20T23:56:00Z","title":"On minimax density estimation via measure transport","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.10231","snapshot_observed_at":"2026-08-07T05:58:52.631038Z","title":"On minimax density estimation via measure transport","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.631038Z"},"links":{"cited_paper":"/paper/2207.10231","citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:7e3804a29f71211ea5c7e0738abe7122febaa0debdd36798802cdcc06eea1549","observation_id":"1ae94377-e6b3-4c16-89ce-ad17d4648ea3","resolution":{"observed_at":"2026-08-07T05:58:52.631038Z","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-07T05:58:52.805434Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.805434Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:ad992ca7cc2532c934b25cee102fd7673d35bdcae2ac8781df15644978bf23ec","observation_id":"6984a3a0-bb3c-43c6-a151-4f95dcf989c8","resolution":{"observed_at":"2026-08-07T05:58:52.805434Z","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-07T05:58:52.974003Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:52.974003Z"},"links":{"citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:cfdc61f2dad146048a6adc0470968fc3fb648e787f6e3f68c7a28f5046012432","observation_id":"affd2498-9c7b-4adc-b4de-bb2238db699b","resolution":{"observed_at":"2026-08-07T05:58:52.974003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.09026","last_updated":"2022-09-18T19:09:17Z","snapshot_observed_at":"2026-07-06T09:56:53.503210Z","submitted_at":"2020-09-18T18:58:25Z","title":"Adversarial Robustness through Bias Variance Decomposition: A New Perspective for Federated Learning","version":3},"cited_work":{"arxiv_id":"2009.09026","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.09026","snapshot_observed_at":"2026-08-07T05:58:53.255281Z","title":"Adversarial Robustness through Bias Variance Decomposition: A New Perspective for Federated Learning","venue":"cs.LG","work_id":"99276c21-f51d-4294-934c-ceb764df70d1","year":2020},"citing_paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T05:58:53.100583Z"},"links":{"cited_paper":"/paper/2009.09026","citing_paper":"/paper/2506.06613"},"observation_digest":"sha256:d3979fab49bd924b685c28ebfbbcdc269a72bb391300c3c1ff42cc4c484a94b3","observation_id":"ff9109b5-618b-4867-9a28-ed64c689829f","resolution":{"observed_at":"2026-08-07T05:58:53.365742Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.06613","last_updated":"2025-06-07T01:11:50Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T05:51:03.576033Z","submitted_at":"2025-06-07T01:11:50Z","title":"Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":41},"total_outbound_references":47},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2506.06613."}