{"as_of":"2026-08-06T12:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:306f203708398be39edb765b48e4bc3413d15e2a2aff9129d49f4ccccb6dc8c3","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-06T06:34:29.942622+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-06-26T14:55:48.622856Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T05:59:38.430494Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.06069","last_updated":"2022-05-12T13:06:11Z","snapshot_observed_at":"2026-07-30T19:45:44.147237Z","submitted_at":"2022-05-12T13:06:11Z","title":"Sequential algorithms for testing identity and closeness of distributions","version":1},"cited_work":{"arxiv_id":"2205.06069","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.06069","snapshot_observed_at":"2026-07-04T05:59:38.430494Z","title":"Sequential algorithms for testing identity and closeness of distributions.arXiv preprint arXiv:2205.06069, 2022","venue":null,"work_id":"ab16524c-7b57-44b9-b33d-71672fc86296","year":2022},"citing_paper":{"arxiv_id":"2606.21253","last_updated":"2026-06-19T09:30:55Z","snapshot_observed_at":"2026-08-04T23:04:21.359555Z","submitted_at":"2026-06-19T09:30:55Z","title":"Gradient-Free Warm-Start Library Recovery: an Amortized-Regret Separation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T14:55:48.622856Z"},"links":{"cited_paper":"/paper/2205.06069","citing_paper":"/paper/2606.21253"},"observation_digest":"sha256:848ae40ffcdbbe579e9d73a61017a5ddce29ef96d5a37387f1c5af6b73c9536e","observation_id":"fadb7398-e75c-47cc-ae55-7bdb153c84a6","resolution":{"observed_at":"2026-07-04T05:59:38.432329Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2205.06069/citation-record","integrity":"/paper/2205.06069/integrity","json":"/paper/2205.06069/citation-record.json","paper":"/paper/2205.06069"},"outbound":[],"paper":{"arxiv_id":"2205.06069","last_updated":"2022-05-12T13:06:11Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-30T19:45:44.147237Z","submitted_at":"2022-05-12T13:06:11Z","title":"Sequential algorithms for testing identity and closeness of distributions"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2205.06069."}