{"as_of":"2026-08-18T17:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5929ee98dc6c8dc8b207164ea388b56949da0d9a9ee3671c914c0a58412843e3","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:05:54.884264Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2305.16637","last_updated":"2023-08-19T03:21:34Z","snapshot_observed_at":"2026-08-18T08:17:44.659326Z","submitted_at":"2023-05-26T05:26:00Z","title":"FARA: Future-aware Ranking Algorithm for Fairness Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16637","snapshot_observed_at":"2026-08-03T05:05:54.884264Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.03345","last_updated":"2026-05-24T12:17:32Z","snapshot_observed_at":"2026-08-03T05:05:54.029986Z","submitted_at":"2026-02-03T10:11:24Z","title":"Beyond Exposure: Optimizing Ranking Fairness with Non-linear Time-Income Functions","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T05:05:54.884264Z"},"links":{"cited_paper":"/paper/2305.16637","citing_paper":"/paper/2602.03345"},"observation_digest":"sha256:e0e17aa0dbe3a0402eef46ccdf8d4babec6138f501f783d2e285de05a6339e77","observation_id":"24a1d571-aead-40b4-b51c-6d782531ec2f","resolution":{"observed_at":"2026-08-03T05:05:54.884264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.16637/citation-record","integrity":"/paper/2305.16637/integrity","json":"/paper/2305.16637/citation-record.json","paper":"/paper/2305.16637"},"outbound":[],"paper":{"arxiv_id":"2305.16637","last_updated":"2023-08-19T03:21:34Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-18T08:17:44.659326Z","submitted_at":"2023-05-26T05:26:00Z","title":"FARA: Future-aware Ranking Algorithm for Fairness Optimization"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2305.16637."}