{"as_of":"2026-08-08T16:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b09b614a01340859f7c68636055933672429a6d616011b6e622c3fb4d28a2494","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-06T18:27:05.047268Z","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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.08518/citation-record","integrity":"/paper/2507.08518/integrity","json":"/paper/2507.08518/citation-record.json","paper":"/paper/2507.08518"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.01653","last_updated":"2019-03-06T09:53:59Z","snapshot_observed_at":"2026-07-06T06:48:23.889615Z","submitted_at":"2018-07-04T16:06:39Z","title":"Latent Space Autoregression for Novelty Detection","version":2},"cited_work":{"arxiv_id":"1807.01653","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.01653","snapshot_observed_at":"2026-08-06T18:27:06.172637Z","title":"Latent Space Autoregression for Novelty Detection","venue":"cs.CV","work_id":"654ce913-6396-4e80-b092-cd1d47a79db2","year":2018},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:03.859016Z"},"links":{"cited_paper":"/paper/1807.01653","citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:c7ed3f7c4ef1e6263c2d23de980b237b7eab302954a9b7e44055c4874c317e45","observation_id":"20d68264-0fcf-463c-9b3f-73f9b06ad776","resolution":{"observed_at":"2026-08-06T18:27:06.178144Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:03.936327Z","title":"Theory of reproducing kernels","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:03.936327Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:eb81f335378d34fe02c09d5b6760b5d3089c39c60ed9faf2a1d12bf0e55a477d","observation_id":"e2f8f682-37ac-4c64-906c-70d6c6739369","resolution":{"observed_at":"2026-08-06T18:27:03.936327Z","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-06T18:27:03.994964Z","title":"Learning theory from first principles","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:03.994964Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:c72337fce0599a547c4684abcdaaf3ac41b17b3876b39063649e0564724bad0d","observation_id":"29cb305e-c0c0-4d5f-aaf0-17b554ac012d","resolution":{"observed_at":"2026-08-06T18:27:03.994964Z","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-06T18:27:06.647022Z","title":"Bartlett and Shahar Mendelson","venue":null,"work_id":"69a125c8-b9fe-4af9-a8a9-2c9f9852fec2","year":2002},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.031298Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:462559fd983dd0fa51f9aa297428a6f29f2f89a08e90aca4a34cef46a2f87f69","observation_id":"d7259dde-14dc-459d-8b48-179d348b50bd","resolution":{"observed_at":"2026-08-06T18:27:06.652295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.629720Z","title":"Classification-based anomaly detection for general data","venue":null,"work_id":"8c064869-7f9f-4be8-a475-e26abd0d8d21","year":2020},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.111165Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:c16cb835ca1425f73605e9004e41fc2cf535acf5e559994afd979206683923a5","observation_id":"4e341e81-9b5f-41cc-ab4b-20ba151abfab","resolution":{"observed_at":"2026-08-06T18:27:06.635955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.612964Z","title":"Reproducing kernel Hilbert spaces in probability and statistics","venue":null,"work_id":"ac25529c-1eed-4116-90fd-922589b91199","year":2011},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.221361Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:ecc8994416f5f75091784e4169b6ee33fb101f67f69635f0461c1f8bbd068f37","observation_id":"c9d2b9ee-bf8e-4c99-acc9-0837b6c0cddf","resolution":{"observed_at":"2026-08-06T18:27:06.617799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.269638Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.269638Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:8f91f10f6371a86c82187668d89f3ff84db5123720b9e07f109ce0d7041e94bd","observation_id":"1f44b1fa-1b99-4a4f-8e8d-6f7d52963a43","resolution":{"observed_at":"2026-08-06T18:27:04.269638Z","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-06T18:27:06.595408Z","title":"Random rotation ensembles","venue":null,"work_id":"95f80dba-7a73-41bd-90cd-591cfb6f66af","year":2016},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.314497Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:22e8241aa7d7d6ea7e9e7d4bcde7dd6a36e552eca60fca3aeb1022597535ae81","observation_id":"0ccee690-e977-46ab-90a7-07186877cac7","resolution":{"observed_at":"2026-08-06T18:27:06.600658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.423024Z","title":"Convex Optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.423024Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:7a5795be00a0049c2b94de8a6f230d2cb0f6d40dea7105b70e6b0cf140b82664","observation_id":"21f83e8a-14cc-4add-8583-235132a5c173","resolution":{"observed_at":"2026-08-06T18:27:04.423024Z","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-06T18:27:04.513014Z","title":"Breunig, Hans-Peter Kriegel, Raymond T","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.513014Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:1642efc033bbaa229276f814f7c1d96bb6cc8d27ecc904074c6df615438c45a8","observation_id":"d9c42c3f-c250-43ab-a02c-9cd12ec336f3","resolution":{"observed_at":"2026-08-06T18:27:04.513014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14136","last_updated":"2023-12-21T18:55:22Z","snapshot_observed_at":"2026-07-06T17:06:45.522731Z","submitted_at":"2023-12-21T18:55:22Z","title":"Fast kernel half-space depth for data with non-convex supports","version":1},"cited_work":{"arxiv_id":"2312.14136","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.14136","snapshot_observed_at":"2026-08-06T18:27:05.853151Z","title":"Fast kernel half-space depth for data with non-convex supports","venue":"stat.ML","work_id":"f4a52cae-484a-4cfe-9291-395d872f7eb7","year":2023},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.560615Z"},"links":{"cited_paper":"/paper/2312.14136","citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:15049497b78d469999f2a4f1b6845e1f922d207e7036b1c7ab517e2fe2850462","observation_id":"233a5b73-d022-4b58-86ad-965bc1d14b2e","resolution":{"observed_at":"2026-08-06T18:27:05.929992Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.563614Z","title":"Beyond mahalanobis distance for textual ood detection","venue":null,"work_id":"b5a92fd5-0824-4075-91b4-30686f707771","year":2022},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.594716Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:69885b08236e07046f4849ed8722f9205b5594f6a47b8b7ce61db067300bf980","observation_id":"f1a3c60c-e9b6-4a67-9883-29bc104f0179","resolution":{"observed_at":"2026-08-06T18:27:06.569123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11235","last_updated":"2024-03-09T13:28:29Z","snapshot_observed_at":"2026-07-06T14:44:56.245065Z","submitted_at":"2023-01-26T17:18:36Z","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.11235","snapshot_observed_at":"2026-08-06T18:27:04.741729Z","title":"Handbook of convergence theorems for (stochastic) gradient methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.741729Z"},"links":{"cited_paper":"/paper/2301.11235","citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:62a9afab614b6cfd2703fdf588b0aaf542f055e358851c12bf18afb0bb04f1cd","observation_id":"90e18804-29e9-42d1-b08e-38c0d2c82e50","resolution":{"observed_at":"2026-08-06T18:27:04.741729Z","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-06T18:27:04.860587Z","title":"Deep anomaly detection using geometric transformations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.860587Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:ea5c0a52f2c5103cda76cd03d1e165a510c21154addb7c99e7b515d7096ce99c","observation_id":"2f21e061-8012-4ee1-bc8e-0910ea33d48f","resolution":{"observed_at":"2026-08-06T18:27:04.860587Z","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-06T18:27:04.866489Z","title":"Borgwardt, Malte J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.866489Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:c11b3e5955fa305572b3244d43a7db6a55cee4f719d20d53960a16cb4f29833a","observation_id":"9bb2f569-626c-46c7-b91c-0dcc86250210","resolution":{"observed_at":"2026-08-06T18:27:04.866489Z","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-06T18:27:06.517752Z","title":"Faster algorithms for structured linear and kernel support vector machines","venue":null,"work_id":"484c5d0f-f9a0-4418-bfea-339ad75e1eab","year":2025},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.872137Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:9284911caecbf3dca6277847435caf62e8c0c8244fe2c7ed98297061156866a3","observation_id":"155e90ff-d8ac-43b1-a742-f2cea98d5fb7","resolution":{"observed_at":"2026-08-06T18:27:06.523093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.878081Z","title":"Hadsell, S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.878081Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:df70d27d0c1f42f0a7df8df6d5e060378ec0ee7a1c3fae8aa206278d9ad50d1c","observation_id":"c824a7f8-23fc-4e32-8dff-c75a49984cd3","resolution":{"observed_at":"2026-08-06T18:27:04.878081Z","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-06T18:27:06.500100Z","title":"On the complexity of linear prediction: Risk bounds, margin bounds, and regularization","venue":null,"work_id":"0f2620f2-8649-4e7f-8852-e73c52fa35cf","year":2008},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.883006Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:8b4621452f786408a48aa7e8f39cd5cdf1e574081e3bec4b4173c699b30b3d16","observation_id":"0e6f3811-77fa-4a02-ba9f-66d314bad916","resolution":{"observed_at":"2026-08-06T18:27:06.505553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.482066Z","title":"A new measure of rank correlation","venue":null,"work_id":"30dc3629-4b19-4417-b356-8b8ee4efe326","year":1938},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.887775Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:af55dcb4c7db0596c26e2f32be07513a1ba0088c7e1548b6c8f938229c3f829b","observation_id":"7f591dcd-39d8-4bfa-a64b-9933f7adaddc","resolution":{"observed_at":"2026-08-06T18:27:06.487200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-06T18:27:04.892900Z","title":"Kingma and Max Welling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.892900Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:067d434afed15ea3f9c5f7216a71af3907ebdea6651ade287ac8fbb85232aa76","observation_id":"f88583ad-56d1-41de-ae1a-e190b7b27f96","resolution":{"observed_at":"2026-08-06T18:27:04.892900Z","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-06T18:27:06.465202Z","title":"Mnist handwritten digit database","venue":null,"work_id":"12ada2d7-0676-44e7-a1a4-e94db8dbd30d","year":null},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.898377Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:edfceffa2e4b885c41bff43f203f15bc8f6f2a96dbf88cfd9bbd692eb825ac19","observation_id":"da24d710-43f8-4d86-8a9c-4340140b11a7","resolution":{"observed_at":"2026-08-06T18:27:06.470813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.903339Z","title":"Model compression for deep neural networks: A survey","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.903339Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:1bef6e916fb7acbf2bf932ad0b49a75d5f77770ad6418eb352a8fb6ff07bd9c1","observation_id":"938c90c5-f5b9-42c3-95f4-1cc83550fbc8","resolution":{"observed_at":"2026-08-06T18:27:04.903339Z","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-06T18:27:06.445943Z","title":"Risk bounds and calibration for a smart predict-then-optimize method","venue":null,"work_id":"32220f4e-86f0-4ec1-986f-7629ff93e3a4","year":2021},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.908795Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:06398ccf5d5c2d8964353e664ffc968c9b17da3d5f08d13f7665ee277d148416","observation_id":"2e563e3c-0ebd-4805-9ddf-86901be09ff9","resolution":{"observed_at":"2026-08-06T18:27:06.451545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.915399Z","title":"Liu and Kesar Singh and","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.915399Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:65b904a59ef8604c9d16e6957a8e9af2e9ea0a9cf7505b9d8514ac6584917e33","observation_id":"35aa8623-f215-4ad5-b959-7c4e27a20928","resolution":{"observed_at":"2026-08-06T18:27:04.915399Z","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-06T18:27:06.427818Z","title":"Beyond least-squares: Fast rates for regularized empirical risk minimization through self-concordance","venue":null,"work_id":"73b18261-140c-416e-9d5f-7f119140b03b","year":2019},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.921241Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:a435f75b4d5cab4248caad1eb753dd34fc42ecd842aca1507bc663e987079c28","observation_id":"75f3a794-b1de-4d20-a2da-88a39c9ee53b","resolution":{"observed_at":"2026-08-06T18:27:06.433857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.926315Z","title":"A vector-contraction inequality for rademacher complexities","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.926315Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:08d7adf95214d8fc8c95b13c3cde92300fd5a6480ccc4f9765a4cf150b1f0835","observation_id":"5cd2586f-cb8e-47e5-9db8-9084c211ccb2","resolution":{"observed_at":"2026-08-06T18:27:04.926315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.02851","last_updated":"2024-07-10T08:02:03Z","snapshot_observed_at":"2026-07-06T14:00:22.500463Z","submitted_at":"2022-10-06T12:14:25Z","title":"Anomaly detection using data depth: multivariate case","version":2},"cited_work":{"arxiv_id":"2210.02851","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.02851","snapshot_observed_at":"2026-08-06T18:27:05.552608Z","title":"Anomaly detection using data depth: multivariate case","venue":"stat.ML","work_id":"8c036a16-6c50-4fd2-8411-7215f510355e","year":2022},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.931144Z"},"links":{"cited_paper":"/paper/2210.02851","citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:33cf0e774925c070be1dd595a49c283583c40a720bc44384887e8773c5c2c004","observation_id":"541ff01f-21fb-4736-a5fe-1bb014936afc","resolution":{"observed_at":"2026-08-06T18:27:05.625079Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.937207Z","title":"Nonparametric imputation by data depth","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.937207Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:84f193bfaa6b2fbe7778222125260d8dd77524d4816589adf4ed5e0e197a7d67","observation_id":"1690f67c-500c-4338-8487-d62e412b70f5","resolution":{"observed_at":"2026-08-06T18:27:04.937207Z","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-06T18:27:06.410570Z","title":"Combining statistical depth and fermat distance for uncertainty quantification","venue":null,"work_id":"228cbb95-3212-4613-a9ec-8000b1d637b9","year":2024},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.942148Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:4f11c3302607c9fd4d4bf970bb37777705348eee65c8c2ec5da0758fc713659e","observation_id":"079306f6-ec32-42d8-9bc9-b4fd636a9e8e","resolution":{"observed_at":"2026-08-06T18:27:06.415932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.946656Z","title":"Pedregosa, G","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.946656Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:beafa8fce220e59c05450ad8b4d0b4c235968c798c70f52a68f41c9a70a68204","observation_id":"86257d6d-33a2-4bca-bb38-dd971a7219b3","resolution":{"observed_at":"2026-08-06T18:27:04.946656Z","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-06T18:27:04.957421Z","title":"Ocgan: One-class novelty detection using gans with constrained latent representations","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.957421Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:f5d7b0e2a361b77a19af49365c21dec4ec2f0b887b7e59c6f74cd83b8ac3668e","observation_id":"537a47a1-9103-4779-9f90-45a5a9a9deae","resolution":{"observed_at":"2026-08-06T18:27:04.957421Z","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-06T18:27:06.381670Z","title":"A halfspace-mass depth-based method for adversarial attack detection","venue":null,"work_id":"5858bbb0-ef01-4861-877d-2d8fab200756","year":2023},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.962256Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:acfeb1ad50467b3311f4e14496ceaf7f529323f885216a630b31f024159d0078","observation_id":"93d05f98-4544-4078-992a-eec2d20960f2","resolution":{"observed_at":"2026-08-06T18:27:06.387248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.364875Z","title":"Outlier detection datasets (odds) library, 2016","venue":null,"work_id":"fe81d58d-981e-4459-ba51-35052d404d27","year":2016},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.968063Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:b272847e0b991c0b7ddb662bf436c6ff242c7ff82d9f9ecf574ed693a7af00b1","observation_id":"08e766cd-58c6-46d8-aa42-f08d8474e51e","resolution":{"observed_at":"2026-08-06T18:27:06.369762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.345628Z","title":"Reid and Robert C","venue":null,"work_id":"fbc8f580-ffaa-42d8-bb3d-f3e71eca10d9","year":2011},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.973675Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:691c07a447efb2f5921c22cb6dca0188aa90a3d0608b224677aefe60c4baea07","observation_id":"c6b05da4-ab33-440d-a8d6-9bf8cbfb7a15","resolution":{"observed_at":"2026-08-06T18:27:06.350058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:04.978736Z","title":"Deep one-class classification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.978736Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:b01425724713977fadd8de587863a2990b6112a82834d153c1470cf9ced02df4","observation_id":"c7fbdfef-d48f-45ef-8a64-6b3c9e1bd527","resolution":{"observed_at":"2026-08-06T18:27:04.978736Z","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-06T18:27:04.983944Z","title":"Waldstein, Ursula Schmidt - Erfurth, and Georg Langs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.983944Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:efa72ff10737d74ef633517f484311436a82fdbb6b0ebdfea0427cd0bfe29a58","observation_id":"4b51bdbc-64dc-42d2-a1f1-7dd4b3690263","resolution":{"observed_at":"2026-08-06T18:27:04.983944Z","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-06T18:27:04.988879Z","title":"Platt, John Shawe-Taylor, Alex J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.988879Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:cc26bd0b0fb8836573268869b63f388fa3143d2ceec15e3be96bca224048a3da","observation_id":"03996f26-9668-42b2-abe9-c10d6972693a","resolution":{"observed_at":"2026-08-06T18:27:04.988879Z","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-06T18:27:04.994936Z","title":"Spearman","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:04.994936Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:abf9bb032a418c96784d4229c51e1bd9be23bd4c165d40492b4a8c89b2a318a8","observation_id":"274e633b-c511-41fc-8294-92431f8135ab","resolution":{"observed_at":"2026-08-06T18:27:04.994936Z","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-06T18:27:06.304881Z","title":"Support Vector Machines","venue":null,"work_id":"b1d1d845-48d0-4b03-8ee4-332b69de309f","year":2008},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.000691Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:1538599fa0d718c783146d469729ebad4770904e5c0da288f5de8e1809379e9f","observation_id":"636b5172-425a-4478-960b-fa328fb91089","resolution":{"observed_at":"2026-08-06T18:27:06.309548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.289105Z","title":"Mathematics and the picturing of data","venue":null,"work_id":"c321870f-97a9-42b1-b70c-7462a436a9bf","year":1975},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.005681Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:b23bd7df323f947c7c7e44fe88ab02e4a355234db7418d84ce98b1c016f8c229","observation_id":"578cfd97-ccc9-4b18-9161-026f3a649cc7","resolution":{"observed_at":"2026-08-06T18:27:06.294043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.270864Z","title":"Conditional image generation with pixelcnn decoders","venue":null,"work_id":"901a6a64-d7ed-4f90-b978-953da89331c6","year":2016},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.010387Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:2b1d4165592a00b71273bb5f5026239071b04d0657bacf080ae12b76865053c8","observation_id":"22484230-073c-45e1-ab33-9e07ca0458c1","resolution":{"observed_at":"2026-08-06T18:27:06.277105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.254165Z","title":null,"venue":null,"work_id":"c7aa53ca-1808-4695-afd3-b84abdc7e8cd","year":1968},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.017310Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:3c934e8ac86e6906c4d6048cc687b75df952a1ee84f05d7d5b70f0e6009ea8a1","observation_id":"7df70243-8e07-4df3-8cfb-abcd68ae7aa8","resolution":{"observed_at":"2026-08-06T18:27:06.259121Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.237572Z","title":"Optimal transport: Old and New , volume 338","venue":null,"work_id":"d60ed50e-d76a-41a0-80c1-4e25c352b2bb","year":2009},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.022829Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:e124e2064f408cb83520c9ceaac401c2cb9f7f07c331a18ad700c0861000446f","observation_id":"05da26d9-b320-4edc-9f4e-08fc818f81ce","resolution":{"observed_at":"2026-08-06T18:27:06.242651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:05.028905Z","title":"One-class anomaly detection via novelty normalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.028905Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:783b6b140451489ecc7d1831d932bff53ad884a503ee49cefdd4abbc5244e8b7","observation_id":"d9ef187f-685f-4ab9-9160-1a4cb7178009","resolution":{"observed_at":"2026-08-06T18:27:05.028905Z","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-06T18:27:05.034564Z","title":"Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.034564Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:c7e259c6e65e7ce001f7b13d18e5ba07dd90aa5aeb050ad130072c083874ca0a","observation_id":"00dcfa3a-95d1-48dc-9c5a-29105e7b479e","resolution":{"observed_at":"2026-08-06T18:27:05.034564Z","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-06T18:27:06.207354Z","title":"Deep structured energy based models for anomaly detection","venue":null,"work_id":"27574bd4-fb1f-4fd4-8096-5c6408e0af81","year":2016},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.041333Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:e1d1974f92bea52f71d93e0bf0215b2377f4c96d705a2f13620694a5b0cc8b4e","observation_id":"5cb6ac70-e4ae-4523-89c4-90ac94c4fd5e","resolution":{"observed_at":"2026-08-06T18:27:06.211968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"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-06T18:27:06.190202Z","title":"Deep autoencoding gaussian mixture model for unsupervised anomaly detection","venue":null,"work_id":"e43a6cec-578b-4fd0-a844-af4bec73b76e","year":2018},"citing_paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T18:27:05.047268Z"},"links":{"citing_paper":"/paper/2507.08518"},"observation_digest":"sha256:0129fc3779613a0984ef66f9b88ca563becf8cfd42619cd97c1577a116839eab","observation_id":"9f7f2272-4415-4b67-8094-05fe0e1e8183","resolution":{"observed_at":"2026-08-06T18:27:06.195476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.08518","last_updated":"2025-07-11T12:05:03Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-06T18:14:14.394746Z","submitted_at":"2025-07-11T12:05:03Z","title":"Data Depth as a Risk"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":3,"verified_fuzzy":21},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2507.08518."}