{"as_of":"2026-08-13T15:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88e263ee204648ea21bef8146770c760018a1d01450a4db77897158ca22beecf","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:26:21.699444Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2412.02704/citation-record","integrity":"/paper/2412.02704/integrity","json":"/paper/2412.02704/citation-record.json","paper":"/paper/2412.02704"},"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-12T14:26:23.402611Z","title":"Spectral clustering with graph neural networks for graph pooling, 2020","venue":null,"work_id":"46fc6c5f-22d5-4058-ae88-24033a6d75ae","year":2020},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.205797Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:3dd1e2f1401c40fd80c5b38e546e1dc8e05e8c0bbad967871bf50c565000929a","observation_id":"1c693c4c-d747-479a-8e12-f7b3ead4ebdd","resolution":{"observed_at":"2026-08-12T14:26:23.412820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.374080Z","title":"Deep clustering for unsupervised learning of visual features, 2 019","venue":null,"work_id":"d5239b52-fe24-4c53-8822-6d3a5b6dc778","year":null},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.217225Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:978008542f3be636bbc5454b6597f169db33190fc210eb935e010fe4395f1f23","observation_id":"b6a4ad43-86b5-4de1-82fd-daeb05c9fb28","resolution":{"observed_at":"2026-08-12T14:26:23.383763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.338905Z","title":"Visual categorization with bags of keypoints","venue":null,"work_id":"ae67e787-1eeb-42fe-9275-2217f71a4e78","year":2004},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.229749Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:1eabfd5e6d13749003759ae3e4aa56a4387f372cdef591a501a51c94eecc2cf1","observation_id":"d4ea39c3-2ddf-495a-8929-ad4dcb58fe60","resolution":{"observed_at":"2026-08-12T14:26:23.344589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.299398Z","title":"A k-means clusterin g algorithm","venue":null,"work_id":"ad47b04b-0aec-4fa7-9cbb-7a7e38af989c","year":1979},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.243576Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:c896a5bdc144a13921365f80d80b3b3de2ee7303ee42e40642c86b66b9cce832","observation_id":"22aebfad-6fec-4819-88b2-45eebfa6b8d7","resolution":{"observed_at":"2026-08-12T14:26:23.306761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.263908Z","title":"Schulman","venue":null,"work_id":"fa2cb888-8f65-45a7-831c-8947af7662f0","year":2000},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.251769Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:8b49e19c6cbebeddf51ec5946181ce8464395d466f3d08759172b0377b9c3614","observation_id":"13f8ce79-78e5-47c5-bc21-25524fed5651","resolution":{"observed_at":"2026-08-12T14:26:23.271325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.235544Z","title":"Correlatio n clustering","venue":null,"work_id":"e5e6c5e4-4bbe-4935-8a8d-3f9b4d5132c4","year":2004},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.260934Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:d794891c3e224effddcdbae9f9fcf8806231ed645f2cf18f82966ceb3b557dc1","observation_id":"a0719b77-5773-461f-9382-c991e94034f4","resolution":{"observed_at":"2026-08-12T14:26:23.245013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.188964Z","title":"Cluster graph mo dification problems","venue":null,"work_id":"7d6db1b6-65a7-4920-a1ae-5fc2890209b4","year":2004},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.267298Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:9683c584fda5d6a5f12a54b21547e08cdc07894bde42ffa35b63a1bc32307c88","observation_id":"942be8be-551c-449e-838f-164ff940f04e","resolution":{"observed_at":"2026-08-12T14:26:23.211745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.152371Z","title":"Fixed- parameter algorithms for cluster vertex deletion","venue":null,"work_id":"be099506-6114-4015-a44a-7784dd842a3a","year":2010},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.275244Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:475ad95314ff905a350dfc28edbf0fb1ad1d241bda7df29046ecc79bb80fa49f","observation_id":"e8c60afc-c093-4412-996f-554691f2e960","resolution":{"observed_at":"2026-08-12T14:26:23.161394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.122557Z","title":"The node-deletion pr oblem for hereditary properties is np-complete","venue":null,"work_id":"2c0d1776-82a9-4233-ba34-a827c87e780e","year":1980},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.286455Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:bb3502943f94f0f3d38db7c388f15d6cf36d858e6e5eef12bcc6933456c1ce19","observation_id":"fd74ad8e-42c4-4f80-8888-0de1a059fdad","resolution":{"observed_at":"2026-08-12T14:26:23.133323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.063408Z","title":"Novel ap- proaches for analyzing biological networks","venue":null,"work_id":"fc0021d6-7699-4530-896b-755fe0d231ce","year":2005},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.296352Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:240f8923d82a9ed41e50323ca3a37dd9f6453e33b54b7aa54f403f9b3d140c73","observation_id":"b6ce8451-5aad-4d5e-b9fb-5a7e27a6a918","resolution":{"observed_at":"2026-08-12T14:26:23.092978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:23.017776Z","title":"Detection of protein complexes in protein interaction networks using n-clubs","venue":null,"work_id":"24b4111a-44d7-4642-8a54-434572f6ded0","year":2008},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.303748Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:1224be32e4ec3890e4ce2f1c3ebc6dae0cbdd1a454811b110b0245143ac32056","observation_id":"7af7dd34-ca13-498b-bb16-dbabacc75792","resolution":{"observed_at":"2026-08-12T14:26:23.037547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.968692Z","title":"On editing graphs in to 2-club clusters","venue":null,"work_id":"2f2d313a-e8ee-4c39-bc0a-7f96e46ed9e1","year":2012},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.315000Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:4f71fa5bb653b759d499363b1a173d3cb6cb0ed20663b35ee4aaa7872fa42b3d","observation_id":"d28dde94-d4f6-4331-8ac4-6616c93f2757","resolution":{"observed_at":"2026-08-12T14:26:22.984703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.937402Z","title":"Splitting an orderin g into a partition to minimize diameter","venue":null,"work_id":"e0bd5f67-ecf6-434c-9743-ec1e6ac8d86e","year":1997},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.323086Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:73c09d3032fbf71136d7c568c85438f677d24114fd75275ed1ca4001224848bd","observation_id":"c6e57335-4236-4d94-8e0b-481811fce614","resolution":{"observed_at":"2026-08-12T14:26:22.945543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.905629Z","title":"On the complexity of graph clustering with bounded diameter","venue":null,"work_id":"e0e2c526-34d7-44ac-a30d-fbe6ad8a5dcf","year":2014},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.336766Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:b4e93006dc3d2c21af85e03a9ac606cc68daa103f79c31c766b6a9d5e7547f45","observation_id":"3c66cf23-3f51-4567-82dc-09c12f9d696c","resolution":{"observed_at":"2026-08-12T14:26:22.911931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.885220Z","title":"Bounded diameter clustering s cheme for protein interaction networks","venue":null,"work_id":"5e33d024-58f5-4608-af64-269f5333e675","year":2009},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.346069Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:93a51a8a5791bd388fc76eab04d075a095b01d255198137cb9e8f0a7c2739928","observation_id":"2680f720-6a5e-4a13-8d8e-8f7d96049cdb","resolution":{"observed_at":"2026-08-12T14:26:22.892336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.856456Z","title":"Efficient cluster ing algorithms for self- organizing wireless sensor networks","venue":null,"work_id":"48d1a86f-d504-45ed-b39f-cf52839bb7ab","year":2006},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.355504Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:5fed4eedee4f8b77331419babfea27930844cf632200f284f738528ba3ea71d4","observation_id":"4c2a1f8f-c362-4c80-a79a-a6b613fb13f9","resolution":{"observed_at":"2026-08-12T14:26:22.862450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.835552Z","title":"Minimum sum of diame ters clustering","venue":null,"work_id":"e3bef9e5-0c27-400b-b752-e27c3a6951e1","year":1987},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.365914Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:b31299b1afa98044a7623166caaff0cf19dc5b596383aa2c1322b07593855efb","observation_id":"d6403b82-8cfc-4e9f-a829-dd69c7ea83e0","resolution":{"observed_at":"2026-08-12T14:26:22.842341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.806176Z","title":"Clustering to minimi ze the sum of cluster diameters","venue":null,"work_id":"1b3eb57c-5c7f-4f65-8019-9bf67d7f99f4","year":2001},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.385152Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:bfc0a2caab26f365f1e10f83ab063567762617e0e0b477723d5d8b131f09b4ea","observation_id":"6343ed74-29c4-4073-9807-f5f80a061200","resolution":{"observed_at":"2026-08-12T14:26:22.817839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.773623Z","title":"Geometric clustering to minimize the sum of clust er sizes","venue":null,"work_id":"df654e32-92ec-48b7-a701-a4299cd127ae","year":2005},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.395423Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:e0fe95d15f562e8bca314461904dc32f781e6ce7a0e8b37e38924b229958ed50","observation_id":"dd51c145-7e56-49fc-a9c7-e36a8528eaab","resolution":{"observed_at":"2026-08-12T14:26:22.782914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.744645Z","title":"Detect ing overlapping protein complexes in protein-protein interaction networks","venue":null,"work_id":"550ebea6-4e50-40ee-8b45-8ef1a3d4d37d","year":2012},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.405636Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:f01734b4695650056549bcbdeb847e225cf6a396bd0d69212d05f8feeb644d36","observation_id":"528a437f-1402-4bad-ad80-adae36f21604","resolution":{"observed_at":"2026-08-12T14:26:22.751121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.692397Z","title":"Finding communities by cluster ing a graph into over- lapping subgraphs","venue":null,"work_id":"950e8678-bb0c-4a58-b382-cb3b06cfb58c","year":2005},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.413046Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:890cfb621b7f5e254e55eae9e5dd20a629eb2bd7a9bd291a8d33eb6fec233e15","observation_id":"b7eeeb4e-7af4-4d29-a9ff-0162cca54730","resolution":{"observed_at":"2026-08-12T14:26:22.704291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.664345Z","title":"Graph-based data clustering with overlaps","venue":null,"work_id":"acd7f9b8-d710-497b-b584-3ccaeaa9dcc5","year":2011},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.423426Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:f74e8c92cc451503f77c726f4324e10536b19d0f257cea6afc35f2c7a1a20529","observation_id":"96f8f000-be06-4cbc-9f57-54d5607335b3","resolution":{"observed_at":"2026-08-12T14:26:22.671495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.638824Z","title":"An algorithm to find overlapping communit y structure in net- works","venue":null,"work_id":"99429704-ad35-4323-bae7-041787e29198","year":2007},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.442389Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:400ed604003f580df6db58297463be702dddc27f7d81ee928c7a0d67f940056a","observation_id":"fa991489-9709-484d-8525-22e5970f0981","resolution":{"observed_at":"2026-08-12T14:26:22.647141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.616257Z","title":"Cluster editing with vertex splitting","venue":null,"work_id":"19b002a6-3670-481b-bd8e-def2265b5f87","year":2018},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.453274Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:0d069e9d7626329ceb72b184c03a9900a80a02c6a11c9cfe3775c3086a204972","observation_id":"78e6d9fc-6a34-4163-a4ea-2299b98b8d91","resolution":{"observed_at":"2026-08-12T14:26:22.623052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.578370Z","title":"Abu-Khzam, Emmanuel Arrighi, Matthias Benter t, Pål Grønås Drange, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw, Blair D","venue":null,"work_id":"15805301-491a-4b78-9b8b-f321aa642e0c","year":2023},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.459571Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:2ba6d15b565057c4e0706de2c53ec1a3c5057e85f8a9a2c712ced9f32b696266","observation_id":"fa381883-d802-4163-a5d7-212e7cf2949d","resolution":{"observed_at":"2026-08-12T14:26:22.597620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.532574Z","title":"Introduction to graph theory , volume 2","venue":null,"work_id":"33ccfffb-b225-42f7-8848-00aa5e327d08","year":2001},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.471978Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:4b66badb7660e527c797118eb51bb22981a584c603ee99ea90cbd57295671c92","observation_id":"64770368-0f19-4272-ae11-c50686737026","resolution":{"observed_at":"2026-08-12T14:26:22.544839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.488690Z","title":"Cluster deletion revisited","venue":null,"work_id":"d11b261f-bc13-44ee-b3b2-01796d06e986","year":2022},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.482570Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:22aea13885ec571d4e15ce57fdd98410f3e70cd5ffad622cf7c4913ab9419477","observation_id":"4aeb1b84-8d90-44b6-86c9-d0a3e9886da0","resolution":{"observed_at":"2026-08-12T14:26:22.495327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.447549Z","title":"A golden ratio parameterized algorit hm for cluster editing","venue":null,"work_id":"307592ab-192f-405f-8cdf-3d5019c182c2","year":2012},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.489714Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:aadf4ee0d90b841e85088b2923dd663206b7ac661d5d8f9e7821038b7649e814","observation_id":"af01b98b-b977-4290-afa4-27471c72469c","resolution":{"observed_at":"2026-08-12T14:26:22.460687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.422292Z","title":"Cluster editing with overlapping communities","venue":null,"work_id":"f284c997-011b-45a2-b143-f81fcf3bc42a","year":2023},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.496306Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:ca744898c786e22da8adfa8d2be12e8719c13321acaff57b63ec92a1d9413817","observation_id":"fa6857a0-9d08-40e4-a17a-f375e5050485","resolution":{"observed_at":"2026-08-12T14:26:22.430016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.392338Z","title":"Abu-Khzam, Norma Makarem, and Maryam Shehab","venue":null,"work_id":"1719fb31-dd52-434d-a857-c5662eaba470","year":2023},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.502970Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:2d1f346c91c9e152ede1883503bf9b0add6ed8f5b736e7791fc41dbb85b9b867","observation_id":"ab80e431-25ca-4ba6-ac0c-9a3bca60984b","resolution":{"observed_at":"2026-08-12T14:26:22.405175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.368496Z","title":"Algorithms for 2-club cluster deletion prob lems using automated gen- eration of branching rules","venue":null,"work_id":"1b934027-6dd2-4aed-93fc-53ec5570daae","year":2024},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.509950Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:261135a4b2b868e5ebc166384c2e4eaa6725dec212fe98a67a3bcc7fdecdf58b","observation_id":"c91ecdbd-9a88-4632-b9ae-a169e59d032a","resolution":{"observed_at":"2026-08-12T14:26:22.374599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.347121Z","title":"Graph clustering by flow simulation","venue":null,"work_id":"a009150e-57b0-4e31-a957-bb87f58480a7","year":2000},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.517292Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:d2b09fd8eafc0eef7c752696256775a334ca98401b9f765ced174ab5388b3fd5","observation_id":"01d049c9-233d-4c7e-9c0c-d6453e3a12fe","resolution":{"observed_at":"2026-08-12T14:26:22.354216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.326551Z","title":"Pace solver de- scription: Kapoce: A heuristic cluster editing algorithm","venue":null,"work_id":"6d7c1335-7d24-41a4-bd98-4fc0371a7182","year":2021},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.526528Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:a269b21164f2f0c821ddf49d20b9ae13346903eafa3da956d124f97284db738a","observation_id":"b55d115c-1ae6-40bb-9867-2abc191167a8","resolution":{"observed_at":"2026-08-12T14:26:22.333510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.304051Z","title":"The pace 2021 parameterized algorithms and computational expe riments challenge: Correlation Clustering with Overlap: a Heuristic Graph Edi ting Approach 13 Cluster editing","venue":null,"work_id":"d4849faf-0e50-4914-b731-38e948dfa5f5","year":2021},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.536431Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:03c12063b470e90700eb9f53ad1dd4c277b9951fe62ba7361b685d78ffafa83b","observation_id":"a1dd20ce-9743-4859-8989-6d58868bf52f","resolution":{"observed_at":"2026-08-12T14:26:22.312393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04846","last_updated":"2025-06-05T17:25:21Z","snapshot_observed_at":"2026-08-13T07:14:32.663675Z","submitted_at":"2024-11-07T16:33:45Z","title":"On the Complexity of 2-club Cluster Editing with Vertex Splitting","version":2},"cited_work":{"arxiv_id":"2411.04846","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04846","snapshot_observed_at":"2026-08-12T14:26:21.784291Z","title":"On the Complexity of 2-club Cluster Editing with Vertex Splitting","venue":"cs.DS","work_id":"e66fdbc6-3e31-423b-b2b5-285e8e10e879","year":2024},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.543849Z"},"links":{"cited_paper":"/paper/2411.04846","citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:5e3edc125c8bda3dd82ebcc9da3635e9ef469f543d038ba74f716266ba408d9b","observation_id":"4bfba92d-8399-475d-818b-541ab616da4c","resolution":{"observed_at":"2026-08-12T14:26:21.792934Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.276628Z","title":"Rossi and Nesreen K","venue":null,"work_id":"0cb05506-0fbd-40c9-b319-64cc9adeb71c","year":2015},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.554758Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:07729e1c7f830c70219dd10ff0ef215a17e9af517e266432010d816b00583140","observation_id":"f9eebec5-a87e-4cd5-a21d-94660a4490df","resolution":{"observed_at":"2026-08-12T14:26:22.286638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.250247Z","title":"Gscluster: network-weighted gene -set clustering analysis","venue":null,"work_id":"0dd6d1ee-2842-4a51-b102-197f31b6ff42","year":2019},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.562053Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:32d14407af10075ac255104a38401ed13b0f595581e76e158fae0b26bb0a5ab2","observation_id":"8b7e67b5-79c3-4227-99ba-e40cbc17879b","resolution":{"observed_at":"2026-08-12T14:26:22.258215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.228600Z","title":"Clustering of the self-organi zing map using a clustering validity index based on inter-cluster and intra -cluster density","venue":null,"work_id":"0716d28a-31b4-4d6b-a3e1-9f359e4cfd4f","year":2004},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.568480Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:3838aba4d10a6d4c7038f9e76edc67a4c632c4892b64cbca9b709debd5bda569","observation_id":"a44b374c-76dd-48b1-9e6c-9b411fd6c771","resolution":{"observed_at":"2026-08-12T14:26:22.234428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.192030Z","title":"P erformance eval- uation of distance metrics in the clustering algorithms","venue":null,"work_id":"bca980db-26e9-4b24-bf78-83eae54426f8","year":2014},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.578339Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:43a258f8bbacdd64629ec54e1c02726abbc6c8dabeccbd9fe1db317c287c75c9","observation_id":"f0f36a90-8824-417b-969e-a37cbbfb9c45","resolution":{"observed_at":"2026-08-12T14:26:22.208007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.165957Z","title":"An ensemble framework for clustering protein–protein interaction networks","venue":null,"work_id":"101ce351-3307-481e-bcf0-24661103ed3f","year":2007},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.592406Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:f7a66cb3e1dac64d94c36e46eab054aece76af6e8e6b1a53a03ce043968557e4","observation_id":"199cde05-4881-464e-860f-eceb1726ba7b","resolution":{"observed_at":"2026-08-12T14:26:22.173690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.141483Z","title":"Ad-cluster: Augmented discriminative clus tering for domain adap- tive person re-identification","venue":null,"work_id":"82504900-655b-4d0e-bb73-debce739c8ab","year":2020},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.600304Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:00aa03a542956eff5464e535d166b1fab70bd703bc156780644b8904ebca48d6","observation_id":"23f4669b-13cb-4b70-824c-81733dc8e42b","resolution":{"observed_at":"2026-08-12T14:26:22.150422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.115376Z","title":"Clustering validity checking methods: Part ii","venue":null,"work_id":"4cc12e0f-0f84-4b11-bd6e-a61391913864","year":2002},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.607867Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:fdeb3eca590eeddcfa6fd68328d6b52b5996ec31187c5bcb04b3247a435d0717","observation_id":"563fc037-6612-4d13-8a5b-8d6f6e25c83f","resolution":{"observed_at":"2026-08-12T14:26:22.123834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.078953Z","title":"Benchmark graphs for testing community detection algorithms","venue":null,"work_id":"dd05b11c-cb16-42cb-abf2-80d5aa29fe85","year":2008},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.615021Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:fb4dc1b76f04466868a44167247e2cbae2563abfcad0ea8b7134e1c325527df2","observation_id":"ed7e4749-4bd0-4fea-ab89-f314bfaaa726","resolution":{"observed_at":"2026-08-12T14:26:22.089531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.054452Z","title":"A comparison of common programming languages used in bioinformatics","venue":null,"work_id":"17be8967-2e51-4ba1-9adc-987042f372e0","year":2008},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.622940Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:884bf640abb93d7ad06b01cf6f2e4cbc835a623e6fb3097e8b257e6059c9b9be","observation_id":"748ed22d-47cd-4253-82bf-7afad9b0eca8","resolution":{"observed_at":"2026-08-12T14:26:22.061610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.027043Z","title":"Ranking programming languages by energy efficiency","venue":null,"work_id":"4ccfd754-cb2d-4e9f-b73e-4ee8edfb6ee0","year":2021},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.633278Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:850c9eecde66b73286594644c1076ae921b9c7a30dbe9999f948616f10a57585","observation_id":"e8cb86fd-b5bd-4857-b5ca-8c15da50f5dc","resolution":{"observed_at":"2026-08-12T14:26:22.035694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:22.002386Z","title":null,"venue":null,"work_id":"186b855f-6f55-4a3a-b526-31c37d89a9c6","year":2011},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.640019Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:7b654cdcbe68bde7c431facedff9197a5733e1611a3c6b4bee6704bd5dd39f2c","observation_id":"73014cc5-695f-4319-9f65-77b638c702d9","resolution":{"observed_at":"2026-08-12T14:26:22.008507Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:21.979984Z","title":"Analysis of network clustering algorithms and cluster quality metri cs at scale","venue":null,"work_id":"99acba19-ae80-43d2-a9f3-88c7fcfbafc3","year":2016},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.646257Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:0ce2020f5c300fe40b6911508a3269dc94571074cd634fe7c6b0ac1d7531fe51","observation_id":"bca37eeb-ef16-44d6-b14e-ccfa5ffe4bca","resolution":{"observed_at":"2026-08-12T14:26:21.986277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:21.948694Z","title":"On the complexity of multi-paramete rized cluster editing","venue":null,"work_id":"0409c534-bb4b-4373-a9aa-5accccf938eb","year":2017},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.656498Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:608b1d4dab6b1b5db64d8a0d22ec7f5c83ee3a9f9618dbafe5d5f417a785eab0","observation_id":"1ec04a6b-c8c6-4260-b77b-16715422b995","resolution":{"observed_at":"2026-08-12T14:26:21.955565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:21.918700Z","title":"Combinatorial text classification: the effect of multi-parameterized corr elation clustering","venue":null,"work_id":"9e957274-c3bf-4b71-9cac-0405fe1a6b6f","year":2019},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.664588Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:0169400cf42f0f1bd8ba314f27d8f0ef21bcf9728dac4a3cc3ea7b46b05f39fc","observation_id":"72de3750-aee4-4372-bc2b-9a2db83a2439","resolution":{"observed_at":"2026-08-12T14:26:21.930370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:21.891294Z","title":"Vulnerability rating of source code with token embeddin g and combinatorial algorithms","venue":null,"work_id":"6315d6ee-aef4-4c50-908c-f1d8b4adf961","year":2020},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.671849Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:d12097d77d978ea86005edbf306a2b87717113988e310f89ec36cec3b09250ef","observation_id":"fdea7be4-5388-4f1f-9ecd-66fa30d9bd65","resolution":{"observed_at":"2026-08-12T14:26:21.898839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:21.860697Z","title":"Barr, and Faisal N","venue":null,"work_id":"b7886404-c8f6-4690-8298-995fa536f815","year":2022},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.692443Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:7253c4b651c8fc21fbc7e9878c07d7366be0a7919730d071ba51dc23ab8c98ba","observation_id":"dcd2739e-6451-47d0-98ff-0a3ace4f68a0","resolution":{"observed_at":"2026-08-12T14:26:21.867336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:26:21.828883Z","title":"Abu-Khzam, Michael A","venue":null,"work_id":"f998f8fb-e22c-4e9e-98fc-6f4fc8ce9d7a","year":2010},"citing_paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T14:26:21.699444Z"},"links":{"citing_paper":"/paper/2412.02704"},"observation_digest":"sha256:68856274ae9fa8427025cf9902f1f701f7a7fdcd69882171a84fa422bc71ef80","observation_id":"d58c28ec-11e2-48ae-8fa7-7813f64c8feb","resolution":{"observed_at":"2026-08-12T14:26:21.839575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.02704","last_updated":"2024-11-23T00:28:03Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-13T05:59:53.487334Z","submitted_at":"2024-11-23T00:28:03Z","title":"Correlation Clustering with Overlap: a Heuristic Graph Editing Approach"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":50},"total_outbound_references":52},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2412.02704."}