{"as_of":"2026-08-17T02:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:32240c5d3b5a5f56e61f40a1ea912b5556f99502c6c46c72f40b7732a0ea238a","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-16T06:30:59.297886+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-14T12:35:07.612021Z","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-14T12:35:07.855634Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"0902.3282","last_updated":"2009-02-19T02:00:34Z","snapshot_observed_at":"2026-08-15T05:54:40.688198Z","submitted_at":"2009-02-19T02:00:34Z","title":"Computing k-Centers On a Line","version":1},"cited_work":{"arxiv_id":"0902.3282","doi":null,"metadata_source":"pith","pith_arxiv_id":"0902.3282","snapshot_observed_at":"2026-08-14T12:35:07.855634Z","title":"Computing k-Centers On a Line","venue":"cs.CG","work_id":"b5aad2f7-b3c9-44b1-9dd1-98f13fa1b03f","year":2009},"citing_paper":{"arxiv_id":"1908.09648","last_updated":"2019-08-19T22:24:07Z","snapshot_observed_at":"2026-08-16T10:28:37.372549Z","submitted_at":"2019-08-19T22:24:07Z","title":"Planar p-center problems are solvable in polynomial time when clustering a Pareto Front","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.612021Z"},"links":{"cited_paper":"/paper/0902.3282","citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:93b2864af9991e9fe11cf30964353e518a28115b82f5e9161639efbce2eab219","observation_id":"581dabb3-4953-451a-8706-9b1aef963dd4","resolution":{"observed_at":"2026-08-14T12:35:07.859638Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/0902.3282/citation-record","integrity":"/paper/0902.3282/integrity","json":"/paper/0902.3282/citation-record.json","paper":"/paper/0902.3282"},"outbound":[],"paper":{"arxiv_id":"0902.3282","last_updated":"2009-02-19T02:00:34Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-15T05:54:40.688198Z","submitted_at":"2009-02-19T02:00:34Z","title":"Computing k-Centers On a Line"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:0902.3282."}