{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:33UKQHIZNA6DXVVH72PPPN3IHT","short_pith_number":"pith:33UKQHIZ","canonical_record":{"source":{"id":"1103.2651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-14T12:50:48Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"df76429b078ca53f61fb1a4ee8ae1820c9fc8fc0abcebde144f2bdccf81fb517","abstract_canon_sha256":"2b123df133aae4466bb02b3da5f02da7b810ede57b9b3396a3832a692478e1bc"},"schema_version":"1.0"},"canonical_sha256":"dee8a81d19683c3bd6a7fe9ef7b7683cc53f2ac38eff4f1297176b9e411d3a9e","source":{"kind":"arxiv","id":"1103.2651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2651","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2651v2","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2651","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"33UKQHIZNA6D","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"33UKQHIZNA6DXVVH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"33UKQHIZ","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:33UKQHIZNA6DXVVH72PPPN3IHT","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-14T12:50:48Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"df76429b078ca53f61fb1a4ee8ae1820c9fc8fc0abcebde144f2bdccf81fb517","abstract_canon_sha256":"2b123df133aae4466bb02b3da5f02da7b810ede57b9b3396a3832a692478e1bc"},"schema_version":"1.0"},"canonical_sha256":"dee8a81d19683c3bd6a7fe9ef7b7683cc53f2ac38eff4f1297176b9e411d3a9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:19.448024Z","signature_b64":"OHklywrUcd7STcA95kil72f4pXQwfLLJZXMhGbL2A+UOmIZFbFCeO+liXCmGmBKAQx+nOb3xYW5pGCPTrg4bBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee8a81d19683c3bd6a7fe9ef7b7683cc53f2ac38eff4f1297176b9e411d3a9e","last_reissued_at":"2026-05-18T02:22:19.447412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:19.447412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2651","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-18T02:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2eCpxzRX28Y8y9Cy2MskV2F9x1j1USRdV4Xrt3WvSHLX/OJO48F4ky50GT1I67eTIBDoG1lLebQYacqb7GNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:16:35.782241Z"},"content_sha256":"a309e87d6741af1b16e93a857c293c94cf695defc6e5572e1610838acc8f51f5","schema_version":"1.0","event_id":"sha256:a309e87d6741af1b16e93a857c293c94cf695defc6e5572e1610838acc8f51f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:33UKQHIZNA6DXVVH72PPPN3IHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Continual Top-$k$ Keyword Search in Relational Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Yanwei Xu","submitted_at":"2011-03-14T12:50:48Z","abstract_excerpt":"Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying data schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term interests on specific topics. To deal with such a situation, it is necessary to build effective and efficient facility in database systems to support continual keyword queries evaluation.\n  In this paper, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2651","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-18T02:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pn9114OQtFOo1bVkMr8a+ee3a/8aT2INgLSeucxNSuSyxMWpYoAkxMIzrHiXmPYrzAVvboR9fDpjCBfcbpxpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:16:35.782911Z"},"content_sha256":"f2c926fa11631277c0fd72dd951d3d2381eaf5739e76f59e0f6da0d4267d1f29","schema_version":"1.0","event_id":"sha256:f2c926fa11631277c0fd72dd951d3d2381eaf5739e76f59e0f6da0d4267d1f29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33UKQHIZNA6DXVVH72PPPN3IHT/bundle.json","state_url":"https://pith.science/pith/33UKQHIZNA6DXVVH72PPPN3IHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33UKQHIZNA6DXVVH72PPPN3IHT/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-06-09T09:16:35Z","links":{"resolver":"https://pith.science/pith/33UKQHIZNA6DXVVH72PPPN3IHT","bundle":"https://pith.science/pith/33UKQHIZNA6DXVVH72PPPN3IHT/bundle.json","state":"https://pith.science/pith/33UKQHIZNA6DXVVH72PPPN3IHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33UKQHIZNA6DXVVH72PPPN3IHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:33UKQHIZNA6DXVVH72PPPN3IHT","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":"2b123df133aae4466bb02b3da5f02da7b810ede57b9b3396a3832a692478e1bc","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-14T12:50:48Z","title_canon_sha256":"df76429b078ca53f61fb1a4ee8ae1820c9fc8fc0abcebde144f2bdccf81fb517"},"schema_version":"1.0","source":{"id":"1103.2651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2651","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2651v2","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2651","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"33UKQHIZNA6D","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"33UKQHIZNA6DXVVH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"33UKQHIZ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:f2c926fa11631277c0fd72dd951d3d2381eaf5739e76f59e0f6da0d4267d1f29","target":"graph","created_at":"2026-05-18T02:22:19Z","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 in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying data schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term interests on specific topics. To deal with such a situation, it is necessary to build effective and efficient facility in database systems to support continual keyword queries evaluation.\n  In this paper, we p","authors_text":"Yanwei Xu","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-14T12:50:48Z","title":"Efficient Continual Top-$k$ Keyword Search in Relational Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2651","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:a309e87d6741af1b16e93a857c293c94cf695defc6e5572e1610838acc8f51f5","target":"record","created_at":"2026-05-18T02:22:19Z","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":"2b123df133aae4466bb02b3da5f02da7b810ede57b9b3396a3832a692478e1bc","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-03-14T12:50:48Z","title_canon_sha256":"df76429b078ca53f61fb1a4ee8ae1820c9fc8fc0abcebde144f2bdccf81fb517"},"schema_version":"1.0","source":{"id":"1103.2651","kind":"arxiv","version":2}},"canonical_sha256":"dee8a81d19683c3bd6a7fe9ef7b7683cc53f2ac38eff4f1297176b9e411d3a9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dee8a81d19683c3bd6a7fe9ef7b7683cc53f2ac38eff4f1297176b9e411d3a9e","first_computed_at":"2026-05-18T02:22:19.447412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:19.447412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OHklywrUcd7STcA95kil72f4pXQwfLLJZXMhGbL2A+UOmIZFbFCeO+liXCmGmBKAQx+nOb3xYW5pGCPTrg4bBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:19.448024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a309e87d6741af1b16e93a857c293c94cf695defc6e5572e1610838acc8f51f5","sha256:f2c926fa11631277c0fd72dd951d3d2381eaf5739e76f59e0f6da0d4267d1f29"],"state_sha256":"e22cdd231f142091047fad67ad06ce17a9b0628ffb0c115cfe941f9bbd853de0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUQJNvZMLk7MgM+yW3EVCUYZ0YgGc7I/98+tmu5tVArZ9EQOxHla8JEWIKN7UdIEf4wvSrAZSBzYAoPiZtYGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:16:35.786239Z","bundle_sha256":"04e235d7da7cd3819a9907f9a1ff3472439ac00aa39966dd653c736fed9f2159"}}