{"as_of":"2026-08-10T06:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f10c6d4e24018473aa7f07ec820857a8ce64caf3a7b3225c1ab5bf6a8acd2258","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:37:46.423906Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:42:17.175045Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02623","snapshot_observed_at":"2026-08-04T14:42:17.175045Z","title":"Ninareh Mehrabi, Fred Morstatter, Nripsuta Saxena, Kristina Lerman, and Aram Galstyan","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.24340","last_updated":"2026-01-19T12:27:39Z","snapshot_observed_at":"2026-08-09T15:18:43.115294Z","submitted_at":"2025-09-29T06:43:24Z","title":"humancompatible.detect: a Python Toolkit for Detecting Bias in AI Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:17.175045Z"},"links":{"cited_paper":"/paper/2502.02623","citing_paper":"/paper/2509.24340"},"observation_digest":"sha256:22a966f4b715cbc7984f3580d7b1c988cc5d4be46857265f187428cee18e047f","observation_id":"d998ef79-3d2d-4255-88e8-c763ca0eb797","resolution":{"observed_at":"2026-08-04T14:42:17.175045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02623/citation-record","integrity":"/paper/2502.02623/integrity","json":"/paper/2502.02623/citation-record.json","paper":"/paper/2502.02623"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:37:47.108078Z","title":"Nonparametric estimators,","venue":null,"work_id":"8db3562b-a8c2-4e15-bede-d54e0b1737eb","year":2009},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.235780Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:e37b38a60ffafe50256b853bc00a1595d6ada32d6721d4e965fa0709f6069e0c","observation_id":"c69d48ed-e729-48b4-a9af-1802ae6e018b","resolution":{"observed_at":"2026-08-09T12:37:47.112757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.093889Z","title":"Markov processes over denumerable products of spaces, describing large systems of automata,","venue":null,"work_id":"cb68472d-d2d8-40de-bef3-2055cdbcd805","year":1969},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.241262Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:0971d56d15103a5eab0cbe9017b884aefa1ceb31a0b061f7d88b08e098e71254","observation_id":"996c5446-91d7-4116-bb1e-23b5de39d53a","resolution":{"observed_at":"2026-08-09T12:37:47.098431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.080466Z","title":"The speed of mean glivenko-cantelli convergence,","venue":null,"work_id":"a781f62c-cc1f-4e6f-9742-7e2cae5aa422","year":1969},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.246576Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:1548cea02b6700c5c370269bf090256e60227de3d32788fe28dcb74217bd4133","observation_id":"d93207b9-b591-4265-a445-ef32eaf8d0ef","resolution":{"observed_at":"2026-08-09T12:37:47.084828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.066678Z","title":"A kernel two-sample test,","venue":null,"work_id":"4c570911-3b14-43f7-85fa-484eab6333a2","year":2012},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.251331Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:0b6ff7b4105e176b0d733d1998965ba0da95d53c204caee57339d7fc08c9f51e","observation_id":"e7c0714c-ce6a-4975-bbcd-69aa2ba0edac","resolution":{"observed_at":"2026-08-09T12:37:47.071428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.052540Z","title":"Statistical estimation of ergodic markov chain kernel over discrete state space,","venue":null,"work_id":"2c6f85e4-2759-4ddb-903a-bd0ae716373b","year":2021},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.256112Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:34545c315b71f7abdfd173f815685b0bd16af29fd2d7a505056daea9d20b1768","observation_id":"d70d1c44-79c8-481f-ab0a-5b3e93abd4e3","resolution":{"observed_at":"2026-08-09T12:37:47.057379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.038582Z","title":"Neue begr¨ undung der theorie quadratischer formen von un- endlichvielen ver¨ anderlichen.,","venue":null,"work_id":"24f16cbf-d156-45a7-8863-38a03193a7a6","year":1909},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.260980Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:a6df104493ae225fc5b213c2487a54b33af96f8aa349c781a53b721e7f4452c2","observation_id":"bd7484b8-2946-4ced-89a3-23ff40ab340c","resolution":{"observed_at":"2026-08-09T12:37:47.043321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.024584Z","title":"On the rate of convergence in wasserstein distance of the empirical measure,","venue":null,"work_id":"ef5af7f4-3c27-412c-b230-ccf17fd0afd3","year":2015},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.266574Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:cd04f3e676976d919b25914f3c966f3978aef03eae4abd60c5f02fbcd61bbcef","observation_id":"6e20e723-0fbe-49b2-bab2-64c69ad08435","resolution":{"observed_at":"2026-08-09T12:37:47.029201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:47.010382Z","title":"Sharp asymptotic and finite-sample rates of conver- gence of empirical measures in wasserstein distance,","venue":null,"work_id":"699ad47a-7692-4885-bf6b-6d72be0b4f98","year":2019},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.271247Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:85020aa8c63717c82e09e61389c2c91ab011d09dbbb9ad0ffabe35a40a4a980e","observation_id":"1f84f179-18cc-48b8-96ec-518c746824ae","resolution":{"observed_at":"2026-08-09T12:37:47.015086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.996271Z","title":"Statistical aspects of wasserstein dis- tances,","venue":null,"work_id":"62a90fb7-e5a4-46d6-9de2-7c43f169fb7b","year":2019},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.275776Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:039723b55201ae518bb0f840d0cc361cdf9cdc5ae876d72fdb1c3e76eed092cf","observation_id":"3a822f8f-af49-4598-a9d9-49eae59b5271","resolution":{"observed_at":"2026-08-09T12:37:47.000931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.08365","last_updated":"2018-08-02T01:17:57Z","snapshot_observed_at":"2026-07-06T06:51:38.176531Z","submitted_at":"2018-07-22T20:57:17Z","title":"On the rate of convergence of empirical measure in $\\infty-$Wasserstein distance for unbounded density function","version":2},"cited_work":{"arxiv_id":"1807.08365","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.08365","snapshot_observed_at":"2026-08-09T12:37:46.614348Z","title":"On the rate of convergence of empirical measure in $\\infty-$Wasserstein distance for unbounded density function","venue":"math.PR","work_id":"e4e6d803-97f9-42f7-8e08-8666e3f81c7a","year":2018},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.280010Z"},"links":{"cited_paper":"/paper/1807.08365","citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:11c63808a0248600f934c314d60d9df3957208f6e9b1ab563ffd48c15992f1d3","observation_id":"224dbd39-9ccd-447b-a172-4c375732ab0b","resolution":{"observed_at":"2026-08-09T12:37:46.619920Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.08693","last_updated":"2023-10-22T20:59:12Z","snapshot_observed_at":"2026-08-08T22:36:57.934512Z","submitted_at":"2018-10-19T21:38:06Z","title":"The total variation distance between high-dimensional Gaussians with the same mean","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.08693","snapshot_observed_at":"2026-08-09T12:37:46.284908Z","title":"The total variation distance between high-dimensional gaussians with the same mean,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.284908Z"},"links":{"cited_paper":"/paper/1810.08693","citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:5757eb89fc672052c07f8e02a7a80068f3b49ce5b3e9ffd8437b1d56ebcf0892","observation_id":"cff37e0d-6d00-47c5-ba2b-e72bc0e7c244","resolution":{"observed_at":"2026-08-09T12:37:46.284908Z","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-09T12:37:46.980971Z","title":"Polynomial time and private learning of unbounded gaussian mixture models,","venue":null,"work_id":"791c004c-b239-4b51-9bc8-b863c376a88b","year":2023},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.289751Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:0150e7b897cdc46e335a57163ec1cb1f756cb5b5a7ebe0af53503b7a212fd81f","observation_id":"6eb29e61-ea47-4dc4-87e1-3fdc9a696934","resolution":{"observed_at":"2026-08-09T12:37:46.986056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.966143Z","title":"Sample com- plexity of sinkhorn divergences,","venue":null,"work_id":"6a6ef68b-e93c-4aab-b5ec-dff23a5b9a0b","year":2019},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.294397Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:5cd89783feea80f550b655d9dc7b09e9acfbc602caff4422288cc6716d11334d","observation_id":"caed3735-cd09-4be6-bcc7-d1810622881c","resolution":{"observed_at":"2026-08-09T12:37:46.970654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01429","last_updated":"2021-02-15T09:44:14Z","snapshot_observed_at":"2026-07-06T10:30:04.856768Z","submitted_at":"2021-01-05T09:46:58Z","title":"Convergence and finite sample approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings","version":2},"cited_work":{"arxiv_id":"2101.01429","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.01429","snapshot_observed_at":"2026-08-09T12:37:46.577826Z","title":"Convergence and finite sample approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings","venue":"stat.ML","work_id":"7a77cdd6-b51f-4194-bb5f-3400a9eef6e1","year":2021},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.298672Z"},"links":{"cited_paper":"/paper/2101.01429","citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:46de68c9a03e011edcc5a20a8eb343776e20caa4028a2fd75b54c322d9a0c082","observation_id":"c60cba5c-c986-4c40-b21d-33048f8aa909","resolution":{"observed_at":"2026-08-09T12:37:46.583452Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.952000Z","title":"Minimax esti- mation of maximum mean discrepancy with radial kernels,","venue":null,"work_id":"eece65e1-d409-441a-bbc0-99cf16d0761c","year":2016},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.303348Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:0b2f52956a9810f473405b26d3f33590d0d724946c9bc80d74ffbb579f27b2e5","observation_id":"65c60bbc-d45e-4d86-9a20-fcc24a8223ff","resolution":{"observed_at":"2026-08-09T12:37:46.956773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.937860Z","title":"Sample complexity of probability divergences under group symmetry,","venue":null,"work_id":"af5c346a-5045-463c-8e05-6aa66b2fe038","year":2023},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.307773Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:d70f0a5b776e91f000f70e85410a547a44c6f67e7972e1b2caa246e40d4e6bef","observation_id":"deee6ca0-b692-46a0-af34-927a84d36d3a","resolution":{"observed_at":"2026-08-09T12:37:46.942549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2311.02868","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:37:46.551027Z","title":"Sample complexity bounds for estimating the wasserstein distance under invariances,","venue":null,"work_id":"f47052b6-17b3-43e2-8ac5-d4786b00411b","year":2023},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.312043Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:08dff9683c0ae1c309eb8a8c80b90bdb7f422283bf9ff91e9f23129f0cca99de","observation_id":"a76ffc25-62bc-426d-8acb-93eff8f01e61","resolution":{"observed_at":"2026-08-09T12:37:46.561718Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.923476Z","title":"Computability of optimizers,","venue":null,"work_id":"194a7944-f03b-4080-b3d7-10fa77806dca","year":2023},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.316315Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:24831d683777eaf9a4036c61dd23d02b2f961783e3063c788c0136db66e3adf8","observation_id":"22787ad6-22a6-4930-84f8-237ed5be58b0","resolution":{"observed_at":"2026-08-09T12:37:46.928269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.908724Z","title":"How we analyzed the compas recidivism algorithm","venue":null,"work_id":"12a35c2a-c1a0-458f-bb55-5ec404902812","year":2016},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.320706Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:7182490063fc85864a9edd6c9f6ad0d1817ffe2f3798d8bb0c735d6a7de64e83","observation_id":"fee349a1-637b-4a16-ac1b-50806e744720","resolution":{"observed_at":"2026-08-09T12:37:46.913460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05498","last_updated":"2022-04-28T18:04:20Z","snapshot_observed_at":"2026-08-08T04:25:11.829980Z","submitted_at":"2021-06-10T04:59:06Z","title":"It's COMPASlicated: The Messy Relationship between RAI Datasets and Algorithmic Fairness Benchmarks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.05498","snapshot_observed_at":"2026-08-09T12:37:46.325164Z","title":"It’s compaslicated: The messy rela- tionship between rai datasets and algorithmic fairness benchmarks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.325164Z"},"links":{"cited_paper":"/paper/2106.05498","citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:d2a23139b211b15336bd6314f84b045a579c2cda22bc7e487985a51e7681d52d","observation_id":"a3df908b-55dc-4670-8316-45ced7a3d890","resolution":{"observed_at":"2026-08-09T12:37:46.325164Z","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-09T12:37:46.331151Z","title":"A kernel method for the two-sample problem,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.331151Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:b7af48fc618c689a58d53565833c52a14c254c0c2297a0a97faa4b9a8a9fca97","observation_id":"f8fc3421-ff10-4fa6-b06a-e706e053a79e","resolution":{"observed_at":"2026-08-09T12:37:46.331151Z","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-09T12:37:46.885534Z","title":null,"venue":null,"work_id":"143b5fc8-7cd9-4289-8e30-3a9cbf43f2b1","year":2002},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.336331Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:8a21200801d436ba62e3157ae0e22f8cb7c8a4abe711aa56ee697cfb5900a66a","observation_id":"86ae6112-3d41-4a04-9aa6-1e10f6e087df","resolution":{"observed_at":"2026-08-09T12:37:46.890213Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.871384Z","title":"Berlinet and C","venue":null,"work_id":"9b7bc386-064c-476c-89fa-18f734623edb","year":2004},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.340531Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:2f3c9240d360254d1dfe6ff464961e258de5f11a0192b0a8e00ebe05758533a6","observation_id":"33b84f14-b5e2-4f18-a93c-818d66e41483","resolution":{"observed_at":"2026-08-09T12:37:46.875778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.857798Z","title":"Computational optimal transport,","venue":null,"work_id":"e71b9b71-e25b-4f35-8f9b-b9a1eed1e70f","year":2020},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.345238Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:0108c1216c996927983e59e2cfd6e1d1c9000c8ea73764c10c0913f5a199f62a","observation_id":"201d340b-35b4-4b48-8e28-3ffc9b126b9f","resolution":{"observed_at":"2026-08-09T12:37:46.862363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.843491Z","title":"Monge, M´ emoire sur la th´ eorie des d´ eblais et des remblais","venue":null,"work_id":"430caa6c-03be-49c7-a60f-f390f4c25a0f","year":null},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.349466Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:7e3529c18574a6cd0bbde24cf3de3817dbab27d1b650afa9bd23878d43ba9581","observation_id":"1695c31f-4e25-4353-ad88-dd91b2599568","resolution":{"observed_at":"2026-08-09T12:37:46.848480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.829318Z","title":"On the translocation of masses,","venue":null,"work_id":"b6d089ec-77a4-4fce-bc60-07e5bd6104b8","year":2006},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.354840Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:a8aebc62c219006c0e5988379c2816a5598909c8b234f3fd03e465063d017ed4","observation_id":"0a359038-69f2-47c5-b6f7-a638870eb536","resolution":{"observed_at":"2026-08-09T12:37:46.833996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.815406Z","title":"On the uniform convergence of relative frequencies of events to their probabilities,","venue":null,"work_id":"2d13d98e-87ea-4e39-9ab7-7807d6eb21d6","year":1971},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.362504Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:9c8bd24ee4a32d2ab06c9569a03e84da75d509f0e3bb015c29e425d02d82bed8","observation_id":"1b798462-b510-4000-b178-811ba40a62f6","resolution":{"observed_at":"2026-08-09T12:37:46.820125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.800783Z","title":"Low-rank methods in event detection with subsampled point-to-subspace proximity tests,","venue":null,"work_id":"4e2021dd-ff89-456d-a4b1-526804c92626","year":2022},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.367753Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:a93bd8730a5fb0e81267aa8d5d1f532a4b9bd4da24d4984b993198de81a0507e","observation_id":"65d62834-f738-4c6b-aff4-504195f34692","resolution":{"observed_at":"2026-08-09T12:37:46.805704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.786392Z","title":"ϵ-nets and simplex range queries,","venue":null,"work_id":"e06a47c0-d84f-4feb-83d8-be526b07edbc","year":1987},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.372575Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:91509ad868f6faed30bf1f40ab5137aaa7ca4f7c3ae961330335a111eea79ca1","observation_id":"67a719a3-06f5-471b-bfc9-7583ae77573c","resolution":{"observed_at":"2026-08-09T12:37:46.791287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.771493Z","title":"Epsilon-nets and simplex range queries,","venue":null,"work_id":"83adfcd1-613e-4116-8c96-75603c84bb5c","year":1986},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.377033Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:ada755fc01976b91f97e949d39a9dad34553c317a1aed2f3b1627046280a997e","observation_id":"448fab45-0be8-4bf3-ad95-10a4bc696fe6","resolution":{"observed_at":"2026-08-09T12:37:46.776306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.756787Z","title":"Further applications of random sampling to computational geometry,","venue":null,"work_id":"69cba4c8-b5b0-4d5b-80a5-7d1a80305ece","year":1986},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.381300Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:10082a0f9f034a5a4830ac1620ee610578fdaff14d6ec504d1fcd233429c2a31","observation_id":"f09c0b92-0e04-4c81-816b-6b0f0e2d1367","resolution":{"observed_at":"2026-08-09T12:37:46.761631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.742198Z","title":"New applications of random sampling in computational geometry,","venue":null,"work_id":"a8504687-e629-4d65-b95c-09df9b8d9095","year":1987},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.385421Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:bb8d0724afd5057857db8b9b7cf049d9269c3558781f1c5cfc732589020bf23a","observation_id":"7f795d7f-6bce-4840-bb65-0f0da42aa532","resolution":{"observed_at":"2026-08-09T12:37:46.747216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.726173Z","title":"Lecture notes: Geom- etry: Combinatorics and Algorithms","venue":null,"work_id":"aca1c558-015d-4a56-8c79-70756ee2d404","year":2019},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.389590Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:d97db99968921940fa5658676d2a59029847c130d38fe6cafdb3ba83d792faff","observation_id":"e6c5aec0-130c-4b9d-9ebb-47b448bc4a75","resolution":{"observed_at":"2026-08-09T12:37:46.731985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.710283Z","title":"Mitzenmacher and E","venue":null,"work_id":"869acfe5-74f9-4b0e-925b-c087152986e8","year":2017},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.394085Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:bcb6b8e4c48b75e44e06ab3ee1d134454a2c2988ba6d7b71b8b1c6970f4d3483","observation_id":"f2a3f30b-562a-4406-86f5-187a214722d1","resolution":{"observed_at":"2026-08-09T12:37:46.715806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.694223Z","title":"Pot: Python optimal transport,","venue":null,"work_id":"e02a4cfe-de43-423d-9978-79dee2a20e4d","year":2021},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.399827Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:448a3e18a1e9304d1f8a2d6d7d8739d325902c95930c5888b2913dc365961807","observation_id":"517b0174-e4b1-4ab8-933b-e3dca4fcbec1","resolution":{"observed_at":"2026-08-09T12:37:46.699292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.678682Z","title":"Becker and R","venue":null,"work_id":"1e8b6430-2041-4622-9634-99c1c01a5f39","year":null},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.404087Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:f703358b825db9f8766582a019f24d72fdea58f8e03c6e5a10003e9aee96def1","observation_id":"d4904eba-ced8-456d-9cc4-d5075fa589fc","resolution":{"observed_at":"2026-08-09T12:37:46.683861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.662586Z","title":"Retiring adult: New datasets for fair machine learning,","venue":null,"work_id":"4da2bf7f-cc20-4870-9e31-46c3c913f2de","year":2021},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.414575Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:92557a9515dccd7cea52843956137b223ff6bdb45966d27b47e889bcfd34c08c","observation_id":"0eb3f3cf-172c-4f33-8542-8f9f45107f6e","resolution":{"observed_at":"2026-08-09T12:37:46.668064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.646511Z","title":"Minimax estimation of maximum mean discrepancy with radial kernels,","venue":null,"work_id":"37b28609-d07b-43da-8e6e-1bbf0463d950","year":2016},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.419166Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:d84ac93c3ef02d5de7354d428623071c3c2cf35be5fb96a902d61730b63f094b","observation_id":"f985d387-da7b-4458-93cb-302bdecaf19e","resolution":{"observed_at":"2026-08-09T12:37:46.651850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.630665Z","title":"On the sample complexity of learning functions with bounded variation,","venue":null,"work_id":"209e0cfe-86b9-4e95-a8e6-c8d67f627239","year":1998},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.423906Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:e6ca193f404cd303bb74ff46573822dc71ad27a425e5ac2fd0d717d6d84c752e","observation_id":"b7e4cdfc-5cba-4bba-9f86-180ba0afcc1a","resolution":{"observed_at":"2026-08-09T12:37:46.635759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T12:37:46.409114Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-09T12:37:46.409114Z"},"links":{"citing_paper":"/paper/2502.02623"},"observation_digest":"sha256:de478bf797826960150bfbd6303caedb5f0d93f28375cabcae2919269c266d34","observation_id":"4a9dfef9-33fd-4334-be05-3666ea446a78","resolution":{"observed_at":"2026-08-09T12:37:46.409114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.02623","last_updated":"2025-02-04T14:03:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T12:28:00.042931Z","submitted_at":"2025-02-04T14:03:49Z","title":"Sample Complexity of Bias Detection with Subsampled Point-to-Subspace Distances"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":32},"total_outbound_references":40},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 1 inbound Pith citation observation for arXiv:2502.02623."}