{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OCOKLOFO5NJELTSIOPQHTNMZR5","short_pith_number":"pith:OCOKLOFO","schema_version":"1.0","canonical_sha256":"709ca5b8aeeb5245ce4873e079b5998f52792800e3c2e404482d12c242727bdb","source":{"kind":"arxiv","id":"2308.10168","version":2},"attestation_state":"computed","paper":{"title":"Head-to-Tail: How Knowledgeable are Large Language Models (LLMs)? A.K.A. Will LLMs Replace Knowledge Graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hanwen Zha, Kai Sun, Xin Luna Dong, Yifan Ethan Xu, Yue Liu","submitted_at":"2023-08-20T05:31:03Z","abstract_excerpt":"Since the recent prosperity of Large Language Models (LLMs), there have been interleaved discussions regarding how to reduce hallucinations from LLM responses, how to increase the factuality of LLMs, and whether Knowledge Graphs (KGs), which store the world knowledge in a symbolic form, will be replaced with LLMs. In this paper, we try to answer these questions from a new angle: How knowledgeable are LLMs?\n  To answer this question, we constructed Head-to-Tail, a benchmark that consists of 18K question-answer (QA) pairs regarding head, torso, and tail facts in terms of popularity. We designed "},"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":"2308.10168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-08-20T05:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"6e0160aedee4aa8c10b0f88de6cfbe4b42fee2cbba9638b0f4142dc14de1b0e3","abstract_canon_sha256":"5f03f52cebce4947aeab068be95ae588994f41bfcf6b086d4707a66688396be8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:43.639094Z","signature_b64":"07r4He2pBYmpkzCcosuGHf3kOVHgsDCV0hq1QQ74gI5SqugVXUbpVs2RpjEJmKHwFjK0h6S73WvsS3C01QziAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"709ca5b8aeeb5245ce4873e079b5998f52792800e3c2e404482d12c242727bdb","last_reissued_at":"2026-07-05T08:03:43.638692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:43.638692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Head-to-Tail: How Knowledgeable are Large Language Models (LLMs)? A.K.A. Will LLMs Replace Knowledge Graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hanwen Zha, Kai Sun, Xin Luna Dong, Yifan Ethan Xu, Yue Liu","submitted_at":"2023-08-20T05:31:03Z","abstract_excerpt":"Since the recent prosperity of Large Language Models (LLMs), there have been interleaved discussions regarding how to reduce hallucinations from LLM responses, how to increase the factuality of LLMs, and whether Knowledge Graphs (KGs), which store the world knowledge in a symbolic form, will be replaced with LLMs. In this paper, we try to answer these questions from a new angle: How knowledgeable are LLMs?\n  To answer this question, we constructed Head-to-Tail, a benchmark that consists of 18K question-answer (QA) pairs regarding head, torso, and tail facts in terms of popularity. We designed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10168","kind":"arxiv","version":2},"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/2308.10168/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":"2308.10168","created_at":"2026-07-05T08:03:43.638749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10168v2","created_at":"2026-07-05T08:03:43.638749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10168","created_at":"2026-07-05T08:03:43.638749+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCOKLOFO5NJE","created_at":"2026-07-05T08:03:43.638749+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCOKLOFO5NJELTSI","created_at":"2026-07-05T08:03:43.638749+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCOKLOFO","created_at":"2026-07-05T08:03:43.638749+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.11495","citing_title":"Chain-of-Verification Reduces Hallucination in Large Language Models","ref_index":164,"is_internal_anchor":false},{"citing_arxiv_id":"2309.05922","citing_title":"A Survey of Hallucination in Large Foundation Models","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2401.01313","citing_title":"A Comprehensive Survey of Hallucination Mitigation Techniques in Large Language Models","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07301","citing_title":"SOM: Structured Opponent Modeling for LLM-based Agents via Structural Causal Model","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5","json":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5.json","graph_json":"https://pith.science/api/pith-number/OCOKLOFO5NJELTSIOPQHTNMZR5/graph.json","events_json":"https://pith.science/api/pith-number/OCOKLOFO5NJELTSIOPQHTNMZR5/events.json","paper":"https://pith.science/paper/OCOKLOFO"},"agent_actions":{"view_html":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5","download_json":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5.json","view_paper":"https://pith.science/paper/OCOKLOFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10168&json=true","fetch_graph":"https://pith.science/api/pith-number/OCOKLOFO5NJELTSIOPQHTNMZR5/graph.json","fetch_events":"https://pith.science/api/pith-number/OCOKLOFO5NJELTSIOPQHTNMZR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5/action/storage_attestation","attest_author":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5/action/author_attestation","sign_citation":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5/action/citation_signature","submit_replication":"https://pith.science/pith/OCOKLOFO5NJELTSIOPQHTNMZR5/action/replication_record"}},"created_at":"2026-07-05T08:03:43.638749+00:00","updated_at":"2026-07-05T08:03:43.638749+00:00"}