{"as_of":"2026-08-23T20:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31798dc49baf1d13e26257e9e27a41548122eaebd55eec6681155af2650fc786","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-23T06:30:58.430688+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-07-14T06:44:16.198117Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.00855","last_updated":"2021-07-07T12:44:42Z","snapshot_observed_at":"2026-08-16T18:27:25.922033Z","submitted_at":"2021-05-03T13:41:46Z","title":"Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness","version":2},"cited_work":{"arxiv_id":"2105.00855","doi":"10.48550/arxiv.2105.00855","metadata_source":"arxiv_reference","pith_arxiv_id":"2105.00855","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computationally","venue":"arXiv (Cornell University)","work_id":"bb18a808-29c1-4806-b2f9-5bc888622eac","year":null},"citing_paper":{"arxiv_id":"2606.26369","last_updated":"2026-06-24T20:36:42Z","snapshot_observed_at":"2026-08-15T16:06:57.939778Z","submitted_at":"2026-06-24T20:36:42Z","title":"Scoring Is Not Enough: Addressing Gaps in Utility-fairness Trade-offs for Ranking","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-26T00:53:33.999836Z"},"links":{"cited_paper":"/paper/2105.00855","citing_paper":"/paper/2606.26369"},"observation_digest":"sha256:ade25fa020fd7370ca0c8c305907bd11a894600bcd5cb5e481b7d31a637d7fb3","observation_id":"6ea60d3a-bb9d-4238-b8e3-ba4324bf8ff3","resolution":{"observed_at":"2026-06-26T00:58:47.863003Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.00855","last_updated":"2021-07-07T12:44:42Z","snapshot_observed_at":"2026-08-16T18:27:25.922033Z","submitted_at":"2021-05-03T13:41:46Z","title":"Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.00855","snapshot_observed_at":"2026-07-14T06:44:16.198117Z","title":"Computationally efficient optimization of Plackett -- Luce ranking models for relevance and fairness","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11146","last_updated":"2026-07-13T06:37:42Z","snapshot_observed_at":"2026-08-14T23:38:52.756466Z","submitted_at":"2026-07-13T06:37:42Z","title":"Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-14T06:44:16.198117Z"},"links":{"cited_paper":"/paper/2105.00855","citing_paper":"/paper/2607.11146"},"observation_digest":"sha256:09a0241b3d403813b62fe2027ea9e01528979b4c7eed24a801ef9bd784c265b2","observation_id":"179a38a6-fce8-498a-8255-4952101ff3eb","resolution":{"observed_at":"2026-07-14T06:44:16.198117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2105.00855/citation-record","integrity":"/paper/2105.00855/integrity","json":"/paper/2105.00855/citation-record.json","paper":"/paper/2105.00855"},"outbound":[],"paper":{"arxiv_id":"2105.00855","last_updated":"2021-07-07T12:44:42Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-16T18:27:25.922033Z","submitted_at":"2021-05-03T13:41:46Z","title":"Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2105.00855."}