{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XGY6K2S3XBKJEXGHAF2ZIDSDRD","short_pith_number":"pith:XGY6K2S3","schema_version":"1.0","canonical_sha256":"b9b1e56a5bb854925cc70175940e4388f187f17244c0c74c9b250549025cc3ca","source":{"kind":"arxiv","id":"2405.05536","version":1},"attestation_state":"computed","paper":{"title":"How Good Are Multi-dimensional Learned Indices? An Experimental Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lei Chen, Maocheng Li, Qiyu Liu, Yanyan Shen, Yuxiang Zeng","submitted_at":"2024-05-09T04:23:31Z","abstract_excerpt":"Efficient indexing is fundamental for multi-dimensional data management and analytics. An emerging tendency is to directly learn the storage layout of multi-dimensional data by simple machine learning models, yielding the concept of Learned Index. Compared with the conventional indices used for decades (e.g., kd-tree and R-tree variants), learned indices are empirically shown to be both space- and time-efficient on modern architectures. However, there lacks a comprehensive evaluation of existing multi-dimensional learned indices under a unified benchmark, which makes it difficult to decide the"},"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":"2405.05536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-05-09T04:23:31Z","cross_cats_sorted":[],"title_canon_sha256":"59ba388f761c2a9d073f4e8c3e2c6e2a03acc6e0959d7d5ee041796dfe783fde","abstract_canon_sha256":"ab35ab3598467ceced1eaca125858a817ad29cdc3c82c68c267365a60bdc81b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:19.562929Z","signature_b64":"J/xjnhQ2cL5Jdk1JNjRWdApQfVTZwU+NCDwCGyJNdCbj3Wly4mZNJCfk9/f0aiQMf7kWIAJHAvOXcnEld/nvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9b1e56a5bb854925cc70175940e4388f187f17244c0c74c9b250549025cc3ca","last_reissued_at":"2026-07-05T08:17:19.562502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:19.562502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Good Are Multi-dimensional Learned Indices? An Experimental Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lei Chen, Maocheng Li, Qiyu Liu, Yanyan Shen, Yuxiang Zeng","submitted_at":"2024-05-09T04:23:31Z","abstract_excerpt":"Efficient indexing is fundamental for multi-dimensional data management and analytics. An emerging tendency is to directly learn the storage layout of multi-dimensional data by simple machine learning models, yielding the concept of Learned Index. Compared with the conventional indices used for decades (e.g., kd-tree and R-tree variants), learned indices are empirically shown to be both space- and time-efficient on modern architectures. However, there lacks a comprehensive evaluation of existing multi-dimensional learned indices under a unified benchmark, which makes it difficult to decide the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.05536","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/2405.05536/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":"2405.05536","created_at":"2026-07-05T08:17:19.562566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.05536v1","created_at":"2026-07-05T08:17:19.562566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.05536","created_at":"2026-07-05T08:17:19.562566+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGY6K2S3XBKJ","created_at":"2026-07-05T08:17:19.562566+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGY6K2S3XBKJEXGH","created_at":"2026-07-05T08:17:19.562566+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGY6K2S3","created_at":"2026-07-05T08:17:19.562566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09937","citing_title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD","json":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD.json","graph_json":"https://pith.science/api/pith-number/XGY6K2S3XBKJEXGHAF2ZIDSDRD/graph.json","events_json":"https://pith.science/api/pith-number/XGY6K2S3XBKJEXGHAF2ZIDSDRD/events.json","paper":"https://pith.science/paper/XGY6K2S3"},"agent_actions":{"view_html":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD","download_json":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD.json","view_paper":"https://pith.science/paper/XGY6K2S3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.05536&json=true","fetch_graph":"https://pith.science/api/pith-number/XGY6K2S3XBKJEXGHAF2ZIDSDRD/graph.json","fetch_events":"https://pith.science/api/pith-number/XGY6K2S3XBKJEXGHAF2ZIDSDRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD/action/storage_attestation","attest_author":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD/action/author_attestation","sign_citation":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD/action/citation_signature","submit_replication":"https://pith.science/pith/XGY6K2S3XBKJEXGHAF2ZIDSDRD/action/replication_record"}},"created_at":"2026-07-05T08:17:19.562566+00:00","updated_at":"2026-07-05T08:17:19.562566+00:00"}