{"as_of":"2026-08-22T03:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad1c0ed2506aa4a4091f193f0ecd49c30f67591adfac19f605be7a9cb86c66d6","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:19:01.757177Z","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-12T21:23:12.782124Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.02003","last_updated":"2021-01-06T13:18:02Z","snapshot_observed_at":"2026-08-21T20:17:09.867568Z","submitted_at":"2021-01-06T13:18:02Z","title":"Algorithms and Hardness for Multidimensional Range Updates and Queries","version":1},"cited_work":{"arxiv_id":"2101.02003","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.02003","snapshot_observed_at":"2026-08-12T21:23:12.782124Z","title":"Algorithms and Hardness for Multidimensional Range Updates and Queries","venue":"cs.DS","work_id":"7b5d24c7-507a-49f4-bf66-cfee5749b6b6","year":2021},"citing_paper":{"arxiv_id":"2411.08972","last_updated":"2024-11-13T19:03:59Z","snapshot_observed_at":"2026-08-21T14:20:05.899770Z","submitted_at":"2024-11-13T19:03:59Z","title":"Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T21:23:12.224352Z"},"links":{"cited_paper":"/paper/2101.02003","citing_paper":"/paper/2411.08972"},"observation_digest":"sha256:9908631c7c53247e16e60056e7a7f9300b6556ef24312be773263f2a520d040f","observation_id":"24e788fe-6c90-4ad5-a7a4-8be6ccbf4f8c","resolution":{"observed_at":"2026-08-12T21:23:12.785697Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.02003","last_updated":"2021-01-06T13:18:02Z","snapshot_observed_at":"2026-08-21T20:17:09.867568Z","submitted_at":"2021-01-06T13:18:02Z","title":"Algorithms and Hardness for Multidimensional Range Updates and Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.02003","snapshot_observed_at":"2026-08-14T04:19:01.757177Z","title":"Joshua Lau, Angus Ritossa.https://arxiv.org/abs/2101.02003","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":185,"source":"pdf_text","source_observed_at":"2026-08-14T04:19:01.757177Z"},"links":{"cited_paper":"/paper/2101.02003","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:2725e41aa93ccfcd8d7204c81477d5e515aa3bb84fa28d467b6d6f54b52c981c","observation_id":"ee75f5a0-3230-4de8-8764-a62acf9f01c0","resolution":{"observed_at":"2026-08-14T04:19:01.757177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2101.02003/citation-record","integrity":"/paper/2101.02003/integrity","json":"/paper/2101.02003/citation-record.json","paper":"/paper/2101.02003"},"outbound":[],"paper":{"arxiv_id":"2101.02003","last_updated":"2021-01-06T13:18:02Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-21T20:17:09.867568Z","submitted_at":"2021-01-06T13:18:02Z","title":"Algorithms and Hardness for Multidimensional Range Updates and Queries"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2101.02003."}