{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LRNLK5LN7QZVYQU4YZXBVFCPAO","short_pith_number":"pith:LRNLK5LN","schema_version":"1.0","canonical_sha256":"5c5ab5756dfc335c429cc66e1a944f039cc0cd1ab4d4ec1dee6188d1242d4016","source":{"kind":"arxiv","id":"1704.00205","version":2},"attestation_state":"computed","paper":{"title":"Keyword Search on RDF Graphs - A Query Graph Assembly Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dongyan Zhao, Jeffrey Xu Yu, Lei Zou, Shuo Han","submitted_at":"2017-04-01T18:17:28Z","abstract_excerpt":"Keyword search provides ordinary users an easy-to-use interface for querying RDF data. Given the input keywords, in this paper, we study how to assemble a query graph that is to represent user's query intention accurately and efficiently. Based on the input keywords, we first obtain the elementary query graph building blocks, such as entity/class vertices and predicate edges. Then, we formally define the query graph assembly (QGA) problem. Unfortunately, we prove theoretically that QGA is a NP-complete problem. In order to solve that, we design some heuristic lower bounds and propose a biparti"},"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":"1704.00205","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-04-01T18:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"5ef62ff816e6e77ecf305247114ec69b22e56679b83e7e57f45f53fe1de3f77a","abstract_canon_sha256":"8efc044c3629533598925dd7d14b1cbcadb5476ce77335b4cba53954ba889bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.319492Z","signature_b64":"xA9n6sfRRtyOYo45R0jI8tXzTJi+hhe2V54pUTQYlik5K5JW7iVy7/1quduPykdQ0MsVT7lOg1Oy93WWGD8qAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c5ab5756dfc335c429cc66e1a944f039cc0cd1ab4d4ec1dee6188d1242d4016","last_reissued_at":"2026-05-18T00:36:43.318845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.318845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Keyword Search on RDF Graphs - A Query Graph Assembly Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dongyan Zhao, Jeffrey Xu Yu, Lei Zou, Shuo Han","submitted_at":"2017-04-01T18:17:28Z","abstract_excerpt":"Keyword search provides ordinary users an easy-to-use interface for querying RDF data. Given the input keywords, in this paper, we study how to assemble a query graph that is to represent user's query intention accurately and efficiently. Based on the input keywords, we first obtain the elementary query graph building blocks, such as entity/class vertices and predicate edges. Then, we formally define the query graph assembly (QGA) problem. Unfortunately, we prove theoretically that QGA is a NP-complete problem. In order to solve that, we design some heuristic lower bounds and propose a biparti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00205","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":""},"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":"1704.00205","created_at":"2026-05-18T00:36:43.318933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00205v2","created_at":"2026-05-18T00:36:43.318933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00205","created_at":"2026-05-18T00:36:43.318933+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRNLK5LN7QZV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRNLK5LN7QZVYQU4","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRNLK5LN","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO","json":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO.json","graph_json":"https://pith.science/api/pith-number/LRNLK5LN7QZVYQU4YZXBVFCPAO/graph.json","events_json":"https://pith.science/api/pith-number/LRNLK5LN7QZVYQU4YZXBVFCPAO/events.json","paper":"https://pith.science/paper/LRNLK5LN"},"agent_actions":{"view_html":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO","download_json":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO.json","view_paper":"https://pith.science/paper/LRNLK5LN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00205&json=true","fetch_graph":"https://pith.science/api/pith-number/LRNLK5LN7QZVYQU4YZXBVFCPAO/graph.json","fetch_events":"https://pith.science/api/pith-number/LRNLK5LN7QZVYQU4YZXBVFCPAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/action/storage_attestation","attest_author":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/action/author_attestation","sign_citation":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/action/citation_signature","submit_replication":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/action/replication_record"}},"created_at":"2026-05-18T00:36:43.318933+00:00","updated_at":"2026-05-18T00:36:43.318933+00:00"}