{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7NQBRXJSXBXFJP4BNQUV2RZF7Y","short_pith_number":"pith:7NQBRXJS","schema_version":"1.0","canonical_sha256":"fb6018dd32b86e54bf816c295d4725fe04824fc2e96ef4ee74fc149b636abf1f","source":{"kind":"arxiv","id":"2103.04541","version":2},"attestation_state":"computed","paper":{"title":"A Reinforcement Learning Based R-Tree for Spatial Data Indexing in Dynamic Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Cheng Long, Gao Cong, Kaiyu Feng, Sheng Wang, Tu Gu, Zheng Wang","submitted_at":"2021-03-08T04:29:58Z","abstract_excerpt":"Learned indices have been proposed to replace classic index structures like B-Tree with machine learning (ML) models. They require to replace both the indices and query processing algorithms currently deployed by the databases, and such a radical departure is likely to encounter challenges and obstacles. In contrast, we propose a fundamentally different way of using ML techniques to improve on the query performance of the classic R-Tree without the need of changing its structure or query processing algorithms. Specifically, we develop reinforcement learning (RL) based models to decide how to c"},"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":"2103.04541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-03-08T04:29:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0aea0bec27ebaacc959b9d3dc47b1edaeded188b66237ca15f65ef550c192ebb","abstract_canon_sha256":"0decd6d368e910d27b7937d4f2e200a8053570a4d74502892310e74878524b57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:08.859267Z","signature_b64":"tYAO+Bs3lMOqhcumvZVLlO12NCUHYQaTdFS+Dmame6GANLTjUXDNiQWNqtL6SslNWZYBwnTZekbaimDFneUICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb6018dd32b86e54bf816c295d4725fe04824fc2e96ef4ee74fc149b636abf1f","last_reissued_at":"2026-07-05T03:21:08.858723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:08.858723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reinforcement Learning Based R-Tree for Spatial Data Indexing in Dynamic Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Cheng Long, Gao Cong, Kaiyu Feng, Sheng Wang, Tu Gu, Zheng Wang","submitted_at":"2021-03-08T04:29:58Z","abstract_excerpt":"Learned indices have been proposed to replace classic index structures like B-Tree with machine learning (ML) models. They require to replace both the indices and query processing algorithms currently deployed by the databases, and such a radical departure is likely to encounter challenges and obstacles. In contrast, we propose a fundamentally different way of using ML techniques to improve on the query performance of the classic R-Tree without the need of changing its structure or query processing algorithms. Specifically, we develop reinforcement learning (RL) based models to decide how to c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04541","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.04541/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":"2103.04541","created_at":"2026-07-05T03:21:08.858781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.04541v2","created_at":"2026-07-05T03:21:08.858781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04541","created_at":"2026-07-05T03:21:08.858781+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NQBRXJSXBXF","created_at":"2026-07-05T03:21:08.858781+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NQBRXJSXBXFJP4B","created_at":"2026-07-05T03:21:08.858781+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NQBRXJS","created_at":"2026-07-05T03:21:08.858781+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":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y","json":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y.json","graph_json":"https://pith.science/api/pith-number/7NQBRXJSXBXFJP4BNQUV2RZF7Y/graph.json","events_json":"https://pith.science/api/pith-number/7NQBRXJSXBXFJP4BNQUV2RZF7Y/events.json","paper":"https://pith.science/paper/7NQBRXJS"},"agent_actions":{"view_html":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y","download_json":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y.json","view_paper":"https://pith.science/paper/7NQBRXJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.04541&json=true","fetch_graph":"https://pith.science/api/pith-number/7NQBRXJSXBXFJP4BNQUV2RZF7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7NQBRXJSXBXFJP4BNQUV2RZF7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/action/storage_attestation","attest_author":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/action/author_attestation","sign_citation":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/action/citation_signature","submit_replication":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/action/replication_record"}},"created_at":"2026-07-05T03:21:08.858781+00:00","updated_at":"2026-07-05T03:21:08.858781+00:00"}