{"as_of":"2026-08-08T13:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de9b73d879b420226f4ab9977b1f91c4f431b8fda6c3dc583186e7fbb24b5b17","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-08T06:32:00.761636+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-07T15:14:48.837341Z","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-07T15:14:50.300825Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1707.08238","last_updated":"2017-07-30T14:44:22Z","snapshot_observed_at":"2026-08-04T21:28:21.729217Z","submitted_at":"2017-07-25T22:03:21Z","title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model","version":2},"cited_work":{"arxiv_id":"1707.08238","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.08238","snapshot_observed_at":"2026-08-07T15:14:50.300825Z","title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model","venue":"cs.DS","work_id":"1c34efae-a626-47ed-b94d-4779020b67ff","year":2017},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.837341Z"},"links":{"cited_paper":"/paper/1707.08238","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:b9af74b82df8de1770516656bf2b3e35e0a7482e27def71b34fc3869b3132ef1","observation_id":"ec571fcc-94b6-4142-b2d8-2b8a9fc174d9","resolution":{"observed_at":"2026-08-07T15:14:50.500721Z","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/1707.08238/citation-record","integrity":"/paper/1707.08238/integrity","json":"/paper/1707.08238/citation-record.json","paper":"/paper/1707.08238"},"outbound":[],"paper":{"arxiv_id":"1707.08238","last_updated":"2017-07-30T14:44:22Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T21:28:21.729217Z","submitted_at":"2017-07-25T22:03:21Z","title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model"},"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 1 inbound Pith citation observation for arXiv:1707.08238."}