{"as_of":"2026-08-21T01:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0d004ccfbc1b82e5179f7885074b1517b9d18e4ddbac85ecc96a066a9998340a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:59:13.707121Z","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-23T04:42:33.615191Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.07132","last_updated":"2020-04-15T14:58:52Z","snapshot_observed_at":"2026-08-11T00:29:44.346422Z","submitted_at":"2020-04-15T14:58:52Z","title":"Hiring Fairly in the Age of Algorithms","version":1},"cited_work":{"arxiv_id":"2004.07132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.07132","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1bd8ead0-881e-45a7-b520-b0cf4b18f055","year":2020},"citing_paper":{"arxiv_id":"2501.14110","last_updated":"2026-04-19T03:15:43Z","snapshot_observed_at":"2026-08-02T20:16:39.213081Z","submitted_at":"2025-01-23T21:53:50Z","title":"Value Sensitive Design for Fair Online Recruitment: A Conceptual Framework Informed by Job Seekers' Fairness Concerns","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-23T04:39:31.014429Z"},"links":{"cited_paper":"/paper/2004.07132","citing_paper":"/paper/2501.14110"},"observation_digest":"sha256:70b71b6a11c3e7862f0839686185db4918a22ccbb1f83746cf3d0c4170fb996e","observation_id":"c209c771-8a8a-49b2-a74d-d3ad9dc77016","resolution":{"observed_at":"2026-05-23T04:42:33.618010Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07132","last_updated":"2020-04-15T14:58:52Z","snapshot_observed_at":"2026-08-11T00:29:44.346422Z","submitted_at":"2020-04-15T14:58:52Z","title":"Hiring Fairly in the Age of Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07132","snapshot_observed_at":"2026-08-08T19:58:35.990200Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05286","last_updated":"2025-07-07T10:35:57Z","snapshot_observed_at":"2026-08-12T09:17:47.949444Z","submitted_at":"2025-02-07T19:43:34Z","title":"Fairness and Sparsity within Rashomon sets: Enumeration-Free Exploration and Characterization","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T19:58:35.990200Z"},"links":{"cited_paper":"/paper/2004.07132","citing_paper":"/paper/2502.05286"},"observation_digest":"sha256:30cf77f7a951a005c32c9169ac2644581c26a064cc65e1186ff40751f39bc4c5","observation_id":"806dfbb8-bd21-4b14-addc-79f1b0b3c7fd","resolution":{"observed_at":"2026-08-08T19:58:35.990200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07132","last_updated":"2020-04-15T14:58:52Z","snapshot_observed_at":"2026-08-11T00:29:44.346422Z","submitted_at":"2020-04-15T14:58:52Z","title":"Hiring Fairly in the Age of Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07132","snapshot_observed_at":"2026-08-16T00:59:13.707121Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.02329","last_updated":"2025-07-01T20:12:44Z","snapshot_observed_at":"2026-08-16T00:52:21.266823Z","submitted_at":"2025-05-05T02:56:28Z","title":"Regulating Algorithmic Management: A Multi-Stakeholder Study of Challenges in Aligning Software and the Law for Workplace Scheduling","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-16T00:59:13.707121Z"},"links":{"cited_paper":"/paper/2004.07132","citing_paper":"/paper/2505.02329"},"observation_digest":"sha256:c6369dbf5daa41f41e59813c708fbbdf6112876072b706dcb893f94197d4a7c0","observation_id":"df2cd3d1-a960-443b-8c6c-d1b50d15e8f9","resolution":{"observed_at":"2026-08-16T00:59:13.707121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2004.07132/citation-record","integrity":"/paper/2004.07132/integrity","json":"/paper/2004.07132/citation-record.json","paper":"/paper/2004.07132"},"outbound":[],"paper":{"arxiv_id":"2004.07132","last_updated":"2020-04-15T14:58:52Z","latest_version":1,"primary_category":"cs.HC","snapshot_observed_at":"2026-08-11T00:29:44.346422Z","submitted_at":"2020-04-15T14:58:52Z","title":"Hiring Fairly in the Age of Algorithms"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2004.07132."}