{"as_of":"2026-08-17T15:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f032b9cb8c9f049612840ea042ed935a6d5cebba00e9b79a87d90f6fe2ebce46","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:20:23.817042Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:43:43.396059Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-06-29T14:13:30.297812Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.08470","snapshot_observed_at":"2026-08-02T20:43:43.396059Z","title":"Learning credal ensembles via distributionally robust optimization","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.22747","last_updated":"2026-06-20T12:55:53Z","snapshot_observed_at":"2026-08-16T05:57:20.073205Z","submitted_at":"2026-02-26T08:36:09Z","title":"Set-based v.s. Distribution-based Representations of Epistemic Uncertainty: A Comparative Study","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-02T20:43:43.396059Z"},"links":{"cited_paper":"/paper/2602.08470","citing_paper":"/paper/2602.22747"},"observation_digest":"sha256:ed35117c2a099c5a5066d07c260b9e03aa760e6494e3a4ca3b5397961b1cc5fe","observation_id":"cc2a532e-888e-413e-9dde-62165febef0c","resolution":{"observed_at":"2026-08-02T20:43:43.396059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"cited_work":{"arxiv_id":"2602.08470","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.08470","snapshot_observed_at":"2026-06-29T14:13:30.297812Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","venue":"cs.LG","work_id":"99e1d6fb-db2c-4be4-ba88-b567ba9c181b","year":2026},"citing_paper":{"arxiv_id":"2605.28165","last_updated":"2026-05-27T08:47:50Z","snapshot_observed_at":"2026-08-08T06:00:31.662496Z","submitted_at":"2026-05-27T08:47:50Z","title":"Unification and Optimization of Robust Supervised Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T14:05:30.109141Z"},"links":{"cited_paper":"/paper/2602.08470","citing_paper":"/paper/2605.28165"},"observation_digest":"sha256:8418ebd4160b733fc76a7792035fc1791381dc1012133614544119f3820e1e70","observation_id":"60fec167-809b-4417-a789-a6e04eeb5a03","resolution":{"observed_at":"2026-06-29T14:13:30.298921Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.08470/citation-record","integrity":"/paper/2602.08470/integrity","json":"/paper/2602.08470/citation-record.json","paper":"/paper/2602.08470"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:20:23.795550Z","title":"Additionally, Wang et al","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.795550Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:8836d2a1c68ad165655e03d75ebf8a22a22aee5032f8feddf2b277b7a1b521e0","observation_id":"a1c372ca-413c-4247-9b65-da675fa8616a","resolution":{"observed_at":"2026-08-03T03:20:23.795550Z","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-03T03:20:23.812865Z","title":"!') #' %(","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.812865Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:423b357e2f382539a18585b57ff94c201f63687b8f8cdb82acc1ac606fc0f41b","observation_id":"5235ea30-9898-43e8-b5f2-d080be9f0262","resolution":{"observed_at":"2026-08-03T03:20:23.812865Z","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-03T03:20:23.804425Z","title":"Specifically, WSIs from centers 0, 1, and 3, which use 3DHistech scanners, make up the ID training and validation set","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.804425Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:841424ba43b86a99848cf5811b5f3e49134d852c66c2b14926efaf4b4a03185d","observation_id":"dcb40026-6e48-4a5b-8d62-2af49754d2c6","resolution":{"observed_at":"2026-08-03T03:20:23.804425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08731","last_updated":"2020-04-02T05:40:29Z","snapshot_observed_at":"2026-08-14T08:06:00.989531Z","submitted_at":"2019-11-20T06:43:41Z","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08731","snapshot_observed_at":"2026-08-03T03:20:23.762792Z","title":"Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.762792Z"},"links":{"cited_paper":"/paper/1911.08731","citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:1f8e8220fd83b21b583c005432e2b821480c3da2d086dd9d7a9e9cef554357d3","observation_id":"db950ce9-78f4-49da-a531-844a7335f1cd","resolution":{"observed_at":"2026-08-03T03:20:23.762792Z","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-03T03:20:23.767902Z","title":"doi: 10.1016/j","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.767902Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:a89e7a8cafa5fb6b0daf1784bbcc271e4404c166bf5ef5a96e433d1c24127c92","observation_id":"4d469373-9e0a-438e-9d86-7ce420f9898b","resolution":{"observed_at":"2026-08-03T03:20:23.767902Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:20:23.772949Z","title":"Credal ensemble distillation for uncertainty quantification.arXiv preprint arXiv:2511.13766, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.772949Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:9d769fe7448397db974b2af8302b44cbd2e286766ee9fd2e95741624f34ecf5c","observation_id":"263a5d16-1f37-4486-b86a-5aa3dafd4b59","resolution":{"observed_at":"2026-08-03T03:20:23.772949Z","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-03T03:20:23.817042Z","title":"\"\"deffun(x: np.ndarray) -> np.ndarray:return-entropy(x, base=base)x0=probs.mean(axis=1)constraints={","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.817042Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:a784e3b3e654597efa29cdb0b99166e7d34f7ff7e1ebbdb538357938f3a95cda","observation_id":"596a5e1c-1bb1-4f31-80dd-aa48ba8a0cd4","resolution":{"observed_at":"2026-08-03T03:20:23.817042Z","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-03T03:20:23.808441Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.808441Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:54022654bf99f16f8699b049c48dc66765220b6db076784d2bc3a6ec2bce9250","observation_id":"58efd296-12c6-479f-96ba-19048608a071","resolution":{"observed_at":"2026-08-03T03:20:23.808441Z","resolver_source":null,"status":"malformed_identifier"},"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-03T03:20:23.799995Z","title":"All experiments are conducted on a single Nvidia A100-SXM4-80GB GPU","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":128,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.799995Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:e023d75b2f25668a2eecba897d0ce4d5ca3207f122a6c24bce2eb265369ed760","observation_id":"d62b7fab-4a38-48e9-90e0-c7f7823739d0","resolution":{"observed_at":"2026-08-03T03:20:23.799995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.07146","last_updated":"2017-06-14T06:06:48Z","snapshot_observed_at":"2026-08-16T07:54:28.918946Z","submitted_at":"2016-05-23T19:27:13Z","title":"Wide Residual Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.07146","snapshot_observed_at":"2026-08-03T03:20:23.781889Z","title":"Wide residual networks.arXiv preprint arXiv:1605.07146,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.781889Z"},"links":{"cited_paper":"/paper/1605.07146","citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:c99cc3053ef243a2ea59f8a3e0c4a74474c73242bd3b88bc2385ad6b1b267607","observation_id":"9141f8c2-92c6-4a9d-8eb7-3ce409329aaa","resolution":{"observed_at":"2026-08-03T03:20:23.781889Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.04759","last_updated":"2018-04-24T20:36:16Z","snapshot_observed_at":"2026-08-15T05:34:53.434231Z","submitted_at":"2017-10-13T00:27:57Z","title":"Bayesian Hypernetworks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.04759","snapshot_observed_at":"2026-08-03T03:20:23.738232Z","title":"Bayesian hypernetworks.ArXiv Preprint ArXiv:1710.04759,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.738232Z"},"links":{"cited_paper":"/paper/1710.04759","citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:c45950c6207cd11dedae019ffea37759522dbd172f0fb42536225d718bf4e290","observation_id":"ca73e3b3-7380-409a-a4f4-e5f54ab3fcad","resolution":{"observed_at":"2026-08-03T03:20:23.738232Z","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-03T03:20:23.791078Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.791078Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:73432f682a345ac4ca7235c302be5d51df2a31000bf072ff11a5e39c0ac9893a","observation_id":"c7171bfd-a4af-4ded-8c29-c340429d6d80","resolution":{"observed_at":"2026-08-03T03:20:23.791078Z","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-03T03:20:23.732766Z","title":"On second-order scoring rules for epistemic uncertainty quantification","venue":null,"work_id":null,"year":2078},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.732766Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:53a335f956402e27c9dff1c435b87810ffa30b6337ee1dc6dd92507dd8d7ae52","observation_id":"fac0ae40-a3d8-4449-8bb9-0456b168b36a","resolution":{"observed_at":"2026-08-03T03:20:23.732766Z","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-03T03:20:23.786837Z","title":"18 Dengyong Zhou, Sumit Basu, Yi Mao, and John Platt","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.786837Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:6287b5b9255ec695e2a50b4f99ca516bd142e92cda1c3147dcff82a0ee967bda","observation_id":"2aa0fdbe-a0a6-4e71-84c8-bd2a2ca61ff4","resolution":{"observed_at":"2026-08-03T03:20:23.786837Z","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-03T03:20:23.748082Z","title":"A unified evaluation framework for epistemic predictions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.748082Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:4985a09b1fadbf81374acf2a263a3525a9a437e72f0e4b22043d504bdcef3f0b","observation_id":"e497ed59-cdf1-46ab-8379-c5de2f41c3cf","resolution":{"observed_at":"2026-08-03T03:20:23.748082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19460","last_updated":"2024-11-27T18:54:22Z","snapshot_observed_at":"2026-08-16T14:14:00.919105Z","submitted_at":"2024-02-29T18:52:56Z","title":"Benchmarking Uncertainty Disentanglement: Specialized Uncertainties for Specialized Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19460","snapshot_observed_at":"2026-08-03T03:20:23.753101Z","title":"Benchmarking uncertainty disentanglement: Specialized uncertainties for specialized tasks.arXiv preprint arXiv:2402.19460,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.753101Z"},"links":{"cited_paper":"/paper/2402.19460","citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:f62dcefbbfc31a7cccb111890354885a99cdcbeb0280419638ea24a4ba8d457e","observation_id":"3742dde2-586d-4344-a666-facd208d5353","resolution":{"observed_at":"2026-08-03T03:20:23.753101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03390","last_updated":"2024-10-04T12:54:21Z","snapshot_observed_at":"2026-08-16T13:12:36.391237Z","submitted_at":"2024-10-04T12:54:21Z","title":"Lightning UQ Box: A Comprehensive Framework for Uncertainty Quantification in Deep Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03390","snapshot_observed_at":"2026-08-03T03:20:23.742987Z","title":"Isaac Levi.The enterprise of knowledge: An essay on knowledge, credal probability, and chance","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.742987Z"},"links":{"cited_paper":"/paper/2410.03390","citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:c11001eafa4ef32f7926540c62147f3597a7139c649d025125eb7cde722fed87","observation_id":"c48301e2-dde7-4a63-bc58-d1ef805f7b01","resolution":{"observed_at":"2026-08-03T03:20:23.742987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.02060","last_updated":"2019-09-04T19:07:33Z","snapshot_observed_at":"2026-08-14T04:58:55.958441Z","submitted_at":"2019-09-04T19:07:33Z","title":"Distributionally Robust Language Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.02060","snapshot_observed_at":"2026-08-03T03:20:23.758073Z","title":"Yonatan Oren, Shiori Sagawa, Tatsunori B Hashimoto, and Percy Liang","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.758073Z"},"links":{"cited_paper":"/paper/1909.02060","citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:a10b03b1af88b5dd65cfa1a769617b1a42541fe9f83246aedd1112b380ac0264","observation_id":"57cb2dd7-ee5a-47ac-9553-14772124dec4","resolution":{"observed_at":"2026-08-03T03:20:23.758073Z","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-03T03:20:23.776993Z","title":"Yeming Wen, Dustin Tran, and Jimmy Ba","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization","version":3},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-03T03:20:23.776993Z"},"links":{"citing_paper":"/paper/2602.08470"},"observation_digest":"sha256:528fd886e5860aa1b0c73614cf71632fca6a518ccf58afc0084b9817a21c9141","observation_id":"f2b2edc5-4e55-410c-a6d6-cbae77fbe060","resolution":{"observed_at":"2026-08-03T03:20:23.776993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.08470","last_updated":"2026-06-16T06:59:06Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T17:55:25.811116Z","submitted_at":"2026-02-09T10:16:43Z","title":"Learning Credal Ensembles via Distributionally Robust Optimization"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":19},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 2 inbound Pith citation observations for arXiv:2602.08470."}