{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3DC6CUVGCQH5BH2WMGXJN6A5ZH","short_pith_number":"pith:3DC6CUVG","canonical_record":{"source":{"id":"1811.06678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-16T05:12:28Z","cross_cats_sorted":[],"title_canon_sha256":"5038249a0a379cffa81f03e10769deee668837680435d0f092335655212584f6","abstract_canon_sha256":"34c4689c18311671f8ec458bbbfbe79b320a9606694757cfe0d61d310893d3a2"},"schema_version":"1.0"},"canonical_sha256":"d8c5e152a6140fd09f5661ae96f81dc9c3c1c8d4aac15687bed618df5de6b5c9","source":{"kind":"arxiv","id":"1811.06678","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06678","created_at":"2026-05-17T23:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06678v2","created_at":"2026-05-17T23:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06678","created_at":"2026-05-17T23:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"3DC6CUVGCQH5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3DC6CUVGCQH5BH2W","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3DC6CUVG","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3DC6CUVGCQH5BH2WMGXJN6A5ZH","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-16T05:12:28Z","cross_cats_sorted":[],"title_canon_sha256":"5038249a0a379cffa81f03e10769deee668837680435d0f092335655212584f6","abstract_canon_sha256":"34c4689c18311671f8ec458bbbfbe79b320a9606694757cfe0d61d310893d3a2"},"schema_version":"1.0"},"canonical_sha256":"d8c5e152a6140fd09f5661ae96f81dc9c3c1c8d4aac15687bed618df5de6b5c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:19.131610Z","signature_b64":"tlkeTPRN3Qza7NrJtXnn/9aCG2xxEn4UCyznUGu5tm8HR3C3sVjl8+bMcBx2GA3Hc/4JlmjJwe4QO8wH3LOtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8c5e152a6140fd09f5661ae96f81dc9c3c1c8d4aac15687bed618df5de6b5c9","last_reissued_at":"2026-05-17T23:55:19.131104Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:19.131104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06678","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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PjxM0tDtCorkprq3xQ3E0l+lzqP8xRAruWIviZyOKJyT4ny9rR/dY03M+Tfl/vlYdAv9qH/qprOaOKdmVvZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:26:26.299153Z"},"content_sha256":"a7d026d1e10964fd57939f31d2b91c7221cb260004518bab3c16b7c3eb71ef24","schema_version":"1.0","event_id":"sha256:a7d026d1e10964fd57939f31d2b91c7221cb260004518bab3c16b7c3eb71ef24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3DC6CUVGCQH5BH2WMGXJN6A5ZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Potential of Learned Index Structures for Index Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Harrie Oosterhuis, J. Shane Culpepper, Maarten de Rijke","submitted_at":"2018-11-16T05:12:28Z","abstract_excerpt":"Inverted indexes are vital in providing fast key-word-based search. For every term in the document collection, a list of identifiers of documents in which the term appears is stored, along with auxiliary information such as term frequency, and position offsets. While very effective, inverted indexes have large memory requirements for web-sized collections. Recently, the concept of learned index structures was introduced, where machine learned models replace common index structures such as B-tree-indexes, hash-indexes, and bloom-filters. These learned index structures require less memory, and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06678","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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RISHIindEWdZljZSr9VUxvH81mWO/04oIhdTX3TOMiIyoQVLXl5BaSoUNXbUjHRKYS8gjWR6umWgIvBsZG/gAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:26:26.299518Z"},"content_sha256":"7614b67cde92d782321c3d88b43bf4e20bfc2de2f1d3d5128f199229c463248d","schema_version":"1.0","event_id":"sha256:7614b67cde92d782321c3d88b43bf4e20bfc2de2f1d3d5128f199229c463248d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH/bundle.json","state_url":"https://pith.science/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH/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-05T15:26:26Z","links":{"resolver":"https://pith.science/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH","bundle":"https://pith.science/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH/bundle.json","state":"https://pith.science/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DC6CUVGCQH5BH2WMGXJN6A5ZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3DC6CUVGCQH5BH2WMGXJN6A5ZH","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":"34c4689c18311671f8ec458bbbfbe79b320a9606694757cfe0d61d310893d3a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-16T05:12:28Z","title_canon_sha256":"5038249a0a379cffa81f03e10769deee668837680435d0f092335655212584f6"},"schema_version":"1.0","source":{"id":"1811.06678","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06678","created_at":"2026-05-17T23:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06678v2","created_at":"2026-05-17T23:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06678","created_at":"2026-05-17T23:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"3DC6CUVGCQH5","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3DC6CUVGCQH5BH2W","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3DC6CUVG","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:7614b67cde92d782321c3d88b43bf4e20bfc2de2f1d3d5128f199229c463248d","target":"graph","created_at":"2026-05-17T23:55: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":"Inverted indexes are vital in providing fast key-word-based search. For every term in the document collection, a list of identifiers of documents in which the term appears is stored, along with auxiliary information such as term frequency, and position offsets. While very effective, inverted indexes have large memory requirements for web-sized collections. Recently, the concept of learned index structures was introduced, where machine learned models replace common index structures such as B-tree-indexes, hash-indexes, and bloom-filters. These learned index structures require less memory, and c","authors_text":"Harrie Oosterhuis, J. Shane Culpepper, Maarten de Rijke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-16T05:12:28Z","title":"The Potential of Learned Index Structures for Index Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06678","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:a7d026d1e10964fd57939f31d2b91c7221cb260004518bab3c16b7c3eb71ef24","target":"record","created_at":"2026-05-17T23:55: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":"34c4689c18311671f8ec458bbbfbe79b320a9606694757cfe0d61d310893d3a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-16T05:12:28Z","title_canon_sha256":"5038249a0a379cffa81f03e10769deee668837680435d0f092335655212584f6"},"schema_version":"1.0","source":{"id":"1811.06678","kind":"arxiv","version":2}},"canonical_sha256":"d8c5e152a6140fd09f5661ae96f81dc9c3c1c8d4aac15687bed618df5de6b5c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8c5e152a6140fd09f5661ae96f81dc9c3c1c8d4aac15687bed618df5de6b5c9","first_computed_at":"2026-05-17T23:55:19.131104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:19.131104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tlkeTPRN3Qza7NrJtXnn/9aCG2xxEn4UCyznUGu5tm8HR3C3sVjl8+bMcBx2GA3Hc/4JlmjJwe4QO8wH3LOtAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:19.131610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06678","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7d026d1e10964fd57939f31d2b91c7221cb260004518bab3c16b7c3eb71ef24","sha256:7614b67cde92d782321c3d88b43bf4e20bfc2de2f1d3d5128f199229c463248d"],"state_sha256":"b72c7502b936aa5e9d6f807f0784c53aaef74ac5c0691494c16e79d205e453fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3okld4AqR85WHGTEXIb1bBUNQ9bwtpH+evvGvKF2TLVRzw33Nx1ql4M6I3b9+cHnbOoBp931ybj1oKlalX55BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:26:26.301557Z","bundle_sha256":"1547361ee52b59260a346093ff9b49e1c5c30613d7de0ae5451b72e985fe4e9d"}}