{"as_of":"2026-08-21T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e13562601f0b92ccf9a78e7a492c8e4cc830548930e26ea55b4a55c3234b5e7c","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T19:51:27.895449Z","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-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.11767/citation-record","integrity":"/paper/2508.11767/integrity","json":"/paper/2508.11767/citation-record.json","paper":"/paper/2508.11767"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.11770","last_updated":"2025-08-15T18:39:51Z","snapshot_observed_at":"2026-08-05T19:47:34.650790Z","submitted_at":"2025-08-15T18:39:51Z","title":"FairVizARD: A Visualization System for Assessing Multi-Party Fairness of Ride-Sharing Matching Algorithms","version":1},"cited_work":{"arxiv_id":"2508.11770","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.11770","snapshot_observed_at":"2026-08-05T19:51:27.945650Z","title":"FairVizARD: A Visualization System for Assessing Multi-Party Fairness of Ride-Sharing Matching Algorithms","venue":"cs.HC","work_id":"598704d5-4e8c-4f6b-8c99-54f04d5ac123","year":2025},"citing_paper":{"arxiv_id":"2508.11767","last_updated":"2025-08-15T18:36:52Z","snapshot_observed_at":"2026-08-16T15:02:39.402491Z","submitted_at":"2025-08-15T18:36:52Z","title":"Limitation Learning: Catching Adverse Dialog with GAIL","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T19:51:27.895449Z"},"links":{"cited_paper":"/paper/2508.11770","citing_paper":"/paper/2508.11767"},"observation_digest":"sha256:123dcfd217847a50457220527f8c03922b53656907d8895d1e8ae10b26668f35","observation_id":"62b66bb9-f2be-4083-ba9c-df27d08b0d1f","resolution":{"observed_at":"2026-08-05T19:51:27.953134Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.11767","last_updated":"2025-08-15T18:36:52Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T15:02:39.402491Z","submitted_at":"2025-08-15T18:36:52Z","title":"Limitation Learning: Catching Adverse Dialog with GAIL"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":1},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 1 of 1 outbound references and 0 inbound Pith citation observations for arXiv:2508.11767."}