{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P7DC4DZ3SW2DJQUN7OXA764HBM","short_pith_number":"pith:P7DC4DZ3","canonical_record":{"source":{"id":"1604.03234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-12T03:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"693d25f2ad746354df0b3fbea4f2e5448abddf36d77c09ac6a71bdeb0fb78290","abstract_canon_sha256":"d9dd356089ab00d0314e1f63914644f32e934e5d4ce773a233620fc5f0f31c69"},"schema_version":"1.0"},"canonical_sha256":"7fc62e0f3b95b434c28dfbae0ffb870b3904aa1a7fe7d0ae425065c9b6e72e68","source":{"kind":"arxiv","id":"1604.03234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03234","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03234v1","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03234","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"P7DC4DZ3SW2D","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7DC4DZ3SW2DJQUN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7DC4DZ3","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P7DC4DZ3SW2DJQUN7OXA764HBM","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-12T03:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"693d25f2ad746354df0b3fbea4f2e5448abddf36d77c09ac6a71bdeb0fb78290","abstract_canon_sha256":"d9dd356089ab00d0314e1f63914644f32e934e5d4ce773a233620fc5f0f31c69"},"schema_version":"1.0"},"canonical_sha256":"7fc62e0f3b95b434c28dfbae0ffb870b3904aa1a7fe7d0ae425065c9b6e72e68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:16.009793Z","signature_b64":"YqisTAWYBddjKLDxOQ0e40ae4sR7nL3ekg7coO+t/TOpbi6PQlaAyDupC6wPdpcF/v04g6VOIxIbOY4GCWnjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fc62e0f3b95b434c28dfbae0ffb870b3904aa1a7fe7d0ae425065c9b6e72e68","last_reissued_at":"2026-05-18T01:17:16.009139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:16.009139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03234","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-18T01:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWPxkU9vW9OnQVam0go3lRggyoL4FGoa+yBge58K7VeQcMPgSrOPiOzVCN6Ae1678rwO70G/Pxhhs1XoC294DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:43:54.450663Z"},"content_sha256":"966148039628565566e118198a9095b8e96aac30b1572719822ccee2b11c1f9c","schema_version":"1.0","event_id":"sha256:966148039628565566e118198a9095b8e96aac30b1572719822ccee2b11c1f9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P7DC4DZ3SW2DJQUN7OXA764HBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hippo: A Fast, yet Scalable, Database Indexing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jia Yu, Mohamed Sarwat","submitted_at":"2016-04-12T03:41:17Z","abstract_excerpt":"Even though existing database indexes (e.g., B+-Tree) speed up the query execution, they suffer from two main drawbacks: (1) A database index usually yields 5% to 15% additional storage overhead which results in non-ignorable dollar cost in big data scenarios especially when deployed on modern storage devices like Solid State Disk (SSD) or Non-Volatile Memory (NVM). (2) Maintaining a database index incurs high latency because the DBMS has to find and update those index pages affected by the underlying table changes. This paper proposes Hippo a fast, yet scalable, database indexing approach. Hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03234","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-18T01:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExbhRkU69kpSFpyGeUhM6+UV+hRV+D0cCTwCFjb9fpy9BrwbqyVhrdNjSfhC93wRSWWGgT2Ik44kTp3amb6JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:43:54.451011Z"},"content_sha256":"e977f2a76bdd4fd03dd0c98fbc143b1a28171bfb6fa990f063e92e93c8dae04d","schema_version":"1.0","event_id":"sha256:e977f2a76bdd4fd03dd0c98fbc143b1a28171bfb6fa990f063e92e93c8dae04d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7DC4DZ3SW2DJQUN7OXA764HBM/bundle.json","state_url":"https://pith.science/pith/P7DC4DZ3SW2DJQUN7OXA764HBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7DC4DZ3SW2DJQUN7OXA764HBM/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-07-01T07:43:54Z","links":{"resolver":"https://pith.science/pith/P7DC4DZ3SW2DJQUN7OXA764HBM","bundle":"https://pith.science/pith/P7DC4DZ3SW2DJQUN7OXA764HBM/bundle.json","state":"https://pith.science/pith/P7DC4DZ3SW2DJQUN7OXA764HBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7DC4DZ3SW2DJQUN7OXA764HBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P7DC4DZ3SW2DJQUN7OXA764HBM","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":"d9dd356089ab00d0314e1f63914644f32e934e5d4ce773a233620fc5f0f31c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-12T03:41:17Z","title_canon_sha256":"693d25f2ad746354df0b3fbea4f2e5448abddf36d77c09ac6a71bdeb0fb78290"},"schema_version":"1.0","source":{"id":"1604.03234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03234","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03234v1","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03234","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"P7DC4DZ3SW2D","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7DC4DZ3SW2DJQUN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7DC4DZ3","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:e977f2a76bdd4fd03dd0c98fbc143b1a28171bfb6fa990f063e92e93c8dae04d","target":"graph","created_at":"2026-05-18T01:17:16Z","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":"Even though existing database indexes (e.g., B+-Tree) speed up the query execution, they suffer from two main drawbacks: (1) A database index usually yields 5% to 15% additional storage overhead which results in non-ignorable dollar cost in big data scenarios especially when deployed on modern storage devices like Solid State Disk (SSD) or Non-Volatile Memory (NVM). (2) Maintaining a database index incurs high latency because the DBMS has to find and update those index pages affected by the underlying table changes. This paper proposes Hippo a fast, yet scalable, database indexing approach. Hi","authors_text":"Jia Yu, Mohamed Sarwat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-12T03:41:17Z","title":"Hippo: A Fast, yet Scalable, Database Indexing Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03234","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:966148039628565566e118198a9095b8e96aac30b1572719822ccee2b11c1f9c","target":"record","created_at":"2026-05-18T01:17:16Z","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":"d9dd356089ab00d0314e1f63914644f32e934e5d4ce773a233620fc5f0f31c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-12T03:41:17Z","title_canon_sha256":"693d25f2ad746354df0b3fbea4f2e5448abddf36d77c09ac6a71bdeb0fb78290"},"schema_version":"1.0","source":{"id":"1604.03234","kind":"arxiv","version":1}},"canonical_sha256":"7fc62e0f3b95b434c28dfbae0ffb870b3904aa1a7fe7d0ae425065c9b6e72e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fc62e0f3b95b434c28dfbae0ffb870b3904aa1a7fe7d0ae425065c9b6e72e68","first_computed_at":"2026-05-18T01:17:16.009139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:16.009139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YqisTAWYBddjKLDxOQ0e40ae4sR7nL3ekg7coO+t/TOpbi6PQlaAyDupC6wPdpcF/v04g6VOIxIbOY4GCWnjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:16.009793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:966148039628565566e118198a9095b8e96aac30b1572719822ccee2b11c1f9c","sha256:e977f2a76bdd4fd03dd0c98fbc143b1a28171bfb6fa990f063e92e93c8dae04d"],"state_sha256":"6f91b9d6d3457b70c8a6c843d1e60d6c849847c55eff193402a2d734b3478015"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tE9tsyo6TY2lkcrQOMEGKZLcBPK4I32pvRkBxksKW3Pjpg9bhQSRKDGRGuNCl1RRc2zNaBuWdTI8tyUNzsr+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:43:54.452917Z","bundle_sha256":"0c682b3174c647c6ac5bb46ded7ea0ea53ac257a448f235171f9f00a8d9874e2"}}