{"as_of":"2026-08-14T22:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:224e652187d033c06840df75de0a8229305e31ebbb5cae687dd7a45c83b2b710","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:05:46.362166Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.09937/citation-record","integrity":"/paper/2502.09937/integrity","json":"/paper/2502.09937/citation-record.json","paper":"/paper/2502.09937"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.320031Z","title":"Machine learning for databases: Foundations, paradigms, and open problems,","venue":null,"work_id":"72caaf4a-6356-466a-9bea-9cfa5f3694af","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.084003Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:c736d4a3c4e4f1722ae4c8c7e7833f198b4bec9db1ffaf7a6651dcf64e88a85b","observation_id":"7eee7592-23ae-45e7-bd00-39b151927d88","resolution":{"observed_at":"2026-08-07T20:05:47.325292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.304924Z","title":"The case for learned index structures,","venue":null,"work_id":"c0517db6-eac0-4209-8afd-54671931bbab","year":2018},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.089384Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:2015e7e772068ce687fa4dd59fb8333820d2e97604d468570822dffdb6bfc999","observation_id":"d931f3c2-8a2b-4348-9e8d-0a6136df7436","resolution":{"observed_at":"2026-08-07T20:05:47.309923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.289066Z","title":"The pgm-index,","venue":null,"work_id":"9f5879a8-9afe-4e3f-9b20-bb2186c8d526","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.094434Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:1c767eae0aac46178537d67ecfdf050088009b118656288bb7e5b99d28b419c2","observation_id":"6b4752a3-dcd8-4dc7-a77f-83ed4cc1a78f","resolution":{"observed_at":"2026-08-07T20:05:47.294127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.273499Z","title":"Alex: an updatable adaptive learned index,","venue":null,"work_id":"20445feb-5a85-4720-8c2f-af78c3f77e13","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.099951Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:a708210c77ad1eb1f6b5cbd719b22f430b377b1da2cc82f8310fd929778eaeb0","observation_id":"ed3778cf-5342-4951-b4b6-c31a89d61612","resolution":{"observed_at":"2026-08-07T20:05:47.278615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.257244Z","title":"Updatable learned index with precise positions,","venue":null,"work_id":"d34f00b3-f910-47a9-9d1a-119564063c93","year":2021},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.104817Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:bd78cc64a1917d590f0ec473593af025e6ddd7979d58781af535890ad1f4ad83","observation_id":"e9fb4b81-abc6-4e0a-94be-dc8265e11420","resolution":{"observed_at":"2026-08-07T20:05:47.262642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.241865Z","title":"Sagedb: A learned database system,","venue":null,"work_id":"fe7261bd-fcdc-45d6-86ec-5bf9704eb35b","year":2019},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.110089Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:aed7d43ac5812f9d0bcfd7ffeb1f9ea2e854ced4c99e2601902be6c5e5fc6741","observation_id":"d161835f-a3b9-451f-9960-345de39b7837","resolution":{"observed_at":"2026-08-07T20:05:47.246948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.226012Z","title":"A tutorial on learned multi- dimensional indexes,","venue":null,"work_id":"172bf960-4724-43a5-bb6d-ba615aa6e22b","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.115834Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:0f8faec5a7b9b47f19d4046e50f3e78d4904f5d36217f825612d59cf19fe7581","observation_id":"63737a02-0a5f-4d84-b1f7-e60ee25523ef","resolution":{"observed_at":"2026-08-07T20:05:47.231209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05536","last_updated":"2024-05-09T04:23:31Z","snapshot_observed_at":"2026-08-13T00:11:52.824559Z","submitted_at":"2024-05-09T04:23:31Z","title":"How Good Are Multi-dimensional Learned Indices? An Experimental Survey","version":1},"cited_work":{"arxiv_id":"2405.05536","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.05536","snapshot_observed_at":"2026-08-07T20:05:46.499781Z","title":"How Good Are Multi-dimensional Learned Indices? An Experimental Survey","venue":"cs.DB","work_id":"2b887e12-f956-446d-9af1-d444975c3bdb","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.120740Z"},"links":{"cited_paper":"/paper/2405.05536","citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:cbd81327d5bc31bacdd8385f757124e9dbfbdc709514b1e3a85e6c854e19fe12","observation_id":"a8d86eb5-dcf3-46de-8475-88f87b6cdd47","resolution":{"observed_at":"2026-08-07T20:05:46.506116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.208308Z","title":"A survey of multi-dimensional indexes: Past and future trends,","venue":null,"work_id":"738a7faf-f806-4110-97db-356e7bd3bff4","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.125824Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:dafc1388ca0f497e923b6eb946e72dddd20851f002fb78fb94feff566eb170ef","observation_id":"4947c550-7e33-4dee-aaf1-83fa1ff6ef55","resolution":{"observed_at":"2026-08-07T20:05:47.213143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06456","last_updated":"2024-03-11T06:32:32Z","snapshot_observed_at":"2026-08-13T00:57:55.210818Z","submitted_at":"2024-03-11T06:32:32Z","title":"A Survey of Learned Indexes for the Multi-dimensional Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06456","snapshot_observed_at":"2026-08-07T20:05:46.130636Z","title":"A survey of learned indexes for the multi-dimensional space,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.130636Z"},"links":{"cited_paper":"/paper/2403.06456","citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:db4bab2067fa3ecea17338b780c215703bb89d849e6d3ff7341e38be5870c003","observation_id":"46867bf5-4e59-4db5-b54f-2eaba41bb276","resolution":{"observed_at":"2026-08-07T20:05:46.130636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.193008Z","title":"Accelerating b+ tree search by using simple machine learning techniques,","venue":null,"work_id":"1a3402aa-c4b7-4d30-bf88-d336cc822110","year":2019},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.137564Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:1d64dbf9f9581a5ce3c6a07998cbcb9383d129189a53e606055b3b7779be642d","observation_id":"34d3d65c-5496-4f10-90e7-432b1439f7f4","resolution":{"observed_at":"2026-08-07T20:05:47.197978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.177107Z","title":"From wisckey to bourbon: A learned index for log-structured merge trees,","venue":null,"work_id":"00e66ccb-3637-4b8e-98e2-5001b777584b","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.142665Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:7a53a8def595513990fe029d9a1ea2fd02354618bf79e60ec535514c8b83aa1f","observation_id":"7caece08-a701-470a-b622-0f058f82a7f7","resolution":{"observed_at":"2026-08-07T20:05:47.182000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.160971Z","title":"R-trees: A dynamic index structure for spatial searching,","venue":null,"work_id":"314f58a3-cffc-4aab-863f-d9398f60d508","year":1984},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.147590Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:8fb858e475241351d1cf84f6b1b8d6a8a67cb154a282ba59f81297b5887165f5","observation_id":"272a6a45-3c66-4b06-b8b2-90b3d395d2c3","resolution":{"observed_at":"2026-08-07T20:05:47.166099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.144660Z","title":"Ubiquitous b-tree,","venue":null,"work_id":"f5e5079b-9709-4a02-98a0-f45745efc486","year":1979},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.152537Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:4ea738f88cc4b3dcf7bb2658dbe7336c6859a822d3d3c5cc0402467af5e5c6e4","observation_id":"f29d9980-692f-4f2e-b098-34eb3e752a66","resolution":{"observed_at":"2026-08-07T20:05:47.149742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.128484Z","title":"Manolopoulos, A","venue":null,"work_id":"f274c9ad-b91d-461c-9ae8-9feb2be8edfc","year":2010},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.157182Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:40075db60f3fbf11dcb919441c5e969c3c7cddd0ebeba0d762e77ce914c84aa0","observation_id":"047c75dd-ab48-4fd8-a281-33b08dae9710","resolution":{"observed_at":"2026-08-07T20:05:47.133574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.110987Z","title":"Lisa: A learned index structure for spatial data,","venue":null,"work_id":"89fbf937-e54b-4218-a6e1-d38658131b47","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.162179Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:52563288745e6549fb6f8a99027d6013ce9280ed02889c154e365d5ed5860a53","observation_id":"d8658bd2-2876-4f38-9f8d-83a0bde2fcc7","resolution":{"observed_at":"2026-08-07T20:05:47.116569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.093694Z","title":"Multilabel classification,","venue":null,"work_id":"0131b5fd-1b8d-459d-a4b8-80eb978b9e76","year":2016},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.166874Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:72a5d2b3c2afeab230e62e0814b89873674f65dc166c16dca1d188caf4a99b67","observation_id":"d90234f2-b3cf-421b-8ed8-ac3834f41344","resolution":{"observed_at":"2026-08-07T20:05:47.099020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.077457Z","title":"The “ai + r","venue":null,"work_id":"8c4a1d6f-21b7-4cb0-8c51-864a9e3813a7","year":2022},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.171685Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:f8d1b48631f35bd132a3dcaa6e9cacd4fc6a3d94960c8e11c24ea6f18a223a2d","observation_id":"407e8efe-cffd-408d-b6a6-b5aa4fd76923","resolution":{"observed_at":"2026-08-07T20:05:47.082309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.061490Z","title":"Data classification,","venue":null,"work_id":"1f02f14a-de34-49de-a890-451cec3a1ab2","year":2015},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.176402Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:1e7cfefb9e58b7810b5069aecf14fd6a0eade21b5b3c5a1486aab4f85c2c3ce5","observation_id":"99bbc5ed-a98c-452c-9c53-3b2b9fde8d11","resolution":{"observed_at":"2026-08-07T20:05:47.066386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.044044Z","title":"The handwritten trie: Indexing electronic ink,","venue":null,"work_id":"e51f6087-1783-41b5-8a59-2482e8224726","year":1995},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.181456Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:dfd49d71031744eb2acff35b13eb0fcfca0f7416870c3d0191b571fdf0367f06","observation_id":"7aa220fd-d2bb-40f6-a293-8de93ce38f4c","resolution":{"observed_at":"2026-08-07T20:05:47.049789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:47.027894Z","title":null,"venue":null,"work_id":"fb561649-b893-4da9-ba9f-353baf1593cd","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.186462Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:1ebb66c7293a8876a6bc55c40e8fc67e3ab0bd436ba390ea6a4cc7af90edb1c3","observation_id":"ad9a0f63-67ed-4c8c-91fc-bdcf37e7e2b3","resolution":{"observed_at":"2026-08-07T20:05:47.032856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.191385Z","title":"Algorithms for hyper- parameter optimization,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.191385Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:a18066f0154c7c1265a8a6a1d1b67421d552ac31aa680cc2d1d21cb8a3cd8efe","observation_id":"f42a2181-e901-4de6-9345-5624b19b8ce9","resolution":{"observed_at":"2026-08-07T20:05:46.191385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.196170Z","title":"Random forests,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.196170Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:0ca29053b356d62ba9d38e787a4cb267a72ce10bb2985425b19bfa4cca23b231","observation_id":"655e29ef-30c0-4656-8235-3a86dc8a8425","resolution":{"observed_at":"2026-08-07T20:05:46.196170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.985248Z","title":"A tutorial on multilabel learning,","venue":null,"work_id":"aba8fd05-9226-479b-a0dc-b43d4066dab3","year":2015},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.201124Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:bb45b29e81f35a55ad064560c7e2617b17520e513cf277af968bb819b6bea044","observation_id":"c7604f6c-1216-44b4-bdb1-cb5cc1c1c5a3","resolution":{"observed_at":"2026-08-07T20:05:46.991608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.205921Z","title":"Induction of decision trees,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.205921Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:f9fd8cfb4aac6881f577614729181c3f7d7728d37f5267a9ae7dd29230efcd0e","observation_id":"5c4b8b81-d4fb-4bf2-9e9d-34ad172f670c","resolution":{"observed_at":"2026-08-07T20:05:46.205921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.956030Z","title":"Scikit-multilearn: a scikit-based python environment for performing multi-label classification,","venue":null,"work_id":"3afabaae-fe05-49c1-b597-c1db9b6da732","year":2019},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.211278Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:4c15ecb80463edb4b47a5990cd3beeb01e5cf78e16f4595546cea43d37788d33","observation_id":"314a20c3-e5a7-44c7-8d5e-debff17fd2f8","resolution":{"observed_at":"2026-08-07T20:05:46.961143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.215986Z","title":"Scikit-learn: Machine learning in Python,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.215986Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:0f8e1244fc6f45ce2d7d7f6fef9f6023815e8fc24b10b322efae6de3f51158c6","observation_id":"65ff686d-1528-427b-8cca-d3aae3566c34","resolution":{"observed_at":"2026-08-07T20:05:46.215986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.221392Z","title":"Xgboost: A scalable tree boosting system,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.221392Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:fbcb7d0b646f771df48dfacb24a7aec8b6c5ba8d165454c95d098f12fd5f85f8","observation_id":"12846deb-b191-4334-aae4-2cf02946e475","resolution":{"observed_at":"2026-08-07T20:05:46.221392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.917123Z","title":"A tailored regression for learned indexes: Logarithmic error regression,","venue":null,"work_id":"4bcd913a-3bdf-4d59-b042-bfe3dc1c115a","year":2021},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.225980Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:1c182855a48ef21a57cb1dc941820135c6f591dabb79422e63804c7ef2ed54f6","observation_id":"61f6c5ec-b3d0-4548-87e9-b5b31d7c205e","resolution":{"observed_at":"2026-08-07T20:05:46.922231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.901151Z","title":"On the suitability of neural networks as building blocks for the design of efficient learned indexes,","venue":null,"work_id":"8a811a8e-634e-44e5-85e7-f639673e38f5","year":2022},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.231064Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:44d18276f41893c2a927b7132a29a8e9e9ea4ab422b1949c4081730341c79bfe","observation_id":"6e961296-6635-4a9d-b137-612ac071d95c","resolution":{"observed_at":"2026-08-07T20:05:46.906358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.883872Z","title":"Neural networks as building blocks for the design of efficient learned indexes,","venue":null,"work_id":"68e11f2f-32e2-4cc2-bf95-957df86ec875","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.237163Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:b9dd9da8c344891b7b2c9696594f61bdc20e5f630925ecc84c2149ce6225088f","observation_id":"2eabd4b7-b88e-49a6-bb22-b34167e7f295","resolution":{"observed_at":"2026-08-07T20:05:46.889921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.865955Z","title":"On nonlinear learned string indexing,","venue":null,"work_id":"0d7f0995-461a-4eb8-8310-a47479de90a4","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.242306Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:c49ecc48dd6e30ba432b69718e12243f0c07011543b1862db60f3cc8313063b5","observation_id":"e72622c9-e958-49b2-a947-24a0f541e8a2","resolution":{"observed_at":"2026-08-07T20:05:46.871877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.847630Z","title":"Pytorch module for loss functions,","venue":null,"work_id":"30678449-3339-4427-9518-a75b28b481c7","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.246683Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:6a0bab7ad1b1a99fc961251b1d0fc51e3564020e8248f2c0445f68793b7ee3a7","observation_id":"06b4039f-1061-4cf5-92a6-32384a853801","resolution":{"observed_at":"2026-08-07T20:05:46.853113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.830979Z","title":"Learning multi- dimensional indexes,","venue":null,"work_id":"094db713-3014-43d1-9a9b-d7b0bc493ccc","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.251055Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:71a5f26091c57c885969e5868860d74ec622eac60451e3b5182c9b4eb0692568","observation_id":"c25c250d-af1c-455a-8dd4-3c249b843c61","resolution":{"observed_at":"2026-08-07T20:05:46.835973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.814904Z","title":"Learning over sets for databases,","venue":null,"work_id":"2ed4ef7c-990e-49fa-815c-f618bf22c56e","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.255465Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:44a6de29c836640b74fe68ea9c066af1a84ffe84e71b26b176457e226b150ccb","observation_id":"36e10d38-6a10-42df-a276-d6ba6581f544","resolution":{"observed_at":"2026-08-07T20:05:46.819794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.799191Z","title":"Ucr-star: The ucr spatio-temporal active repository,","venue":null,"work_id":"04fb481d-a024-4635-a173-2fbd11506742","year":2019},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.259749Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:25ef2b90f7c197e9d8d38255b22518d8882a84d1e7852455d453d80730e912f1","observation_id":"0d611a93-b890-40e4-a01d-6dc4b8799ae2","resolution":{"observed_at":"2026-08-07T20:05:46.804002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.783269Z","title":"Indexing recent trajectories of moving objects,","venue":null,"work_id":"c72287d2-b070-4e6b-91eb-d1bfe74b1b2b","year":2014},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.264206Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:f2eac56cd70f99414dd7bb33797bee01d147134de4e50f9bb0169e02b93a54a9","observation_id":"c6b9dca5-e361-4b37-89e2-355598be981b","resolution":{"observed_at":"2026-08-07T20:05:46.788278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.268712Z","title":"Pytorch: An imperative style, high-performance deep learning library,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.268712Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:7be43af126474a5137fe4da99f672b9da61183d1cc74a80fa7e11ea20aec22d8","observation_id":"3d5f87b0-8815-415a-9abb-f8893b1df819","resolution":{"observed_at":"2026-08-07T20:05:46.268712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T20:05:46.273082Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.273082Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:be322f8a74f84abb3840d5313ed85b90d95e2328fb209db19fc4acf0b526e8c4","observation_id":"361d0a35-4c81-465e-81dd-677b7f989dbf","resolution":{"observed_at":"2026-08-07T20:05:46.273082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.755997Z","title":"The r+-tree: A dynamic index for multi-dimensional objects","venue":null,"work_id":"e7af19a4-7a26-408f-8088-16f5d31fbe3f","year":1987},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.277933Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:87617694edb72acc39625ee7e2ac07f11cfbac71b1487e00c4d2be54f178954a","observation_id":"7683493b-b0c6-4613-9be3-c1a9a9c564ee","resolution":{"observed_at":"2026-08-07T20:05:46.761335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.740385Z","title":"The r*- tree: an efficient and robust access method for points and rectangles,","venue":null,"work_id":"395e0424-fd2d-400e-bb64-795c8e818248","year":1990},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.282474Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:5e38f2ee950def0d229c2b9d0f361740265c5ad2c63057342d623acb3d210960","observation_id":"e81325be-42ee-4dcf-b3a3-03d7eed32e76","resolution":{"observed_at":"2026-08-07T20:05:46.745464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.724908Z","title":"A revised r*-tree in comparison with related index structures,","venue":null,"work_id":"9f4baa7f-0ccb-4bfe-8010-b1dfdd9f74f7","year":2009},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.287060Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:cd9d8cc856506f3ad573c144c4e81c8e900f50eea6ac047bd974829f16823664","observation_id":"3a7494fe-b2fe-4c46-9785-441af43655ed","resolution":{"observed_at":"2026-08-07T20:05:46.729946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.709134Z","title":"Samet, Foundations of multidimensional and metric data structures","venue":null,"work_id":"4548346b-2508-415f-8f1c-c49480aa2318","year":2006},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.291782Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:f740a593c9f6023cc8c7105999464297d876d059089e2d1b4731c71a84f4b42d","observation_id":"753485b0-ee56-4183-a393-9f1f2d058741","resolution":{"observed_at":"2026-08-07T20:05:46.714047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.693245Z","title":"Improv- ing spatial data processing by clipping minimum bounding boxes,","venue":null,"work_id":"e74544ed-8acb-4369-aadd-0c24f1ef7379","year":2018},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.296994Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:d9be85ec1c8c4fd9b5920c31739779b882cb0e93c915de7bc9169dba644dca97","observation_id":"033ad25b-c0ff-4869-8756-108f015357a8","resolution":{"observed_at":"2026-08-07T20:05:46.698499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.678061Z","title":"The priority r-tree: A practically efficient and worst-case optimal r-tree,","venue":null,"work_id":"5f30d016-02e3-4c29-9a70-b50e70510f9f","year":2008},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.301792Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:f363dc596f6c768a33c0ab6bd4baa0f2a90d6d3bde1bfc13799cf1765064271b","observation_id":"179db2c9-d6f0-47e9-b0ba-2d231b9f4a7d","resolution":{"observed_at":"2026-08-07T20:05:46.682991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.662300Z","title":"Hilbert r-tree: An improved r-tree using fractals,","venue":null,"work_id":"5fff7498-1ed7-43b0-9894-85e486b715a3","year":1994},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.306487Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:71535099cc502a540abd9e4e4bf18847096cbf232a81ee4a6d7af742acf3afbf","observation_id":"183c252c-a0d0-4807-a99a-043605180ea4","resolution":{"observed_at":"2026-08-07T20:05:46.667311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.04541","last_updated":"2021-10-11T05:03:08Z","snapshot_observed_at":"2026-08-14T15:10:54.968544Z","submitted_at":"2021-03-08T04:29:58Z","title":"A Reinforcement Learning Based R-Tree for Spatial Data Indexing in Dynamic Environments","version":2},"cited_work":{"arxiv_id":"2103.04541","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.04541","snapshot_observed_at":"2026-08-07T20:05:46.431636Z","title":"A Reinforcement Learning Based R-Tree for Spatial Data Indexing in Dynamic Environments","venue":"cs.DB","work_id":"1bb410b4-1c8c-48db-91df-45099c92ef89","year":2021},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.311121Z"},"links":{"cited_paper":"/paper/2103.04541","citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:cf548ce5e612c7dd3a5d8d209e0db37e46ab94d12c38cd694bc60eb17fdf7f62","observation_id":"26fac2cd-3b8b-4ab0-9efa-17e9322e02a6","resolution":{"observed_at":"2026-08-07T20:05:46.437520Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.645727Z","title":"Platon: Top-down r-tree packing with learned partition policy,","venue":null,"work_id":"3ccc84ba-4636-489a-b0f8-f47a12782f04","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.316746Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:9d097a3b473e611b547ee35833b5f50d23c8367b9c25e68320c015434d27ff63","observation_id":"d1375940-f264-45cd-8f79-431d804e330b","resolution":{"observed_at":"2026-08-07T20:05:46.650941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.629693Z","title":"Acr-tree: Constructing r-trees using deep reinforcement learning,","venue":null,"work_id":"8a467ebc-96d1-4bcc-ba1a-91f99b8b34d4","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.321453Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:802cc33cdf0da15c23e280b80afc394241aa4c239d6db6bf4174e6ce5b94ef94","observation_id":"5a4bed2d-14ef-497f-84c1-e877ce942900","resolution":{"observed_at":"2026-08-07T20:05:46.634883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.613962Z","title":"Hands-off model integration in spatial index structures,","venue":null,"work_id":"3f53d68b-fda7-435e-9325-eabca98d7b54","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.326769Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:c55224b3a3f14ccf34c4095961dbd7354a6484301119643a1272ef026ee11d35","observation_id":"82ecc769-701a-4e21-b403-069e9517fde6","resolution":{"observed_at":"2026-08-07T20:05:46.618997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.10349","last_updated":"2020-08-24T12:09:55Z","snapshot_observed_at":"2026-08-06T17:31:17.958215Z","submitted_at":"2020-08-24T12:09:55Z","title":"The Case for Learned Spatial Indexes","version":1},"cited_work":{"arxiv_id":"2008.10349","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.10349","snapshot_observed_at":"2026-08-07T20:05:46.404667Z","title":"The Case for Learned Spatial Indexes","venue":"cs.DB","work_id":"dd7e4a08-d79e-4e4c-9433-131793ba6f58","year":2020},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.331583Z"},"links":{"cited_paper":"/paper/2008.10349","citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:e8a124ee5ed4444589d7bede29ef4901d25af0188b3f2484d91b9ff73fd56c6b","observation_id":"6bc72cab-f3eb-40a6-8ff0-53b25bd9a2b3","resolution":{"observed_at":"2026-08-07T20:05:46.412346Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.598152Z","title":"The case for ml- enhanced high-dimensional indexes,","venue":null,"work_id":"7fd70e3c-3f1e-4cf7-ae25-12547822c850","year":2021},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.337158Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:af8af315e4410f8d747ac1e6a674c7e49f3a22e5aad65c47acacf3bc5352a7cc","observation_id":"c8fef840-9995-4c1f-a8ff-a852e4773141","resolution":{"observed_at":"2026-08-07T20:05:46.603128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.581059Z","title":"Limou- sine: Blending learned and classical indexes to self-design larger-than- memory cloud storage engines,","venue":null,"work_id":"b652f2e0-1368-40ab-a060-5b0ca54dad4f","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.341995Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:dffbf5634586515eaf54daf347eba376f91f3c1ef572a24b3004f4ff9914ce52","observation_id":"b187cf15-e7b9-47a9-99d2-d79d3b30b0c8","resolution":{"observed_at":"2026-08-07T20:05:46.586100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.565783Z","title":"Unsupervised space partition- ing for nearest neighbor search,","venue":null,"work_id":"3e0c7481-5b96-4091-a772-599fc3f83a31","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.346914Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:dad6848277cec594090d746f28f4b92e7f5b76ce52ffaf2970d85e3fd78a7cd4","observation_id":"8f227e5c-e24e-43b6-90f7-bc99d274b812","resolution":{"observed_at":"2026-08-07T20:05:46.570399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.550593Z","title":"Two is better than one: The case for 2-tree for skewed data sets,","venue":null,"work_id":"5e806ee4-078c-4a80-af37-0682bc94ae08","year":2023},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.351555Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:2f06db451200fd34eb56ad9c35371f122b6d2c533fa311ea0082200342589af3","observation_id":"6776e740-a02b-45ec-8658-7099a232a7a2","resolution":{"observed_at":"2026-08-07T20:05:46.555246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.534534Z","title":"Similarity indexing with the ss-tree,","venue":null,"work_id":"47025ad1-8912-437e-919b-d6fe392ba2c4","year":1996},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.356422Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:666d0ba9cfc3d93fec9026d7c9ff18e6a4418b8056c34971feeb96e3c5954cc8","observation_id":"4d9c479f-752b-4a35-a1f7-82a1e05bf348","resolution":{"observed_at":"2026-08-07T20:05:46.539120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T20:05:46.518007Z","title":"Machine unlearning in learned databases: An experimental analysis,","venue":null,"work_id":"e110994d-5c2d-42a4-822a-6711f128ad63","year":2024},"citing_paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T20:05:46.362166Z"},"links":{"citing_paper":"/paper/2502.09937"},"observation_digest":"sha256:2c65c42f4e4c8d75198ef25068a009ad9bdd5e897f06c7eb96812b10f240a954","observation_id":"92baf306-d47a-4d1b-be30-ec0d6e85499a","resolution":{"observed_at":"2026-08-07T20:05:46.523227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09937","last_updated":"2025-02-14T06:16:26Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-14T21:46:20.635948Z","submitted_at":"2025-02-14T06:16:26Z","title":"Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":45},"total_outbound_references":57},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2502.09937."}