{"as_of":"2026-08-10T06:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:471e5687a2ccb5a2f0b49fb3246c9c0690edbd57f53af1d86415d5a9b394706f","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:30:36.507831Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T00:58:40.441273Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.04050","last_updated":"2021-03-01T18:44:36Z","snapshot_observed_at":"2026-08-10T03:54:22.953570Z","submitted_at":"2020-10-08T15:15:34Z","title":"A survey of algorithmic recourse: definitions, formulations, solutions, and prospects","version":2},"cited_work":{"arxiv_id":"2010.04050","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.04050","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of algorithmic recourse: definitions, formulations, so- lutions, and prospects","venue":null,"work_id":"0c0f6194-9276-4b2a-a8a8-e46965ee4ebd","year":2010},"citing_paper":{"arxiv_id":"2405.18921","last_updated":"2025-11-17T09:44:58Z","snapshot_observed_at":"2026-08-06T14:50:32.794176Z","submitted_at":"2024-05-29T09:24:25Z","title":"GLANCE: Global Actions in a Nutshell for Counterfactual Explainability","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T00:57:48.467129Z"},"links":{"cited_paper":"/paper/2010.04050","citing_paper":"/paper/2405.18921"},"observation_digest":"sha256:176a90650ccaf03fa86abb67ba10920036dcb1c2af79baa7a41393ec759d28a3","observation_id":"632f5e9d-2a55-4ce4-a13e-e61168d67bd5","resolution":{"observed_at":"2026-05-24T00:58:40.444933Z","resolver_source":"arxiv_id","status":"verified_exact"},"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-08-10T03:54:22.953570Z","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:7dfa5326bd93e0eee507412ee3296659003beb9680c307433c251c6a99e02c6d","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":{"arxiv_id":"2010.04050","last_updated":"2021-03-01T18:44:36Z","snapshot_observed_at":"2026-08-10T03:54:22.953570Z","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-07T00:26:31.270882Z","title":"A survey of algorithmic recourse: definitions,formulations,solutions,andprospects","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14287","last_updated":"2025-06-17T07:59:07Z","snapshot_observed_at":"2026-08-09T21:48:38.068082Z","submitted_at":"2025-06-17T07:59:07Z","title":"Steering Robots with Inference-Time Interactions","version":1},"reference_index":159,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:31.270882Z"},"links":{"cited_paper":"/paper/2010.04050","citing_paper":"/paper/2506.14287"},"observation_digest":"sha256:16acebba8a753df6042b796c8f5b08b3096d81e50a736aaa802bb4c1169918bb","observation_id":"ea8d9412-c594-4456-bf37-a8cb1628104c","resolution":{"observed_at":"2026-08-07T00:26:31.270882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.04050","last_updated":"2021-03-01T18:44:36Z","snapshot_observed_at":"2026-08-10T03:54:22.953570Z","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-06T16:47:07.070808Z","title":"A survey of algorith- mic recourse: definitions, formulations, solutions, and prospects","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.12599","last_updated":"2025-07-16T19:41:41Z","snapshot_observed_at":"2026-08-09T17:38:39.904921Z","submitted_at":"2025-07-16T19:41:41Z","title":"A Survey of Explainable Reinforcement Learning: Targets, Methods and Needs","version":1},"reference_index":192,"source":"pdf_text","source_observed_at":"2026-08-06T16:47:07.070808Z"},"links":{"cited_paper":"/paper/2010.04050","citing_paper":"/paper/2507.12599"},"observation_digest":"sha256:e78e3cc918d97fcd2ab44242d7a9e9fec17074e0f94ae44622eeeb58c56b6cc8","observation_id":"9763dfe1-48d3-444e-82a8-9d448dd0d76f","resolution":{"observed_at":"2026-08-06T16:47:07.070808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2010.04050/citation-record","integrity":"/paper/2010.04050/integrity","json":"/paper/2010.04050/citation-record.json","paper":"/paper/2010.04050"},"outbound":[],"paper":{"arxiv_id":"2010.04050","last_updated":"2021-03-01T18:44:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T03:54:22.953570Z","submitted_at":"2020-10-08T15:15:34Z","title":"A survey of algorithmic recourse: definitions, formulations, solutions, and prospects"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2010.04050."}