{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:U7IVRHOFLQ4BQGYRMYUKFTA3GJ","short_pith_number":"pith:U7IVRHOF","schema_version":"1.0","canonical_sha256":"a7d1589dc55c38181b116628a2cc1b3248c8b92aa6af2ff3cd6c8fa1ba0153ac","source":{"kind":"arxiv","id":"2312.11539","version":3},"attestation_state":"computed","paper":{"title":"KGLens: Towards Efficient and Effective Knowledge Probing of Large Language Models with Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"He Bai, Navdeep Jaitly, Shangshang Zheng, Xiaochuan Niu, Yi Su, Yizhe Zhang","submitted_at":"2023-12-15T23:34:05Z","abstract_excerpt":"Large Language Models (LLMs) might hallucinate facts, while curated Knowledge Graph (KGs) are typically factually reliable especially with domain-specific knowledge. Measuring the alignment between KGs and LLMs can effectively probe the factualness and identify the knowledge blind spots of LLMs. However, verifying the LLMs over extensive KGs can be expensive. In this paper, we present KGLens, a Thompson-sampling-inspired framework aimed at effectively and efficiently measuring the alignment between KGs and LLMs. KGLens features a graph-guided question generator for converting KGs into natural "},"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":"2312.11539","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-15T23:34:05Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"4df25275366575620828cb4e5661d7026728b1eab927003826a4fc328c12b2f6","abstract_canon_sha256":"52a3677538fc2d59e2895867377848540d316a6d0e061c528ac5a27d79ee725e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:50:52.956357Z","signature_b64":"VrgE+kJL4BGb6wta65WzGXdZ0k6BSHHXIu+GR/4MyC9eUWMogfUl+rRm3NTg/6IpEWTUmovjbQGt/NNrC/+KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7d1589dc55c38181b116628a2cc1b3248c8b92aa6af2ff3cd6c8fa1ba0153ac","last_reissued_at":"2026-07-05T08:50:52.955992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:50:52.955992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KGLens: Towards Efficient and Effective Knowledge Probing of Large Language Models with Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"He Bai, Navdeep Jaitly, Shangshang Zheng, Xiaochuan Niu, Yi Su, Yizhe Zhang","submitted_at":"2023-12-15T23:34:05Z","abstract_excerpt":"Large Language Models (LLMs) might hallucinate facts, while curated Knowledge Graph (KGs) are typically factually reliable especially with domain-specific knowledge. Measuring the alignment between KGs and LLMs can effectively probe the factualness and identify the knowledge blind spots of LLMs. However, verifying the LLMs over extensive KGs can be expensive. In this paper, we present KGLens, a Thompson-sampling-inspired framework aimed at effectively and efficiently measuring the alignment between KGs and LLMs. KGLens features a graph-guided question generator for converting KGs into natural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.11539","kind":"arxiv","version":3},"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/2312.11539/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":"2312.11539","created_at":"2026-07-05T08:50:52.956052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.11539v3","created_at":"2026-07-05T08:50:52.956052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.11539","created_at":"2026-07-05T08:50:52.956052+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7IVRHOFLQ4B","created_at":"2026-07-05T08:50:52.956052+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7IVRHOFLQ4BQGYR","created_at":"2026-07-05T08:50:52.956052+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7IVRHOF","created_at":"2026-07-05T08:50:52.956052+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06014","citing_title":"ExploreGS: Explorable 3D Scene Reconstruction with Virtual Camera Samplings and Diffusion Priors","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ","json":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ.json","graph_json":"https://pith.science/api/pith-number/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/graph.json","events_json":"https://pith.science/api/pith-number/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/events.json","paper":"https://pith.science/paper/U7IVRHOF"},"agent_actions":{"view_html":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ","download_json":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ.json","view_paper":"https://pith.science/paper/U7IVRHOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.11539&json=true","fetch_graph":"https://pith.science/api/pith-number/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/action/storage_attestation","attest_author":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/action/author_attestation","sign_citation":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/action/citation_signature","submit_replication":"https://pith.science/pith/U7IVRHOFLQ4BQGYRMYUKFTA3GJ/action/replication_record"}},"created_at":"2026-07-05T08:50:52.956052+00:00","updated_at":"2026-07-05T08:50:52.956052+00:00"}