{"as_of":"2026-08-22T14:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da7472fc5485e51418f880c64d6c69f20189b3c242baef157440b6bc279fa4ed","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-07T14:52:40.517087Z","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-22T06:32:14.747728+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/2505.18043/citation-record","integrity":"/paper/2505.18043/integrity","json":"/paper/2505.18043/citation-record.json","paper":"/paper/2505.18043"},"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-07T14:52:49.263569Z","title":"Improved approximations for the max k-colored cluster- ing problem","venue":null,"work_id":"04234df3-3431-4a0e-85bd-433f7125b0f4","year":null},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:35.786738Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:86c325ed4ee69f6e1c8e2318828a5632d8c1c61a2e0e8f7c69a273e0ffac858b","observation_id":"95e08385-99d3-4992-ac1d-3e3473125a02","resolution":{"observed_at":"2026-08-07T14:52:49.320366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:49.084658Z","title":"A 0.3622-Approximation Algorithm for the Maximum k- Edge-Colored Clustering Problem","venue":null,"work_id":"ab8504a3-a97c-424a-9d90-4908e74df595","year":2020},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:35.855691Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:f51d61e3493d8a4134fa67e80ecd0fce13a2a76232b9d3cd554071177573d03d","observation_id":"7a4d6b35-8657-4b45-839f-353d169cbc07","resolution":{"observed_at":"2026-08-07T14:52:49.169413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:48.861799Z","title":"Approximability and inapproximability for maximum k-edge-colored clustering problem","venue":null,"work_id":"b3f6fcc1-a13e-454d-8200-30b679970c40","year":2019},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:35.920202Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:fcde350dc872dd4cda424ca7d70b84c94c8de8b9cb38c663610735b375ab2e4e","observation_id":"4474c4dc-6a08-4817-ad30-c7bb4bb2733e","resolution":{"observed_at":"2026-08-07T14:52:48.942416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:48.718862Z","title":"Clustering in graphs and hypergraphs with categorical edge labels","venue":null,"work_id":"0db55255-19bf-435f-af00-a600d3bb238b","year":2020},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.003098Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:e8c246c215a8e0cfc31f1fbd97ccb4c45fc68f5c03cc1bbcb43730440bb3f730","observation_id":"30303018-8382-4ad4-8b5b-85fe90e198d8","resolution":{"observed_at":"2026-08-07T14:52:48.777888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:48.516137Z","title":"Diverse and experienced group discovery via hypergraph clustering","venue":null,"work_id":"6bcc98e4-0caa-4fa3-b18c-d83e362eb655","year":2022},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.088849Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:2dc61ed231fe563bdb96f564c9a63583b237e50593592420be338a7b4f32cb80","observation_id":"99dc6a45-b3d3-42d2-b1b7-13942d85f1af","resolution":{"observed_at":"2026-08-07T14:52:48.632451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:48.330159Z","title":"Improved theoretical and practical guarantees for chromatic correlation clustering","venue":null,"work_id":"90cc9c8f-36d4-4f9c-9663-f6e955e1c67f","year":2015},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.167750Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:1377319f98d3deb8122ba029e06c7d7f203627a70e502192ca7ae7b4dab5cf03","observation_id":"6cf20ed0-ef04-46de-9e15-9adc05778e9c","resolution":{"observed_at":"2026-08-07T14:52:48.445217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:48.123600Z","title":"Evolutionary algorithms for overlapping correlation clustering","venue":null,"work_id":"1b025bdf-9377-44a9-be17-8f5a9a874f39","year":2014},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.259102Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:39f848373b5c0c6a82409a8bc6745eb12b88e509692341c4510d443ee98f6e07","observation_id":"fd8575f8-d5fa-4fff-9c7d-98fa5927d2d9","resolution":{"observed_at":"2026-08-07T14:52:48.212796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:47.930832Z","title":"Clustering on k-edge-colored graphs","venue":null,"work_id":"013bd532-3e6c-4be7-b8b4-dcb613950fe1","year":2016},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.356982Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:c1bf4f0be07fd9c36731449d76d1992f595898d2ce9a91aa19934a557b4f13c4","observation_id":"95130738-2c30-4cd2-b8e4-15775b0ae999","resolution":{"observed_at":"2026-08-07T14:52:48.010864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:47.751876Z","title":"Correlation clustering","venue":null,"work_id":"26628404-aec3-4ac4-99ab-99f40a865edc","year":2004},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.480111Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:f3ecec8de827254e27c42eb8ab0e8192494ad9bb063e08a5ed0f03b8255c6115","observation_id":"40e6519f-cf68-4a80-8e8d-5c8a37ee6746","resolution":{"observed_at":"2026-08-07T14:52:47.841322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:47.593278Z","title":"Inapproximability of hypergraph vertex cover and applications to scheduling problems","venue":null,"work_id":"fa71f442-acbd-4d80-abbe-52f1a9a353b7","year":2010},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.560306Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:e2bda45f0a6c6cf37cf9029cfae3f49f0ee3f936c1d6a18142cef61c0807143f","observation_id":"217507a4-647d-4532-9d6b-1fef13689fe9","resolution":{"observed_at":"2026-08-07T14:52:47.656164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:47.442935Z","title":"Cut, glue & cut: A fast, approximate solver for multicut partitioning","venue":null,"work_id":"4f5fd5d8-48a7-4ceb-b811-7c1adb026548","year":2014},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.631386Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:e8445fcd09dc523dcbb9ea5e4c9851a318aad2e6d56f9a2c7cfbca3ee50c23e8","observation_id":"802225ed-ec62-486d-ae87-dea7572b614b","resolution":{"observed_at":"2026-08-07T14:52:47.495823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:36.745059Z","title":"Higher-order organization of complex networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.745059Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:1967fb40c79dda47d4f68c39c6dbc5c610581d2ecf0c65b662436d7bdc596e35","observation_id":"972643f7-6181-4228-93e3-6822bfdb5490","resolution":{"observed_at":"2026-08-07T14:52:36.745059Z","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-07T14:52:47.264798Z","title":"Linear time bounds for median computations","venue":null,"work_id":"209a3040-4cf1-4a86-a2d8-93b19781d614","year":1972},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.817425Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:225f291a6d47a1d4ca6ebcd5385b7c87bcd50f067f9d17f51244602d7447f974","observation_id":"4b2c1a34-6beb-4fd2-a1d7-6755a55121af","resolution":{"observed_at":"2026-08-07T14:52:47.327900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:47.054145Z","title":"Correlation Clustering","venue":null,"work_id":"b5410348-8c4b-4fbc-bd8e-a79a60ba84c6","year":2022},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.891609Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:d5fb96d1d4b20f8fa3f99a1504b34607a01797944f7d752e246dbf727188792a","observation_id":"71cc5022-d9f7-4f33-8920-5ea3186f0a87","resolution":{"observed_at":"2026-08-07T14:52:47.172024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:46.813547Z","title":"Chromatic correlation clustering","venue":null,"work_id":"e49d473d-1064-48e9-936e-c8cbbcdc1cc9","year":2015},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:36.974021Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:ce47e91454f51228bab24252a8c95472a22bf6c7cc80440c29ca2ad825686dff","observation_id":"2b6e7bed-7d00-428f-9028-3f28c6b73230","resolution":{"observed_at":"2026-08-07T14:52:46.911909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:46.615156Z","title":"Overlapping correlation clustering","venue":null,"work_id":"8944b874-9a4c-4284-8943-9edea3241c06","year":2011},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.078795Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:5e3942a14ce9a99e4c6214026a4555b66e629b156c2e90b4aee7c1dafc3feb5f","observation_id":"ef862437-6dfa-4cac-a7bd-34617c76263a","resolution":{"observed_at":"2026-08-07T14:52:46.700987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:46.393648Z","title":"A hybrid heuristic for the overlapping cluster editing problem","venue":null,"work_id":"d051c4c3-8e7a-4da8-9e46-544d97beb072","year":2019},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.157936Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:e868164067f280eff3409a85e5199ff7678ecfac3d4262b82693b68a25241a8d","observation_id":"65d3264a-0e15-4f86-9f89-72979a3b0935","resolution":{"observed_at":"2026-08-07T14:52:46.484606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:46.245484Z","title":"Hypergraph clustering: from blockmodels to modularity","venue":null,"work_id":"982e73be-8fbf-48ec-a1c5-6424cd9e6874","year":2021},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.247047Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:e3e3d40ca836d684a3411ece08779c7a098386f15ad1cd46f43292f4c414086f","observation_id":"256cc428-3e05-4f37-8892-a77208960f01","resolution":{"observed_at":"2026-08-07T14:52:46.271718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:46.122514Z","title":"Overlapping and robust edge-colored clustering in hypergraphs","venue":null,"work_id":"e8a3dad5-1f5d-4471-9cfd-fe6fb8899e58","year":2024},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.323940Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:a3a849f734ca4bd008d3b5a0e4430eb362095ccf907e8883980b81aa4e387884","observation_id":"b12b0439-9fd2-411e-92cd-0a74e5bdf415","resolution":{"observed_at":"2026-08-07T14:52:46.225956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13000","last_updated":"2025-02-18T16:20:50Z","snapshot_observed_at":"2026-08-16T12:57:15.960482Z","submitted_at":"2025-02-18T16:20:50Z","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges","version":1},"cited_work":{"arxiv_id":"2502.13000","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13000","snapshot_observed_at":"2026-08-07T14:52:40.664268Z","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges","venue":"cs.DS","work_id":"e48ad1b4-3033-483c-b5ab-1a0f45be639b","year":2025},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.447783Z"},"links":{"cited_paper":"/paper/2502.13000","citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:becb729d93adb91fdc8965de0256b0789525f6cb9100b3a5c4e142793df29cd9","observation_id":"6a0aea90-454a-48e0-a622-8b2ae3de0b9f","resolution":{"observed_at":"2026-08-07T14:52:40.787819Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.997077Z","title":"Cognitive relevance of the community structure of the human brain functional coactivation network","venue":null,"work_id":"a83dc8cc-386b-482d-b10f-9dc84a9e0f0e","year":2013},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.541003Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:aaac6332087c71baabc3fb8a9ef38383c4f469cf7c285f64a4b70f2e20318031","observation_id":"9d5406b5-47fe-48c7-95e7-abd7c4e0767d","resolution":{"observed_at":"2026-08-07T14:52:46.042669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.872623Z","title":"Robust Correlation Clustering","venue":null,"work_id":"2af2640a-272d-4d06-8f80-2b6b98d1b29f","year":2019},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.638160Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:407682d9a1d50af2b92fc9a25a3ce3e72703ba7ca0b0ef56c76e23c62010906f","observation_id":"74683680-bdf7-423f-92b5-a40385ce9c96","resolution":{"observed_at":"2026-08-07T14:52:45.949166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.773781Z","title":"A new multilayered PCP and the hardness of hypergraph vertex cover","venue":null,"work_id":"7810eb09-63df-4a3b-83bb-798a4d43f33c","year":2005},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.727670Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:50d560ecd320c4a5f39b7d540ff9ee43585ec09f10d8e0d0b610b70e935890e6","observation_id":"53f0b3a1-c248-4ed6-879b-74e44f27d074","resolution":{"observed_at":"2026-08-07T14:52:45.820940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.676381Z","title":"A density-based algorithm for discover- ing clusters in large spatial databases with noise","venue":null,"work_id":"ded40465-9c14-4a74-98b5-9245811ca6fe","year":1996},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.812967Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:69e5cf00b01cca8ed84c792bdeadb99fca63d5c22615a8a191fc79236917c4a5","observation_id":"e7c411fe-324d-47b5-a1d3-a510b4fc73e2","resolution":{"observed_at":"2026-08-07T14:52:45.722474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.556487Z","title":"A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects","venue":null,"work_id":"e7f30277-1694-4f8a-819e-1b55eb206948","year":2022},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.909504Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:f8a305fd22b8c1ce333b60f4e5f0954040bbe17ba94dff9bf3606269d62f4c07","observation_id":"96091b74-4c1b-4749-8b2b-f4aaf4b1f1f1","resolution":{"observed_at":"2026-08-07T14:52:45.610491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.417289Z","title":"Lp-based pivoting algorithm for higher-order correlation clustering","venue":null,"work_id":"dca42a3b-a3fb-4ff9-9363-dbac83110fd3","year":2019},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.006232Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:5b9596425e698b55e0f1b1b0c0148c129f1ea1254d2070e4a541b1dae8964a0b","observation_id":"bc065ec2-9d4d-4197-9266-d42f21633a70","resolution":{"observed_at":"2026-08-07T14:52:45.479432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.295888Z","title":"Approximation algorithms for partial covering problems","venue":null,"work_id":"be3ff97a-ec57-4079-ac41-a3a25419e4b2","year":2004},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.093963Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:60fa58545488fe3f222f012f308562214e47d6c6f04fc962249f7d9fbbcb71f7","observation_id":"8370a8b1-8af7-4687-ab7a-a22bb09e07fe","resolution":{"observed_at":"2026-08-07T14:52:45.347877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.147300Z","title":"Correlation clustering generalized","venue":null,"work_id":"0201d41b-30fc-43ad-bfb0-4fcc2fb06df7","year":2018},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.207369Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:8d64e89f724c083138d79b7db5a72b90c53613959cd91e04b0049062542903ad","observation_id":"0fabf800-dcbc-444c-b607-266424861260","resolution":{"observed_at":"2026-08-07T14:52:45.214429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:45.048536Z","title":"A general approximation technique for constrained forest problems","venue":null,"work_id":"faeac063-60fb-4f50-bba1-82d7f46f6617","year":1995},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.308385Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:4dda0307fe8f51aec953b66c655b31a358fe670bd2c40ab00c7dc43618cd4106","observation_id":"e9d24cc6-d3fd-4296-9730-fc94ff8f2221","resolution":{"observed_at":"2026-08-07T14:52:45.099076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:44.898495Z","title":"Goemans and David P","venue":null,"work_id":"e521cb4f-9990-44c5-853f-5af4145c5af4","year":1996},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.376114Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:7bc6e688b257be71975ffe7eadf6d7a142409728c469dbff64d7413f3b26a59d","observation_id":"3a05f88a-93fb-404d-97a1-58eb50be5aff","resolution":{"observed_at":"2026-08-07T14:52:44.956775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:44.741394Z","title":"A primal-dual bicriteria distributed algorithm for capacitated vertex cover","venue":null,"work_id":"2e5f8a64-679a-42d2-854b-b43fd30ac075","year":2008},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.483457Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:4733636bce89a9055254ce29abdd205c66e267b4821a59a647a8db504d72136e","observation_id":"84c3fde1-31e9-4372-b7d6-e68aa65af1c8","resolution":{"observed_at":"2026-08-07T14:52:44.809006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:44.581114Z","title":"Approximation algorithms for the capacitated correlation clustering problem with penalties","venue":null,"work_id":"87388f46-02ad-40f1-a59a-2c88f84c5134","year":2023},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.583499Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:efc636b9a5a47e5ab64677041b6ec2adb6e3fd293fa818983de58bfa06f31776","observation_id":"7b7f77cf-5742-4aa3-a891-284b5c1dddaf","resolution":{"observed_at":"2026-08-07T14:52:44.665632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:44.344266Z","title":"Walmart Recruiting: Trip Type Classifica- tion","venue":null,"work_id":"27e31eb2-f0b1-4941-8c5a-365a0f72f166","year":2015},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.682719Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:f754a02cdc6676517f55a079e25a05b54dc9c4b72561b20127046047fb3acc6c","observation_id":"d076a85a-773d-494d-aff3-2a9fb5b631db","resolution":{"observed_at":"2026-08-07T14:52:44.462600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:44.120245Z","title":"What’s Cooking? https://kaggle.com/competitions/whats-cooking, 2015","venue":null,"work_id":"9b6b38a7-1093-4e70-8875-ccc2e91b12ab","year":2015},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.767268Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:965405312bd49c911b131566b94a746f489327e5e0a5c4268108c7aa8fec015c","observation_id":"5116cd27-7e6e-4f8c-9108-2b01b4da53b9","resolution":{"observed_at":"2026-08-07T14:52:44.222711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:43.929089Z","title":"Practical guide to cluster analysis in R: Unsupervised machine learning , vol- ume 1","venue":null,"work_id":"76943741-a775-49bc-96aa-1093264a4cee","year":2017},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.872168Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:14bef61fd6735cd6d38bd87e10022fe09c816bef7fe66831fc9ba5b5fdfdfb6e","observation_id":"66449ef5-2644-4ad1-9dab-2ef6c5df9781","resolution":{"observed_at":"2026-08-07T14:52:44.020245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:43.734922Z","title":"Higher-order correlation clus- tering for image segmentation","venue":null,"work_id":"81e7ba79-f67e-4ded-9538-3a8c72f99cfc","year":2011},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:38.967015Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:b66b15fa4b076681aceb1282f44106d3a3cf119f215c99b0fb49cee80f3ad0b3","observation_id":"c239b24b-2640-4549-85a5-9d90870340b6","resolution":{"observed_at":"2026-08-07T14:52:43.819652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:43.584880Z","title":"A color-blind 3-approximation for chromatic correlation clustering and improved heuristics","venue":null,"work_id":"7163d9ec-7e39-4932-aae7-df847b5c41b0","year":2021},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.035003Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:f3226f08c39f8c95272097dc51cb9ab530b8ade10ac5a29a81ec00c1ada849e6","observation_id":"a166a319-0466-403c-b2c3-feb95c0ed478","resolution":{"observed_at":"2026-08-07T14:52:43.651679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:43.428844Z","title":"Recsys challenge 2019: Session-based hotel recommendations","venue":null,"work_id":"70e4281f-b41d-4a3a-a1c4-fc5eef9e26b4","year":2019},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.164504Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:7ff9743b71f4c07f1c314c9068d1b8dc7704c7d9509004bd58bc85e8bbd42386","observation_id":"2d86803a-ae75-4886-87cf-90385fa8d6fe","resolution":{"observed_at":"2026-08-07T14:52:43.502684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:43.273846Z","title":"Motif clustering and overlapping clustering for social network analysis","venue":null,"work_id":"57478872-235a-4712-9288-778736e124f4","year":2017},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.262543Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:066def3a48dc71cc71826b3be30871a04c0cd74bf958b7845c06e5b444a96a8b","observation_id":"c9cd3dfd-3607-4d84-81de-b96f2418384e","resolution":{"observed_at":"2026-08-07T14:52:43.342330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:43.080102Z","title":"Inhomogeneous hypergraph clustering with applications","venue":null,"work_id":"86cd4180-83b5-43a9-bef8-ae4ac459b413","year":2017},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.360065Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:3cb0aa3ad4e2c112436bc757b6aa907e4de1d95943ca0ecc0fbfbaa0911ee12b","observation_id":"a2854c40-2969-4141-a782-0feba0fb5bd4","resolution":{"observed_at":"2026-08-07T14:52:43.168932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:42.941910Z","title":"Mittelmann","venue":null,"work_id":"fbeb03e0-1829-484e-aa93-8c6be18d3af0","year":2018},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.465195Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:8e3bb5ff84a7d83caee0cda4f80a94d15987eb9bd6bee85dd034f8aa957bdb86","observation_id":"194c535f-b255-4953-93a7-d45661496fcf","resolution":{"observed_at":"2026-08-07T14:52:43.022639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:42.772246Z","title":"Mittelmann","venue":null,"work_id":"7d87c607-3a36-4082-9bc3-3035b61851f1","year":2023},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.576895Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:b12719d1ddde86befd1e2d9f794d4b905c3e13257891a1af42e27b569abb0665","observation_id":"896d699a-1235-4e06-8b83-41103e0d1fde","resolution":{"observed_at":"2026-08-07T14:52:42.831969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:42.599452Z","title":"Correlation clustering methodologies and their funda- mental results","venue":null,"work_id":"5e3ea348-02b5-459b-8982-5ce0a004a451","year":2018},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.682507Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:49058979f6bd6056edd9a75a337ee131234ab2eea593b6d1dee2683dca0c3d33","observation_id":"8e6ef35f-52e4-40e7-b412-8e20d6053867","resolution":{"observed_at":"2026-08-07T14:52:42.682445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:42.435904Z","title":"Complex network measures of brain connectivity: uses and interpre- tations","venue":null,"work_id":"4c501f1a-7c26-4a32-8e6f-e54f0b5a13a9","year":2010},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.795560Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:13b5a10b2b54c9f3d1a9af4de5486e3a76a8b5cd555f06e221a05e2a867f150f","observation_id":"f1650c30-f829-43e9-a5b9-11107079e029","resolution":{"observed_at":"2026-08-07T14:52:42.516113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:42.264815Z","title":"An overview of Microsoft Academic Service (MAS) and Applications","venue":null,"work_id":"cc7a1361-564d-4563-9c54-72613fc53da6","year":2015},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.882811Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:ea1de8abe17769db88d9ecf4681d5f39b905d9c41ff20335c721c88acc0ca316","observation_id":"b75c84b6-ee62-4c76-a594-203a55e94886","resolution":{"observed_at":"2026-08-07T14:52:42.336210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:42.112856Z","title":"Drug Abuse Warning Network (DA WN)","venue":null,"work_id":"2640c701-6f25-446d-aca1-44baa97b3a55","year":2011},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:39.964980Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:1204a019f8e6c31ea72d426903905b1d24d4e40e8506458ebb54ac1abff6bb99","observation_id":"d5885586-5439-411b-9e69-77543af46cb6","resolution":{"observed_at":"2026-08-07T14:52:42.187190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:41.891475Z","title":"Overlapping and Robust Edge-Colored Clustering in Hyper- graphs","venue":null,"work_id":"5a951da8-2482-49a4-b5a4-b3a62b160039","year":2024},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:40.080333Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:efcc48900c5fd7871de4f689ccedf86361d5345a047bd757aeee523dbebddec0","observation_id":"feac6710-a5ce-492d-ab51-51b10f53e77d","resolution":{"observed_at":"2026-08-07T14:52:42.000407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:41.660043Z","title":"Optimal LP rounding and linear-time approximation algorithms for clustering edge-colored hypergraphs","venue":null,"work_id":"88ccbd27-8131-48e6-a377-122f4c02cd45","year":2023},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:40.190540Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:9ab2c6552714599f110aa894dabef71b8a345af46c2e463bdd93ad0ae2a3020f","observation_id":"8edc4ce5-310e-41a7-a9ee-e49a82633b62","resolution":{"observed_at":"2026-08-07T14:52:41.754232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:41.478433Z","title":"A correlation clustering framework for community detection","venue":null,"work_id":"b4d38612-afa0-4b94-8e64-042324847d69","year":2018},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:40.280793Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:42ecaa74ecd237dd035ca1428bbd0b81c9603a970986e9eb392035c7ffe8589e","observation_id":"c7c5927a-c927-4c02-864b-2bc5d6769465","resolution":{"observed_at":"2026-08-07T14:52:41.546372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:41.300709Z","title":"A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis","venue":null,"work_id":"3ee74299-da07-40d1-acf8-a539e790a809","year":2022},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:40.362036Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:bf9e27847074dde6ffed92bb67bbdca787d56dc40bd8cd7bd9dbf31c9a9c5b24","observation_id":"d83cf334-5fa3-446b-8021-68dfbe1949f3","resolution":{"observed_at":"2026-08-07T14:52:41.385006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:41.094778Z","title":"Chromatic correlation clustering, revisited","venue":null,"work_id":"4f8058ba-fe62-44dc-95a0-38f302c07233","year":2022},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:40.444324Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:a6641f8f08a0641b0899a4f210fc7599ac9144c459bd58baf434d1ea929c54bf","observation_id":"b764bdb2-72b8-4db9-9c2d-914a0fc824ec","resolution":{"observed_at":"2026-08-07T14:52:41.203608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07T14:52:40.885952Z","title":"level” ℓe := P u∈e βe,u. Consider an iteration for node v ∈ V . By enumerating δ(v), we can compute, for every color c ∈ χ(δ(v)), the “slack","venue":null,"work_id":"70ec91c2-a4ea-41a9-8d26-78deab9da00f","year":2012},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:40.517087Z"},"links":{"citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:980d5dd757a21a56fd8e4910ad37a09171fbf27a36fbe2fc2657dc8d7963a935","observation_id":"5d7d1b9b-7ae3-46f0-9c82-e0896fcabd1f","resolution":{"observed_at":"2026-08-07T14:52:40.956249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 0 inbound Pith citation observations for arXiv:2505.18043."}