{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LRNLK5LN7QZVYQU4YZXBVFCPAO","short_pith_number":"pith:LRNLK5LN","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"},"canonical_sha256":"5c5ab5756dfc335c429cc66e1a944f039cc0cd1ab4d4ec1dee6188d1242d4016","source":{"kind":"arxiv","id":"1704.00205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00205","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00205v2","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00205","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"LRNLK5LN7QZV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LRNLK5LN7QZVYQU4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LRNLK5LN","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LRNLK5LN7QZVYQU4YZXBVFCPAO","target":"record","payload":{"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"},"canonical_sha256":"5c5ab5756dfc335c429cc66e1a944f039cc0cd1ab4d4ec1dee6188d1242d4016","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"},"source_kind":"arxiv","source_id":"1704.00205","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB+iwI0k8P7C0p0KEyGpmr0aIVJ9BTnpCHwq8o66VeOmsHzqFXisCyc896BHXjinRx17laay/2x8kegZKlBXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:31:26.453909Z"},"content_sha256":"eb14f01e62d62d52117b007a9742e2054d62ff7068afd317bb7ba257800cae38","schema_version":"1.0","event_id":"sha256:eb14f01e62d62d52117b007a9742e2054d62ff7068afd317bb7ba257800cae38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LRNLK5LN7QZVYQU4YZXBVFCPAO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRtRwdXnY+/A7jj2Vr3SaGH6WIPOTwfc8rdOIHiUdC1FnBmFksJjLFJhhXWvmTPXECwj5dTDRH77P1Asp7uRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:31:26.454251Z"},"content_sha256":"3dbd1887edcf80d4ff1c46b9875b7588a346dcf0613b9b234ac0fa5d1681cb62","schema_version":"1.0","event_id":"sha256:3dbd1887edcf80d4ff1c46b9875b7588a346dcf0613b9b234ac0fa5d1681cb62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/bundle.json","state_url":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T16:31:26Z","links":{"resolver":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO","bundle":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/bundle.json","state":"https://pith.science/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRNLK5LN7QZVYQU4YZXBVFCPAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LRNLK5LN7QZVYQU4YZXBVFCPAO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8efc044c3629533598925dd7d14b1cbcadb5476ce77335b4cba53954ba889bf0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-04-01T18:17:28Z","title_canon_sha256":"5ef62ff816e6e77ecf305247114ec69b22e56679b83e7e57f45f53fe1de3f77a"},"schema_version":"1.0","source":{"id":"1704.00205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00205","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00205v2","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00205","created_at":"2026-05-18T00:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"LRNLK5LN7QZV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LRNLK5LN7QZVYQU4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LRNLK5LN","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:3dbd1887edcf80d4ff1c46b9875b7588a346dcf0613b9b234ac0fa5d1681cb62","target":"graph","created_at":"2026-05-18T00:36:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dongyan Zhao, Jeffrey Xu Yu, Lei Zou, Shuo Han","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-04-01T18:17:28Z","title":"Keyword Search on RDF Graphs - A Query Graph Assembly Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00205","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb14f01e62d62d52117b007a9742e2054d62ff7068afd317bb7ba257800cae38","target":"record","created_at":"2026-05-18T00:36:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8efc044c3629533598925dd7d14b1cbcadb5476ce77335b4cba53954ba889bf0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2017-04-01T18:17:28Z","title_canon_sha256":"5ef62ff816e6e77ecf305247114ec69b22e56679b83e7e57f45f53fe1de3f77a"},"schema_version":"1.0","source":{"id":"1704.00205","kind":"arxiv","version":2}},"canonical_sha256":"5c5ab5756dfc335c429cc66e1a944f039cc0cd1ab4d4ec1dee6188d1242d4016","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c5ab5756dfc335c429cc66e1a944f039cc0cd1ab4d4ec1dee6188d1242d4016","first_computed_at":"2026-05-18T00:36:43.318845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:43.318845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xA9n6sfRRtyOYo45R0jI8tXzTJi+hhe2V54pUTQYlik5K5JW7iVy7/1quduPykdQ0MsVT7lOg1Oy93WWGD8qAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:43.319492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb14f01e62d62d52117b007a9742e2054d62ff7068afd317bb7ba257800cae38","sha256:3dbd1887edcf80d4ff1c46b9875b7588a346dcf0613b9b234ac0fa5d1681cb62"],"state_sha256":"7d3fe7d80ab7232b40b665f8f02b47cbb23240db20e11a59125391b55c6ae6c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLVGoSOD5xz5g7I4Vxo1lq+vTLK4XwtIcXSDF7s2XrGJAvAMefQ9Ug7jDFRWnbJ1X2iIaz+EcEeOwAY9peAHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T16:31:26.456161Z","bundle_sha256":"3b9dd24e52534dbd8b5f443569d48d208f0fe95ce1e9f5794f9d75fb3a05f69b"}}