{"as_of":"2026-08-10T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da649fe5c821b6abf6e2fe27096733e3df21d6981926d5d6b43b450e3fb0e383","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-10T06:31:04.303077+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-08-05T20:07:04.803402Z","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-04T23:34:25.241689Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.11779","last_updated":"2019-10-25T15:03:11Z","snapshot_observed_at":"2026-07-06T08:32:17.643291Z","submitted_at":"2019-10-25T15:03:11Z","title":"Toward a better trade-off between performance and fairness with kernel-based distribution matching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.11779","snapshot_observed_at":"2026-08-05T20:07:04.803402Z","title":"Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2508.11258","last_updated":"2025-08-15T06:50:29Z","snapshot_observed_at":"2026-08-09T16:00:11.144537Z","submitted_at":"2025-08-15T06:50:29Z","title":"Group Fairness Meets the Black Box: Enabling Fair Algorithms on Closed LLMs via Post-Processing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T20:07:04.803402Z"},"links":{"cited_paper":"/paper/1910.11779","citing_paper":"/paper/2508.11258"},"observation_digest":"sha256:bdeac9a2846094d77ee27583a4917c85010f5beccdfc7e6aa3628b9ed30665c1","observation_id":"21f995d5-680b-4efe-b587-991986efb411","resolution":{"observed_at":"2026-08-05T20:07:04.803402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.11779","last_updated":"2019-10-25T15:03:11Z","snapshot_observed_at":"2026-07-06T08:32:17.643291Z","submitted_at":"2019-10-25T15:03:11Z","title":"Toward a better trade-off between performance and fairness with kernel-based distribution matching","version":1},"cited_work":{"arxiv_id":"1910.11779","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.11779","snapshot_observed_at":"2026-08-04T23:34:25.241689Z","title":"Toward a better trade-off between performance and fairness with kernel-based distribution matching","venue":"cs.LG","work_id":"9c0dc7fb-c0e4-4bf0-9383-508d5250fa45","year":2019},"citing_paper":{"arxiv_id":"2509.06535","last_updated":"2025-09-08T10:41:10Z","snapshot_observed_at":"2026-08-09T16:06:26.457762Z","submitted_at":"2025-09-08T10:41:10Z","title":"On the Reproducibility of \"FairCLIP: Harnessing Fairness in Vision-Language Learning''","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T23:34:24.225324Z"},"links":{"cited_paper":"/paper/1910.11779","citing_paper":"/paper/2509.06535"},"observation_digest":"sha256:2b0df782a54351b9ee3bb0abf2e33141260c49c7aa0cdbba0c6d7d8d3555f38e","observation_id":"c5c6e83f-ce6e-4dd2-8d01-c440d5a524d8","resolution":{"observed_at":"2026-08-04T23:34:25.296677Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1910.11779/citation-record","integrity":"/paper/1910.11779/integrity","json":"/paper/1910.11779/citation-record.json","paper":"/paper/1910.11779"},"outbound":[],"paper":{"arxiv_id":"1910.11779","last_updated":"2019-10-25T15:03:11Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:32:17.643291Z","submitted_at":"2019-10-25T15:03:11Z","title":"Toward a better trade-off between performance and fairness with kernel-based distribution matching"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1910.11779."}