{"as_of":"2026-08-08T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d8089c664a74cfe76106fad782d3f2d359ef887030ed335c9455d39f1082aca0","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-07T12:35:31.104149Z","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-07T12:35:34.760208Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.11885","last_updated":"2019-11-02T15:18:34Z","snapshot_observed_at":"2026-08-08T00:56:46.606856Z","submitted_at":"2019-05-28T15:28:07Z","title":"Differentiable Ranks and Sorting using Optimal Transport","version":2},"cited_work":{"arxiv_id":"1905.11885","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.11885","snapshot_observed_at":"2026-08-07T12:35:34.760208Z","title":"Differentiable Ranks and Sorting using Optimal Transport","venue":"cs.LG","work_id":"b8f23dd3-b3a5-4874-af4e-fd345a29ced1","year":2019},"citing_paper":{"arxiv_id":"2505.24664","last_updated":"2025-05-30T14:53:40Z","snapshot_observed_at":"2026-08-07T12:13:19.961043Z","submitted_at":"2025-05-30T14:53:40Z","title":"Learning Distributions over Permutations and Rankings with Factorized Representations","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.104149Z"},"links":{"cited_paper":"/paper/1905.11885","citing_paper":"/paper/2505.24664"},"observation_digest":"sha256:d1a7f8b192b9fc5474cb1e90324b2373c6a565646e8ad168943490dd66b7121b","observation_id":"4d280429-4ae6-424a-a8ae-040ee578cc25","resolution":{"observed_at":"2026-08-07T12:35:34.912011Z","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/1905.11885/citation-record","integrity":"/paper/1905.11885/integrity","json":"/paper/1905.11885/citation-record.json","paper":"/paper/1905.11885"},"outbound":[],"paper":{"arxiv_id":"1905.11885","last_updated":"2019-11-02T15:18:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T00:56:46.606856Z","submitted_at":"2019-05-28T15:28:07Z","title":"Differentiable Ranks and Sorting using Optimal Transport"},"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:1905.11885."}