{"as_of":"2026-08-16T17:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbcbb41998a4a9367515637e054685945a5205d24a8e68f0d0bf45e0b32ff4e8","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-16T06:30:59.297886+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-08-14T18:55:43.310905Z","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-09T06:21:45.560387Z","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:0d64f0572ba49c9c8a0ca18b7f46d269aabba58ccd527c7fde8d8a3018ff7605","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:bdb56248c9259d49505a97d6a9bcf11a1522908df1f3b79e33166bb525ccb796","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-09T06:21:45.560387Z","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:28e42b24feeee774d64f13b206cccecdc394b85f477d8e1e277feee58fec4692","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-09T06:21:45.560387Z","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:37d029db93a180b834c912071290f828e50ddb1b4cd45723852c17036dab0f14","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:2a171c72749a964a766297ab4a39f637895a558aa3f01083edb98deeda5d32cc","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:5a31b2107478adeb31a06fd28b82afddfd108ff9c9edf69a1baf829fe55e8dd7","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:f5526742c9d9af670b19e9c4a0167ee0ba0a5fc07912ac84e77711bb38791112","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-09T06:21:45.560387Z","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:61fc58e6cf511d6a7db0a0f5d9074b86f489145d4b9de96fc07e2fbe5b080316","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:a7b17af336beb9cf56c229e6022307d96f14cdcd10fbffeb82eabb85149eb207","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-09T06:21:45.560387Z","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:9ddb30665130216413d0115fd4aab8966d0b7bfda5955c5f46da93b3c2a630a8","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-08-16T14:32:27.579987Z","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-09T06:21:45.560387Z","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:65e75956878fd7e91dd0a0f67dc79f74ee41b7d8e0f9146c5cdb44e5fceec4fd","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:1d005a09f5e95df5c001ba3067d9f15dfe7ab3e741d4d6f7f07def958b5e8130","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T15:59:56.095916Z","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-09T06:21:45.560387Z","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:9cfa7b5edcad897d07496d3cb85cdf906f3a90e80e0c993b609bfad7505ac014","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-09T06:21:45.560387Z","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:9f83ffd9a3fac074973df23a17eeaef1c581a8f69154297334faa35ad9e9a42b","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-09T06:21:45.560387Z","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:93a799f80dd1ed9559a20d1701f7cfe9836ae988fa9296ced8a0acdd91b5a9ec","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-09T06:21:45.560387Z","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:baf3d825893a83d0e3bde9190627e5863df3e03e465394a9b280209b6af285c2","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:d13ae46281bf1334750ef1e77bc42b2f649c75ac7da9c8f6c05e1fd4899959dc","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-09T06:21:45.560387Z","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:5bbb7eeae081504d44db7f23d29f898f1247a175de270771b0b9b8c4ce17d07d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:01362fc3b6975235147a939615c90185d8d7e5243bc31390d75ce4779a989377","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T23:50:45.029465Z","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-09T06:21:45.560387Z","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:46bf2ffa0b18e62afa515c66ce4949b711d4692589dc9babe76b224d5a8158bb","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-09T06:21:45.560387Z","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:dfb9b4e586e631d9fc4d900e49e38f6a47a08e9524c7474f179376f0379f84a6","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:a06b64a79608dd6676f487c399172951bd15763cdd0106f85de417e8e8bc82e7","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-09T06:21:45.560387Z","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:97a08639e2e8b4e2c8c3c22f0ba925d862d6f90da7dfc2f3e8ffc6e4a3ec7862","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:efcb702623969c4a4fad66e54074a112ca18ce72d8ab9c6d185088ccd3f77610","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-09T06:21:45.560387Z","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:910c30a7d38e6583485307da81cb4f1fafd645da3e53c11c0799ca69f90f8252","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:6df9bf3af92cb90e277685686d9a7a99050e4a2ccaec6ba98bec2359a56f0b21","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-08-16T16:26:27.218816Z","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-09T06:21:45.560387Z","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:c1c34bbd357aff5645d1f0145fdf80602e9c0ff070128aa4f008462ad8745ab6","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:4c22c0c84d29d42fe0de9f1470d4fe18aaf6b8c857230859ce6734917e02d98d","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-09T06:21:45.560387Z","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:4faf6ee6c9be9eb59533ae6bf645df1fbee903c8d5f7ac3efc22afa7b466dd33","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:7ebe28d23504958b3edf8528a887a409d0511814b1637c0be5c66d50cadeec36","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-09T06:21:45.560387Z","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:8590f7d5f1a243e5c576cf3506b30b5bc55bfb77a6efd21d6774859608f3c7ef","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-09T06:21:45.560387Z","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:128982fc43ff0b08f8682896c3babd11ff059a7a871fa2b806abd2a0f6f7db77","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:4234fc15949c5df7e4138d775dd95aa53264c84c88fc376bed2eeb9a4a514dae","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:3b1bc1012223bcb05305acb80a03314ded0b0ce7094bd3fc956dfd1121b26b21","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:c77eaece2ac76840822383e060df09b3ba867cb09f50a29180a0fca3488eb34c","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-09T06:21:45.560387Z","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:5f136a9706ca2d4a599760be325d79ed40d510be470b4a489185ed2066cc6a91","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-09T06:21:45.560387Z","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:7d18d83ff548943d86c6aec03312582c01c133bcda02b4a1b3e30693c27b09c9","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-09T06:21:45.560387Z","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:d9c69ecf7d4c341aa19f6d922ee1a6a078da4ae4883655235e0498f26fc02f2d","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-09T06:21:45.560387Z","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:14cfb0c38f0f1843dc879c5536cb014897f229380b0c3650e424c1069dbdda6a","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:addb2789645ae1b27b495d57c521568c4344c8c4ef3c6d144aa222d45db78954","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:5a5db332e803f1ee7427af59ac4c90ad03ac88e6eac7c589ae2e964a21b3ee36","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:c5335804270544fda08ba8abc679e29773eb627631f75a18f9cd4045e35101bb","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:a918950a85244f566ce4ea178af6fc1b03ab2cf45151a316e2371538162de54d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:5909130d0afaed0c5be46027ba1bdf3346bf42c27c97ab3bb11b9e6cdcd23b3d","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-09T06:21:45.560387Z","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:e1046d92f5f3992e5bd13dccc19d456aeed4bbb672c98a5c8255945290ba0e1c","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-09T06:21:45.560387Z","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:95ee33be5ca67a167fef16db427a2a9ad964e3f4ff78899565cccb9afe679049","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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:e8f3848bd7b540cf54c260a5827b872c953eb370d7b1d3a26167ba7bee50f2f1","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-09T06:21:45.560387Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2507.08518."}