Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T14:52:40.517087Z
Paper Citation Record · LEDGER
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T14:52:40.517087Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
52 of 52 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 95e08385-99d3-4992-ac1d-3e3473125a02 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Improved approximations for the max k-colored cluster- ing problem
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 7a4d6b35-8657-4b45-839f-353d169cbc07 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A 0.3622-Approximation Algorithm for the Maximum k- Edge-Colored Clustering Problem
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 4474c4dc-6a08-4817-ad30-c7bb4bb2733e · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Approximability and inapproximability for maximum k-edge-colored clustering problem
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 30303018-8382-4ad4-8b5b-85fe90e198d8 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Clustering in graphs and hypergraphs with categorical edge labels
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 99dc6a45-b3d3-42d2-b1b7-13942d85f1af · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Diverse and experienced group discovery via hypergraph clustering
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 6cf20ed0-ef04-46de-9e15-9adc05778e9c · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Improved theoretical and practical guarantees for chromatic correlation clustering
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation fd8575f8-d5fa-4fff-9c7d-98fa5927d2d9 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Evolutionary algorithms for overlapping correlation clustering
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 95130738-2c30-4cd2-b8e4-15775b0ae999 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Clustering on k-edge-colored graphs
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 40e6519f-cf68-4a80-8e8d-5c8a37ee6746 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation clustering
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 217507a4-647d-4532-9d6b-1fef13689fe9 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Inapproximability of hypergraph vertex cover and applications to scheduling problems
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 802225ed-ec62-486d-ae87-dea7572b614b · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Cut, glue & cut: A fast, approximate solver for multicut partitioning
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 972643f7-6181-4228-93e3-6822bfdb5490 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Higher-order organization of complex networks
Reference 12
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4b2c1a34-6beb-4fd2-a1d7-6755a55121af · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Linear time bounds for median computations
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 71cc5022-d9f7-4f33-8920-5ea3186f0a87 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation Clustering
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 2b6e7bed-7d00-428f-9028-3f28c6b73230 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Chromatic correlation clustering
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation ef862437-6dfa-4cac-a7bd-34617c76263a · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Overlapping correlation clustering
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 65d3264a-0e15-4f86-9f89-72979a3b0935 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A hybrid heuristic for the overlapping cluster editing problem
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 256cc428-3e05-4f37-8892-a77208960f01 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Hypergraph clustering: from blockmodels to modularity
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b12b0439-9fd2-411e-92cd-0a74e5bdf415 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Overlapping and robust edge-colored clustering in hypergraphs
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 6a0aea90-454a-48e0-a622-8b2ae3de0b9f · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 9d5406b5-47fe-48c7-95e7-abd7c4e0767d · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Cognitive relevance of the community structure of the human brain functional coactivation network
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 74683680-bdf7-423f-92b5-a40385ce9c96 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Robust Correlation Clustering
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 53f0b3a1-c248-4ed6-879b-74e44f27d074 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A new multilayered PCP and the hardness of hypergraph vertex cover
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation e7c411fe-324d-47b5-a1d3-a510b4fc73e2 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A density-based algorithm for discover- ing clusters in large spatial databases with noise
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 96091b74-4c1b-4749-8b2b-f4aaf4b1f1f1 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation bc065ec2-9d4d-4197-9266-d42f21633a70 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Lp-based pivoting algorithm for higher-order correlation clustering
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 8370a8b1-8af7-4687-ab7a-a22bb09e07fe · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Approximation algorithms for partial covering problems
Reference 27
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 0fabf800-dcbc-444c-b607-266424861260 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation clustering generalized
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation e9d24cc6-d3fd-4296-9730-fc94ff8f2221 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A general approximation technique for constrained forest problems
Reference 29
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 3a05f88a-93fb-404d-97a1-58eb50be5aff · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Goemans and David P
Reference 30
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 84c3fde1-31e9-4372-b7d6-e68aa65af1c8 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A primal-dual bicriteria distributed algorithm for capacitated vertex cover
Reference 31
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 7b7f77cf-5742-4aa3-a891-284b5c1dddaf · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Approximation algorithms for the capacitated correlation clustering problem with penalties
Reference 32
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation d076a85a-773d-494d-aff3-2a9fb5b631db · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Walmart Recruiting: Trip Type Classifica- tion
Reference 33
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 5116cd27-7e6e-4f8c-9108-2b01b4da53b9 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach What’s Cooking? https://kaggle.com/competitions/whats-cooking, 2015
Reference 34
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 66449ef5-2644-4ad1-9dab-2ef6c5df9781 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Practical guide to cluster analysis in R: Unsupervised machine learning , vol- ume 1
Reference 35
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c239b24b-2640-4549-85a5-9d90870340b6 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Higher-order correlation clus- tering for image segmentation
Reference 36
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation a166a319-0466-403c-b2c3-feb95c0ed478 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A color-blind 3-approximation for chromatic correlation clustering and improved heuristics
Reference 37
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 2d86803a-ae75-4886-87cf-90385fa8d6fe · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Recsys challenge 2019: Session-based hotel recommendations
Reference 38
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c9cd3dfd-3607-4d84-81de-b96f2418384e · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Motif clustering and overlapping clustering for social network analysis
Reference 39
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation a2854c40-2969-4141-a782-0feba0fb5bd4 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Inhomogeneous hypergraph clustering with applications
Reference 40
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 194c535f-b255-4953-93a7-d45661496fcf · outbound
Reference 41
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 896d699a-1235-4e06-8b83-41103e0d1fde · outbound
Reference 42
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 8e6ef35f-52e4-40e7-b412-8e20d6053867 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation clustering methodologies and their funda- mental results
Reference 43
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f1650c30-f829-43e9-a5b9-11107079e029 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Complex network measures of brain connectivity: uses and interpre- tations
Reference 44
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b75c84b6-ee62-4c76-a594-203a55e94886 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach An overview of Microsoft Academic Service (MAS) and Applications
Reference 45
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation d5885586-5439-411b-9e69-77543af46cb6 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Drug Abuse Warning Network (DA WN)
Reference 46
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation feac6710-a5ce-492d-ab51-51b10f53e77d · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Overlapping and Robust Edge-Colored Clustering in Hyper- graphs
Reference 47
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 8edc4ce5-310e-41a7-a9ee-e49a82633b62 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Optimal LP rounding and linear-time approximation algorithms for clustering edge-colored hypergraphs
Reference 48
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c7c5927a-c927-4c02-864b-2bc5d6769465 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A correlation clustering framework for community detection
Reference 49
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation d83cf334-5fa3-446b-8021-68dfbe1949f3 · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
Reference 50
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b764bdb2-72b8-4db9-9c2d-914a0fc824ec · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Chromatic correlation clustering, revisited
Reference 51
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 5d7d1b9b-7ae3-46f0-9c82-e0896fcabd1f · outbound
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach 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
Reference 52
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
No inbound Pith citation observations are available.