{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5YFRJS6ROLAEYEWYO7QLBQ4JYH","short_pith_number":"pith:5YFRJS6R","canonical_record":{"source":{"id":"1108.4516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-23T07:52:52Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"511733cd0eb6fb01c9967caab493ded85a0c62eb62824321d3e9a10145a0e7b6","abstract_canon_sha256":"cc7b664b2d3c6136d2968fafec1a4770265902847b531080b934bca88b700b91"},"schema_version":"1.0"},"canonical_sha256":"ee0b14cbd172c04c12d877e0b0c389c1d67e93179cfc8fa54cdbb417aa86938b","source":{"kind":"arxiv","id":"1108.4516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4516","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4516v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4516","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"5YFRJS6ROLAE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5YFRJS6ROLAEYEWY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5YFRJS6R","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5YFRJS6ROLAEYEWYO7QLBQ4JYH","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-23T07:52:52Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"511733cd0eb6fb01c9967caab493ded85a0c62eb62824321d3e9a10145a0e7b6","abstract_canon_sha256":"cc7b664b2d3c6136d2968fafec1a4770265902847b531080b934bca88b700b91"},"schema_version":"1.0"},"canonical_sha256":"ee0b14cbd172c04c12d877e0b0c389c1d67e93179cfc8fa54cdbb417aa86938b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:54.361403Z","signature_b64":"Pi/Hu3QT0QeWnMyxDDA2PzUHcpnRq/9Be2Gh2xgGfjOIRz8jSUIe+/78a0x87sVOUHlboF6/1LtzmqwohxvLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee0b14cbd172c04c12d877e0b0c389c1d67e93179cfc8fa54cdbb417aa86938b","last_reissued_at":"2026-05-18T04:14:54.360700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:54.360700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4516","source_version":1,"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-18T04:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnCu99DUgqoDh/YWqXr1VA4uCRZL17emLiam6J2NXbqoGxHDmF2sSE0yiVpZ4dFp5VHZJ2VQg2bVbn8U3GoMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:18:17.247630Z"},"content_sha256":"4eb21d16acb8ad96c80c1ebbd82684fc474f8519ace75447794d50fcebf685b2","schema_version":"1.0","event_id":"sha256:4eb21d16acb8ad96c80c1ebbd82684fc474f8519ace75447794d50fcebf685b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5YFRJS6ROLAEYEWYO7QLBQ4JYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable 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-08-23T07:52:52Z","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 database 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 a database system to support continual keyword queries.\n  In this paper, we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4516","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"},"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-18T04:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wi9i7t1tGF0bCMRzyFa5kWJTPDPxwbWa4ip8iscRm+wK0nUmEofSudz3psd7m9OaCSoeHBI7LsBan1OBI0vwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:18:17.248285Z"},"content_sha256":"9741fdd51fbe9fdec3e8be733d559364ef62908acb03f84b7310362d5d9eeffc","schema_version":"1.0","event_id":"sha256:9741fdd51fbe9fdec3e8be733d559364ef62908acb03f84b7310362d5d9eeffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH/bundle.json","state_url":"https://pith.science/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH/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-09T06:18:17Z","links":{"resolver":"https://pith.science/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH","bundle":"https://pith.science/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH/bundle.json","state":"https://pith.science/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YFRJS6ROLAEYEWYO7QLBQ4JYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5YFRJS6ROLAEYEWYO7QLBQ4JYH","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":"cc7b664b2d3c6136d2968fafec1a4770265902847b531080b934bca88b700b91","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-23T07:52:52Z","title_canon_sha256":"511733cd0eb6fb01c9967caab493ded85a0c62eb62824321d3e9a10145a0e7b6"},"schema_version":"1.0","source":{"id":"1108.4516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4516","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4516v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4516","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"5YFRJS6ROLAE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5YFRJS6ROLAEYEWY","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5YFRJS6R","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:9741fdd51fbe9fdec3e8be733d559364ef62908acb03f84b7310362d5d9eeffc","target":"graph","created_at":"2026-05-18T04:14:54Z","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 database 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 a database system to support continual keyword queries.\n  In this paper, we propose","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-08-23T07:52:52Z","title":"Scalable Continual Top-k Keyword Search in Relational Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4516","kind":"arxiv","version":1},"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:4eb21d16acb8ad96c80c1ebbd82684fc474f8519ace75447794d50fcebf685b2","target":"record","created_at":"2026-05-18T04:14:54Z","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":"cc7b664b2d3c6136d2968fafec1a4770265902847b531080b934bca88b700b91","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-08-23T07:52:52Z","title_canon_sha256":"511733cd0eb6fb01c9967caab493ded85a0c62eb62824321d3e9a10145a0e7b6"},"schema_version":"1.0","source":{"id":"1108.4516","kind":"arxiv","version":1}},"canonical_sha256":"ee0b14cbd172c04c12d877e0b0c389c1d67e93179cfc8fa54cdbb417aa86938b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee0b14cbd172c04c12d877e0b0c389c1d67e93179cfc8fa54cdbb417aa86938b","first_computed_at":"2026-05-18T04:14:54.360700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:54.360700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pi/Hu3QT0QeWnMyxDDA2PzUHcpnRq/9Be2Gh2xgGfjOIRz8jSUIe+/78a0x87sVOUHlboF6/1LtzmqwohxvLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:54.361403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4eb21d16acb8ad96c80c1ebbd82684fc474f8519ace75447794d50fcebf685b2","sha256:9741fdd51fbe9fdec3e8be733d559364ef62908acb03f84b7310362d5d9eeffc"],"state_sha256":"0854be1e7bb467e8297d39330c8c62a58f57347fe192c0c13e9d8eaa698f0bcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+W3MqHeXdycTYyXn1LaDf7hHHO56Lkofr4SjfMIc2u/0sFEB1g7xHraYP1PrHnlSeDJfZH1dWxS1AkG9a+qDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:18:17.251891Z","bundle_sha256":"2153bc0fcccf100bcb12f0d55481dd138161392ebf5fcc3f7b53b6cc454203f9"}}