{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WIUQIGE2KFMP7LEUQMLAQGI6Y6","short_pith_number":"pith:WIUQIGE2","schema_version":"1.0","canonical_sha256":"b22904189a5158ffac94831608191ec7b418866a2675d57225ec6facd479ef47","source":{"kind":"arxiv","id":"2304.03728","version":1},"attestation_state":"computed","paper":{"title":"Interpretable Unified Language Checking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Danny Fox, Helen Meng, Hongyin Luo, James Glass, Luc Gaitskell, Thomas Hartvigsen, Tianhua Zhang, Wei Fang, Xixin Wu, Yung-Sung Chuang","submitted_at":"2023-04-07T16:47:49Z","abstract_excerpt":"Despite recent concerns about undesirable behaviors generated by large language models (LLMs), including non-factual, biased, and hateful language, we find LLMs are inherent multi-task language checkers based on their latent representations of natural and social knowledge. We present an interpretable, unified, language checking (UniLC) method for both human and machine-generated language that aims to check if language input is factual and fair. While fairness and fact-checking tasks have been handled separately with dedicated models, we find that LLMs can achieve high performance on a combinat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2304.03728","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-04-07T16:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"ad5b44501b4d5db7b1fcfc9b7ff6269a743e3050c6d588ce19f60e2782b76add","abstract_canon_sha256":"5edb057e2fa9a1c8d9d9e9661d6c4ae1dc273a78dc796c82e7e3752f3acbf49c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:59.593569Z","signature_b64":"oEEvs3Fhs3zwkeo6Drb2ywQ6/nEYahtAa9CfsUXxYwH9RIwZRR1w+Khl7OJ8Rdk0K7zI9l25O3UsEQeb8gsqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22904189a5158ffac94831608191ec7b418866a2675d57225ec6facd479ef47","last_reissued_at":"2026-07-05T05:58:59.593145Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:59.593145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpretable Unified Language Checking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Danny Fox, Helen Meng, Hongyin Luo, James Glass, Luc Gaitskell, Thomas Hartvigsen, Tianhua Zhang, Wei Fang, Xixin Wu, Yung-Sung Chuang","submitted_at":"2023-04-07T16:47:49Z","abstract_excerpt":"Despite recent concerns about undesirable behaviors generated by large language models (LLMs), including non-factual, biased, and hateful language, we find LLMs are inherent multi-task language checkers based on their latent representations of natural and social knowledge. We present an interpretable, unified, language checking (UniLC) method for both human and machine-generated language that aims to check if language input is factual and fair. While fairness and fact-checking tasks have been handled separately with dedicated models, we find that LLMs can achieve high performance on a combinat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03728","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.03728/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.03728","created_at":"2026-07-05T05:58:59.593201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03728v1","created_at":"2026-07-05T05:58:59.593201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03728","created_at":"2026-07-05T05:58:59.593201+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIUQIGE2KFMP","created_at":"2026-07-05T05:58:59.593201+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIUQIGE2KFMP7LEU","created_at":"2026-07-05T05:58:59.593201+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIUQIGE2","created_at":"2026-07-05T05:58:59.593201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.11511","citing_title":"Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection","ref_index":152,"is_internal_anchor":false},{"citing_arxiv_id":"2401.15884","citing_title":"Corrective Retrieval Augmented Generation","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6","json":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6.json","graph_json":"https://pith.science/api/pith-number/WIUQIGE2KFMP7LEUQMLAQGI6Y6/graph.json","events_json":"https://pith.science/api/pith-number/WIUQIGE2KFMP7LEUQMLAQGI6Y6/events.json","paper":"https://pith.science/paper/WIUQIGE2"},"agent_actions":{"view_html":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6","download_json":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6.json","view_paper":"https://pith.science/paper/WIUQIGE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03728&json=true","fetch_graph":"https://pith.science/api/pith-number/WIUQIGE2KFMP7LEUQMLAQGI6Y6/graph.json","fetch_events":"https://pith.science/api/pith-number/WIUQIGE2KFMP7LEUQMLAQGI6Y6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6/action/storage_attestation","attest_author":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6/action/author_attestation","sign_citation":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6/action/citation_signature","submit_replication":"https://pith.science/pith/WIUQIGE2KFMP7LEUQMLAQGI6Y6/action/replication_record"}},"created_at":"2026-07-05T05:58:59.593201+00:00","updated_at":"2026-07-05T05:58:59.593201+00:00"}