{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JUFTLGKLT37IWZXWJI3HGCKAM2","short_pith_number":"pith:JUFTLGKL","schema_version":"1.0","canonical_sha256":"4d0b35994b9efe8b66f64a36730940668c38b78e04f2d7327d28fcfeec09b54c","source":{"kind":"arxiv","id":"2410.02811","version":1},"attestation_state":"computed","paper":{"title":"SAC-KG: Exploiting Large Language Models as Skilled Automatic Constructors for Domain Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Hanzhu Chen, Jieping Ye, Jie Wang, Qitan Lv, Xiaoqi Ni, Xu Shen","submitted_at":"2024-09-22T13:55:23Z","abstract_excerpt":"Knowledge graphs (KGs) play a pivotal role in knowledge-intensive tasks across specialized domains, where the acquisition of precise and dependable knowledge is crucial. However, existing KG construction methods heavily rely on human intervention to attain qualified KGs, which severely hinders the practical applicability in real-world scenarios. To address this challenge, we propose a general KG construction framework, named SAC-KG, to exploit large language models (LLMs) as Skilled Automatic Constructors for domain Knowledge Graph. SAC-KG effectively involves LLMs as domain experts to generat"},"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":"2410.02811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-09-22T13:55:23Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"a24703e7d9bf34cdb62ceab378ad5eeedda41ac858945b554d2495cde071c0dd","abstract_canon_sha256":"5772a7e8948eec6ef535a7a71de89d1ccbb1b1718ffaf2674d36821d332c576e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:40.008683Z","signature_b64":"Lpe7aBqeRuxQc1H8k/OKyTIHW5j0cIJSQP6gnletqGwdVTj65WnLoqC8D3cdgBqAasPIemMAfKPV+3rUKAnSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d0b35994b9efe8b66f64a36730940668c38b78e04f2d7327d28fcfeec09b54c","last_reissued_at":"2026-07-05T09:15:40.008231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:40.008231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAC-KG: Exploiting Large Language Models as Skilled Automatic Constructors for Domain Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Hanzhu Chen, Jieping Ye, Jie Wang, Qitan Lv, Xiaoqi Ni, Xu Shen","submitted_at":"2024-09-22T13:55:23Z","abstract_excerpt":"Knowledge graphs (KGs) play a pivotal role in knowledge-intensive tasks across specialized domains, where the acquisition of precise and dependable knowledge is crucial. However, existing KG construction methods heavily rely on human intervention to attain qualified KGs, which severely hinders the practical applicability in real-world scenarios. To address this challenge, we propose a general KG construction framework, named SAC-KG, to exploit large language models (LLMs) as Skilled Automatic Constructors for domain Knowledge Graph. SAC-KG effectively involves LLMs as domain experts to generat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02811","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/2410.02811/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":"2410.02811","created_at":"2026-07-05T09:15:40.008300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02811v1","created_at":"2026-07-05T09:15:40.008300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02811","created_at":"2026-07-05T09:15:40.008300+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUFTLGKLT37I","created_at":"2026-07-05T09:15:40.008300+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUFTLGKLT37IWZXW","created_at":"2026-07-05T09:15:40.008300+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUFTLGKL","created_at":"2026-07-05T09:15:40.008300+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2","json":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2.json","graph_json":"https://pith.science/api/pith-number/JUFTLGKLT37IWZXWJI3HGCKAM2/graph.json","events_json":"https://pith.science/api/pith-number/JUFTLGKLT37IWZXWJI3HGCKAM2/events.json","paper":"https://pith.science/paper/JUFTLGKL"},"agent_actions":{"view_html":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2","download_json":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2.json","view_paper":"https://pith.science/paper/JUFTLGKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02811&json=true","fetch_graph":"https://pith.science/api/pith-number/JUFTLGKLT37IWZXWJI3HGCKAM2/graph.json","fetch_events":"https://pith.science/api/pith-number/JUFTLGKLT37IWZXWJI3HGCKAM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2/action/storage_attestation","attest_author":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2/action/author_attestation","sign_citation":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2/action/citation_signature","submit_replication":"https://pith.science/pith/JUFTLGKLT37IWZXWJI3HGCKAM2/action/replication_record"}},"created_at":"2026-07-05T09:15:40.008300+00:00","updated_at":"2026-07-05T09:15:40.008300+00:00"}