{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FCHRZ4DC2MA7JCS5TDTFN35CA2","short_pith_number":"pith:FCHRZ4DC","schema_version":"1.0","canonical_sha256":"288f1cf062d301f48a5d98e656efa2069ae35633d9a7f7a2552c05c262c42c92","source":{"kind":"arxiv","id":"2412.10064","version":1},"attestation_state":"computed","paper":{"title":"Text2Cypher: Bridging Natural Language and Graph Databases","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gianandrea Minneci, Jon Besga, Leila Messallem, Makbule Gulcin Ozsoy","submitted_at":"2024-12-13T11:50:51Z","abstract_excerpt":"Knowledge graphs use nodes, relationships, and properties to represent arbitrarily complex data. When stored in a graph database, the Cypher query language enables efficient modeling and querying of knowledge graphs. However, using Cypher requires specialized knowledge, which can present a challenge for non-expert users. Our work Text2Cypher aims to bridge this gap by translating natural language queries into Cypher query language and extending the utility of knowledge graphs to non-technical expert users.\n  While large language models (LLMs) can be used for this purpose, they often struggle t"},"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":"2412.10064","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-13T11:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"be723d83b6b79a75a3ae7af77f30dc0eb76c987a906dca00848cb5b45c5d5afd","abstract_canon_sha256":"637ea104dadb15d7730de706314e1d4418f35f82e1d56fe897eee3cfe2f5fc86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:46.472267Z","signature_b64":"jPPqOm1EavXTxuNAfap4BQkAY7n9qoj3uerIyPe73xGqEcUozib/Vftn4MopR9YDmkyec3/u3HRIuJ3DhLEMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"288f1cf062d301f48a5d98e656efa2069ae35633d9a7f7a2552c05c262c42c92","last_reissued_at":"2026-07-05T09:48:46.471736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:46.471736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Text2Cypher: Bridging Natural Language and Graph Databases","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gianandrea Minneci, Jon Besga, Leila Messallem, Makbule Gulcin Ozsoy","submitted_at":"2024-12-13T11:50:51Z","abstract_excerpt":"Knowledge graphs use nodes, relationships, and properties to represent arbitrarily complex data. When stored in a graph database, the Cypher query language enables efficient modeling and querying of knowledge graphs. However, using Cypher requires specialized knowledge, which can present a challenge for non-expert users. Our work Text2Cypher aims to bridge this gap by translating natural language queries into Cypher query language and extending the utility of knowledge graphs to non-technical expert users.\n  While large language models (LLMs) can be used for this purpose, they often struggle t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10064","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/2412.10064/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":"2412.10064","created_at":"2026-07-05T09:48:46.471793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10064v1","created_at":"2026-07-05T09:48:46.471793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10064","created_at":"2026-07-05T09:48:46.471793+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCHRZ4DC2MA7","created_at":"2026-07-05T09:48:46.471793+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCHRZ4DC2MA7JCS5","created_at":"2026-07-05T09:48:46.471793+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCHRZ4DC","created_at":"2026-07-05T09:48:46.471793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04645","citing_title":"CYGNET: Cypher Gate for Neural Execution Triage and Cost Containment","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2606.27742","citing_title":"KG2Cypher: Data-Centric Pipeline for Building Enterprise Text-to-Cypher Systems","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2510.08952","citing_title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2","json":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2.json","graph_json":"https://pith.science/api/pith-number/FCHRZ4DC2MA7JCS5TDTFN35CA2/graph.json","events_json":"https://pith.science/api/pith-number/FCHRZ4DC2MA7JCS5TDTFN35CA2/events.json","paper":"https://pith.science/paper/FCHRZ4DC"},"agent_actions":{"view_html":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2","download_json":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2.json","view_paper":"https://pith.science/paper/FCHRZ4DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10064&json=true","fetch_graph":"https://pith.science/api/pith-number/FCHRZ4DC2MA7JCS5TDTFN35CA2/graph.json","fetch_events":"https://pith.science/api/pith-number/FCHRZ4DC2MA7JCS5TDTFN35CA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2/action/storage_attestation","attest_author":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2/action/author_attestation","sign_citation":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2/action/citation_signature","submit_replication":"https://pith.science/pith/FCHRZ4DC2MA7JCS5TDTFN35CA2/action/replication_record"}},"created_at":"2026-07-05T09:48:46.471793+00:00","updated_at":"2026-07-05T09:48:46.471793+00:00"}