{"as_of":"2026-08-24T03:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:751846bd7eae8cb01bc59555b1bbbe43590aadbe08fd82923a3565b68e9c283d","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-23T06:30:58.430688+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-06T18:24:55.240825Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":4,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1503.02504","last_updated":"2015-10-02T12:51:33Z","snapshot_observed_at":"2026-08-14T22:57:10.016176Z","submitted_at":"2015-03-09T15:04:30Z","title":"The Quicksort algorithm and related topics","version":4},"cited_work":{"arxiv_id":"1503.02504","doi":"10.48550/arxiv.1503.02504","metadata_source":"pith","pith_arxiv_id":"1503.02504","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The Quicksort algorithm and related topics","venue":"cs.DS","work_id":"2c49fe69-fe3f-4328-bb3b-06d0229ee31c","year":2015},"citing_paper":{"arxiv_id":"2507.08615","last_updated":"2025-07-11T14:12:20Z","snapshot_observed_at":"2026-08-15T12:57:13.290502Z","submitted_at":"2025-07-11T14:12:20Z","title":"Expected and minimal values of a universal tree balance index","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:24:55.240825Z"},"links":{"cited_paper":"/paper/1503.02504","citing_paper":"/paper/2507.08615"},"observation_digest":"sha256:df142ae65ab784c85284938447548d8b7a66be47cc806297378430edcb8800bf","observation_id":"bd475b3e-c1d5-4cff-bb7d-f64a2daf99ec","resolution":{"observed_at":"2026-08-06T18:25:19.407790Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1503.02504/citation-record","integrity":"/paper/1503.02504/integrity","json":"/paper/1503.02504/citation-record.json","paper":"/paper/1503.02504"},"outbound":[],"paper":{"arxiv_id":"1503.02504","last_updated":"2015-10-02T12:51:33Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T22:57:10.016176Z","submitted_at":"2015-03-09T15:04:30Z","title":"The Quicksort algorithm and related topics"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1503.02504."}