{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:7NQBRXJSXBXFJP4BNQUV2RZF7Y","short_pith_number":"pith:7NQBRXJS","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"},"canonical_sha256":"fb6018dd32b86e54bf816c295d4725fe04824fc2e96ef4ee74fc149b636abf1f","source":{"kind":"arxiv","id":"2103.04541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.04541","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.04541v2","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04541","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"7NQBRXJSXBXF","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"pith_short_16","alias_value":"7NQBRXJSXBXFJP4B","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"pith_short_8","alias_value":"7NQBRXJS","created_at":"2026-07-05T03:21:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:7NQBRXJSXBXFJP4BNQUV2RZF7Y","target":"record","payload":{"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"},"canonical_sha256":"fb6018dd32b86e54bf816c295d4725fe04824fc2e96ef4ee74fc149b636abf1f","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"},"source_kind":"arxiv","source_id":"2103.04541","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-07-05T03:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edOwg9RQCQJNZUHtoJ7NNiSZrGvWa1FonPVTvTKIhMeEgdoCgdD3T9nYgaarkSlSjORgzQC9g52EcAdH5ZUSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:41:37.407882Z"},"content_sha256":"ba33ead5a85ff7bacf472029ae3f2742d93645e1530a30c3218c647237f85be4","schema_version":"1.0","event_id":"sha256:ba33ead5a85ff7bacf472029ae3f2742d93645e1530a30c3218c647237f85be4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:7NQBRXJSXBXFJP4BNQUV2RZF7Y","target":"graph","payload":{"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"},"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-05T03:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgzB/1quhWoEwNgphoMh5Im1cs/ErwDzphWz34dJLrdnF/F96Hd76jIFOa4VaJ4rP4M/lW7calidQel9enXECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T17:41:37.410224Z"},"content_sha256":"09cb14b713d88993fd5288a10d72b1404b2dfe82f975b412cad12ab5f2ead95d","schema_version":"1.0","event_id":"sha256:09cb14b713d88993fd5288a10d72b1404b2dfe82f975b412cad12ab5f2ead95d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/bundle.json","state_url":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/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-14T17:41:37Z","links":{"resolver":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y","bundle":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/bundle.json","state":"https://pith.science/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NQBRXJSXBXFJP4BNQUV2RZF7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:7NQBRXJSXBXFJP4BNQUV2RZF7Y","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":"0decd6d368e910d27b7937d4f2e200a8053570a4d74502892310e74878524b57","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-03-08T04:29:58Z","title_canon_sha256":"0aea0bec27ebaacc959b9d3dc47b1edaeded188b66237ca15f65ef550c192ebb"},"schema_version":"1.0","source":{"id":"2103.04541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.04541","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.04541v2","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04541","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"7NQBRXJSXBXF","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"pith_short_16","alias_value":"7NQBRXJSXBXFJP4B","created_at":"2026-07-05T03:21:08Z"},{"alias_kind":"pith_short_8","alias_value":"7NQBRXJS","created_at":"2026-07-05T03:21:08Z"}],"graph_snapshots":[{"event_id":"sha256:09cb14b713d88993fd5288a10d72b1404b2dfe82f975b412cad12ab5f2ead95d","target":"graph","created_at":"2026-07-05T03:21:08Z","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/2103.04541/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cheng Long, Gao Cong, Kaiyu Feng, Sheng Wang, Tu Gu, Zheng Wang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-03-08T04:29:58Z","title":"A Reinforcement Learning Based R-Tree for Spatial Data Indexing in Dynamic Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04541","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:ba33ead5a85ff7bacf472029ae3f2742d93645e1530a30c3218c647237f85be4","target":"record","created_at":"2026-07-05T03:21:08Z","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":"0decd6d368e910d27b7937d4f2e200a8053570a4d74502892310e74878524b57","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-03-08T04:29:58Z","title_canon_sha256":"0aea0bec27ebaacc959b9d3dc47b1edaeded188b66237ca15f65ef550c192ebb"},"schema_version":"1.0","source":{"id":"2103.04541","kind":"arxiv","version":2}},"canonical_sha256":"fb6018dd32b86e54bf816c295d4725fe04824fc2e96ef4ee74fc149b636abf1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb6018dd32b86e54bf816c295d4725fe04824fc2e96ef4ee74fc149b636abf1f","first_computed_at":"2026-07-05T03:21:08.858723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:21:08.858723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tYAO+Bs3lMOqhcumvZVLlO12NCUHYQaTdFS+Dmame6GANLTjUXDNiQWNqtL6SslNWZYBwnTZekbaimDFneUICA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:21:08.859267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.04541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba33ead5a85ff7bacf472029ae3f2742d93645e1530a30c3218c647237f85be4","sha256:09cb14b713d88993fd5288a10d72b1404b2dfe82f975b412cad12ab5f2ead95d"],"state_sha256":"e4f0aa886fafd40061f1b0e7714744007d0848206326cf31469665420f096814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJpQnoYwF2jzANT80d6+0oCQYdEZmor9naeocnVp0ZH0+9fsIAYc/4GWUGPtMBqCGcG2sBtp1YBIrOuOVoMmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T17:41:37.418912Z","bundle_sha256":"5fc0859afb82a0dcabc4ec00d7b758477e87731500d2d4dbd850a919d5862500"}}