{"as_of":"2026-08-16T14:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:346829213535ea41e449b72968630ceea00588a8ee820e7abafd51824c689344","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:35:07.782475Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.09648/citation-record","integrity":"/paper/1908.09648/integrity","json":"/paper/1908.09648/citation-record.json","paper":"/paper/1908.09648"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.374941Z","title":"Agarwal and C","venue":null,"work_id":"49897158-ff05-4564-a6e0-06e9116fd68d","year":2002},"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":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.599872Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:ba7858dda64929a82dec2958b81a5dada1ab330969e0d16c83794cbe3f6fc997","observation_id":"a4b0ae4a-c3ca-45e9-b6a2-7610ea5d010d","resolution":{"observed_at":"2026-08-14T12:35:08.378538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.363865Z","title":"Agarwal, M","venue":null,"work_id":"e3e02327-5d2b-4535-9b0c-429ff290d698","year":1998},"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":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.605164Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:9b18c7d58f0a2b3830818d2e00958259a2bf6c06a36c5be5027501107ea07cfb","observation_id":"489d3f07-f820-42ab-9b52-719f5a60d0d7","resolution":{"observed_at":"2026-08-14T12:35:08.367650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.351720Z","title":"Auger, J","venue":null,"work_id":"61b90696-8d9e-4dfe-89c7-459ef640da21","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":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.608533Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:ae70a4f8b084cfa9fea3d3e387a9c4ad486f40a7b1a13c7978ff4e88be29a895","observation_id":"c6e40562-22c1-43dd-a31d-ca1b21ce9c00","resolution":{"observed_at":"2026-08-14T12:35:08.355945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"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"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00849","last_updated":"2018-03-02T13:58:44Z","snapshot_observed_at":"2026-08-14T19:40:17.173030Z","submitted_at":"2018-03-02T13:58:44Z","title":"Maximum Volume Subset Selection for Anchored Boxes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00849","snapshot_observed_at":"2026-08-14T12:35:07.616439Z","title":"Bringmann, S","venue":null,"work_id":null,"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":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.616439Z"},"links":{"cited_paper":"/paper/1803.00849","citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:d83f03925e416e6fee81a47e3d1efa7bf514a78cedccc897987cd2e9b3957248","observation_id":"add8c2a2-d879-42cb-a42d-be36aacda006","resolution":{"observed_at":"2026-08-14T12:35:07.616439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.338468Z","title":"Bringmann, T","venue":null,"work_id":"e715b790-d4d5-48f8-8a44-82656bb16768","year":2014},"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":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.620612Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:9c32fe70030b4718f090dedad94a1c028e9c68ffdb82e995f1542be6dbfa811d","observation_id":"123848b9-d223-4e50-b439-1a08e0f20dbd","resolution":{"observed_at":"2026-08-14T12:35:08.342930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.325748Z","title":"Calik, M","venue":null,"work_id":"dc7ef46b-8521-4085-ae84-911f9e235bdf","year":2015},"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":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.624991Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:463a30ce6ae98dcf8362c75e151e4b260743b76519099a19167453e2b54ee270","observation_id":"8af57929-d641-478b-88a3-fe4251fdc9c2","resolution":{"observed_at":"2026-08-14T12:35:08.329994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.313831Z","title":"Calik and B","venue":null,"work_id":"0a9dec1f-dbfc-4530-96d3-59ca6efdf8db","year":2013},"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":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.628700Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:7cddfd81d69ba87c159333ae9df9a704465281b70ae833fee7f2e339c884e6fb","observation_id":"8f1ca6ac-6787-41c0-914c-f24596aab4a8","resolution":{"observed_at":"2026-08-14T12:35:08.317660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.302326Z","title":"Callaghan, S","venue":null,"work_id":"bdd5d85c-6c56-46cd-879f-4ed2abc158ce","year":2017},"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":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.632499Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:d9d6fce592fcf8feff995397b812d8fe09d32517b98f5f5fb5fab3fb9130c806","observation_id":"28dab5f1-6129-4727-965a-1f9921496ada","resolution":{"observed_at":"2026-08-14T12:35:08.306216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.290574Z","title":"Network and discrete location: models, algorithms and appl ications","venue":null,"work_id":"777b4ba1-b6a3-4c16-b4f6-c8caae8994f7","year":1995},"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":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.636149Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:c2726e6a41a484a13d6eb984f0a4dc4e40b9067f9222de5a5314ac5ccac79661","observation_id":"326df8e3-bd26-416d-8bf6-e38468bfd4f8","resolution":{"observed_at":"2026-08-14T12:35:08.294893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.278649Z","title":"The p-centre problemheuristic and optima l algorithms","venue":null,"work_id":"a25c7276-b0f5-4f2b-8a9c-45e32dd4c716","year":1984},"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":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.639947Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:f581fc45a8d2bc579d6d37ec9729bc375942d2e1bf384804525facf35b3cff26","observation_id":"29603b8e-4dcc-40ae-b8f7-63b130c8f7a3","resolution":{"observed_at":"2026-08-14T12:35:08.282448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.266498Z","title":"On the rectangular p-center problem","venue":null,"work_id":"53f59522-b1f7-4cea-858e-9d94fd3e6bb5","year":1987},"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":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.644934Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:03c631f144d0f030cbbdf66a141e5ee982d38d21ed006b66c068e52c12a428ee","observation_id":"dadaabe8-e414-422c-8246-b48e3e98ff5b","resolution":{"observed_at":"2026-08-14T12:35:08.270369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.252604Z","title":null,"venue":null,"work_id":"6c2e64cb-d9e4-4991-b03b-c0d122cea6ef","year":2015},"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":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.649020Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:6ff87de9441e78a27c128cf3811b595017acd9e3a41d4e129a76a71d11431c4a","observation_id":"cb7e0e56-e1bf-44c5-9f9f-10ffcb729060","resolution":{"observed_at":"2026-08-14T12:35:08.257659Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.241162Z","title":"Dupin, F","venue":null,"work_id":"f1116763-6e78-4298-9663-309fa8ec491d","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":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.653058Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:099a1a7c676594e0d7ac1e076676dd529539e5e69e42dd0a031e3b70482ecdd4","observation_id":"e000bc61-1dff-45b6-93a5-5a54f5765d29","resolution":{"observed_at":"2026-08-14T12:35:08.245053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.229018Z","title":"Dupin, F","venue":null,"work_id":"74580c92-bbc6-4eaa-b8b8-1ad97e374e2c","year":2019},"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":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.656769Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:f29e66fecb34d2868a22ab02416b4f46fed22110427813c64921d05cee235a6a","observation_id":"64768f23-a0d9-45e9-8a2c-4b151e777ac8","resolution":{"observed_at":"2026-08-14T12:35:08.233059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1806.02098","last_updated":"2020-05-21T09:23:14Z","snapshot_observed_at":"2026-08-14T19:06:58.005569Z","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:01976f360ccc4ae932347e2bd3a4ae9a82bba7466492c48c04909b0dbb0c1868","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-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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.216751Z","title":"Ehrgott and X","venue":null,"work_id":"f6ddb5ed-481e-4b63-b7ef-d4e6183a3dbe","year":2003},"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":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.665882Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:39a3303c617237b10187e08d51197471582a46d294fd59f7a79e95d5556638e0","observation_id":"c5b2f03e-d1e1-484c-9451-595bb595941c","resolution":{"observed_at":"2026-08-14T12:35:08.220631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.204958Z","title":"Elloumi, M","venue":null,"work_id":"07be0b86-512b-4d4c-bed2-a162b084c935","year":2004},"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":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.669629Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:20fe42ce4f6e8760d58a9f4e8c684e74eedb9231d69b43693b424bc035af1d27","observation_id":"aae4ce70-3fc6-4b64-b4c8-9f81f8c71d47","resolution":{"observed_at":"2026-08-14T12:35:08.208695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.192212Z","title":"Elshaikh, S","venue":null,"work_id":"83c2b1d2-dff1-4a91-ae81-9bc84b3e28a8","year":2015},"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":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.673362Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:82030bbb1985aa6523a925161e9e5a60201c40ada48dc5cf5bc02b40238cd414","observation_id":"73298cbe-2687-4548-882f-c57d0dec2c0f","resolution":{"observed_at":"2026-08-14T12:35:08.196842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.180241Z","title":"Eppstein","venue":null,"work_id":"3189e90d-28a1-488b-a2fc-877f9c06e63f","year":1997},"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":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.676522Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:53b5f76b36bf2a33a34a2224613c59f2cd99b9a4be43d915874399acef565f73","observation_id":"f756fe19-8d9d-481e-bded-76c3cfc55eb8","resolution":{"observed_at":"2026-08-14T12:35:08.184134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.168133Z","title":"Ferone, P","venue":null,"work_id":"b74bb519-8b34-450e-907b-366b66441dad","year":2017},"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":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.680395Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:633efe32d4b55a59d48d12e5e007a8b52a560b7680fe28ca21985a7860191acb","observation_id":"b702453a-6a8c-4090-93b0-a36034f94f58","resolution":{"observed_at":"2026-08-14T12:35:08.172352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.155488Z","title":"Gonzalez","venue":null,"work_id":"8a90d880-8914-415f-bc41-19e5cf6a3358","year":1985},"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":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.683980Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:bf130c37c39002781e5b64f81068472bae4d08cfe787e3f972c118c81aa92f38","observation_id":"9f942540-5711-4457-a7cb-790bb5ae09ba","resolution":{"observed_at":"2026-08-14T12:35:08.159443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1701.07204","last_updated":"2018-04-25T10:36:08Z","snapshot_observed_at":"2026-08-14T21:19:37.245174Z","submitted_at":"2017-01-25T08:44:04Z","title":"Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.07204","snapshot_observed_at":"2026-08-14T12:35:07.687885Z","title":"Grønlund et al","venue":null,"work_id":null,"year":2017},"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":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.687885Z"},"links":{"cited_paper":"/paper/1701.07204","citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:9fb49ae5b2bdbb1a1f7db68404be457966c373b8307b53db1b67a66594365d76","observation_id":"c64ae6c3-0fa8-43d8-984d-c1884cf1089f","resolution":{"observed_at":"2026-08-14T12:35:07.687885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.143675Z","title":"Guo-Hui and G","venue":null,"work_id":"561aa9da-972b-4c95-889f-25c6384fa2fe","year":1998},"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":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.691839Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:48a4750d1026073f1457db93e279d32fbd5ca2388c2cddf397673bbb36a4e386","observation_id":"c6f4a0f3-1a18-4733-9508-a75dbdc6271f","resolution":{"observed_at":"2026-08-14T12:35:08.147491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.131956Z","title":"Hochbaum","venue":null,"work_id":"5690bfd8-427a-48d8-a961-9ec0a19bf9e8","year":1984},"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":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.695268Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:c8d05ac55f70be2070894b8092d3eb874ba2b798d2e5a2e4b6ee79e4abb324ef","observation_id":"0f67fba2-30ec-43d4-a352-8ea27ea1e1d7","resolution":{"observed_at":"2026-08-14T12:35:08.136033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.119942Z","title":"Hochbaum and D.B","venue":null,"work_id":"1313d111-617b-48ab-9909-2bda0be51ee2","year":1985},"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":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.699299Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:41a6c18f475eea05f4112359930caf8205b6bd2b60f95dd16ebd833bb8abc65c","observation_id":"ae76354e-8abb-4d16-b2c7-88b429ebcf3b","resolution":{"observed_at":"2026-08-14T12:35:08.124378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.107235Z","title":"Hsu and G","venue":null,"work_id":"3fda7834-4102-4d3b-a283-3992490720e9","year":1979},"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":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.704242Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:3ca6a20b11517143b637ab5b7a8ca5771c72598ffca1552cd271d87a5307109b","observation_id":"948f2348-4513-4006-a851-b6ab3dc4a0a5","resolution":{"observed_at":"2026-08-14T12:35:08.111438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.094377Z","title":"Hwang, R","venue":null,"work_id":"4e5f1b21-d823-4470-99cb-292857bdb5a2","year":1993},"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":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.709472Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:9c5734abbfe4f9bc79eaea355d3b3e88ae786054d8914bc4b849042f76b0e5cd","observation_id":"ea4c4fda-2c64-423d-b8b9-3eb4097961e6","resolution":{"observed_at":"2026-08-14T12:35:08.098539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.082814Z","title":"Karmakar, S","venue":null,"work_id":"711a0607-a012-4e99-83cd-27c9293442d1","year":2013},"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":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.713637Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:c267f4df2861d08faeada6c9aaca03d0680ea7465903ff9f5005daeca757fc0a","observation_id":"5ca540ea-901c-460a-945e-327e646c23ee","resolution":{"observed_at":"2026-08-14T12:35:08.086683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.071086Z","title":null,"venue":null,"work_id":"535690db-2e14-4984-b29d-7659244a6140","year":2016},"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":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.717762Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:234f6a2a9f6015a5cf59b81668c519cd96c2a711eb713e7725748e7ec71ee896","observation_id":"66677d2b-9f00-4671-bc45-2bd493dc1945","resolution":{"observed_at":"2026-08-14T12:35:08.075096Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.057644Z","title":"Mahajan, P","venue":null,"work_id":"332c66c2-bf98-4ea5-af29-4658f4c1150b","year":2012},"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":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.722904Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:aac0515c83c372970c6d031a0cceb45983f6b1a3b5f0c1efa714b7e983a62d50","observation_id":"19d1607b-1f74-49d5-9e29-246fccfa45df","resolution":{"observed_at":"2026-08-14T12:35:08.062091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.047003Z","title":null,"venue":null,"work_id":"c32366a1-e6b1-4d13-9a7e-9bc4d195ef57","year":1983},"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":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.726685Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:5e111834527099f6577f5175254ef90132eb36f9cab46e8e828174cf3f40d0f4","observation_id":"a1f95124-b0a1-4f83-90cc-ad58e4e551b1","resolution":{"observed_at":"2026-08-14T12:35:08.050389Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.035878Z","title":"Megiddo and K","venue":null,"work_id":"1015a35a-a50e-463e-935f-a3f3f1b37eac","year":1984},"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":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.730360Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:0a43dd231eb1719b4339b5544a84ce79445d0664c8b5e9a11bf4eb29db44b75d","observation_id":"38fed393-ab33-43e9-a788-b0caf5a56ee0","resolution":{"observed_at":"2026-08-14T12:35:08.039657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.024280Z","title":"Megiddo and A","venue":null,"work_id":"e8ee4418-5cf8-4540-88ab-e930407fb253","year":1983},"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":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.734183Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:69e5a8375e206c7c3bc8209919a32e1abef6f3b44904d8bd27b485f04e470ce2","observation_id":"b596a23d-8a15-4183-b8cb-372dae2dc0a8","resolution":{"observed_at":"2026-08-14T12:35:08.028047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:08.012612Z","title":"Mladenovi´ c, M","venue":null,"work_id":"0f12a867-9893-4d16-a777-8b20eae08266","year":2003},"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":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.738184Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:6f1b1ad2e0d6022d61ce3e851417f7acae10fbda912c3d2d5963a4738627a3ef","observation_id":"daace1c1-957d-4caf-aedd-b2783adf5c46","resolution":{"observed_at":"2026-08-14T12:35:08.016645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.999967Z","title":"Peugeot, N","venue":null,"work_id":"3881efd8-9d12-41ab-8e61-13e9440d5537","year":2017},"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":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.741508Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:4d0a22968df36b0503a82d2e63a6c7e3c8f40e6fcba97271dd270a7ff01f51c1","observation_id":"4b4b3628-e027-49d1-8785-ccc8374d0f28","resolution":{"observed_at":"2026-08-14T12:35:08.004544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.987643Z","title":"Pulido and C","venue":null,"work_id":"b4338dc8-a8d3-43e1-ba07-ce05183f8974","year":2004},"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":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.744896Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:5d9ff5e3691e6c64d7b2c7ae861601ee1630f9ec1fe24133e1998d3e99032f41","observation_id":"d864f706-d3c6-4f5a-9ff7-1e6db82255ab","resolution":{"observed_at":"2026-08-14T12:35:07.991827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.975737Z","title":"Ramirez-Atencia, S","venue":null,"work_id":"983498ae-b136-4d5c-9a6c-6bfe689db28f","year":2017},"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":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.748217Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:4ec191f70259ec15e2501321364d7b4696b6839d8b41ed3d8cb48010e6bab980","observation_id":"829e5222-d208-4bcd-8c5a-f9ed2fb7fda2","resolution":{"observed_at":"2026-08-14T12:35:07.979840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.964140Z","title":"Kubushishi","venue":null,"work_id":"12fd04ab-9782-4c73-8974-b1403183e9ca","year":1994},"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":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.751678Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:d74fc9d8d1251b241b4c0d283349ec90aacd04dd3fde1f7cf3fa1e0fbfef235a","observation_id":"d022ae77-5b40-4c96-8838-7ab3a6ce8505","resolution":{"observed_at":"2026-08-14T12:35:07.968010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.953119Z","title":"Samorani, Y","venue":null,"work_id":"3bd11a27-aeae-4da9-acf5-5e7d7d6aa94a","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":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.755095Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:24094dc2ef6500241f436dcde085a7847ecf642269f8822f3c39ea3582104877","observation_id":"b975a63d-c299-48be-8590-325eab5008d8","resolution":{"observed_at":"2026-08-14T12:35:07.956918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.942191Z","title":null,"venue":null,"work_id":"1088976e-1cef-4a47-ba26-03b31476cc9f","year":2000},"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":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.758836Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:673e19b8575d77040bd796ba51ba16cabf588200d3d323889c6a5a0a9960c895","observation_id":"6db0b622-8983-4466-ab0d-c46888716fed","resolution":{"observed_at":"2026-08-14T12:35:07.945890Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.930519Z","title":null,"venue":null,"work_id":"6e0d7d6c-73b8-42a0-a280-70f3c8b7d235","year":1997},"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":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.762533Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:4e15df9cde381c64d4d3bb90f87c75ae2a902df54a1ab515f5d9f77d99aab8c5","observation_id":"d75f5694-45cb-44a0-8613-bcfd7fdf394e","resolution":{"observed_at":"2026-08-14T12:35:07.934727Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.918118Z","title":"Sintorn and U","venue":null,"work_id":"ac89eecc-f245-4aad-b125-eb81e6920812","year":2008},"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":43,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.766201Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:de9cb857c987f0a959b2f91100b94a1ea3eec00cf9688656f996fffd1a652f0c","observation_id":"3452f2be-f3ea-47b1-8788-3f72963432bd","resolution":{"observed_at":"2026-08-14T12:35:07.922151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.905060Z","title":null,"venue":null,"work_id":"e3668ab7-8184-4a5f-b8b3-5b5e82aaf078","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":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.770018Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:ab0b17f3620782c1aee0b9fb034d32d2fc8ef3d085abc7453e3ddaebb14a669f","observation_id":"327e0dc9-0961-4476-8923-ea44eb9f4eca","resolution":{"observed_at":"2026-08-14T12:35:07.909945Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.893104Z","title":"W ang and M","venue":null,"work_id":"56bab0ba-ef25-40cd-b6f5-e2807471448d","year":2011},"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":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.773752Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:eaa70f96a12ce99274683876054fb89b6bd0c542f9c5a3bde1e078a84061764b","observation_id":"6281723e-cbd1-4e2e-8b2a-769a2bd7096f","resolution":{"observed_at":"2026-08-14T12:35:07.897122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.880274Z","title":"Zio and R","venue":null,"work_id":"341e7ad6-4cba-40df-aea0-a66f8ba05019","year":2011},"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":46,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.778428Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:09bff0813f130850422f4ab86141a7ad11ff69f0675e00b63ab94469d92bcbb0","observation_id":"ce22c41c-1dae-42d5-b212-15a7732d48b8","resolution":{"observed_at":"2026-08-14T12:35:07.884048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:07.868451Z","title":"□ Lemma 10","venue":null,"work_id":"a04105c2-c37f-4d59-bd4c-d8349445b1e9","year":null},"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":47,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:07.782475Z"},"links":{"citing_paper":"/paper/1908.09648"},"observation_digest":"sha256:ff80b01e75feef250e3016173ad757ea586717fc1cd5da65e1c6daed750d8339","observation_id":"7da712eb-6122-4a19-b0cc-68a309745f01","resolution":{"observed_at":"2026-08-14T12:35:07.872451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"1908.09648","last_updated":"2019-08-19T22:24:07Z","latest_version":1,"primary_category":"cs.CG","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"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":37},"total_outbound_references":47},"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 16 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:1908.09648."}