{"as_of":"2026-08-18T18:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c6c238334f807c2ea867306303877fa58f0ed6e6d7be23ec72754239722a5727","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T18:22:41.629378Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2607.04509/citation-record","integrity":"/paper/2607.04509/integrity","json":"/paper/2607.04509/citation-record.json","paper":"/paper/2607.04509"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-73437-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two-dimensionalrangeminimum queries","venue":null,"work_id":"344486e7-41e3-4c6f-8bc2-be7589ecc528","year":2007},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:0dc25a722834a0b68b73b7e701c93aeac6a89f99a959ee4a10f40b5a4a829c84","observation_id":"d2a13f2d-50ce-43cc-b4db-1c2187c5f12f","resolution":{"observed_at":"2026-07-11T18:28:11.217486Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-11T01:08:32.873321+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T01:08:32.873321+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Lrm-trees: Compressed in- dices, adaptive sorting, and compressed permutations.Theor","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:b6e5214021a25929a5cf3f0ba55c3fb758e52b493441b7825eb1722ce11a8075","observation_id":"a5b1bc28-e814-47f4-a64c-a3f7f24ccb2e","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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-07-11T18:22:41.629378Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:a55905927d0ea1833d8fea1c5fb1dc0b23371ef476888254c50e14ffdf0a4a6a","observation_id":"7986bc93-1061-46b5-924b-bd1262bcbc28","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/s00453-021-00799-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ian Munro, Gonzalo Navarro, and Yakov Nekrich","venue":"Algorithmica","work_id":"9ec4a206-260f-4624-93a6-d7e87818b545","year":2021},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:aae86e030d917d8780f84e356153df633ec06f9dae71d8507706db729e6fbb1a","observation_id":"88ec5a32-ee90-41a8-b8a8-4ce34bdaa7ce","resolution":{"observed_at":"2026-07-11T18:28:11.015753Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:16.468642+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:16.468642+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Bender and Martin Farach-Colton","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:556225a0040b702fda9cab91aa5b90cd4b70abc86814f27f9a32a6dbc57f7e47","observation_id":"9fea8222-cae5-4e3a-8fcd-e872f765a452","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/978-3-540-31856-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T18:28:11.264064Z","title":"Approximate range mode and range median queries","venue":null,"work_id":"4214c1b1-7b4e-458b-8eff-e85537401e84","year":2005},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:8a51c3b85069880d9b84e410eedd11bc2ea0c74441ec1b7d6ba72ac811439257","observation_id":"15a508af-19d2-4e0c-8d5b-55c8baf3a571","resolution":{"observed_at":"2026-07-11T18:28:11.272844Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:16.96667+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:16.96667+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"The encoding complexity of two dimensional range minimum data structures","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:78a0ed31735822777bf7ee2432179458579f257295e9d74eef8dce13cdf5cf35","observation_id":"317b1c29-f5c3-46b6-814d-a9430f48df90","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1016/j.tcs.2016.02.016","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two dimensional range minimum queries and fibonacci lattices.Theor","venue":"Theoretical Computer Science","work_id":"35963401-01ec-4a3f-8da7-13a70db36dff","year":2016},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:21a092ebba0ab96ac5bbf54d0469473b6addf7304c662e7143f142d4f2cdccec","observation_id":"e3b52bee-807e-4b6f-acf1-2b376755f7cb","resolution":{"observed_at":"2026-07-11T18:28:11.180582Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:17.46422+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:17.46422+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9499-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Srinivasa Rao","venue":"Algorithmica","work_id":"27afbf38-4a3a-45a1-be4f-030f1e962195","year":2012},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:6d2912eb9bf30cc42bc84e3e54088b0374d8346858f19b65db0978af908263be","observation_id":"d022565e-817a-42e1-9bd9-24fca2f20d3f","resolution":{"observed_at":"2026-07-11T18:28:11.076600Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:17.769759+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:17.769759+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Wilkinson","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:39badd5eb9f27539af0f4c45f0f339f3f9af16e86f6bb3401f8b52e0aec73227","observation_id":"2025634c-ab50-4ce3-be6b-3d3bfdab6e57","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/s00453-014-9881-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chan, Stephane Durocher, Matthew Skala, and Bryan T","venue":"Algorithmica","work_id":"c31107a1-ba4d-4b01-a320-ffab6f9bdb60","year":2015},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:bdc967607ad48b84ad1aadf213e855558bfb11fd34c0914624aac889b9960e1b","observation_id":"98b3f9e9-0fb7-4d6e-963d-bafb4df126ad","resolution":{"observed_at":"2026-07-11T18:28:11.157181Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:18.318243+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:18.318243+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2013.0131","doi":"10.1098/rsta.2013.0131","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Srinivasa Rao","venue":"Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences","work_id":"8c0622d2-910b-46d2-ae89-34678c32b394","year":2016},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:bb9812a282e8b172e2b0f20a0b13231b2cc49a998e14123a2cc12908e4e595dd","observation_id":"3f5b458d-7c72-48cb-a4ca-5e769647c1b3","resolution":{"observed_at":"2026-07-11T18:28:11.261813Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:18.548794+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:18.548794+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11786-017-0294-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On succinct representations of binary trees.Math","venue":"Mathematics in Computer Science","work_id":"4a64e741-62e3-4724-8426-b21c976265bf","year":2017},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:dd7ef105937bfed281a9665c7395bea5f3aa20120ba3596bb7c82eb6f473fddd","observation_id":"5a1a1ffb-b548-41de-8652-2b70c3456566","resolution":{"observed_at":"2026-07-11T18:28:11.059926Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:18.792979+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:18.792979+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-012-9683-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine, Gad M","venue":"Algorithmica","work_id":"ea5b63f2-03ab-4bb0-9bcd-13346aabfd24","year":2014},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:18218d290fe3ad5d251606b3700cad864fd3266ccbb37d82be92ee4bbbedd184","observation_id":"5d33ada8-a34f-4be1-9c49-a1d0b5373486","resolution":{"observed_at":"2026-07-11T18:28:11.045120Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:19.107606+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:19.107606+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ic.2012.10.011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ian Munro, Patrick K","venue":"Information and Computation","work_id":"7adf10ea-843a-4852-b5d1-919714f876ae","year":2013},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:38667db0fb982bbf89e39166d44ee317b5457a65d271dd9db2e4f6069e48f805","observation_id":"998e2482-a335-4466-838e-46216dbf36bd","resolution":{"observed_at":"2026-07-11T18:28:11.031398Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:19.359282+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:19.359282+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.isaac.2019.57","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ian Munro, Yakov Nekrich, and Bryce Sandlund","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"05a4c1ec-1d14-4095-b7ba-71278d31fba4","year":2019},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:38815b244254cc79ac556e04d0e7b9c56d0a965528d2ed185eaf6e9aac8cbd3c","observation_id":"2c2b0a82-80fc-4198-8223-6789c69c8f15","resolution":{"observed_at":"2026-07-11T18:28:11.114498Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:19.583446+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:19.583446+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.isaac.2025.31","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Compressibility measures and succinct data structures for piecewise linear approximations","venue":"ArXiv.org","work_id":"b9cc58ec-5b07-4a1d-be00-20ed5f2636a6","year":2025},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:656b35a22e552eeb8e3195023bb5bdf0bd01943f1a23c44acc1d49a32f9689f2","observation_id":"c068cbb4-d436-454c-89e8-7b64c0e622ce","resolution":{"observed_at":"2026-07-11T18:28:11.195837Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:19.823984+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:19.823984+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11786-009-0007-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding range minima in the middle: Approximations and applications.Math","venue":"Mathematics in Computer Science","work_id":"4927d25c-3a9a-4863-b346-ece79a4be6ca","year":2010},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:f8cadd11a8150fd8f16096db7307e88a6b58913f3cf37b828be97d109f53d51c","observation_id":"0a7d3a63-f1d1-42c4-9af8-e349d84eb332","resolution":{"observed_at":"2026-07-11T18:28:11.042160Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:20.058236+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:20.058236+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Space-efficient preprocessing schemes for range min- imum queries on static arrays.SIAM J","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:ad0d54ab4afd862e7d417420d83040d8caeed108d023cd5390117c900b129888","observation_id":"231ca734-92b2-4cc4-b48b-963416763656","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-69068-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An(other) entropy-bounded compressed suffix tree","venue":null,"work_id":"9ad477b5-f926-478b-8e07-941e9cb84e5e","year":2008},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:7df2ad1cdc8785e743d935d982b81bb82c36153c168462673e70ce7d1f659fd2","observation_id":"761c358a-8993-4b17-9ca0-581633ed3edf","resolution":{"observed_at":"2026-07-11T18:28:11.208579Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:20.318783+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:20.318783+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0057.808675","doi":"10.1145/800057.808675","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gabow, Jon Louis Bentley, and Robert Endre Tarjan","venue":null,"work_id":"167a9d22-8736-4d63-8e53-95614a7f77a2","year":1984},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:69d49c23e35a552b34310291651a16971e73724dcfb33936fef6043e65fbe7e2","observation_id":"849978c3-1806-43b1-882a-c81c63d944a3","resolution":{"observed_at":"2026-07-11T18:28:11.246266Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:20.545095+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:20.545095+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-24583-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ian Munro, and Patrick K","venue":"Lecture notes in computer science","work_id":"9369b7fe-1ead-44d4-937e-f15c62eeb87e","year":2011},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:2ddb4c07cdb44c07765db5593694611b6102af0d59fe7df04a2e2bf8629f6f83","observation_id":"eae21ffb-7db7-4a31-946d-c04a4a38ee0a","resolution":{"observed_at":"2026-07-11T18:28:11.126630Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:20.786903+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:20.786903+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-020-00687-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Compressed dynamic range majority and minority data structures.Algorithmica, 82(7):2063–2086, 2020","venue":"Algorithmica","work_id":"9edb7cb4-3c43-4a04-98a0-11817a14f2a9","year":2063},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:47f0e3ec8ac2e497acc2f2c5a2e34101224aceab26ceec216b2d2c6e988ea15f","observation_id":"279eb5e7-3be7-4939-b28e-fc0f2cecb913","resolution":{"observed_at":"2026-07-11T18:28:11.029728Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:21.045534+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:21.045534+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2019.07.002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Compressed range minimum queries.Theor","venue":"Theoretical Computer Science","work_id":"b7dedc82-1e38-4e2c-ba7e-b1453028075b","year":2020},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:5674dbce2a5446fe1eba26e14840eba1124989dfa6eb517c468de0699cf76b6d","observation_id":"e1777d8d-8590-42bc-b1d0-9081b1a4a1f3","resolution":{"observed_at":"2026-07-11T18:28:11.062108Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:21.292626+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:21.292626+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3381416","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Submatrix maximum queries in monge and partial monge matrices are equivalent to predecessor search.ACM Trans","venue":"ACM Transactions on Algorithms","work_id":"ff95e412-ac0d-4022-a98c-a4ef6f41fc03","year":2020},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:425b3373be92baac5a107eff2ab599cd938fa6abd5e7a857a6762cddc23dc640","observation_id":"c5a59c92-3140-40e8-9284-2f9f53be8792","resolution":{"observed_at":"2026-07-11T18:28:11.144103Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:21.531504+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:21.531504+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Nicholson","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:6d865bbd5c19846988c96b178badd00a397876fee292255c3821e764e6917cb9","observation_id":"daa211e7-aebd-42a3-9270-a81bac70dcae","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/978-3-319-62127-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T18:28:10.954893Z","title":"Nicholson","venue":null,"work_id":"d6561a7b-7d8e-46e2-8576-d96a95929235","year":2017},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:0791756b3ab32895536a76f333c03f633bd0dcd18738c6b9b48cf5ea363b5174","observation_id":"75b13ae3-eb11-41e3-8753-dff19d759bf4","resolution":{"observed_at":"2026-07-11T18:28:10.962944Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:22.03551+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:22.03551+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, and Sunil M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:2d122db9eb68e0f7717435297d238f0250be3dcbefe742dd3ef7186e93fb27fc","observation_id":"d29be7c5-73f4-4bab-b65b-cf207bc35e8e","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1016/j.tcs.2015.10.012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Theoretical Computer Science","work_id":"d3141f55-fa42-43b9-87e3-0dac1945cc8a","year":2015},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:1de71586aafff46e0b7ca8c6a1dbc7b1c45c8c1fdf42abb5f1fccb0429c4d283","observation_id":"1adfee65-54dc-411f-aa51-7e4a68e94257","resolution":{"observed_at":"2026-07-11T18:28:11.198676Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:22.291254+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:22.291254+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Cell probe lower bounds and approximations for range mode","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:251c7966a66646cd1df1c91e28956dcc4b68ab3a97a8aba05befff46e56f2f24","observation_id":"df24e93d-bd9d-41e4-912a-fb4e065c0a37","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1145/3012939","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Srinivasa Rao","venue":"ACM Transactions on Algorithms","work_id":"54e3a21e-6d5f-4ba1-bed4-680755d0b444","year":2017},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:14e033ac5b4aa694620a5cec64940487d42b8e60fc152aeb03a58ca6151feb7a","observation_id":"f12322ac-bb12-4d67-aa7a-1ec44d1988d6","resolution":{"observed_at":"2026-07-11T18:28:11.166251Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:22.812021+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:22.812021+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Fast algorithms for finding nearest common ancestors","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:6854405acc1aecabcace9021d168bde4c58807187b5638471d70c19b17032ffc","observation_id":"b2e7d772-49d5-4adc-8865-5e956eb4729f","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/s00453-025-01325-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Space-efficient data structure for next/previous larger/smaller value queries.Algorithmica, 87(10):1369–1392, 2025","venue":"Algorithmica","work_id":"980a8ad0-36ac-44d9-b598-8ef960ba4ad6","year":2025},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:d805cffa830bf30855628731bc3fcfd1d47c99d3ae918e7849ad9d28d9478a5e","observation_id":"fe1badf3-2380-4f21-a08e-ece2bc73c6c3","resolution":{"observed_at":"2026-07-11T18:28:11.094226Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:23.311486+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:23.311486+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-021-00856-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Encoding two-dimensional range top-k queries.Algorithmica, 83(11):3379–3402, 2021","venue":"Algorithmica","work_id":"cfdf9c12-3792-4f7f-8896-fbc4899c59e3","year":2021},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:11b7645f606a22204b96dc8ddb9cdff0eb0f6c3deee82a3b73af17c415dc63e7","observation_id":"34d7a84b-11bb-429b-9cb1-a2ceb9fee197","resolution":{"observed_at":"2026-07-11T18:28:11.172004Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:23.653257+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:23.653257+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2016.01.043","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Simultaneous encodings for range and next/previous larger/smaller value queries.Theor","venue":"Theoretical Computer Science","work_id":"0150b323-3bc7-453d-8aa5-e914bcb144e0","year":2016},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:8c78be031e304b93d0addc16df422115c8e77827f3d7afee6090b10e3837527f","observation_id":"74826aca-558b-4a5f-b7a9-a8e0dc8d7afd","resolution":{"observed_at":"2026-07-11T18:28:11.134810Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:23.913413+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:23.913413+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/oasics.grossi.12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Encoding data structures for range queries on arrays","venue":"Dagstuhl Research Online Publication Server","work_id":"05e35a6a-05ef-461a-b62f-1652b47d62a5","year":2025},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:ed8bfb1b8cdd89e514a031fa4ccd4781f77d732e77717cfd9fe5d449f1e0cd81","observation_id":"210942c7-34cd-481c-ae48-d647048ef089","resolution":{"observed_at":"2026-07-11T18:28:11.052385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:24.161614+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:24.161614+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Encodings for range minimum queries over bounded alphabets.Theor","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:dd60cce82cc6f1a3283f3547742b540f8fa5bd5a61ac5ab0776ece3c874d9410","observation_id":"e12a5ae8-dcc8-4df9-a7b1-f685b128e2bb","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3039873","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Submatrix maximum queries in monge matrices and partial monge matrices, and their applications.ACM Trans","venue":"ACM Transactions on Algorithms","work_id":"51c9efc3-5429-4cea-a97a-cf195433703f","year":2017},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:cfac0d6c6aee58b708117812d01c97904b9edae327349915af2511d8df461cee","observation_id":"ade22c18-208b-40a0-b8ee-1bb25e25eda5","resolution":{"observed_at":"2026-07-11T18:28:11.004345Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:24.462329+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:24.462329+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Searching for frequent colors in rectangles","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:66ec3668569e50073a2659b0869c3f4bba5d3b2fca4a765f204a6cb82740f11c","observation_id":"06780c5b-c534-4b3b-a9d7-18cb9780b256","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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-07-11T18:22:41.629378Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:31ad8282bb45c897bee017e1fca4bb45e13a13afeae5f55254a3bfdc06949efe","observation_id":"bd0672ab-ce09-4362-b902-461c469739de","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02318","last_updated":"2022-02-09T08:15:23Z","snapshot_observed_at":"2026-08-16T17:44:16.986320Z","submitted_at":"2021-11-03T16:11:22Z","title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02318","snapshot_observed_at":"2026-07-11T18:22:41.629378Z","title":"Nearly tight lower bounds for succinct range minimum query.CoRR, abs/2111.02318, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"cited_paper":"/paper/2111.02318","citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:0a9e64852f1e61f4fb517d6680dcd4e93867471e94b4d934ff51d732580e0600","observation_id":"b8317e5e-5c9e-4a77-93e3-5d4cfa8e326b","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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-07-11T18:22:41.629378Z","title":"Lower bound for succinct range minimum query","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:524d0fdc9ddb9180899e77158b7ac79f516cf50ae2b6d4eb2ecaeb4b78533602","observation_id":"5919c33f-79e5-42f4-965e-85590b1a53a3","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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-07-11T18:22:41.629378Z","title":"Ian Munro, Patrick K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:d1d0a47e18fd0f27b7ae2bf1a539f6e3acd71dadfaa792ad9fc0f21d55de3be5","observation_id":"0f9fd9d2-ef34-4e85-95c9-2b864cc5dbad","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/s00453-015-9987-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thankachan","venue":"Algorithmica","work_id":"471e14a3-cb1f-4c57-b3fb-a95e17f6fb19","year":2016},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:c862e3527f59a855e2b8e9b7e471944289ba14a7cfc8870b507f79036525231b","observation_id":"dd39a998-b324-4604-b888-74f8cb30ed6d","resolution":{"observed_at":"2026-07-11T18:28:10.971467Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:25.036721+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:25.036721+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Improved bounds for range mode and range median queries","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:750843767efe3febb31e19851e8666365eca27ac2b75975c10f1fa1a9bbbd865","observation_id":"c8d16164-7a8b-4d6a-9bee-9ad0b2ee62d0","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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-07-11T18:22:41.629378Z","title":"Range mode and range median queries in constant time and sub-quadratic space.Inf","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:dc4d09bfcde923aae55fd6b93f6a0443a290990096dd395df2d0b4dcbce57ef5","observation_id":"a62cfa6f-a055-49dd-a91d-8ab348e3f53c","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1007/3-540-36285-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Optimal range max datacube for fixed dimensions","venue":"Lecture notes in computer science","work_id":"04b9a33e-7d81-42e3-bd8a-b801a00791a6","year":2003},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:375bb85cb20224f005dd75768b539d22176e3297bc5adb3df3bfcd444c03d46c","observation_id":"55590eb8-50bd-45d1-9367-0fd70b19992a","resolution":{"observed_at":"2026-07-11T18:28:10.998877Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:25.72785+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:25.72785+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-15612-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Encoding data structures","venue":null,"work_id":"de4422c9-922a-4258-99d7-6e2ce04c2460","year":2015},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:43ba48fe6cc3862c2fbd8636103e0c25a88467af45ec6dbd8402d1907001bf2a","observation_id":"013f95ad-44f7-4e00-8045-fc71d881ec7e","resolution":{"observed_at":"2026-07-11T18:28:11.226003Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:25.953928+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:25.953928+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Srinivasa Rao","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:dbda19837b9881deecca2ade7a40573cca0095091224f55f31565eced008eefd","observation_id":"0aef8d78-95a2-4db1-aa9e-4fb87ba498f5","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","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":"10.1016/j.jda.2006.03.011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Succinct data structures for flexible text retrieval systems.J","venue":"Journal of Discrete Algorithms","work_id":"36a80146-c111-41c6-9512-b439e28dd465","year":2007},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:f795f209103e6ad5da41c968b55679b009834baf8259d41862f224da620ff68b","observation_id":"01528aac-d78a-490d-ad02-c7a0fde06fe3","resolution":{"observed_at":"2026-07-11T18:28:11.073507Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:26.185006+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:26.185006+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0040379","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On finding lowest common ancestors: Simplification and parallelization","venue":"Lecture notes in computer science","work_id":"30b9670c-f3a0-4628-ab56-1af9570647e9","year":1988},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:1a8e0e3a1191afd696158219805272dd5cdfc8d28aa64acb552038f3e6ca15bc","observation_id":"376c4f8f-59a1-4a86-871f-769633bc2187","resolution":{"observed_at":"2026-07-11T18:28:10.976270Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:26.414043+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:26.414043+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-07-11T18:22:41.629378Z","title":"Array range queries","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:83ff35186438709b4ce86bc5b3016334df91c0f6c5f1638ce2ac51258eff1b8c","observation_id":"0be9dd3b-060b-4e16-ba34-838495f8d7dc","resolution":{"observed_at":"2026-07-11T18:22:41.629378Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2019.01.011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theeffectiveentropyofnext/previouslarger/smallervaluequeries.Inf","venue":"Information Processing Letters","work_id":"48d64dcb-b455-4543-bf98-9dbe87c295e8","year":2019},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:7973c44961b2e691ac6e76b4550c7c60a3d5270190a37a172fffb56e4f0d5b51","observation_id":"93ba42a3-3c18-4099-9ee2-7e95ec6eec87","resolution":{"observed_at":"2026-07-11T18:28:11.098945Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:26.658446+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:26.658446+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973075.14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"a36d6b84-3619-4e2a-9f1d-7b0d4168cec1","year":2010},"citing_paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-11T18:22:41.629378Z"},"links":{"citing_paper":"/paper/2607.04509"},"observation_digest":"sha256:6600f8bab41c2c7c45a0619617b5b13582f7e6382fd31f191d11707fd8d71e4e","observation_id":"50256e54-cb6d-424c-bd7a-1e3a3c3a658d","resolution":{"observed_at":"2026-07-11T18:28:11.018951Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-12T07:19:26.902053+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T07:19:26.902053+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.04509","last_updated":"2026-07-05T21:19:21Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-11T18:22:41.153484Z","submitted_at":"2026-07-05T21:19:21Z","title":"Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":34,"verified_fuzzy":0},"total_outbound_references":54},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2607.04509."}