{"as_of":"2026-08-09T07:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e10956517992cb9037b8ccacc523717fd486d3a3d6b3313b5b35eba914e261f","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:30:36.626338Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2502.07214/citation-record","integrity":"/paper/2502.07214/integrity","json":"/paper/2502.07214/citation-record.json","paper":"/paper/2502.07214"},"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-08T13:30:37.322255Z","title":"Combinatorial and computational geometry52(1), 1–30 (2005)","venue":null,"work_id":"27ef8d5f-0fd8-4628-97da-fb3c776ef14e","year":2005},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.425805Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:28904c0e3b1474f6234b9c66d803a7ada234b19953ff7378a90e20f32b50d0ce","observation_id":"0b87ae35-1f6d-4a18-9e8e-71008f467c7b","resolution":{"observed_at":"2026-08-08T13:30:37.327345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.304789Z","title":"In: International Working Conference on Requirements Engineering: Foundation for Software Qual- ity","venue":null,"work_id":"b491b348-2fa4-403c-944f-b9bf2d9464d9","year":2022},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.430935Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:19683aa3e95b9e1f5b38c8e06bbace5b3d6d2b2038688c7ef7880ade3d54a1ec","observation_id":"8a502c96-3373-47c5-a32a-164a88ded080","resolution":{"observed_at":"2026-08-08T13:30:37.310140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.435899Z","title":"UCI Machine Learning Repository (1996), DOI: https://doi.org/10.24432/C5XW20","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.435899Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:c03dda198142df2625dd8bbe838c023df15db5f49e493b458ae0ac4fd732c98d","observation_id":"6eeec175-3324-4683-a496-5ff770d9a392","resolution":{"observed_at":"2026-08-08T13:30:36.435899Z","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-08T13:30:37.287519Z","title":"Quarterly of applied mathematics16(1), 87–90 (1958)","venue":null,"work_id":"5246dfa7-1f41-4896-aa8b-815c9fd61cf8","year":1958},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.441221Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:15053291bb6dfce482f3546f48d50311cb8ac9322e8966d2881ff6b211fe5a8f","observation_id":"10e8efa0-95f4-43b0-aa77-7b72ee87f909","resolution":{"observed_at":"2026-08-08T13:30:37.293518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.446364Z","title":"In: International conference on machine learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.446364Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:138ff052c9851d32c543c69ac015b9c181c09aa173cb1787d2823ab47ca71642","observation_id":"b7999733-5ce4-423c-a39a-2cd3eb709d04","resolution":{"observed_at":"2026-08-08T13:30:36.446364Z","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-08T13:30:37.258494Z","title":"Genome medicine13, 1–16 (2021)","venue":null,"work_id":"b7c02125-4dbf-479a-bd3b-ce7d7d3ca50a","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.451179Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:b78dd6cadff805aaf5074f7e063974fb0349dd3aa04244f64dc5bff7adf94fec","observation_id":"3bc633cd-bbae-4094-a1ee-56e3bdbeb5e6","resolution":{"observed_at":"2026-08-08T13:30:37.263786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.242184Z","title":"In: International Conference on Parallel Problem Solving from Nature","venue":null,"work_id":"41722239-12f6-4dea-9d33-56d98032368a","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.456606Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:100fde08eaf2c57710d5970d1e7e4b208daa81aab12caa23de26062b50b53067","observation_id":"a4a1503c-5098-4f09-918a-b60a15255e60","resolution":{"observed_at":"2026-08-08T13:30:37.247377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00711","last_updated":"2020-10-01T22:33:21Z","snapshot_observed_at":"2026-08-06T21:03:51.198097Z","submitted_at":"2020-10-01T22:33:21Z","title":"A Survey of the State of Explainable AI for Natural Language Processing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.00711","snapshot_observed_at":"2026-08-08T13:30:36.461172Z","title":"arXiv preprint arXiv:2010.00711 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.461172Z"},"links":{"cited_paper":"/paper/2010.00711","citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:0156cfb912c7ab1001b31967f479063856d12541452bc5c5c97175e2b8e8c858","observation_id":"4c52f5af-2c72-41e6-bd28-4075f8e34348","resolution":{"observed_at":"2026-08-08T13:30:36.461172Z","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-08T13:30:37.225313Z","title":"Princeton University Press (2021)","venue":null,"work_id":"b00b1cb1-ffd6-4f99-bfe5-43840fd9579f","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.466160Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:25cacd581275702615fea6f0ab93186b6e6357594bda9fee46f24ccb951e02a0","observation_id":"e2d5ecc3-a8f8-4227-bb3a-d3fb9e43db2d","resolution":{"observed_at":"2026-08-08T13:30:37.230790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.209121Z","title":null,"venue":null,"work_id":"8e637c82-7b34-45a4-a2f1-1e0a45671487","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.470709Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:28b70f5ffedd0b8cdf2af751d79ad2dbde9dbe5af58c1471573ae589509a7a14","observation_id":"57db34d4-4ac3-469b-ad82-db8cc1ab6d5d","resolution":{"observed_at":"2026-08-08T13:30:37.214381Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.475384Z","title":"In: Proceedings of the 3rd innovations in theoretical computer science con- ference","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.475384Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:03ad4ff93a4e29d864ea2f10596712ce52242ec2b26b73fa7f4afd3994d72862","observation_id":"dd78f16f-00bf-4f70-a73b-a60f51399e1a","resolution":{"observed_at":"2026-08-08T13:30:36.475384Z","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-08T13:30:37.182105Z","title":"Journal of Machine Learning Research24(360), 1–37 (2023)","venue":null,"work_id":"b8f50bba-9b17-4514-8962-aba32ea06362","year":2023},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.479979Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:85cf0122166212bd5dfe4312a1f2fd29f101ca263dca165f3047c231474308ae","observation_id":"167b8532-99b4-4815-b53c-a4947bbc80d2","resolution":{"observed_at":"2026-08-08T13:30:37.187035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.166019Z","title":"In: Proceedings of the sixteenth annual ACM symposium on Theory of computing","venue":null,"work_id":"c367f44d-bd36-4d8e-aacc-3aab18b9f63b","year":1984},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.484516Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:fe6265ccf18e77dd31d7ba7c9ead1d2694696248f628d2b1597bef7928642e46","observation_id":"3de31d4c-d5ad-47f6-bd07-f225d19c30c6","resolution":{"observed_at":"2026-08-08T13:30:37.171226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.148023Z","title":"IEEE Technology and Society Magazine41(2), 84–89 (2022)","venue":null,"work_id":"0b2d907f-95ae-4871-8c96-b5e044ded911","year":2022},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.489156Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:cd99b851ce6c1d9ddd78aaeb2a120f778d7233460fb2459f28919fb78573f41b","observation_id":"fd4d0d7f-8bac-427f-87a7-4d21354241d8","resolution":{"observed_at":"2026-08-08T13:30:37.153894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.130862Z","title":null,"venue":null,"work_id":"c73ece0d-b542-48aa-b341-9fb2aadd8f9c","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.493852Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:548279742faed5d80d0ae2dfe8b768e2643a4cb4ece26693d1d4d9a89a579a3e","observation_id":"d0853a6a-cb43-407f-90b4-7ede61c5ed75","resolution":{"observed_at":"2026-08-08T13:30:37.135852Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.113655Z","title":"In: Proceedings of the second annual symposium on Computational geometry","venue":null,"work_id":"72ede80b-4e40-46fa-954c-14340c737526","year":1986},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.498480Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:b5677daae27719c70e9790a8167a1bad00a4de3d0f86aa599ce6039f876053da","observation_id":"f922a10a-0dd3-4afe-8edb-fb071d93024a","resolution":{"observed_at":"2026-08-08T13:30:37.119267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.096343Z","title":"Theoretical Com- puter Science 412(17), 1614–1628 (2011)","venue":null,"work_id":"f227afdf-896d-4fd9-b0f0-d996c467d2c8","year":2011},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.502969Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:650ae5abea3d1edcca70e1e84ecb27e7d8840c8341c8e851bba3a3ee14c60637","observation_id":"2268fa62-7a22-40af-94b5-e7181292966d","resolution":{"observed_at":"2026-08-08T13:30:37.101567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04050","last_updated":"2021-03-01T18:44:36Z","snapshot_observed_at":"2026-07-06T10:02:41.979068Z","submitted_at":"2020-10-08T15:15:34Z","title":"A survey of algorithmic recourse: definitions, formulations, solutions, and prospects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.04050","snapshot_observed_at":"2026-08-08T13:30:36.507831Z","title":"arXiv preprint arXiv:2010.04050 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.507831Z"},"links":{"cited_paper":"/paper/2010.04050","citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:3646907bbc21992d0c6033c90aff4d33b79c49eb49af5fbab4feb9fe286fa6b2","observation_id":"d6478835-62b1-4812-861b-59541bd2af2c","resolution":{"observed_at":"2026-08-08T13:30:36.507831Z","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-08T13:30:37.080548Z","title":"In: Proceedings of the 2021 ACM conference on fairness, accountability, and transparency","venue":null,"work_id":"498d88aa-c82a-4bb1-8b23-58fee96f3a11","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.512834Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:aa9ac6a2e8299a5c7493854ca905cd580d0d7ce48b4d5449b000a65316af4600","observation_id":"c0132ad5-bba1-4540-9dce-63f3e0357d0d","resolution":{"observed_at":"2026-08-08T13:30:37.085665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.064444Z","title":"Advances in neural information processing systems33, 265–277 (2020)","venue":null,"work_id":"ac630148-116b-4523-bada-591cefe625ad","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.517837Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:d00b602f15ee0a729838f7c64d7c4ec2b5ddc2a20530c947b56b3ba96e1bbe7a","observation_id":"96dbd53c-d4f1-4dfc-b4f1-c5c2690b7d98","resolution":{"observed_at":"2026-08-08T13:30:37.069564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.048551Z","title":"BIT Numerical Mathematics 28, 227–241 (1988) XIV W","venue":null,"work_id":"15fa9246-52ff-4575-ba62-3bd61706600b","year":1988},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.522584Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:98e4624f2d2ca2e0076f5b5d7e1cac87cf03e2802c01178e748c6258adf4c98c","observation_id":"1162ede5-29e4-4dcc-9b1a-6c1552e132b6","resolution":{"observed_at":"2026-08-08T13:30:37.053454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:37.032658Z","title":"Frontiers in Physics10, 879171 (2022)","venue":null,"work_id":"1efcd452-f567-4613-8d22-3cb79d0eae06","year":2022},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.527250Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:302e6f6fa78f2fbaaf0232821615aaca67417bc457cdb3fac30bfad1df5db303","observation_id":"45529f5f-d7f5-451b-acfe-c4c54771007c","resolution":{"observed_at":"2026-08-08T13:30:37.037748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.531886Z","title":"ATT Labs [Online]","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.531886Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:055e94a5a62fd7260ed58196cc8efc47dbce969d0fc21ed7224e203db3bf1761","observation_id":"de2d4387-a97b-44b3-8366-08ef37f2b36b","resolution":{"observed_at":"2026-08-08T13:30:36.531886Z","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-08T13:30:36.536762Z","title":"In: Proceedings of the 2020 conference on fairness, accountability, and transparency","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.536762Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:b04e8ca1f0b7224e8897fcd2b320ae34c6fe6ec6950edad6c47ad7cf00b259a9","observation_id":"2bfe6d97-d2ea-4135-99f7-fefa60d63ae7","resolution":{"observed_at":"2026-08-08T13:30:36.536762Z","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-08T13:30:36.995613Z","title":"In:InternationalConferenceonArtificialIntelligenceandStatistics.pp.4679–4698","venue":null,"work_id":"d2cf36ba-4629-4ce8-8709-9ac0c5837c94","year":2023},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.541463Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:078eddecb69b7e0bc905d6ceeb4ba23d82c36ea9bdc5f013c380853a0bec0238","observation_id":"b39e8a4d-d1ed-4a90-99e2-42b039946486","resolution":{"observed_at":"2026-08-08T13:30:37.000521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.979991Z","title":"IEEE transactions on neural networks and learning systems 32(2), 604–624 (2020)","venue":null,"work_id":"c1857702-0adc-4775-898c-972a2d9ddc25","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.546093Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:606236ae734a74f838288ddc1dba4b5f17834e8eb8a9b8d7e9ee06b947c61755","observation_id":"8ddfcf68-b256-40b1-8cbd-5c2d9dd6ca2f","resolution":{"observed_at":"2026-08-08T13:30:36.985337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.964799Z","title":"IEEE Access 8, 220121–220139 (2020)","venue":null,"work_id":"d8e1bb43-120c-4670-90b0-cfab59bfbea6","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.550823Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:250d08e7ae192d1a6b6196c0182cb1f0731071431a11e96d7abd1639facdc93a","observation_id":"e13e74fa-27c1-4402-9499-e93d0f552c4e","resolution":{"observed_at":"2026-08-08T13:30:36.969602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.949666Z","title":"ACM Computing Surveys (CSUR)51(5), 1–36 (2018)","venue":null,"work_id":"4982bea0-3591-48d2-a843-a3424ac59f37","year":2018},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.555739Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:ef866b266d88b5dbefb60d819a951d1989a4ef274d128210c722f5d444193be6","observation_id":"5236814f-0d44-4bed-bba4-c6c54c8aacab","resolution":{"observed_at":"2026-08-08T13:30:36.954617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.934507Z","title":"In: Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society","venue":null,"work_id":"10f8a6bc-9a16-4f74-a682-d0ad3fef4ea8","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.560344Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:ac2c72fd848b0b3616dd16662c4bfc19b7249a227d77c81eb849d27ed4090fe3","observation_id":"e31fda1b-7b35-4ff1-b526-a10ac4753334","resolution":{"observed_at":"2026-08-08T13:30:36.939174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.919438Z","title":"Springer Science & Business Media (2012)","venue":null,"work_id":"7af601c3-0c65-4128-8935-b1db068bdcb6","year":2012},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.565191Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:6971d3882e9a3f84b67d8a1f37389c759e8afc01daf0781335d6b2dab47ceca4","observation_id":"ae25eb5c-2374-439d-9db0-b51e6c7f4d8a","resolution":{"observed_at":"2026-08-08T13:30:36.924371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.904584Z","title":"In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H","venue":null,"work_id":"4abcdcb8-bb90-4713-b32a-0348e7eda7a1","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.569864Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:edd993b72c15bedfc7ab061f4beb0310e013aecc39ea96199ad0400964b373ae","observation_id":"aac5500b-2306-4eab-a27b-fe1ecbd87477","resolution":{"observed_at":"2026-08-08T13:30:36.909334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.888980Z","title":"In: Proceedings of the conference on fairness, accountability, and transparency","venue":null,"work_id":"fd22c41f-3624-46b4-b592-c63f06f32451","year":2019},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.574548Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:f18d28b4037b875242d9dffc07da44c17161bdd9594e7871b7193ada1343ffe2","observation_id":"4e6568b3-0232-4c9d-b1e3-4a8194e176d0","resolution":{"observed_at":"2026-08-08T13:30:36.893878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.873682Z","title":"Advances in neural information processing systems34, 62–75 (2021)","venue":null,"work_id":"62b48972-4ab2-4546-b24d-dd3481e84911","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.579094Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:c33b433db3587a8ae38221eb747ef87f89acdcd3f515e2d7af0284982288bdad","observation_id":"b90dcb93-3187-4cb4-87b6-7ae5af52bb77","resolution":{"observed_at":"2026-08-08T13:30:36.878693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.03585","last_updated":"2022-06-03T02:15:30Z","snapshot_observed_at":"2026-08-07T00:31:20.646257Z","submitted_at":"2022-06-03T02:15:30Z","title":"XAI for Cybersecurity: State of the Art, Challenges, Open Issues and Future Directions","version":1},"cited_work":{"arxiv_id":"2206.03585","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.03585","snapshot_observed_at":"2026-08-08T13:30:36.691891Z","title":"XAI for Cybersecurity: State of the Art, Challenges, Open Issues and Future Directions","venue":"cs.CR","work_id":"b8663e01-ebac-4178-8f2e-2064a74b91fb","year":2022},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.583735Z"},"links":{"cited_paper":"/paper/2206.03585","citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:5eec52f7e2e56b1128e02d90f425bc26cddf916fdc889678ebaf1919f514df68","observation_id":"2b07f0e0-481e-4e6f-8283-4e21f1972497","resolution":{"observed_at":"2026-08-08T13:30:36.699578Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.858004Z","title":"IEEE Transactions on Neural Networks and Learning Systems (2022)","venue":null,"work_id":"2005842f-39ad-4fb4-b309-e87d92d26130","year":2022},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.588699Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:f0345ee97d1a6c5e7a231640515b8edc153e61f2e5e00950463d74c80e885be3","observation_id":"74e068c2-ff48-4fcf-a503-1157e8e9c704","resolution":{"observed_at":"2026-08-08T13:30:36.863111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.842590Z","title":"IEEE Access10, 14076–14119 (2022)","venue":null,"work_id":"e3e2261e-185d-4dc1-a3b1-bfbaf26a05dd","year":2022},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.593605Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:ec8d399df175de93a3283d21aa6855e2742afb3360f9283269946110ae5d6569","observation_id":"a2f0a2a9-56c5-448b-8c6f-cd585c245748","resolution":{"observed_at":"2026-08-08T13:30:36.847456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.825900Z","title":"Advances in Neural Information Processing Systems 34, 16926–16937 (2021)","venue":null,"work_id":"1fb57701-1f38-4d9e-b150-5520f6a883f3","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.598411Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:9f822b16b5feb683275d14728b29476d2340efea48d1d78389a81a3191b616eb","observation_id":"5ff62814-c8c4-4a73-8f02-5f4741933a88","resolution":{"observed_at":"2026-08-08T13:30:36.831394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.808820Z","title":"In: Proceedings of the conference on fairness, accountability, and transparency","venue":null,"work_id":"fc0cef7b-ccee-40d0-a14c-fae85025376d","year":2019},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.603018Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:7719d8c3ddf692df5f8c83642520de90a3b78cb5ce5aae81dd5e0a87bcb289ef","observation_id":"97c0ec9f-e2c3-4101-ab33-c5cc0758ddfe","resolution":{"observed_at":"2026-08-08T13:30:36.813773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.793036Z","title":"In: Proceedings of the 2020 conference on fairness, accountability, and transparency","venue":null,"work_id":"a8be7b2e-0ee5-4217-a500-1f76878f9c1a","year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.607944Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:a347a837a4b0fce5197a876399e2700fa1ecefd0d2450ab63cfe4014024e7764","observation_id":"7983b211-7923-402d-9b18-292868475296","resolution":{"observed_at":"2026-08-08T13:30:36.798076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.10596","last_updated":"2022-11-15T20:57:53Z","snapshot_observed_at":"2026-07-06T10:06:25.277680Z","submitted_at":"2020-10-20T20:08:42Z","title":"Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.10596","snapshot_observed_at":"2026-08-08T13:30:36.612623Z","title":"arXiv preprint arXiv:2010.10596 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.612623Z"},"links":{"cited_paper":"/paper/2010.10596","citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:49e8ab3ec56e21c91dd9aa9e07a83f8cbc9be69946775578d43f0cca5f7a123a","observation_id":"b9615618-5ae2-4a39-a856-256d7132e6c4","resolution":{"observed_at":"2026-08-08T13:30:36.612623Z","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-08T13:30:36.777246Z","title":"Neurocomputing429, 215– 244 (2021)","venue":null,"work_id":"aae89425-b442-46c1-8081-970fe1ca6fea","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.617350Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:990b119fd8a4cdd8d6b154af567fd5df4f9c49185659f604c9006fdfb2b768e3","observation_id":"4f83a7b9-3ecd-4d1b-b1a6-10cc39ffae1a","resolution":{"observed_at":"2026-08-08T13:30:36.782299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.761171Z","title":"Complex & Intelligent Systems7, 439–457 (2021)","venue":null,"work_id":"e2c68216-ff61-478b-b208-b407e676eefb","year":2021},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.621808Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:f190b4a000cee59eb00eb17ba7092b75d90da94f8c4104dc4b2c064c9939606c","observation_id":"7cfee6e2-24bf-47ae-830e-d3c65b1938b5","resolution":{"observed_at":"2026-08-08T13:30:36.766000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T13:30:36.745030Z","title":"IEEE transactions on neural networks and learning systems30(11), 3212– 3232 (2019)","venue":null,"work_id":"ff504efd-30e4-4286-9c42-3b65c7d3aaa6","year":2019},"citing_paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T13:30:36.626338Z"},"links":{"citing_paper":"/paper/2502.07214"},"observation_digest":"sha256:2dc61da0028d335c66008eab18834a63fa74a08c5282d1af99ea00f67e0d5717","observation_id":"fe70c242-450f-451e-88cd-1dbf9cda259a","resolution":{"observed_at":"2026-08-08T13:30:36.750124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.07214","last_updated":"2025-02-11T03:16:08Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T13:24:20.240180Z","submitted_at":"2025-02-11T03:16:08Z","title":"Pareto Optimal Algorithmic Recourse in Multi-cost Function"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":43},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2502.07214."}