{"as_of":"2026-08-16T13:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:035456e93d28eb0ac3cc3aadc6308d18791cda7220915e6caa72d0d52f70c399","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:39:23.330048Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"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.04976/citation-record","integrity":"/paper/1908.04976/integrity","json":"/paper/1908.04976/citation-record.json","paper":"/paper/1908.04976"},"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-14T13:39:23.960790Z","title":"Ailon, M","venue":null,"work_id":"fe7fe535-52a9-42a4-ac1a-e4af3fdb74f6","year":2005},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.143397Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:19ca5d5524c392660fd6c28c4e558859b2a21eb4953e37e5e8fe6a3a1e01bbac","observation_id":"75b3f9cc-8735-472c-b37e-d4497def65ee","resolution":{"observed_at":"2026-08-14T13:39:23.964278Z","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-14T13:39:23.948573Z","title":"Approximate correlation clustering using same-cluster queries","venue":null,"work_id":"09698c65-652d-4644-81b7-430c64a67c66","year":2018},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.148188Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:302c743ee848ff1a5c434c1bdd628b3e0857d6f388cb5321962d3c64e17de468","observation_id":"8ceb1df9-b2fa-4f69-bca4-68d4eaef9c98","resolution":{"observed_at":"2026-08-14T13:39:23.951893Z","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":"1704.01862","last_updated":"2017-10-04T13:02:34Z","snapshot_observed_at":"2026-08-14T21:07:58.870134Z","submitted_at":"2017-04-06T14:36:58Z","title":"Approximate Clustering with Same-Cluster Queries","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.01862","snapshot_observed_at":"2026-08-14T13:39:23.152063Z","title":"Approximate clustering with same-cluster queries","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.152063Z"},"links":{"cited_paper":"/paper/1704.01862","citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:b2b16f21dcfbea4a244f493792a7c2c6ef0f7dfd4c8154a5d5dba17f11820201","observation_id":"2ec18377-8c53-47d4-a0f1-85e63c7c28e0","resolution":{"observed_at":"2026-08-14T13:39:23.152063Z","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-14T13:39:23.937628Z","title":"Aggregating inconsistent information: ranking and clustering","venue":null,"work_id":"e2748f47-fe2f-43a8-96cb-2266e1db51bb","year":2008},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.156690Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:7e6add34a98bfbf24259aa4ac44eda821dc732324f281037650ed1d741e4d1e5","observation_id":"bae73cde-5037-48ac-b5f3-d921cf092d2f","resolution":{"observed_at":"2026-08-14T13:39:23.941499Z","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-14T13:39:23.926545Z","title":"Ashtiani, S","venue":null,"work_id":"b250602a-8bc8-41ae-8972-7c6a2fdcffba","year":2016},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.160789Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:55463e2c8dd23c1d33083fbc9286ced530439601b13eecc7c9aedf8fd2ea108b","observation_id":"5ea7f118-d745-4b74-84b3-5c5f130b9404","resolution":{"observed_at":"2026-08-14T13:39:23.930179Z","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-14T13:39:23.915349Z","title":null,"venue":null,"work_id":"1c0c53b8-e3b0-4be6-928d-6d367a0b30f4","year":2008},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.165125Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:17b5f55789ba5975c86ac3bbb827dbaf3383a1d15bc479d09cf7073116bb7b04","observation_id":"ba113d6e-8026-40cd-9cc1-1efa514c09b6","resolution":{"observed_at":"2026-08-14T13:39:23.919362Z","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-14T13:39:23.900742Z","title":"Bansal, A","venue":null,"work_id":"9019fa91-f9af-4874-b3d1-6ffc9b2b5278","year":2002},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.169870Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:22785c45d8b0ef1b6458ed2ccff833ee84d993957af2ef6d303e79c89c846f4e","observation_id":"217c86d7-378a-4976-a350-f2d31678fc82","resolution":{"observed_at":"2026-08-14T13:39:23.906901Z","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-14T13:39:23.887956Z","title":"Going weighted: Parameterized algorithms for cluster editing","venue":null,"work_id":"4bc46d6e-13d3-4a22-bacf-02be30dbf320","year":2009},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.174690Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:41e754737cc378b828312ed329b1365f66be719dec1f9b43330d8428eeb03ab9","observation_id":"a805c63f-2450-4373-8bb3-569ab0877194","resolution":{"observed_at":"2026-08-14T13:39:23.891806Z","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-14T13:39:23.875203Z","title":"Clustering with qualitative informa- tion","venue":null,"work_id":"33a4992d-3d0a-4d24-851d-0fa8fb08a00b","year":2005},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.178651Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:deee0ca45ea7997a5892afd3917f4be53fa8960b5ef4f4bb45b98aac9e1190fb","observation_id":"3878296a-352e-4bc0-aa59-bbfaca8854b6","resolution":{"observed_at":"2026-08-14T13:39:23.879135Z","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-14T13:39:23.862983Z","title":"Chawla, K","venue":null,"work_id":"2abd2284-6a7b-4511-b27d-e7f7d343a1b3","year":2015},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.182355Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:de628efa7ba06d4aebfee48a03b51589614e14f32d29c1894f9e304aa673bf5c","observation_id":"6aa17e25-2130-4a97-bef9-2c3553567f72","resolution":{"observed_at":"2026-08-14T13:39:23.866474Z","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-14T13:39:23.850402Z","title":"Febrl: a freely available record linkage system with a graphical user interface","venue":null,"work_id":"c6379a67-b86e-4335-8390-f027dbe45c79","year":2008},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.188677Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:00c6e3ff301d2d00a6e4b51cb23e6fc37dfbc661c86d53fcaf13bbcc2d769d17","observation_id":"24555c1c-5007-4613-bfc8-3c56210d4fd2","resolution":{"observed_at":"2026-08-14T13:39:23.854121Z","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-14T13:39:23.837940Z","title":"Correlation clustering in general weighted graphs","venue":null,"work_id":"e3a88ac2-988a-4aeb-9c3a-14f30bcf02af","year":2006},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.193020Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:f1cf08419c6660ebbd224aa27946bc1d10fdbd5b4738f2c9f356313e4646cfbf","observation_id":"7cc7d893-6e75-47c6-8b8c-d220c735b48d","resolution":{"observed_at":"2026-08-14T13:39:23.842410Z","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-14T13:39:23.825763Z","title":null,"venue":null,"work_id":"f20bbc59-4e8c-4995-b044-9a7bf61d666f","year":2016},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.197312Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:f337dc9b6b6935c1fd4b69bc8cf43586daa4a08f5c61d41934af3076960779ba","observation_id":"e4d4dc4d-052b-449d-a478-4fb162a4fb54","resolution":{"observed_at":"2026-08-14T13:39:23.829354Z","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-14T13:39:23.814365Z","title":"Robust entity resolution using a crowdoracle","venue":null,"work_id":"11c14f08-5350-42f9-a4ee-5785d46d5ec0","year":2018},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.201647Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:5135a945beb57a30d33c3b76f2dd8d45b3715625527bcb7662a6829597633f1e","observation_id":"624c0905-2100-4c68-9043-8c8781a530fd","resolution":{"observed_at":"2026-08-14T13:39:23.818089Z","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-14T13:39:23.800448Z","title":"Semi-supervised algorithms for approxi- mately optimal and accurate clustering","venue":null,"work_id":"9792bbbc-4253-47dc-b43d-65efa4fff3f1","year":2018},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.206071Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:290859c8e24447da4a0e4267e335ec2a872dfd67b7532eeb302f3a859c26f15b","observation_id":"f3d8a66a-547a-4e0c-8c72-f870e262bb6a","resolution":{"observed_at":"2026-08-14T13:39:23.805768Z","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-14T13:39:23.787933Z","title":"Giotis and V","venue":null,"work_id":"a7841d3a-3249-4364-8f59-8a957ad6815c","year":2006},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.211034Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:cb346db7b658dc48850c156053ecd5f8d55fdde3f9c64d56bba939bf492c27a4","observation_id":"8d705da6-9010-45d8-bb4a-2e58e7131476","resolution":{"observed_at":"2026-08-14T13:39:23.791909Z","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":"1512.00537","last_updated":"2015-12-02T01:03:47Z","snapshot_observed_at":"2026-08-14T22:20:25.021077Z","submitted_at":"2015-12-02T01:03:47Z","title":"Fault-Tolerant Entity Resolution with the Crowd","version":1},"cited_work":{"arxiv_id":"1512.00537","doi":null,"metadata_source":"pith","pith_arxiv_id":"1512.00537","snapshot_observed_at":"2026-08-14T13:39:23.394185Z","title":"Fault-Tolerant Entity Resolution with the Crowd","venue":"cs.DB","work_id":"2cf0cf6a-2e1a-4067-bb35-a941c0224059","year":2015},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.216420Z"},"links":{"cited_paper":"/paper/1512.00537","citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:b86e14498e55fe6cdd3b2504262df89a7c2e6a3f762d8e334a69f33824ae4d7c","observation_id":"f2717861-f0d4-4148-8a89-e20ac8e59abe","resolution":{"observed_at":"2026-08-14T13:39:23.398542Z","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-14T13:39:23.774166Z","title":"Parameterized Algorithmics for Network Analysis: Clustering and Query- ing","venue":null,"work_id":"bab346e8-0df3-427a-81a3-07c04ba68139","year":2011},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.222691Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:79b7a8b9c3a9f9424e3955a6f7a7b6b864f8b376a8095c26d7b47a4a30844a84","observation_id":"5a935736-00cc-4b39-965c-a1bba3d83c88","resolution":{"observed_at":"2026-08-14T13:39:23.779636Z","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":"1810.04361","last_updated":"2018-10-10T04:12:50Z","snapshot_observed_at":"2026-08-14T18:16:58.363173Z","submitted_at":"2018-10-10T04:12:50Z","title":"Semi-supervised clustering for de-duplication","version":1},"cited_work":{"arxiv_id":"1810.04361","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.04361","snapshot_observed_at":"2026-08-14T13:39:23.372007Z","title":"Semi-supervised clustering for de-duplication","venue":"cs.LG","work_id":"472962cf-e4b9-4ba9-bfc3-c29066581cd7","year":2018},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.226564Z"},"links":{"cited_paper":"/paper/1810.04361","citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:5ba515b0cb4b76948351242595b88e0407ee18b930f4bed0106e5b3ec1390b3a","observation_id":"8f1b7cb7-299d-4382-ab66-0dc98cb00fbe","resolution":{"observed_at":"2026-08-14T13:39:23.378905Z","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-14T13:39:23.757523Z","title":"Mazumdar and B","venue":null,"work_id":"9b0770b6-b1b3-4b22-ba4e-576ef682743a","year":2017},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.230769Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:38e6afbda032e815c71f1d8c6c34ef3f65e709c29c1fa4091a976fa811e8bed7","observation_id":"0aad4db0-1cd4-44eb-8846-22d10371f6d1","resolution":{"observed_at":"2026-08-14T13:39:23.761290Z","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-14T13:39:23.743675Z","title":null,"venue":null,"work_id":"7d4987a2-64b3-4255-871a-a2dbfa3f2aac","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.234419Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:f1d449c4b51e15a8cc5f9c4709b6259aa95e99ab41358ede43f2d201077d393a","observation_id":"13201e25-ae9a-4f1b-ac52-13706b208b04","resolution":{"observed_at":"2026-08-14T13:39:23.748038Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-14T13:39:23.727152Z","title":"Modeling the shape of the scene: A holistic representation of the spatial envelope","venue":null,"work_id":"6c46d478-ceba-4560-a020-7c6aa79c4092","year":2001},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.239164Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:c22278ad5922fed9ca33bfa9409846a1ac963f10ac69308acd79e063b9ad5721","observation_id":"c271e568-8f19-41d7-b073-34a47436759e","resolution":{"observed_at":"2026-08-14T13:39:23.732758Z","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-14T13:39:23.713397Z","title":"Entity resolution with crowd errors","venue":null,"work_id":"59d99370-1783-4176-b2ff-d4c13f529aa8","year":2015},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.243889Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:17355b4e4f90aaa67b14e8a994723c1693f85f222979bff7ed4c591b6439ffc7","observation_id":"90b866be-c14c-42c8-87ec-2f91eb98913d","resolution":{"observed_at":"2026-08-14T13:39:23.718504Z","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-14T13:39:23.697254Z","title":"Waldo: An adaptive human interface for crowd entity resolution","venue":null,"work_id":"1615cea3-faaa-4466-b98e-77315f63367c","year":2017},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.248176Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:5910e1c5613914a48bfc0a5efbe1fa5f075170787404ae156a207bcd0196e160","observation_id":"819cf4c5-89e8-4a04-bbe8-2ca7da0248be","resolution":{"observed_at":"2026-08-14T13:39:23.702691Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:39:23.252162Z","title":"Probability with martingales","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.252162Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:2865795c8195b3deca17564b044e902e5873b7827a2bab0b2bf885715e530119","observation_id":"88805723-7834-460c-9c9b-1671b2e2d576","resolution":{"observed_at":"2026-08-14T13:39:23.252162Z","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-14T13:39:23.668016Z","title":"Overview of record linkage and current research directions","venue":null,"work_id":"86a0a9be-f31b-4bd7-a630-89266c064c25","year":2006},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.256727Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:3387e2451c41e5f58ecaa5915fbba18eca6042ece2b946589e2a0379be82577d","observation_id":"d107eca5-37ca-4dc3-a004-a5961fcadc58","resolution":{"observed_at":"2026-08-14T13:39:23.672562Z","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-14T13:39:23.652970Z","title":"Then{u,v} is in exactly one triangle that includes the pivotw, and the algorithm will make a mistake on{u,v} in iteration t regardless of whether uw orvw is queried","venue":null,"work_id":"8dd50c55-3464-4dbb-9c23-e909f8e8a7e1","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.260539Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:b437cce465c7a5d2e350e24391bb47573d2d81314c5454d79efa9bbad794e58d","observation_id":"5fa3261e-e203-4508-abd6-c19a02ad8d44","resolution":{"observed_at":"2026-08-14T13:39:23.657211Z","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-14T13:39:23.639254Z","title":"Then{u,v} is in exactly one triangle that includes the pivotw, and the algorithm will make a mistake on {u,v} iff the algorithm does not query {u,w}","venue":null,"work_id":"afddcd4c-da09-414f-aba8-a237b5737906","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.264937Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:e7a1e3c61f3239d27e4e9686cb341b7507e1ba88b7fd70d520138da1ae5e1669","observation_id":"37474d42-e773-45fa-99f3-be0ad5bf066a","resolution":{"observed_at":"2026-08-14T13:39:23.643816Z","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-14T13:39:23.625927Z","title":"Analogous to case 2: E[Mt uv|At w] = 1− Pr[Qt vw|At w]","venue":null,"work_id":"769e2a05-88db-4afc-b933-8bb9797910bf","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.268880Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:e96630bc4a8c2d2db64bc43d67ab937dfe47862dfb3e6a6e8e1d6ac963e75b02","observation_id":"f611ff9c-214b-4930-b6e1-91838e814e07","resolution":{"observed_at":"2026-08-14T13:39:23.629921Z","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-14T13:39:23.611411Z","title":"Then recall that{u,v} is a− edge,{u,w} is a + edge, and{v,w} is a− edge","venue":null,"work_id":"495a4395-123b-41ab-ae11-b39a2f9bfa67","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.273973Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:fc6cd8d597b7b3faae1eeb6c6e0978966d50f78e75615b9854a9ed4ab6f970af","observation_id":"b02293a6-0aa5-48f9-80f0-1c9e3384e7c7","resolution":{"observed_at":"2026-08-14T13:39:23.616566Z","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-14T13:39:23.597797Z","title":"Analogous to case 4: E[Mt uv|At w] = 0","venue":null,"work_id":"495464e1-fac5-4cb6-aa37-44d9e23d7055","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.279638Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:b82054c8a78bbbacf5bdba8da724e961d163c903cf559f9d23234e6880a89ef2","observation_id":"f201fe0c-43eb-4d4a-a292-a392e96d79ad","resolution":{"observed_at":"2026-08-14T13:39:23.601618Z","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-14T13:39:23.584443Z","title":"Then{u,v} is in exactly one triangle that includes the pivot w, and the algo- rithm will make a mistake on{u,v} iff the algorithm queries{u,w}","venue":null,"work_id":"b2ddbf42-2900-4123-99df-0bfba1f106d9","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.285264Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:bd381ee267b7136a648df1617250a1d835ea76e6e513351ed878f11756252fb7","observation_id":"31c67768-4806-4bc0-a7c2-0331f8068efa","resolution":{"observed_at":"2026-08-14T13:39:23.588842Z","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-14T13:39:23.570587Z","title":"Analogous to case 6: E[Mt uv|At w] = Pr[Qt vw|At w]","venue":null,"work_id":"24070933-3c75-498c-87df-1dff857ae292","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.289047Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:245c689c236301f1bf977adfb892c9c46b727faec0c10dc7412ef95b7ca53584","observation_id":"4a80b152-6b2e-4baa-af8b-84ff880474fd","resolution":{"observed_at":"2026-08-14T13:39:23.574752Z","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-14T13:39:23.557131Z","title":"Then{u,v} is in exactly one triangle that includes the pivotw, and clearlyPr[Mt uv|At w]≤ Pr[Dt uv|At w]","venue":null,"work_id":"d835c391-a27c-422d-8f70-8485d0025998","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.292635Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:4c630a81b0e9d3188ec2fdcac464439d0f1a6894d1c73a01b0f18c4231349915","observation_id":"5191dad0-5175-4fd3-b7f2-2d7f2be72c69","resolution":{"observed_at":"2026-08-14T13:39:23.561150Z","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-14T13:39:23.543879Z","title":"The expected charge in this case is equal to the sum of the following parts","venue":null,"work_id":"cc862603-fda4-44d8-8923-8deee388456d","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.296471Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:b051ad580ef6dfb1f704ca3ae3ea6d333bdba4d8c64de2757dd2793a3a333bd1","observation_id":"fae57941-d79e-4ca6-b2c3-09e93799edb9","resolution":{"observed_at":"2026-08-14T13:39:23.548281Z","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-14T13:39:23.519678Z","title":null,"venue":null,"work_id":"285a0364-f304-48c9-a3dd-192a9826058c","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.301438Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:e87c0150cbbecea85280a1868141aea58fa3eeace63d40c54f725e14edfb01a1","observation_id":"f7c0955f-1895-43a7-94f4-f5470e9d8140","resolution":{"observed_at":"2026-08-14T13:39:23.524084Z","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-14T13:39:23.504889Z","title":"Then the algorithm is guaranteed to make a mistake on {u,v} in iteration t, so Pr[Dt uv|At w] = 1","venue":null,"work_id":"f27d5b4d-81fa-4dd7-91f0-481e0a68f2f1","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.305678Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:50e1a5d3029d59343794206e82a0a632a7a712de34413debd71f9eadc2fa55ee","observation_id":"78e58eb4-308c-43dc-affc-a662b5f18206","resolution":{"observed_at":"2026-08-14T13:39:23.510607Z","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-14T13:39:23.490398Z","title":"Note that the probability that the algorithm makes a mistake on{u,v} in iterationt is then 1− Pr[Qt uw|At w], as noted in the case analysis forE[Mt uv|At w]","venue":null,"work_id":"f99654c0-a66b-49f3-9f8a-a7f764b1e46a","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.309763Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:056cf34eda4ad155c75831670617bc9d87ee7d7a7f248dddb0ddcfcb758fcfe1","observation_id":"6b313b9e-8f8b-4043-842c-5e8ca32275fd","resolution":{"observed_at":"2026-08-14T13:39:23.495874Z","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-14T13:39:23.477478Z","title":"Analogous to case 2: Pr[Dt uv|At w]≥ 1− Pr[Qt vw|At w]","venue":null,"work_id":"e8c3f4b0-c010-48c6-9d9d-3ce27c02172a","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.314759Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:6b2aae96f8cccbaa5968275a413463cedb226e1da76cfbdb17370536c9af919a","observation_id":"b8d02cc7-221f-48d4-b1de-a19c8b51099b","resolution":{"observed_at":"2026-08-14T13:39:23.481088Z","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-14T13:39:23.464300Z","title":"Note that the probability that the algorithm makes a mistake on {u,v} in iteration t is equal to Pr[Qt uw|At w], as noted in the case analysis for E[Mt uv|At w]","venue":null,"work_id":"a64780de-7ef0-4a8e-af52-57779f91df1d","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.318575Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:5326fee96ed36f8e386b0ad7ef63c44ae9fc1498802935afab666b77ee12693c","observation_id":"d9eb20ac-a6be-4a43-a8c4-43eaa3628f1d","resolution":{"observed_at":"2026-08-14T13:39:23.468606Z","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-14T13:39:23.451259Z","title":"Analogous to case 4: Pr[Dt uv|At w]≥ Pr[Qt vw|At w]","venue":null,"work_id":"ee82a50f-18cd-4915-802d-e8886e9ebc74","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.322311Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:75c11d927534351e8484218a840ad762592047bc5974e1fd608a681400c350ac","observation_id":"40f34ad1-089c-44fe-9855-75aab0dd3256","resolution":{"observed_at":"2026-08-14T13:39:23.455553Z","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-14T13:39:23.436652Z","title":"In this case, we do not simplify Pr[Dt uv|At w] any further","venue":null,"work_id":"79ce5926-cc0e-4c2d-b6e6-0abd97528eac","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.326407Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:6239a4a00210df8cd2f2ef045a2af2f901466e0532427fcdc7efa5354fc72d8d","observation_id":"15744e1a-5522-4abc-92b4-792437fb2a77","resolution":{"observed_at":"2026-08-14T13:39:23.441261Z","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-14T13:39:23.423628Z","title":"clause gadget","venue":null,"work_id":"3d902afd-0d35-470a-99a5-e3fe47adb7b5","year":null},"citing_paper":{"arxiv_id":"1908.04976","last_updated":"2019-08-14T06:26:15Z","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:39:23.330048Z"},"links":{"citing_paper":"/paper/1908.04976"},"observation_digest":"sha256:70def73d00059b427a46a6683e01b5c8d41466f5714c807b8e8793bd0213a719","observation_id":"06448b60-6f98-4751-8539-5ef67b965246","resolution":{"observed_at":"2026-08-14T13:39:23.427236Z","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.04976","last_updated":"2019-08-14T06:26:15Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T13:24:51.040216Z","submitted_at":"2019-08-14T06:26:15Z","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":5,"verified_exact":2,"verified_fuzzy":35},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:1908.04976."}