{"as_of":"2026-08-19T06:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4184deb56df74082538328bfabf33d17a182f4e2d11673abe1ac7642226985c5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:56:02.772490Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:29:18.578715Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-08-11T15:56:02.772490Z","title":"Nearly tight lower bounds for succinct range minimum query","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.10655","last_updated":"2025-03-26T18:09:52Z","snapshot_observed_at":"2026-08-11T15:42:32.509197Z","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T15:56:02.772490Z"},"links":{"cited_paper":"/paper/2111.02318","citing_paper":"/paper/2412.10655"},"observation_digest":"sha256:f5a2f37075fdf3237677183f816bbbcca45bc1cfd82bcc1125814798b51725b3","observation_id":"7d4fb7e6-90b9-43ef-9d70-bc200814d1eb","resolution":{"observed_at":"2026-08-11T15:56:02.772490Z","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":{"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":"2111.02318","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.02318","snapshot_observed_at":"2026-08-07T15:29:18.578715Z","title":"Nearly Tight Lower Bounds for Succinct Range Minimum Query","venue":"cs.DS","work_id":"e8a08123-8df5-4758-964a-3199f964d2c7","year":2021},"citing_paper":{"arxiv_id":"2608.06077","last_updated":"2026-08-06T14:20:52Z","snapshot_observed_at":"2026-08-17T20:46:54.002961Z","submitted_at":"2026-08-06T14:20:52Z","title":"Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:17.222369Z"},"links":{"cited_paper":"/paper/2111.02318","citing_paper":"/paper/2608.06077"},"observation_digest":"sha256:cc41c0964f52c0213a18b9ef1c43557f80ca1dfe7c00e5e6d0ac219e9d70cfee","observation_id":"c262ad02-0010-43fa-9b31-8157bc89cff9","resolution":{"observed_at":"2026-08-07T15:29:18.701022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.02318/citation-record","integrity":"/paper/2111.02318/integrity","json":"/paper/2111.02318/citation-record.json","paper":"/paper/2111.02318"},"outbound":[],"paper":{"arxiv_id":"2111.02318","last_updated":"2022-02-09T08:15:23Z","latest_version":2,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2111.02318."}