{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JW2XKLUPNWZWV3AY7Z56ZH6HP4","short_pith_number":"pith:JW2XKLUP","schema_version":"1.0","canonical_sha256":"4db5752e8f6db36aec18fe7bec9fc77f1437ebeccc69ab349d8448afb697e795","source":{"kind":"arxiv","id":"1703.02212","version":1},"attestation_state":"computed","paper":{"title":"No-But-Semantic-Match: Computing Semantically Matched XML Keyword Search Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengfei Liu, Irene Moser, Md. Saiful Islam, Mehdi Naseriparsa","submitted_at":"2017-03-07T04:54:44Z","abstract_excerpt":"Users are rarely familiar with the content of a data source they are querying, and therefore cannot avoid using keywords that do not exist in the data source. Traditional systems may respond with an empty result, causing dissatisfaction, while the data source in effect holds semantically related content. In this paper we study this no-but-semantic-match problem on XML keyword search and propose a solution which enables us to present the top-k semantically related results to the user. Our solution involves two steps: (a) extracting semantically related candidate queries from the original query "},"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":"1703.02212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-07T04:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"1bc48a5bb6dbfdc5d7373a9262cb3b25c2100dc601762f1ae6c7415e89eee570","abstract_canon_sha256":"12402b3f9fdc4fc38c07faba8dcf9cadfe899be7247231dab6ab1b31c705e9ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:20.487087Z","signature_b64":"BHyEZ74mosvBdkFRXKDMEH1YnfZM16ADNE3H3a0NPV/QL9WH5taouLnQPFtHDFGV8y43xlKaPhMAzD7iCCepAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db5752e8f6db36aec18fe7bec9fc77f1437ebeccc69ab349d8448afb697e795","last_reissued_at":"2026-05-18T00:49:20.486714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:20.486714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No-But-Semantic-Match: Computing Semantically Matched XML Keyword Search Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengfei Liu, Irene Moser, Md. Saiful Islam, Mehdi Naseriparsa","submitted_at":"2017-03-07T04:54:44Z","abstract_excerpt":"Users are rarely familiar with the content of a data source they are querying, and therefore cannot avoid using keywords that do not exist in the data source. Traditional systems may respond with an empty result, causing dissatisfaction, while the data source in effect holds semantically related content. In this paper we study this no-but-semantic-match problem on XML keyword search and propose a solution which enables us to present the top-k semantically related results to the user. Our solution involves two steps: (a) extracting semantically related candidate queries from the original query "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02212","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":""},"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":"1703.02212","created_at":"2026-05-18T00:49:20.486775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02212v1","created_at":"2026-05-18T00:49:20.486775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02212","created_at":"2026-05-18T00:49:20.486775+00:00"},{"alias_kind":"pith_short_12","alias_value":"JW2XKLUPNWZW","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JW2XKLUPNWZWV3AY","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JW2XKLUP","created_at":"2026-05-18T12:31:24.725408+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/JW2XKLUPNWZWV3AY7Z56ZH6HP4","json":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4.json","graph_json":"https://pith.science/api/pith-number/JW2XKLUPNWZWV3AY7Z56ZH6HP4/graph.json","events_json":"https://pith.science/api/pith-number/JW2XKLUPNWZWV3AY7Z56ZH6HP4/events.json","paper":"https://pith.science/paper/JW2XKLUP"},"agent_actions":{"view_html":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4","download_json":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4.json","view_paper":"https://pith.science/paper/JW2XKLUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02212&json=true","fetch_graph":"https://pith.science/api/pith-number/JW2XKLUPNWZWV3AY7Z56ZH6HP4/graph.json","fetch_events":"https://pith.science/api/pith-number/JW2XKLUPNWZWV3AY7Z56ZH6HP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4/action/storage_attestation","attest_author":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4/action/author_attestation","sign_citation":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4/action/citation_signature","submit_replication":"https://pith.science/pith/JW2XKLUPNWZWV3AY7Z56ZH6HP4/action/replication_record"}},"created_at":"2026-05-18T00:49:20.486775+00:00","updated_at":"2026-05-18T00:49:20.486775+00:00"}