{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5JGZROZH22JMAYIB3VTFLGO7LQ","short_pith_number":"pith:5JGZROZH","schema_version":"1.0","canonical_sha256":"ea4d98bb27d692c06101dd665599df5c3405e2309a2ffd5830fb5c12e5208ef7","source":{"kind":"arxiv","id":"2402.16567","version":3},"attestation_state":"computed","paper":{"title":"Aligning Large Language Models to a Domain-specific Graph Database for NL2GQL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.CL","authors_text":"Keren Tan, Siyuan Wang, Tingyu Xie, Weining Qian, Wenbiao Tao, Yuanyuan Liang, Yunshi Lan","submitted_at":"2024-02-26T13:46:51Z","abstract_excerpt":"Graph Databases (Graph DB) find extensive application across diverse domains such as finance, social networks, and medicine. Yet, the translation of Natural Language (NL) into the Graph Query Language (GQL), referred to as NL2GQL, poses significant challenges owing to its intricate and specialized nature. Some approaches have sought to utilize Large Language Models (LLMs) to address analogous tasks like text2SQL. Nonetheless, in the realm of NL2GQL tasks tailored to a particular domain, the absence of domain-specific NL-GQL data pairs adds complexity to aligning LLMs with the graph DB. To tack"},"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":"2402.16567","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-26T13:46:51Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"8888370d2603e08fd350e09f21996c30a00eb39711b90368dfe17fd75e7ee5e9","abstract_canon_sha256":"77ee3f9d8b4ae53acd4eafdb2035f51c584e93cba4906b1330322b81facbc063"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:18.562073Z","signature_b64":"X6KZgpe+p2gZbqZKgMw9n/INATN333UHILJEd/Qei6X0vIDUgA7hwBNTxMAFdeaWbBja3E5rQkk1aM7f/gKfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4d98bb27d692c06101dd665599df5c3405e2309a2ffd5830fb5c12e5208ef7","last_reissued_at":"2026-07-05T09:03:18.561569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:18.561569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aligning Large Language Models to a Domain-specific Graph Database for NL2GQL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.CL","authors_text":"Keren Tan, Siyuan Wang, Tingyu Xie, Weining Qian, Wenbiao Tao, Yuanyuan Liang, Yunshi Lan","submitted_at":"2024-02-26T13:46:51Z","abstract_excerpt":"Graph Databases (Graph DB) find extensive application across diverse domains such as finance, social networks, and medicine. Yet, the translation of Natural Language (NL) into the Graph Query Language (GQL), referred to as NL2GQL, poses significant challenges owing to its intricate and specialized nature. Some approaches have sought to utilize Large Language Models (LLMs) to address analogous tasks like text2SQL. Nonetheless, in the realm of NL2GQL tasks tailored to a particular domain, the absence of domain-specific NL-GQL data pairs adds complexity to aligning LLMs with the graph DB. To tack"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16567","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/2402.16567/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":"2402.16567","created_at":"2026-07-05T09:03:18.561624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.16567v3","created_at":"2026-07-05T09:03:18.561624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16567","created_at":"2026-07-05T09:03:18.561624+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JGZROZH22JM","created_at":"2026-07-05T09:03:18.561624+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JGZROZH22JMAYIB","created_at":"2026-07-05T09:03:18.561624+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JGZROZH","created_at":"2026-07-05T09:03:18.561624+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":71,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ","json":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ.json","graph_json":"https://pith.science/api/pith-number/5JGZROZH22JMAYIB3VTFLGO7LQ/graph.json","events_json":"https://pith.science/api/pith-number/5JGZROZH22JMAYIB3VTFLGO7LQ/events.json","paper":"https://pith.science/paper/5JGZROZH"},"agent_actions":{"view_html":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ","download_json":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ.json","view_paper":"https://pith.science/paper/5JGZROZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.16567&json=true","fetch_graph":"https://pith.science/api/pith-number/5JGZROZH22JMAYIB3VTFLGO7LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5JGZROZH22JMAYIB3VTFLGO7LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ/action/storage_attestation","attest_author":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ/action/author_attestation","sign_citation":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ/action/citation_signature","submit_replication":"https://pith.science/pith/5JGZROZH22JMAYIB3VTFLGO7LQ/action/replication_record"}},"created_at":"2026-07-05T09:03:18.561624+00:00","updated_at":"2026-07-05T09:03:18.561624+00:00"}