{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LIY5VGIHJZUH5PL2DPGHKCSFEB","short_pith_number":"pith:LIY5VGIH","schema_version":"1.0","canonical_sha256":"5a31da99074e687ebd7a1bcc750a45205ef8d72c6de8bcb6ea7a05f2127ddd51","source":{"kind":"arxiv","id":"1301.2362","version":1},"attestation_state":"computed","paper":{"title":"Quasi-SLCA based Keyword Query Processing over Probabilistic XML Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengfei Liu, Jeffrey Xu Yu, Jianxin Li, Rui Zhou","submitted_at":"2013-01-11T00:05:46Z","abstract_excerpt":"The probabilistic threshold query is one of the most common queries in uncertain databases, where a result satisfying the query must be also with probability meeting the threshold requirement. In this paper, we investigate probabilistic threshold keyword queries (PrTKQ) over XML data, which is not studied before. We first introduce the notion of quasi-SLCA and use it to represent results for a PrTKQ with the consideration of possible world semantics. Then we design a probabilistic inverted (PI) index that can be used to quickly return the qualified answers and filter out the unqualified ones b"},"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":"1301.2362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-11T00:05:46Z","cross_cats_sorted":[],"title_canon_sha256":"9569f9aee19b861f4a35b2a0eec6a517e3914e6b1fc57450dd21476bf64de6fd","abstract_canon_sha256":"499d21ce11f9f624db6d4b89da2edf0660c6e5f7eb6dfe4f2400c81eb6c435cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:38.139040Z","signature_b64":"HQS0zsBQ//MAz8Bze5482Ya63XqFTxLBLK243rFh/NWpxBcAF+NqeMj5fT+9DAJ1LT83BGTk86xuEGR8ql1wBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a31da99074e687ebd7a1bcc750a45205ef8d72c6de8bcb6ea7a05f2127ddd51","last_reissued_at":"2026-05-18T03:36:38.138594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:38.138594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-SLCA based Keyword Query Processing over Probabilistic XML Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chengfei Liu, Jeffrey Xu Yu, Jianxin Li, Rui Zhou","submitted_at":"2013-01-11T00:05:46Z","abstract_excerpt":"The probabilistic threshold query is one of the most common queries in uncertain databases, where a result satisfying the query must be also with probability meeting the threshold requirement. In this paper, we investigate probabilistic threshold keyword queries (PrTKQ) over XML data, which is not studied before. We first introduce the notion of quasi-SLCA and use it to represent results for a PrTKQ with the consideration of possible world semantics. Then we design a probabilistic inverted (PI) index that can be used to quickly return the qualified answers and filter out the unqualified ones b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2362","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":"1301.2362","created_at":"2026-05-18T03:36:38.138672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2362v1","created_at":"2026-05-18T03:36:38.138672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2362","created_at":"2026-05-18T03:36:38.138672+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIY5VGIHJZUH","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIY5VGIHJZUH5PL2","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIY5VGIH","created_at":"2026-05-18T12:27:51.066281+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/LIY5VGIHJZUH5PL2DPGHKCSFEB","json":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB.json","graph_json":"https://pith.science/api/pith-number/LIY5VGIHJZUH5PL2DPGHKCSFEB/graph.json","events_json":"https://pith.science/api/pith-number/LIY5VGIHJZUH5PL2DPGHKCSFEB/events.json","paper":"https://pith.science/paper/LIY5VGIH"},"agent_actions":{"view_html":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB","download_json":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB.json","view_paper":"https://pith.science/paper/LIY5VGIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2362&json=true","fetch_graph":"https://pith.science/api/pith-number/LIY5VGIHJZUH5PL2DPGHKCSFEB/graph.json","fetch_events":"https://pith.science/api/pith-number/LIY5VGIHJZUH5PL2DPGHKCSFEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB/action/storage_attestation","attest_author":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB/action/author_attestation","sign_citation":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB/action/citation_signature","submit_replication":"https://pith.science/pith/LIY5VGIHJZUH5PL2DPGHKCSFEB/action/replication_record"}},"created_at":"2026-05-18T03:36:38.138672+00:00","updated_at":"2026-05-18T03:36:38.138672+00:00"}