{"as_of":"2026-08-15T12:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9da4e7907ec32785203dd01ed4593427942551f8b12333fce628ae892b9ace25","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-15T06:32:42.880941+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-14T11:36:52.962127Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T16:39:26.954695Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.11361","last_updated":"2019-05-27T17:45:50Z","snapshot_observed_at":"2026-08-14T16:25:45.589861Z","submitted_at":"2019-05-27T17:45:50Z","title":"Efficient candidate screening under multiple tests and implications for fairness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11361","snapshot_observed_at":"2026-08-14T11:36:52.962127Z","title":"Lipton, and Yishay Mansour","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.09635","last_updated":"2022-01-25T05:42:50Z","snapshot_observed_at":"2026-08-15T08:50:35.450404Z","submitted_at":"2019-08-23T01:22:04Z","title":"A Survey on Bias and Fairness in Machine Learning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:36:52.962127Z"},"links":{"cited_paper":"/paper/1905.11361","citing_paper":"/paper/1908.09635"},"observation_digest":"sha256:bbf62f42f914783c21e5b7fae41d48e5cd908d1d71daa8969c94d28a5da13089","observation_id":"d3ba8f8c-dd13-4759-874e-51aa6625f3fd","resolution":{"observed_at":"2026-08-14T11:36:52.962127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11361","last_updated":"2019-05-27T17:45:50Z","snapshot_observed_at":"2026-08-14T16:25:45.589861Z","submitted_at":"2019-05-27T17:45:50Z","title":"Efficient candidate screening under multiple tests and implications for fairness","version":1},"cited_work":{"arxiv_id":"1905.11361","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.11361","snapshot_observed_at":"2026-08-11T16:39:26.954695Z","title":"Efficient candidate screening under multiple tests and implications for fairness","venue":"cs.LG","work_id":"2bf22bf2-9f3f-494f-86b7-1ae51ac346ff","year":2019},"citing_paper":{"arxiv_id":"2412.09896","last_updated":"2024-12-17T00:57:15Z","snapshot_observed_at":"2026-08-15T04:00:50.681161Z","submitted_at":"2024-12-13T06:31:09Z","title":"Analyzing Fairness of Classification Machine Learning Model with Structured Dataset","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T16:39:26.732797Z"},"links":{"cited_paper":"/paper/1905.11361","citing_paper":"/paper/2412.09896"},"observation_digest":"sha256:2874eaa3bc43a578bf9ae3240752ec445a3380dab0a0e0c4f298f116fa951adb","observation_id":"5877cd7b-6241-47e9-97cd-5c3512c0de6f","resolution":{"observed_at":"2026-08-11T16:39:26.959194Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11361","last_updated":"2019-05-27T17:45:50Z","snapshot_observed_at":"2026-08-14T16:25:45.589861Z","submitted_at":"2019-05-27T17:45:50Z","title":"Efficient candidate screening under multiple tests and implications for fairness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11361","snapshot_observed_at":"2026-08-11T16:41:06.102134Z","title":"Lipton, and Yishay Mansour","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.09900","last_updated":"2025-07-23T21:24:40Z","snapshot_observed_at":"2026-08-14T05:05:33.946871Z","submitted_at":"2024-12-13T06:35:55Z","title":"Analyzing Fairness of Computer Vision and Natural Language Processing Models","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T16:41:06.102134Z"},"links":{"cited_paper":"/paper/1905.11361","citing_paper":"/paper/2412.09900"},"observation_digest":"sha256:124274587e5a816bdf3e0d9c9a498b9451635740a49abfc9d3871a1dd85f4320","observation_id":"236350b5-8405-43ca-aca5-44c6b24772f7","resolution":{"observed_at":"2026-08-11T16:41:06.102134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.11361/citation-record","integrity":"/paper/1905.11361/integrity","json":"/paper/1905.11361/citation-record.json","paper":"/paper/1905.11361"},"outbound":[],"paper":{"arxiv_id":"1905.11361","last_updated":"2019-05-27T17:45:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:25:45.589861Z","submitted_at":"2019-05-27T17:45:50Z","title":"Efficient candidate screening under multiple tests and implications for fairness"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1905.11361."}