{"as_of":"2026-08-13T16:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:36c770535070fad13969e9dae1e70a21eccb0a18af758110309c311b899e5f78","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:44:15.969019Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.16990/citation-record","integrity":"/paper/2411.16990/integrity","json":"/paper/2411.16990/citation-record.json","paper":"/paper/2411.16990"},"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-12T12:44:16.300488Z","title":null,"venue":null,"work_id":"3977f318-cbc8-4c3d-9162-70cdcd496c5a","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.873823Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:feef28b070cba0f62ceac6185fb4fd13f6d306db84af2d443bc36dd3c18342c4","observation_id":"a1eaabd8-1651-4ade-a81d-50c47bf0d7ff","resolution":{"observed_at":"2026-08-12T12:44:16.304503Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.287311Z","title":"Therefore, k-D data must first be linearized to a single dimension","venue":null,"work_id":"5ea73a19-b134-4047-9860-fedb7ccc7afc","year":2020},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.878551Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:98e936d07d20f4a462d1b236eafb85f6bb85abd19b42012c22fbecb9c2d8b585","observation_id":"73b47437-6174-417b-a482-6c5803ba6989","resolution":{"observed_at":"2026-08-12T12:44:16.291851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.274272Z","title":"find” all nodes according to the parameters of the query. In a range query, all nodes haveing key values in the specified range should be notified of the query. To “find","venue":null,"work_id":"8dfa6b28-02e3-473c-ae96-00945c7d24d4","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.883068Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:a72b2825c38ce2e19612ed94242e09e4cb9c11e47212c4a92ad1b2846d49ed2b","observation_id":"49ff84c1-77b1-466b-b7b1-118b55b44381","resolution":{"observed_at":"2026-08-12T12:44:16.278784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.261484Z","title":"In this case, that node happens to be the same node the query started with, node ‘7’","venue":null,"work_id":"b8731b91-495b-42c2-89d3-9b483a4211fc","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.887435Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:dcc8e42f7b5c0ff8275e54b63009d25f4052d8a2028b98f480f51b62e84b53be","observation_id":"a9255cce-5464-4102-9acf-031fb831cb32","resolution":{"observed_at":"2026-08-12T12:44:16.265678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.248339Z","title":"A node maps its k-D data (locally) to a 1-D key using a linearization method, such as z-ordering (cf","venue":null,"work_id":"729d471c-3b43-4421-aeb3-c423c850964e","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.891688Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:3cbd37eb985e93771a1094a27040314888bf0fc60d621fe0382a1fd477953338","observation_id":"1fa1dad4-fa15-4bd7-ac7d-62d349d4014d","resolution":{"observed_at":"2026-08-12T12:44:16.252783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.234796Z","title":"Thus, the query range becomes (0010002 – 0010112)","venue":null,"work_id":"91289946-327e-4cda-bc30-5e7dece365c9","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.896129Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:05d01200eb4e3c692393e2603d1e40af9dec2bf3f6c52f96def484545acaf7eb","observation_id":"2578187f-1ab8-48a9-a0ee-f8251f99357c","resolution":{"observed_at":"2026-08-12T12:44:16.239554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.219201Z","title":"Overview Our proposed modification to the standard skip graph inverts the roles of deterministic key values and random membership vectors","venue":null,"work_id":"5e774c70-bc97-43f6-8981-c29ac46ebb9c","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.900233Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:33413051cb9d5876734a84834f01f52adfa2ec8b7c2420653544bffa132e1bb6","observation_id":"327b2d4e-afb8-4fcc-8ed7-0b7b0ee14369","resolution":{"observed_at":"2026-08-12T12:44:16.224635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.205081Z","title":"Thus, the query traverses the entire list at this level in which node ‘70’ resides, because the query prefix of (0010) exactly matches","venue":null,"work_id":"bb53af1f-bd5f-4105-9ccc-df891736c4f8","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.904891Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:4e3fde505e8366857472fb605ae7a88ac991b1eed7a1eed89ab71a53af0a72fd","observation_id":"57e791ef-3379-4191-9a0b-936a74cd1f19","resolution":{"observed_at":"2026-08-12T12:44:16.209741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.192607Z","title":"Standard skip graphs group nodes based on common prefixes of randomly computed membership vectors and sorted on deterministically computed key values","venue":null,"work_id":"8d63e593-e667-4716-a448-514398b0f03e","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.909110Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:933789ecd7685d11d129794e31ef471e7faf52c5beacc7240a9dfffffc69d618","observation_id":"09927e40-aaba-475e-83f1-619e05213fc1","resolution":{"observed_at":"2026-08-12T12:44:16.196810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.179661Z","title":"Simulation studies of queries executed in k-D standard and inverted skip graphs should be conducted to assess the number of messages needed to maintain them, respectively","venue":null,"work_id":"20f84cb9-8dac-46aa-8bd9-bab630d70b25","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.913635Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:b5a0f11f25a314e8e7596c3af1d2a2161404ac4107f6aca03be4a5d8b3a3734c","observation_id":"debbf2bf-a649-4629-8c22-66b65d55c7fe","resolution":{"observed_at":"2026-08-12T12:44:16.184083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.166240Z","title":"We also thank Hanan Samet for providing us an advance copy of [11]","venue":null,"work_id":"05bde329-8c7e-41fe-affc-83b999e33747","year":null},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.917915Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:cf2e8f4a3027cc8da652a0b28f4d33048c013e2150fd34afaec667cec05de21b","observation_id":"b86345bb-3e70-4515-a3df-2abd45ef3166","resolution":{"observed_at":"2026-08-12T12:44:16.171192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.153482Z","title":"Skip Graphs","venue":null,"work_id":"c860cae2-bb7e-4df7-bfe5-40e66f6ff72a","year":2003},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.922163Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:230319dd763e114714b9561158b6062d95fa7ccc4e1fc7dce7d8213ede99f298","observation_id":"4bb63a85-29c8-464f-b743-51712e9e0a8b","resolution":{"observed_at":"2026-08-12T12:44:16.157692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.140354Z","title":"Borg, and P","venue":null,"work_id":"f716deb7-a160-4989-b725-20ec4dc75c87","year":1997},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.926732Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:bcae7ef746faf15a26db0a84039ec87fca08a34f8e69a4a3c19c2cdfd9c3c591","observation_id":"65aed635-9e4f-4384-a25c-db2d3f223c2b","resolution":{"observed_at":"2026-08-12T12:44:16.144574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.125428Z","title":"The skip quadtree: a simple dynamic data structure for multidimensional data","venue":null,"work_id":"c43ad516-38b1-40d8-9857-b4c81a32f7f7","year":2005},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.931432Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:f89c19b021fafb489c61e0c5c632c6fa36b251fb0d0e0db26628e8566269695f","observation_id":"4ad52a1f-6216-4ee4-bea4-0ba05104e23d","resolution":{"observed_at":"2026-08-12T12:44:16.130145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.109746Z","title":"Quad trees: a data structure for retrieval on composite keys","venue":null,"work_id":"fd7e89bc-3b56-4ded-8ec0-5ad342757093","year":1974},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.935754Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:fde6033af97eb7d4825f9a84604a5c5e6559a918803db67650a7e042e9ffa76d","observation_id":"723f2dca-c13e-4875-9109-f9c07d92f359","resolution":{"observed_at":"2026-08-12T12:44:16.114772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.096211Z","title":"One torus to rule them all: multi-dimensional queries in P2P systems","venue":null,"work_id":"6f74c2c5-1093-4dc8-90ee-8c13d59682e2","year":2004},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.940014Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:d9dcba46d740b120e778e2bbb2b3672c118670dbd8f74cb91b23b8e2996d54c6","observation_id":"e9e04740-e899-4326-85fa-ffdd2f1a305d","resolution":{"observed_at":"2026-08-12T12:44:16.100928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.082309Z","title":"SkipNet: a scalable overlay network with practical locality properties","venue":null,"work_id":"c4572f85-50b2-463f-af87-ff5a0d5e1d39","year":2003},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.944449Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:e5db541ca1f38363fb85f18018cbe5d17fb0d28f606233bb637f9877645b8f0b","observation_id":"81128675-f7a7-4576-9a1b-dfeeccc7e387","resolution":{"observed_at":"2026-08-12T12:44:16.086697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.067925Z","title":"Morton, A Computer Oriented Geodetic Data Bases; and a New Technique in File Sequencing, IBM (Ontario), Technical Report, March 1, 1966","venue":null,"work_id":"04426529-f532-482c-aa76-14674f6b0d19","year":1966},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.948555Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:d38453a32f788e1d8c09fab0819d9e6a243bc1ef8dafdce43de540ba7038c462","observation_id":"045032dd-d665-43f5-b02c-07dd4c9d9f78","resolution":{"observed_at":"2026-08-12T12:44:16.072782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.054426Z","title":null,"venue":null,"work_id":"4e19bb10-8039-4cb7-b009-362a398929bd","year":1999},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.952669Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:63bdadf69a6ab4a8b3700c6b46b5b8fe657097ee1bf3a90e5b7931459045c7f8","observation_id":"f5d9bcf1-89fa-4dd0-889c-a8f1c2b37116","resolution":{"observed_at":"2026-08-12T12:44:16.058533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.040600Z","title":"Skip Lists: a probabilistic alternative to balanced trees","venue":null,"work_id":"2c2dd99e-44ed-4658-811f-820d3062cfd2","year":1990},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.956866Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:e6cc829d3dfd44009c3ed884476413c5659d6f7f8730d26f1958be4fb5d616fe","observation_id":"7c814e81-e4a2-4d48-992c-7f6a2513cd96","resolution":{"observed_at":"2026-08-12T12:44:16.045694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.027066Z","title":"Sagan, Space-Filling Curves , Springer-Verlag, New York, NY, 1994","venue":null,"work_id":"56030a8d-3307-4906-9b2f-c09c078b990b","year":1994},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.960822Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:6f4f6c225bf22360eb4a1631dafabe321aecf3f8d981421f583c59eab89e7d69","observation_id":"c2989950-3e00-4a64-be4d-24163d112c00","resolution":{"observed_at":"2026-08-12T12:44:16.031473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:16.013210Z","title":"Samet, Foundations of Multidimensional and Metric Data Structures, Morgan Kaufmann, 2006","venue":null,"work_id":"0b9ad774-f50e-41f8-99cd-ee960b5935d4","year":2006},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.964947Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:956cad5e73a65b6ede88b4033c58e066f230058a1919902e6e7d88ef877fb1f9","observation_id":"6079684d-efeb-4b97-9410-b278ddb88909","resolution":{"observed_at":"2026-08-12T12:44:16.017763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T12:44:15.997138Z","title":"Warnock, A Hidden Surface Algorithm for Computer Generated Halftone Pictures , Doctoral Thesis, University of Utah, 1969","venue":null,"work_id":"6c96f74a-ccfb-4780-b16e-a042e5014b39","year":1969},"citing_paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:44:15.969019Z"},"links":{"citing_paper":"/paper/2411.16990"},"observation_digest":"sha256:a60e83a2b9274ab29545e8162ac495ae40e57e383ffc41d7e382bd722306a526","observation_id":"7918bae2-d651-4490-80f2-81484631b095","resolution":{"observed_at":"2026-08-12T12:44:16.002957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16990","last_updated":"2024-11-25T23:36:24Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T12:37:13.016305Z","submitted_at":"2024-11-25T23:36:24Z","title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":23},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2411.16990."}