{"as_of":"2026-08-08T12:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:801065b3933513b1f5f50569da268261c77b3376d27e4566a43ebf4cec96d82c","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-08T06:32:00.761636+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-08T00:53:24.495060Z","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":12,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.08871","last_updated":"2020-06-29T23:11:03Z","snapshot_observed_at":"2026-08-08T04:03:26.356056Z","submitted_at":"2020-02-20T17:11:09Z","title":"Fast Differentiable Sorting and Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08871","snapshot_observed_at":"2026-08-07T11:59:05.529141Z","title":"Fast differentiable sorting and ranking, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.00993","last_updated":"2025-06-01T12:49:39Z","snapshot_observed_at":"2026-08-08T00:45:30.620269Z","submitted_at":"2025-06-01T12:49:39Z","title":"FlexSelect: Flexible Token Selection for Efficient Long Video Understanding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:59:05.529141Z"},"links":{"cited_paper":"/paper/2002.08871","citing_paper":"/paper/2506.00993"},"observation_digest":"sha256:7fdc60257ab643725dac05c8de1c788b3b7bc73cdef6e41cdd6c580cb7d0fb9d","observation_id":"142e73d1-bebc-49bf-aba7-c98074de1e36","resolution":{"observed_at":"2026-08-07T11:59:05.529141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08871","last_updated":"2020-06-29T23:11:03Z","snapshot_observed_at":"2026-08-08T04:03:26.356056Z","submitted_at":"2020-02-20T17:11:09Z","title":"Fast Differentiable Sorting and Ranking","version":2},"cited_work":{"arxiv_id":"2002.08871","doi":"10.48550/arxiv.2002.08871","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.08871","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"c6687637-7d01-4bd4-904b-4ebc28ebfd4c","year":2002},"citing_paper":{"arxiv_id":"2606.02294","last_updated":"2026-06-01T14:16:18Z","snapshot_observed_at":"2026-08-06T02:40:12.407253Z","submitted_at":"2026-06-01T14:16:18Z","title":"Regularized Large Neighborhood Search","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T15:15:11.130848Z"},"links":{"cited_paper":"/paper/2002.08871","citing_paper":"/paper/2606.02294"},"observation_digest":"sha256:56942297076ed778e472c9a7187dbfb428406f735f0c58a3ccde61916d3ac8de","observation_id":"6e1a80a0-e96e-45c2-8a54-4a2f97dda71e","resolution":{"observed_at":"2026-06-28T15:22:19.687587Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08871","last_updated":"2020-06-29T23:11:03Z","snapshot_observed_at":"2026-08-08T04:03:26.356056Z","submitted_at":"2020-02-20T17:11:09Z","title":"Fast Differentiable Sorting and Ranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08871","snapshot_observed_at":"2026-08-08T00:53:24.495060Z","title":"International Conference on Machine Learning (ICML) , year =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.04057","last_updated":"2026-08-04T12:17:00Z","snapshot_observed_at":"2026-08-08T12:11:24.371018Z","submitted_at":"2026-08-04T12:17:00Z","title":"LaPrune: Controllable Differentiable Sparsity at Million Scale","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T00:53:24.495060Z"},"links":{"cited_paper":"/paper/2002.08871","citing_paper":"/paper/2608.04057"},"observation_digest":"sha256:18789bcafec389067d600a712845d83dfe3681f079a10d0dd7dfded58f2458a5","observation_id":"1de9cdfc-e3b0-45dd-8916-ac9eb68facb0","resolution":{"observed_at":"2026-08-08T00:53:24.495060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.08871/citation-record","integrity":"/paper/2002.08871/integrity","json":"/paper/2002.08871/citation-record.json","paper":"/paper/2002.08871"},"outbound":[],"paper":{"arxiv_id":"2002.08871","last_updated":"2020-06-29T23:11:03Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-08T04:03:26.356056Z","submitted_at":"2020-02-20T17:11:09Z","title":"Fast Differentiable Sorting and Ranking"},"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 3 inbound Pith citation observations for arXiv:2002.08871."}