{"as_of":"2026-08-13T15:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b9326e402043ce873e38a636edbd4d114d1c46f9deba45136a459d34354ee47","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:23:45.747481Z","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-12T15:23:47.773346Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1603.04892","last_updated":"2016-03-15T21:38:57Z","snapshot_observed_at":"2026-08-01T17:41:35.599057Z","submitted_at":"2016-03-15T21:38:57Z","title":"The landscape of bounds for binary search trees","version":1},"cited_work":{"arxiv_id":"1603.04892","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.04892","snapshot_observed_at":"2026-08-12T15:23:47.773346Z","title":"The landscape of bounds for binary search trees","venue":"cs.DS","work_id":"f166a742-7e10-43dd-8ab2-91761153e81b","year":2016},"citing_paper":{"arxiv_id":"2411.14387","last_updated":"2024-11-21T18:23:28Z","snapshot_observed_at":"2026-08-12T15:11:49.874257Z","submitted_at":"2024-11-21T18:23:28Z","title":"Hardness Amplification for Dynamic Binary Search Trees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:23:45.747481Z"},"links":{"cited_paper":"/paper/1603.04892","citing_paper":"/paper/2411.14387"},"observation_digest":"sha256:55726c8c8489a59768a8cad603e3724de9ea7dd49d045199a246ab4106546e91","observation_id":"b02bc093-3e47-4e72-9863-9b7401c75d1b","resolution":{"observed_at":"2026-08-12T15:23:47.839559Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1603.04892/citation-record","integrity":"/paper/1603.04892/integrity","json":"/paper/1603.04892/citation-record.json","paper":"/paper/1603.04892"},"outbound":[],"paper":{"arxiv_id":"1603.04892","last_updated":"2016-03-15T21:38:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-01T17:41:35.599057Z","submitted_at":"2016-03-15T21:38:57Z","title":"The landscape of bounds for binary search trees"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1603.04892."}