{"as_of":"2026-08-08T20:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ca83722cfff4a690a8c7af39fc090255b74fe7868e0788008bda7b24ec0ef6f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:23:18.833235Z","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-05T15:10:51.519443Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.06368","last_updated":"2018-07-02T12:58:10Z","snapshot_observed_at":"2026-07-06T05:47:34.555344Z","submitted_at":"2017-06-20T11:20:12Z","title":"FA*IR: A Fair Top-k Ranking Algorithm","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06368","snapshot_observed_at":"2026-08-05T18:23:18.833235Z","title":"URL: http://arxiv.org/abs/1706.06368 , doi:10.1145/31 32847.3132938","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.14741","last_updated":"2025-08-20T14:40:21Z","snapshot_observed_at":"2026-08-08T17:04:21.222931Z","submitted_at":"2025-08-20T14:40:21Z","title":"CaTE Data Curation for Trustworthy AI","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T18:23:18.833235Z"},"links":{"cited_paper":"/paper/1706.06368","citing_paper":"/paper/2508.14741"},"observation_digest":"sha256:b2b4ef64adfe46bde3668f08d71ab2fce5ce5d5dc6f96742e5abf322565d86d3","observation_id":"b6801a9e-5614-4d58-8098-33f6474fc593","resolution":{"observed_at":"2026-08-05T18:23:18.833235Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06368","last_updated":"2018-07-02T12:58:10Z","snapshot_observed_at":"2026-07-06T05:47:34.555344Z","submitted_at":"2017-06-20T11:20:12Z","title":"FA*IR: A Fair Top-k Ranking Algorithm","version":3},"cited_work":{"arxiv_id":"1706.06368","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.06368","snapshot_observed_at":"2026-08-05T15:10:51.519443Z","title":"FA*IR: A Fair Top-k Ranking Algorithm","venue":"cs.CY","work_id":"22734dc8-84f1-4208-9626-64274b6654ae","year":2017},"citing_paper":{"arxiv_id":"2508.20399","last_updated":"2025-08-28T03:52:31Z","snapshot_observed_at":"2026-08-08T11:36:29.666561Z","submitted_at":"2025-08-28T03:52:31Z","title":"A Case Study of Balanced Query Recommendation on Wikipedia","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:10:51.086870Z"},"links":{"cited_paper":"/paper/1706.06368","citing_paper":"/paper/2508.20399"},"observation_digest":"sha256:3f3211e915ccb4be23beb8b3a6ead3f8b1fda533aa511e07b5a92192e58132eb","observation_id":"21880bc5-3e84-4f29-8c3e-86e010b1d771","resolution":{"observed_at":"2026-08-05T15:10:51.527055Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1706.06368/citation-record","integrity":"/paper/1706.06368/integrity","json":"/paper/1706.06368/citation-record.json","paper":"/paper/1706.06368"},"outbound":[],"paper":{"arxiv_id":"1706.06368","last_updated":"2018-07-02T12:58:10Z","latest_version":3,"primary_category":"cs.CY","snapshot_observed_at":"2026-07-06T05:47:34.555344Z","submitted_at":"2017-06-20T11:20:12Z","title":"FA*IR: A Fair Top-k Ranking Algorithm"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1706.06368."}