{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2BCTC7HFQEX54DF43TBQIGYOMJ","short_pith_number":"pith:2BCTC7HF","canonical_record":{"source":{"id":"1605.07865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-25T12:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"a8f3918efa27bccb337f7002832e9e9c6e148ec26e87cad01744faebc593b2dd","abstract_canon_sha256":"e54635c88c36dd1043733ef566ab000064341561ae951ff0d5a9fdf5a654d3b9"},"schema_version":"1.0"},"canonical_sha256":"d045317ce5812fde0cbcdcc3041b0e626a0b42cd62d367c4cb8b9f4780ba0233","source":{"kind":"arxiv","id":"1605.07865","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07865","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07865v2","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07865","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"2BCTC7HFQEX5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2BCTC7HFQEX54DF4","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2BCTC7HF","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2BCTC7HFQEX54DF43TBQIGYOMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-25T12:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"a8f3918efa27bccb337f7002832e9e9c6e148ec26e87cad01744faebc593b2dd","abstract_canon_sha256":"e54635c88c36dd1043733ef566ab000064341561ae951ff0d5a9fdf5a654d3b9"},"schema_version":"1.0"},"canonical_sha256":"d045317ce5812fde0cbcdcc3041b0e626a0b42cd62d367c4cb8b9f4780ba0233","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:05.805248Z","signature_b64":"HT9mJEZHleEkkEuKzSKi/X5uOtBGCZbaOmAUpVHJIairHKYfjz+zCQTfFpVjtBgQ4H+B/4SS2KJI67p0KTTsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d045317ce5812fde0cbcdcc3041b0e626a0b42cd62d367c4cb8b9f4780ba0233","last_reissued_at":"2026-05-18T01:00:05.804750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:05.804750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07865","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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8xGVUTyWpCmAKeqnMwDFsFM/ZnOKV6YVqB+wVnupAc77/iXjMbthgFsZde6/PJ0y/gsAy4pINXnmAUthCS0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:51:01.566488Z"},"content_sha256":"cd4f7479c7dc4dce1789d469555fe39dc1ccf4eda249032db5018e5bcec5a02b","schema_version":"1.0","event_id":"sha256:cd4f7479c7dc4dce1789d469555fe39dc1ccf4eda249032db5018e5bcec5a02b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2BCTC7HFQEX54DF43TBQIGYOMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Data Graphs for Keyword Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Konstantin Golenberg, Yehoshua Sagiv","submitted_at":"2016-05-25T12:59:37Z","abstract_excerpt":"A data graph is a convenient paradigm for supporting keyword search that takes into account available semantic structure and not just textual relevance. However, the problem of constructing data graphs that facilitate both efficiency and effectiveness of the underlying system has hardly been addressed. A conceptual model for this task is proposed. Principles for constructing good data graphs are explained. Transformations for generating data graphs from RDB and XML are developed. The results obtained from these transformations are analyzed. It is shown that XML is a better starting point for g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07865","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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0ZR4x3PkkTFKNPnFh9x275i4XPwNzflrgfcMarqr5PebHI/SfRVdG9QKcytxEhY/qODfWHqXxQAUqm7hvVrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:51:01.566835Z"},"content_sha256":"278a72a2543077f50f30fa964e3752e534a4796dfabce40dffc801943c3cc295","schema_version":"1.0","event_id":"sha256:278a72a2543077f50f30fa964e3752e534a4796dfabce40dffc801943c3cc295"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BCTC7HFQEX54DF43TBQIGYOMJ/bundle.json","state_url":"https://pith.science/pith/2BCTC7HFQEX54DF43TBQIGYOMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BCTC7HFQEX54DF43TBQIGYOMJ/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-03T12:51:01Z","links":{"resolver":"https://pith.science/pith/2BCTC7HFQEX54DF43TBQIGYOMJ","bundle":"https://pith.science/pith/2BCTC7HFQEX54DF43TBQIGYOMJ/bundle.json","state":"https://pith.science/pith/2BCTC7HFQEX54DF43TBQIGYOMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BCTC7HFQEX54DF43TBQIGYOMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2BCTC7HFQEX54DF43TBQIGYOMJ","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":"e54635c88c36dd1043733ef566ab000064341561ae951ff0d5a9fdf5a654d3b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-25T12:59:37Z","title_canon_sha256":"a8f3918efa27bccb337f7002832e9e9c6e148ec26e87cad01744faebc593b2dd"},"schema_version":"1.0","source":{"id":"1605.07865","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07865","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07865v2","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07865","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"2BCTC7HFQEX5","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"2BCTC7HFQEX54DF4","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"2BCTC7HF","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:278a72a2543077f50f30fa964e3752e534a4796dfabce40dffc801943c3cc295","target":"graph","created_at":"2026-05-18T01:00:05Z","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":"A data graph is a convenient paradigm for supporting keyword search that takes into account available semantic structure and not just textual relevance. However, the problem of constructing data graphs that facilitate both efficiency and effectiveness of the underlying system has hardly been addressed. A conceptual model for this task is proposed. Principles for constructing good data graphs are explained. Transformations for generating data graphs from RDB and XML are developed. The results obtained from these transformations are analyzed. It is shown that XML is a better starting point for g","authors_text":"Konstantin Golenberg, Yehoshua Sagiv","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-25T12:59:37Z","title":"Constructing Data Graphs for Keyword Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07865","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:cd4f7479c7dc4dce1789d469555fe39dc1ccf4eda249032db5018e5bcec5a02b","target":"record","created_at":"2026-05-18T01:00:05Z","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":"e54635c88c36dd1043733ef566ab000064341561ae951ff0d5a9fdf5a654d3b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-25T12:59:37Z","title_canon_sha256":"a8f3918efa27bccb337f7002832e9e9c6e148ec26e87cad01744faebc593b2dd"},"schema_version":"1.0","source":{"id":"1605.07865","kind":"arxiv","version":2}},"canonical_sha256":"d045317ce5812fde0cbcdcc3041b0e626a0b42cd62d367c4cb8b9f4780ba0233","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d045317ce5812fde0cbcdcc3041b0e626a0b42cd62d367c4cb8b9f4780ba0233","first_computed_at":"2026-05-18T01:00:05.804750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:05.804750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HT9mJEZHleEkkEuKzSKi/X5uOtBGCZbaOmAUpVHJIairHKYfjz+zCQTfFpVjtBgQ4H+B/4SS2KJI67p0KTTsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:05.805248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07865","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd4f7479c7dc4dce1789d469555fe39dc1ccf4eda249032db5018e5bcec5a02b","sha256:278a72a2543077f50f30fa964e3752e534a4796dfabce40dffc801943c3cc295"],"state_sha256":"86f2a9a0472fd882e4e0cb54c46f4f6601a131f2c5ea2fe1a677e0dedd675254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bh7EU7EzF3J+NEtXCGDGSsAGO6566my8V2J0ZE5iKQ4DkW37bDZ02hxqz+0hRwnrh3742tNLqiCtPT3mAcq7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:51:01.568763Z","bundle_sha256":"9eed854dfbea205dc9edfec89b629b1ea584413c23f8a9b3583251fa18dd0e9e"}}