{"as_of":"2026-08-18T17:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1671c2f33b61e18e42af8f942d0418d7c8e1ff9fd40d3297004c306fa1074659","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-18T06:34:40.430872+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-15T15:55:29.521002Z","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-15T15:55:29.887007Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.03738","last_updated":"2025-06-19T12:11:34Z","snapshot_observed_at":"2026-08-16T17:36:27.277109Z","submitted_at":"2021-12-07T14:52:04Z","title":"A more efficient algorithm to compute the Rand Index for change-point problems","version":2},"cited_work":{"arxiv_id":"2112.03738","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.03738","snapshot_observed_at":"2026-08-15T15:55:29.887007Z","title":"A more efficient algorithm to compute the Rand Index for change-point problems","venue":"cs.DS","work_id":"667963c7-f8f1-412a-be82-e2a96dccfd86","year":2021},"citing_paper":{"arxiv_id":"2509.21160","last_updated":"2026-07-08T16:16:06Z","snapshot_observed_at":"2026-08-15T21:50:57.399397Z","submitted_at":"2025-09-25T13:44:34Z","title":"Fast segmentation of watermarked texts from large language models through an epidemic change-point framework","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T15:55:29.521002Z"},"links":{"cited_paper":"/paper/2112.03738","citing_paper":"/paper/2509.21160"},"observation_digest":"sha256:223e43cd7aa1b39dc2bd0ce7de37fd98199cbff4a1e0454d0807b63f05d6308b","observation_id":"75d0b4f1-a20b-4329-8d97-d23ced816d9e","resolution":{"observed_at":"2026-08-15T15:55:29.892814Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2112.03738/citation-record","integrity":"/paper/2112.03738/integrity","json":"/paper/2112.03738/citation-record.json","paper":"/paper/2112.03738"},"outbound":[],"paper":{"arxiv_id":"2112.03738","last_updated":"2025-06-19T12:11:34Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T17:36:27.277109Z","submitted_at":"2021-12-07T14:52:04Z","title":"A more efficient algorithm to compute the Rand Index for change-point problems"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2112.03738."}