{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3VDYILYXLFLSGD3NPO2T34HUTG","short_pith_number":"pith:3VDYILYX","schema_version":"1.0","canonical_sha256":"dd47842f175957230f6d7bb53df0f499900b7a896d0dd3a4a52aa5760ed925dc","source":{"kind":"arxiv","id":"2403.12433","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Complexity Attacks on Dynamic Learned Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Evgenios M. Kornaropoulos, Rui Yang, Yue Cheng","submitted_at":"2024-03-19T04:46:56Z","abstract_excerpt":"Learned Index Structures (LIS) view a sorted index as a model that learns the data distribution, takes a data element key as input, and outputs the predicted position of the key. The original LIS can only handle lookup operations with no support for updates, rendering it impractical to use for typical workloads. To address this limitation, recent studies have focused on designing efficient dynamic learned indexes. ALEX, as the pioneering dynamic learned index structures, enables dynamism by incorporating a series of design choices, including adaptive key space partitioning, dynamic model retra"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.12433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-03-19T04:46:56Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"56bc57a5e224e73926a37a603364b0a91d3b5f6639fbaede654504fae5d46cfe","abstract_canon_sha256":"93ea3d39882979ddd99203a2615098db521def8d7c90ddd03cd9747265378ed4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:01.422920Z","signature_b64":"iU9BSoS7POlwxj+vMFphxtNDLi8xKvdGRxAYwyqIRshSwp0eJT5xecz9sW6SCy9wFLPEap8ZFsfspxQjReWfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd47842f175957230f6d7bb53df0f499900b7a896d0dd3a4a52aa5760ed925dc","last_reissued_at":"2026-07-05T07:58:01.422451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:01.422451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Complexity Attacks on Dynamic Learned Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Evgenios M. Kornaropoulos, Rui Yang, Yue Cheng","submitted_at":"2024-03-19T04:46:56Z","abstract_excerpt":"Learned Index Structures (LIS) view a sorted index as a model that learns the data distribution, takes a data element key as input, and outputs the predicted position of the key. The original LIS can only handle lookup operations with no support for updates, rendering it impractical to use for typical workloads. To address this limitation, recent studies have focused on designing efficient dynamic learned indexes. ALEX, as the pioneering dynamic learned index structures, enables dynamism by incorporating a series of design choices, including adaptive key space partitioning, dynamic model retra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12433","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/2403.12433/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.12433","created_at":"2026-07-05T07:58:01.422516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12433v1","created_at":"2026-07-05T07:58:01.422516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12433","created_at":"2026-07-05T07:58:01.422516+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VDYILYXLFLS","created_at":"2026-07-05T07:58:01.422516+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VDYILYXLFLSGD3N","created_at":"2026-07-05T07:58:01.422516+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VDYILYX","created_at":"2026-07-05T07:58:01.422516+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24975","citing_title":"Poisoning Learned Index Structures: Static and Dynamic Adversarial Attacks on ALEX","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG","json":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG.json","graph_json":"https://pith.science/api/pith-number/3VDYILYXLFLSGD3NPO2T34HUTG/graph.json","events_json":"https://pith.science/api/pith-number/3VDYILYXLFLSGD3NPO2T34HUTG/events.json","paper":"https://pith.science/paper/3VDYILYX"},"agent_actions":{"view_html":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG","download_json":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG.json","view_paper":"https://pith.science/paper/3VDYILYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12433&json=true","fetch_graph":"https://pith.science/api/pith-number/3VDYILYXLFLSGD3NPO2T34HUTG/graph.json","fetch_events":"https://pith.science/api/pith-number/3VDYILYXLFLSGD3NPO2T34HUTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG/action/storage_attestation","attest_author":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG/action/author_attestation","sign_citation":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG/action/citation_signature","submit_replication":"https://pith.science/pith/3VDYILYXLFLSGD3NPO2T34HUTG/action/replication_record"}},"created_at":"2026-07-05T07:58:01.422516+00:00","updated_at":"2026-07-05T07:58:01.422516+00:00"}