{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HRQ3BRV6DWLRC3OTSYJL4A75YW","short_pith_number":"pith:HRQ3BRV6","canonical_record":{"source":{"id":"2508.03471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-05T14:05:40Z","cross_cats_sorted":[],"title_canon_sha256":"0b878318db6771197fc73d501fc3f2f9db1c1b376688ea9b90aa0531ca42570c","abstract_canon_sha256":"f732b7104439b0ede6a1357ff446291fd6a992477a883b338366b5ccbbf9a139"},"schema_version":"1.0"},"canonical_sha256":"3c61b0c6be1d97116dd39612be03fdc58e65376fcf3acf0f79fb124711f642d4","source":{"kind":"arxiv","id":"2508.03471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03471","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03471v1","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03471","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"pith_short_12","alias_value":"HRQ3BRV6DWLR","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"pith_short_16","alias_value":"HRQ3BRV6DWLRC3OT","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"pith_short_8","alias_value":"HRQ3BRV6","created_at":"2026-07-05T11:48:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HRQ3BRV6DWLRC3OTSYJL4A75YW","target":"record","payload":{"canonical_record":{"source":{"id":"2508.03471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-05T14:05:40Z","cross_cats_sorted":[],"title_canon_sha256":"0b878318db6771197fc73d501fc3f2f9db1c1b376688ea9b90aa0531ca42570c","abstract_canon_sha256":"f732b7104439b0ede6a1357ff446291fd6a992477a883b338366b5ccbbf9a139"},"schema_version":"1.0"},"canonical_sha256":"3c61b0c6be1d97116dd39612be03fdc58e65376fcf3acf0f79fb124711f642d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:56.915648Z","signature_b64":"MrWSuTC4BqVpBonPShA0+hMIgyX9Ya1tYYJG6GszQp/XwGA68amWhaO5u7+bre+a94Stoz8H7UxqL6pcFz/PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c61b0c6be1d97116dd39612be03fdc58e65376fcf3acf0f79fb124711f642d4","last_reissued_at":"2026-07-05T11:48:56.915165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:56.915165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.03471","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-07-05T11:48:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Kb6Aj4ra9FXCHz9WahCiNlG6a6WIPD+1egR25QMLnxruzWfvNaXAVwoClLMVjULg+KGVw91FJGn2KLOnrhhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:17:06.037752Z"},"content_sha256":"fe804953ec840b4b4710d14d622012ff64c7db91a96425fc987ea504011e924c","schema_version":"1.0","event_id":"sha256:fe804953ec840b4b4710d14d622012ff64c7db91a96425fc987ea504011e924c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HRQ3BRV6DWLRC3OTSYJL4A75YW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learned Adaptive Indexing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Suprio Ray, Suvam Kumar Das","submitted_at":"2025-08-05T14:05:40Z","abstract_excerpt":"Indexes can significantly improve search performance in relational databases. However, if the query workload changes frequently or new data updates occur continuously, it may not be worthwhile to build a conventional index upfront for query processing. Adaptive indexing is a technique in which an index gets built on the fly as a byproduct of query processing. In recent years, research in database indexing has taken a new direction where machine learning models are employed for the purpose of indexing. These indexes, known as learned indexes, can be more efficient compared to traditional indexe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03471","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.03471/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:48:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNU218sM/Ep4ER9T4QhYWfvj3P/p2tJJQM2RJIrN+nxeEYiUpe0yDJBI/9DSYkq14zts2ILyZNWWgak0qUSFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:17:06.038278Z"},"content_sha256":"31263865133b1357c9b6de5cb2e4a6c178d51f2498728d780eb5b1998dfe7100","schema_version":"1.0","event_id":"sha256:31263865133b1357c9b6de5cb2e4a6c178d51f2498728d780eb5b1998dfe7100"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW/bundle.json","state_url":"https://pith.science/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW/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-08-05T23:17:06Z","links":{"resolver":"https://pith.science/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW","bundle":"https://pith.science/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW/bundle.json","state":"https://pith.science/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRQ3BRV6DWLRC3OTSYJL4A75YW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HRQ3BRV6DWLRC3OTSYJL4A75YW","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":"f732b7104439b0ede6a1357ff446291fd6a992477a883b338366b5ccbbf9a139","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-05T14:05:40Z","title_canon_sha256":"0b878318db6771197fc73d501fc3f2f9db1c1b376688ea9b90aa0531ca42570c"},"schema_version":"1.0","source":{"id":"2508.03471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03471","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03471v1","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03471","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"pith_short_12","alias_value":"HRQ3BRV6DWLR","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"pith_short_16","alias_value":"HRQ3BRV6DWLRC3OT","created_at":"2026-07-05T11:48:56Z"},{"alias_kind":"pith_short_8","alias_value":"HRQ3BRV6","created_at":"2026-07-05T11:48:56Z"}],"graph_snapshots":[{"event_id":"sha256:31263865133b1357c9b6de5cb2e4a6c178d51f2498728d780eb5b1998dfe7100","target":"graph","created_at":"2026-07-05T11:48:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.03471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Indexes can significantly improve search performance in relational databases. However, if the query workload changes frequently or new data updates occur continuously, it may not be worthwhile to build a conventional index upfront for query processing. Adaptive indexing is a technique in which an index gets built on the fly as a byproduct of query processing. In recent years, research in database indexing has taken a new direction where machine learning models are employed for the purpose of indexing. These indexes, known as learned indexes, can be more efficient compared to traditional indexe","authors_text":"Suprio Ray, Suvam Kumar Das","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-05T14:05:40Z","title":"Learned Adaptive Indexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03471","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:fe804953ec840b4b4710d14d622012ff64c7db91a96425fc987ea504011e924c","target":"record","created_at":"2026-07-05T11:48:56Z","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":"f732b7104439b0ede6a1357ff446291fd6a992477a883b338366b5ccbbf9a139","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-08-05T14:05:40Z","title_canon_sha256":"0b878318db6771197fc73d501fc3f2f9db1c1b376688ea9b90aa0531ca42570c"},"schema_version":"1.0","source":{"id":"2508.03471","kind":"arxiv","version":1}},"canonical_sha256":"3c61b0c6be1d97116dd39612be03fdc58e65376fcf3acf0f79fb124711f642d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c61b0c6be1d97116dd39612be03fdc58e65376fcf3acf0f79fb124711f642d4","first_computed_at":"2026-07-05T11:48:56.915165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:56.915165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrWSuTC4BqVpBonPShA0+hMIgyX9Ya1tYYJG6GszQp/XwGA68amWhaO5u7+bre+a94Stoz8H7UxqL6pcFz/PCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:56.915648Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.03471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe804953ec840b4b4710d14d622012ff64c7db91a96425fc987ea504011e924c","sha256:31263865133b1357c9b6de5cb2e4a6c178d51f2498728d780eb5b1998dfe7100"],"state_sha256":"df9a503bc3ef986213a1103187d888bffe494c3aacece7a13915f5dbd18db296"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2cnhbjq0W4Shdv4Hep7G9w3eHqXVBO6VWVMW7Y+4D3dEneENsleXvWQmRUkytdN2DNx4pWNKj6welpGzyNeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:17:06.043322Z","bundle_sha256":"3e6d9d31775832b2b6b27f6e13490f57b36496dd1d13b99c2e26d5d40062ce48"}}