{"as_of":"2026-08-17T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:743884a90583bb5839139ccc1ec762932c09f85f87da9755a4d230f90c3ec850","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-17T06:30:58.91139+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.661608Z","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.826904Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.02098","last_updated":"2020-05-21T09:23:14Z","snapshot_observed_at":"2026-08-17T04:35:43.061639Z","submitted_at":"2018-06-06T10:24:07Z","title":"k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front","version":4},"cited_work":{"arxiv_id":"1806.02098","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.02098","snapshot_observed_at":"2026-08-14T12:35:07.826904Z","title":"k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front","venue":"cs.CC","work_id":"6221eced-aff6-4ef4-ae4c-1684cf2135b3","year":2018},"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":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.661608Z"},"links":{"cited_paper":"/paper/1806.02098","citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:ef6777cb1d2c5b8497ed848c8e44f2ebeab338f11ade150f0d381ab6bf6228d1","observation_id":"53a28478-1559-4592-9296-ac8caa421ce9","resolution":{"observed_at":"2026-08-14T12:35:07.833087Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1806.02098/citation-record","integrity":"/paper/1806.02098/integrity","json":"/paper/1806.02098/citation-record.json","paper":"/paper/1806.02098"},"outbound":[],"paper":{"arxiv_id":"1806.02098","last_updated":"2020-05-21T09:23:14Z","latest_version":4,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-17T04:35:43.061639Z","submitted_at":"2018-06-06T10:24:07Z","title":"k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:1806.02098."}