{"as_of":"2026-08-09T20:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c249cd1779ed2c56930a5c95d9b8e9588685ee0a89ed2983736af9a8df5a42f","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:08:57.442425Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T12:46:57.376473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.11985","last_updated":"2024-10-15T18:47:12Z","snapshot_observed_at":"2026-07-06T19:34:10.252984Z","submitted_at":"2024-10-15T18:47:12Z","title":"The Fair Language Model Paradox","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11985","snapshot_observed_at":"2026-08-08T20:08:57.442425Z","title":"The fair language model paradox","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05159","last_updated":"2025-05-27T16:54:17Z","snapshot_observed_at":"2026-08-09T00:02:45.829856Z","submitted_at":"2025-02-07T18:41:21Z","title":"A Lightweight Method to Disrupt Memorized Sequences in LLM","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T20:08:57.442425Z"},"links":{"cited_paper":"/paper/2410.11985","citing_paper":"/paper/2502.05159"},"observation_digest":"sha256:a5177efb8ad236328c470e5c812bc19d6f00f54217842b32fff74782e4c94971","observation_id":"70fa3916-a3f1-40c6-a62e-f33dbdbb5e3c","resolution":{"observed_at":"2026-08-08T20:08:57.442425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11985","last_updated":"2024-10-15T18:47:12Z","snapshot_observed_at":"2026-07-06T19:34:10.252984Z","submitted_at":"2024-10-15T18:47:12Z","title":"The Fair Language Model Paradox","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11985","snapshot_observed_at":"2026-08-06T17:29:44.621693Z","title":"doi: 10.18653/v1/2022.findings-acl.165","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.10852","last_updated":"2025-08-02T01:45:01Z","snapshot_observed_at":"2026-08-08T02:45:01.978815Z","submitted_at":"2025-07-14T22:56:58Z","title":"LLMs on Trial: Evaluating Judicial Fairness for Large Language Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:29:44.621693Z"},"links":{"cited_paper":"/paper/2410.11985","citing_paper":"/paper/2507.10852"},"observation_digest":"sha256:26e37f15a57368f81e3eb09b96d0b7133a24a28957ac25dc56890a7635747571","observation_id":"61627ff2-bca3-406a-839b-1aa87d9d6734","resolution":{"observed_at":"2026-08-06T17:29:44.621693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11985","last_updated":"2024-10-15T18:47:12Z","snapshot_observed_at":"2026-07-06T19:34:10.252984Z","submitted_at":"2024-10-15T18:47:12Z","title":"The Fair Language Model Paradox","version":1},"cited_work":{"arxiv_id":"2410.11985","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.11985","snapshot_observed_at":"2026-07-02T12:46:57.376473Z","title":"arXiv preprint arXiv:2410.11985 , year=","venue":null,"work_id":"4117dfa4-2fb9-4e35-929f-3946456032ca","year":2024},"citing_paper":{"arxiv_id":"2605.18931","last_updated":"2026-06-03T15:30:42Z","snapshot_observed_at":"2026-07-06T23:29:42.583875Z","submitted_at":"2026-05-18T14:21:46Z","title":"Markov Chain Decoders Overcome the Heavy-Tail Limitations of Lipschitz Generative Models","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-20T08:33:38.253156Z"},"links":{"cited_paper":"/paper/2410.11985","citing_paper":"/paper/2605.18931"},"observation_digest":"sha256:3ff6ad16c89f110bcb48fd50d8a5878f079157c0f99acfc2ec1487a20280ffc8","observation_id":"b2ee82ed-86be-40f6-869d-509b2fda11ff","resolution":{"observed_at":"2026-05-20T08:38:10.487090Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11985","last_updated":"2024-10-15T18:47:12Z","snapshot_observed_at":"2026-07-06T19:34:10.252984Z","submitted_at":"2024-10-15T18:47:12Z","title":"The Fair Language Model Paradox","version":1},"cited_work":{"arxiv_id":"2410.11985","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.11985","snapshot_observed_at":"2026-07-02T12:46:57.376473Z","title":"arXiv preprint arXiv:2410.11985 , year=","venue":null,"work_id":"4117dfa4-2fb9-4e35-929f-3946456032ca","year":2024},"citing_paper":{"arxiv_id":"2606.06267","last_updated":"2026-06-04T15:10:14Z","snapshot_observed_at":"2026-08-02T02:21:26.909548Z","submitted_at":"2026-06-04T15:10:14Z","title":"Many Circuits, One Mechanism: Input Variation and Evaluation Granularity in Circuit Discovery","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-06-28T01:48:12.958931Z"},"links":{"cited_paper":"/paper/2410.11985","citing_paper":"/paper/2606.06267"},"observation_digest":"sha256:25adbd8dac0e1339d50f06e9d6d53e78bfbd85a6555fc7c4bffb16501ef749d5","observation_id":"7b6d92ae-cca8-4cdc-bcda-78563347f413","resolution":{"observed_at":"2026-07-02T12:46:57.377972Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.11985/citation-record","integrity":"/paper/2410.11985/integrity","json":"/paper/2410.11985/citation-record.json","paper":"/paper/2410.11985"},"outbound":[],"paper":{"arxiv_id":"2410.11985","last_updated":"2024-10-15T18:47:12Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:34:10.252984Z","submitted_at":"2024-10-15T18:47:12Z","title":"The Fair Language Model Paradox"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2410.11985."}