{"as_of":"2026-08-13T13:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8023f787d8af574179017d4e8e123249e7e1203a02e88dee255b2d3c50d9d3c","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:18:04.174515Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.14424/citation-record","integrity":"/paper/2411.14424/integrity","json":"/paper/2411.14424/citation-record.json","paper":"/paper/2411.14424"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-08-12T17:13:46.394331Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-12T15:18:04.045431Z","title":"Explaining and harnessing adversarial examples,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.045431Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:7fd73701506cec7b27441610eb522a48fb545af2ac8aa6137f4716162157a670","observation_id":"5675c2ee-6fbd-4e11-960e-ff306652de47","resolution":{"observed_at":"2026-08-12T15:18:04.045431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6199","last_updated":"2014-02-19T16:33:14Z","snapshot_observed_at":"2026-07-06T03:31:33.797310Z","submitted_at":"2013-12-21T03:36:08Z","title":"Intriguing properties of neural networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6199","snapshot_observed_at":"2026-08-12T15:18:04.051512Z","title":"Intriguing properties of neural networks,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.051512Z"},"links":{"cited_paper":"/paper/1312.6199","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:e88e3d15ab3732e26fe08a812a25a51de83fcc3c7f331a6e8b4cf3f06228e00a","observation_id":"bec68828-6f1f-4889-99c4-6757a111faa2","resolution":{"observed_at":"2026-08-12T15:18:04.051512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.00374","last_updated":"2019-06-30T12:42:09Z","snapshot_observed_at":"2026-08-13T03:49:55.489085Z","submitted_at":"2019-06-30T12:42:09Z","title":"Fooling a Real Car with Adversarial Traffic Signs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.00374","snapshot_observed_at":"2026-08-12T15:18:04.056680Z","title":"Fooling a real car with adversarial traffic signs,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.056680Z"},"links":{"cited_paper":"/paper/1907.00374","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:049ece2d385af70d4bec67826faf94685519f1ec41d8abed5ebe703b9326949e","observation_id":"ab8633e3-a99b-4a04-ba70-9d3bd4458943","resolution":{"observed_at":"2026-08-12T15:18:04.056680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06083","last_updated":"2019-09-04T18:53:10Z","snapshot_observed_at":"2026-08-07T14:27:46.872660Z","submitted_at":"2017-06-19T17:53:11Z","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06083","snapshot_observed_at":"2026-08-12T15:18:04.061908Z","title":"Towards deep learning models resistant to adversarial attacks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.061908Z"},"links":{"cited_paper":"/paper/1706.06083","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:6edeed0f404eec64715c21d7a05eec719796384f6c68af58ca797e4b271fb126","observation_id":"b28969c6-c3d8-4586-8c84-06dbab08ba21","resolution":{"observed_at":"2026-08-12T15:18:04.061908Z","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-12T15:18:04.647474Z","title":"Boosting adversarial training with hypersphere embedding,","venue":null,"work_id":"662575fc-bfac-4ad5-8fa2-aed5d552e369","year":2020},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.067188Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:74193182c4e295e41d63a8686766b30977a4802a83e0a8affe439d24ca5582f5","observation_id":"67bbb305-3a11-4192-816e-ba75d757f91d","resolution":{"observed_at":"2026-08-12T15:18:04.652958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:04.072548Z","title":"Theoretically principled trade-off between robustness and accuracy,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.072548Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:47af5a16656e7098a126d51dfb6dd5683f354c0af1ca27c94a332f02301cd161","observation_id":"f0f1a6e3-2649-4f11-bc14-973e53fb6093","resolution":{"observed_at":"2026-08-12T15:18:04.072548Z","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-12T15:18:04.078440Z","title":"Unlabeled data improves adversarial robustness,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.078440Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:2bf0104f86ce28bb6c6e1c16527f80ea6ddd952e6859012072f909c6b384c56f","observation_id":"393bd3d2-fe78-4057-aedd-791507d59cbc","resolution":{"observed_at":"2026-08-12T15:18:04.078440Z","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-12T15:18:04.605626Z","title":"Adver- sarially robust generalization requires more data,","venue":null,"work_id":"535ae66b-9ff8-4879-a567-11bb40bf6e8d","year":2018},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.083308Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:fc805ba53aa0a8eaa526441e7fbe3af7968ed4986b6f18d18a3af1b7f3d0c718","observation_id":"3b9e1805-5022-4c6a-9f21-2073175bec4a","resolution":{"observed_at":"2026-08-12T15:18:04.612706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.03994","last_updated":"2020-01-12T20:30:22Z","snapshot_observed_at":"2026-08-10T02:39:16.757240Z","submitted_at":"2020-01-12T20:30:22Z","title":"Fast is better than free: Revisiting adversarial training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.03994","snapshot_observed_at":"2026-08-12T15:18:04.088367Z","title":"Fast is better than free: Revisiting adversarial training,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.088367Z"},"links":{"cited_paper":"/paper/2001.03994","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:65ab6b41196fbe79d347f11746e89d4041e1a82fc09b6abfd2f7faed6dd7c905","observation_id":"ceecc4c3-052a-43bd-8d2b-db875463e458","resolution":{"observed_at":"2026-08-12T15:18:04.088367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05161","last_updated":"2022-01-30T18:07:32Z","snapshot_observed_at":"2026-08-09T17:25:01.955894Z","submitted_at":"2020-06-09T09:58:19Z","title":"Provable tradeoffs in adversarially robust classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05161","snapshot_observed_at":"2026-08-12T15:18:04.094254Z","title":"Provable tradeoffs in adversarially robust classification,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.094254Z"},"links":{"cited_paper":"/paper/2006.05161","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:cff542810c52fa17ee282bec81dcdb9a61fe5a8f9473a7dbd6c562defc4adf60","observation_id":"8db5ef87-53a8-44fa-8f94-a3276d644d8b","resolution":{"observed_at":"2026-08-12T15:18:04.094254Z","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-12T15:18:04.587835Z","title":"Precise tradeoffs in adversarial training for linear regression,","venue":null,"work_id":"f3e86c45-9c50-4669-ae7d-d901739f5179","year":2020},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.099793Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:efabb2a2826a0ec76f013ce70484d7eb3259d80812e71190780f803021e3b764","observation_id":"f74f613f-111d-455e-9cfb-9bd50169e373","resolution":{"observed_at":"2026-08-12T15:18:04.593616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02811","last_updated":"2025-07-31T18:56:04Z","snapshot_observed_at":"2026-08-13T07:17:24.013293Z","submitted_at":"2024-07-03T05:13:28Z","title":"SPLITZ: Certifiable Robustness via Split Lipschitz Randomized Smoothing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02811","snapshot_observed_at":"2026-08-12T15:18:04.105440Z","title":"Splitz: Certifiable robustness via split lips- chitz randomized smoothing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.105440Z"},"links":{"cited_paper":"/paper/2407.02811","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:9b31a8e10716f06791f9784a33d3e202a1d7672a7ce19fa96c25526df8dd5908","observation_id":"164aea0c-0185-46bf-b1d2-0e4d4911f05d","resolution":{"observed_at":"2026-08-12T15:18:04.105440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06339","last_updated":"2024-10-08T20:17:25Z","snapshot_observed_at":"2026-08-13T13:30:04.649153Z","submitted_at":"2024-10-08T20:17:25Z","title":"Filtered Randomized Smoothing: A New Defense for Robust Modulation Classification","version":1},"cited_work":{"arxiv_id":"2410.06339","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.06339","snapshot_observed_at":"2026-08-12T15:18:04.313488Z","title":"Filtered Randomized Smoothing: A New Defense for Robust Modulation Classification","venue":"cs.LG","work_id":"1083b412-585d-4eef-b868-de5f832eafe1","year":2024},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.111468Z"},"links":{"cited_paper":"/paper/2410.06339","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:727dea7bab435df6d6024f5e358a2d7c5d362f0f2175a5406cb1be4bcd473a55","observation_id":"1e171a54-2a1d-4259-a6ae-273102e43500","resolution":{"observed_at":"2026-08-12T15:18:04.320296Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:04.568234Z","title":"To be robust or to be fair: Towards fairness in adversarial training,","venue":null,"work_id":"fd68099d-5bde-4f93-8621-2f41783277f5","year":2021},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.117730Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:ac486eb72d31bb349e0aba9306c57cc7aef0772b7f3c9f7fa1ffb226addebcd6","observation_id":"417006f2-695c-41a1-8019-638f768ce3c0","resolution":{"observed_at":"2026-08-12T15:18:04.573596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.04243","last_updated":"2021-05-11T14:16:04Z","snapshot_observed_at":"2026-08-10T17:53:16.347809Z","submitted_at":"2021-03-07T03:10:32Z","title":"Estimating and Improving Fairness with Adversarial Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.04243","snapshot_observed_at":"2026-08-12T15:18:04.123266Z","title":"Estimating and improving fairness with adversarial learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.123266Z"},"links":{"cited_paper":"/paper/2103.04243","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:50d5b11297e950c3069d70f3311257d79029df333677838f105d5e5b19d207a3","observation_id":"65b39828-c42c-493e-8a7d-598658ef3aaa","resolution":{"observed_at":"2026-08-12T15:18:04.123266Z","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-12T15:18:04.549784Z","title":"Learning fair classifiers via min-max f- divergence regularization,","venue":null,"work_id":"b8500ba5-6cd1-4612-bbdd-460a1990ea83","year":2023},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.129721Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:002ba95816ea2f9f8322b62b3435d4fe7f524b524b6ddd4440f64f09d9be37f4","observation_id":"9033fe4b-cdf5-485b-8009-393f3b292aa9","resolution":{"observed_at":"2026-08-12T15:18:04.556180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:04.529279Z","title":"On the tradeoff between robustness and fairness,","venue":null,"work_id":"b7d6791b-9234-4d9e-98e6-2307da625c86","year":2022},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.134947Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:ac7b384b54063fea0344417744465d923b8bae8d068ef346e36a3f081c482b90","observation_id":"651666ad-e2d0-43be-9db9-f5091343ce49","resolution":{"observed_at":"2026-08-12T15:18:04.534701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:04.510624Z","title":"Robustness may be at odds with fairness: An empirical study on class-wise accuracy,","venue":null,"work_id":"cb47ebd3-b33a-4498-b544-d45753256953","year":2020},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.140226Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:6e198d089f990faee403ca667016ca6b92596c903a695635d185c4a3018f5a74","observation_id":"8ea32c34-9bb1-4d6c-91a5-4ec7bbef98cf","resolution":{"observed_at":"2026-08-12T15:18:04.517487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:18:04.485014Z","title":"Fairness through robustness: Investigating robustness disparity in deep learning,","venue":null,"work_id":"e6a4048b-3552-41cf-ab24-b2a153812bf5","year":2021},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.145840Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:922e369f1bacf4fd090cdea74647426e083ca56c7157ffa666c51ad86ecdb38d","observation_id":"57f99f5a-a7f6-4d22-8cd5-f2f7466aa763","resolution":{"observed_at":"2026-08-12T15:18:04.493052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07393","last_updated":"2024-05-12T23:15:21Z","snapshot_observed_at":"2026-08-13T00:09:18.350597Z","submitted_at":"2024-05-12T23:15:21Z","title":"Intrinsic Fairness-Accuracy Tradeoffs under Equalized Odds","version":1},"cited_work":{"arxiv_id":"2405.07393","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.07393","snapshot_observed_at":"2026-08-12T15:18:04.264082Z","title":"Intrinsic Fairness-Accuracy Tradeoffs under Equalized Odds","venue":"cs.LG","work_id":"1277bf91-8dc6-452c-ab7a-22881927678e","year":2024},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.150919Z"},"links":{"cited_paper":"/paper/2405.07393","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:3a5cef8949c881056221fada203aa5f37d017d225c09b4e9296b58136a78ed82","observation_id":"7518b8fe-9f1b-4b51-8d0a-bf0cf69ff12a","resolution":{"observed_at":"2026-08-12T15:18:04.274583Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.12532","last_updated":"2024-01-23T07:15:47Z","snapshot_observed_at":"2026-08-13T04:37:12.594258Z","submitted_at":"2024-01-23T07:15:47Z","title":"DAFA: Distance-Aware Fair Adversarial Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.12532","snapshot_observed_at":"2026-08-12T15:18:04.157546Z","title":"Dafa: Distance- aware fair adversarial training,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.157546Z"},"links":{"cited_paper":"/paper/2401.12532","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:b92cdb5cf4f61da4af790b4a09b84ac7111a855e93dbba44d8655a470799cbd3","observation_id":"bbe74525-7229-433f-ac7a-54aa24d5f76f","resolution":{"observed_at":"2026-08-12T15:18:04.157546Z","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-12T15:18:04.164268Z","title":"mixup: Beyond empirical risk minimization,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.164268Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:83bcc667208a893c6ef4a97b854b30fbf99e610ee46c4afe2c517577a30c4f91","observation_id":"1b12af5e-cbfc-4dcf-a785-37a3d912ddb4","resolution":{"observed_at":"2026-08-12T15:18:04.164268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04819","last_updated":"2021-03-17T19:43:43Z","snapshot_observed_at":"2026-08-07T03:59:58.575793Z","submitted_at":"2020-10-09T21:38:14Z","title":"How Does Mixup Help With Robustness and Generalization?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.04819","snapshot_observed_at":"2026-08-12T15:18:04.169621Z","title":"How does mixup help with robustness and generalization?,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.169621Z"},"links":{"cited_paper":"/paper/2010.04819","citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:ced7e00f402edc44bd7e309ed43c550488d8c64764ca3874932d5660104d2452","observation_id":"428655b6-21ac-46ec-b26f-eba674513e43","resolution":{"observed_at":"2026-08-12T15:18:04.169621Z","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-12T15:18:04.453979Z","title":"Manifold mixup: Better representations by interpolat- ing hidden states,","venue":null,"work_id":"a38d5763-53ee-4e66-9169-a6dcb81a418d","year":2019},"citing_paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T15:18:04.174515Z"},"links":{"citing_paper":"/paper/2411.14424"},"observation_digest":"sha256:1d07ed7a24bd11926144d79459651142ede942780e68db32a64546ef6c6f2576","observation_id":"c39bd35b-83ad-4ea9-a534-da1b4a8fe875","resolution":{"observed_at":"2026-08-12T15:18:04.459547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14424","last_updated":"2024-11-21T18:56:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T15:09:26.401215Z","submitted_at":"2024-11-21T18:56:33Z","title":"Learning Fair Robustness via Domain Mixup"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":24},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2411.14424."}