{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5LGX7SYGOHDWVXZE5XVAK7MTH3","short_pith_number":"pith:5LGX7SYG","canonical_record":{"source":{"id":"1903.11203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-27T00:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"470f3b49c1d7b6e757058b88677f976353c757bcbb61c5bf861bc34a10d950d9","abstract_canon_sha256":"d69dd03d39434e0d6f7b956f1a7394a1411a9a7bbc59367041e66a15d9bd114c"},"schema_version":"1.0"},"canonical_sha256":"eacd7fcb0671c76adf24edea057d933eeae3d8878b5aa68035c7f9be12bd3b9d","source":{"kind":"arxiv","id":"1903.11203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11203","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11203v2","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11203","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"5LGX7SYGOHDW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LGX7SYGOHDWVXZE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LGX7SYG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5LGX7SYGOHDWVXZE5XVAK7MTH3","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-27T00:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"470f3b49c1d7b6e757058b88677f976353c757bcbb61c5bf861bc34a10d950d9","abstract_canon_sha256":"d69dd03d39434e0d6f7b956f1a7394a1411a9a7bbc59367041e66a15d9bd114c"},"schema_version":"1.0"},"canonical_sha256":"eacd7fcb0671c76adf24edea057d933eeae3d8878b5aa68035c7f9be12bd3b9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:38.352767Z","signature_b64":"xncMa3VHz11I1w8ZpqWwvKd7scn7GOqaqzGtCsq+HQPi7OOFSOnLJ6UwP1Hd41aIwzidZC53ZDO3qoa9TpKnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eacd7fcb0671c76adf24edea057d933eeae3d8878b5aa68035c7f9be12bd3b9d","last_reissued_at":"2026-05-17T23:49:38.352228Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:38.352228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11203","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-17T23:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPtnXL+JX5KXnvQXbqUEj9q/sCpJRJN34Gs9K85WFMWGduFq6nZ4v+JpehTNjCA6eCPq+BrEtmb6xYxYwaXcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:34:17.664853Z"},"content_sha256":"f3a69285ec76c0fba443e6c7b89fa0793d6411d7ca209f69c7ff7435bb6825f9","schema_version":"1.0","event_id":"sha256:f3a69285ec76c0fba443e6c7b89fa0793d6411d7ca209f69c7ff7435bb6825f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5LGX7SYGOHDWVXZE5XVAK7MTH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jia Yu, Richard Sidle, Ronald Barber, Yingjun Wu, Yuanyuan Tian","submitted_at":"2019-03-27T00:44:43Z","abstract_excerpt":"Database administrators construct secondary indexes on data tables to accelerate query processing in relational database management systems (RDBMSs). These indexes are built on top of the most frequently queried columns according to the data statistics. Unfortunately, maintaining multiple secondary indexes in the same database can be extremely space consuming, causing significant performance degradation due to the potential exhaustion of memory space. In this paper, we demonstrate that there exist many opportunities to exploit column correlations for accelerating data access. We propose HERMIT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11203","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-17T23:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDMy80AAINQAoX4FIfZvlKLwIKaVaah9OqLId45OP05w47b/xi3+rqR3ZOrV/lkrTn8zj6/rw3POWdgwPmbNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:34:17.665194Z"},"content_sha256":"bae7d22f401e4388ce5b739945df6f30c1435875c4980f530255cafdfdb1fd27","schema_version":"1.0","event_id":"sha256:bae7d22f401e4388ce5b739945df6f30c1435875c4980f530255cafdfdb1fd27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3/bundle.json","state_url":"https://pith.science/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3/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-02T12:34:17Z","links":{"resolver":"https://pith.science/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3","bundle":"https://pith.science/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3/bundle.json","state":"https://pith.science/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LGX7SYGOHDWVXZE5XVAK7MTH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5LGX7SYGOHDWVXZE5XVAK7MTH3","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":"d69dd03d39434e0d6f7b956f1a7394a1411a9a7bbc59367041e66a15d9bd114c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-27T00:44:43Z","title_canon_sha256":"470f3b49c1d7b6e757058b88677f976353c757bcbb61c5bf861bc34a10d950d9"},"schema_version":"1.0","source":{"id":"1903.11203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11203","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11203v2","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11203","created_at":"2026-05-17T23:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"5LGX7SYGOHDW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LGX7SYGOHDWVXZE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LGX7SYG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:bae7d22f401e4388ce5b739945df6f30c1435875c4980f530255cafdfdb1fd27","target":"graph","created_at":"2026-05-17T23:49:38Z","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":"Database administrators construct secondary indexes on data tables to accelerate query processing in relational database management systems (RDBMSs). These indexes are built on top of the most frequently queried columns according to the data statistics. Unfortunately, maintaining multiple secondary indexes in the same database can be extremely space consuming, causing significant performance degradation due to the potential exhaustion of memory space. In this paper, we demonstrate that there exist many opportunities to exploit column correlations for accelerating data access. We propose HERMIT","authors_text":"Jia Yu, Richard Sidle, Ronald Barber, Yingjun Wu, Yuanyuan Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-27T00:44:43Z","title":"Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11203","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:f3a69285ec76c0fba443e6c7b89fa0793d6411d7ca209f69c7ff7435bb6825f9","target":"record","created_at":"2026-05-17T23:49:38Z","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":"d69dd03d39434e0d6f7b956f1a7394a1411a9a7bbc59367041e66a15d9bd114c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-27T00:44:43Z","title_canon_sha256":"470f3b49c1d7b6e757058b88677f976353c757bcbb61c5bf861bc34a10d950d9"},"schema_version":"1.0","source":{"id":"1903.11203","kind":"arxiv","version":2}},"canonical_sha256":"eacd7fcb0671c76adf24edea057d933eeae3d8878b5aa68035c7f9be12bd3b9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eacd7fcb0671c76adf24edea057d933eeae3d8878b5aa68035c7f9be12bd3b9d","first_computed_at":"2026-05-17T23:49:38.352228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:38.352228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xncMa3VHz11I1w8ZpqWwvKd7scn7GOqaqzGtCsq+HQPi7OOFSOnLJ6UwP1Hd41aIwzidZC53ZDO3qoa9TpKnDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:38.352767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3a69285ec76c0fba443e6c7b89fa0793d6411d7ca209f69c7ff7435bb6825f9","sha256:bae7d22f401e4388ce5b739945df6f30c1435875c4980f530255cafdfdb1fd27"],"state_sha256":"0de78778f02e2ec4be4a245d32b4544ea8ffabddbe153c37cdc807f4a0f25d90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ykPZS4xGoTAeol//DTI0npE9pn5l2YTb0UBT8Cv6ZHtcXUvngDFbp66WLw6Uu/WqKrv2v+mNej2OpzHTHN/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:34:17.667139Z","bundle_sha256":"c7c170e9a27074984bccf8fbda006b876e93e66b90458d37bd6cb4d9438d0245"}}