Pith. sign in

Paper Citation Record · LEDGER

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach

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.

pith.paper-citation-record.v1
2505.18043 v1

Coverage vector

measured 52 of 52 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:52:40.517087Z

measured 52 of 52 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

52 of 52 outbound references displayed

  • verified exact1
  • verified fuzzy50
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 95e08385-99d3-4992-ac1d-3e3473125a02 · outbound

This paper cites Improved approximations for the max k-colored cluster- ing problem.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:49.320366Z

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.

source=pdf_text observed=2026-08-07T14:52:35.786738Z digest=sha256:86c325ed4ee69f6e1c8e2318828a5632d8c1c61a2e0e8f7c69a273e0ffac858b

Observation 7a4d6b35-8657-4b45-839f-353d169cbc07 · outbound

This paper cites A 0.3622-Approximation Algorithm for the Maximum k- Edge-Colored Clustering Problem.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:49.169413Z

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.

source=pdf_text observed=2026-08-07T14:52:35.855691Z digest=sha256:f51d61e3493d8a4134fa67e80ecd0fce13a2a76232b9d3cd554071177573d03d

Observation 4474c4dc-6a08-4817-ad30-c7bb4bb2733e · outbound

This paper cites Approximability and inapproximability for maximum k-edge-colored clustering problem.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:48.942416Z

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.

source=pdf_text observed=2026-08-07T14:52:35.920202Z digest=sha256:fcde350dc872dd4cda424ca7d70b84c94c8de8b9cb38c663610735b375ab2e4e

Observation 30303018-8382-4ad4-8b5b-85fe90e198d8 · outbound

This paper cites Clustering in graphs and hypergraphs with categorical edge labels.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:48.777888Z

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.

source=pdf_text observed=2026-08-07T14:52:36.003098Z digest=sha256:e8c246c215a8e0cfc31f1fbd97ccb4c45fc68f5c03cc1bbcb43730440bb3f730

Observation 99dc6a45-b3d3-42d2-b1b7-13942d85f1af · outbound

This paper cites Diverse and experienced group discovery via hypergraph clustering.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:48.632451Z

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.

source=pdf_text observed=2026-08-07T14:52:36.088849Z digest=sha256:2dc61ed231fe563bdb96f564c9a63583b237e50593592420be338a7b4f32cb80

Observation 6cf20ed0-ef04-46de-9e15-9adc05778e9c · outbound

This paper cites Improved theoretical and practical guarantees for chromatic correlation clustering.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:48.445217Z

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.

source=pdf_text observed=2026-08-07T14:52:36.167750Z digest=sha256:1377319f98d3deb8122ba029e06c7d7f203627a70e502192ca7ae7b4dab5cf03

Observation fd8575f8-d5fa-4fff-9c7d-98fa5927d2d9 · outbound

This paper cites Evolutionary algorithms for overlapping correlation clustering.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Evolutionary algorithms for overlapping correlation clustering

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:48.212796Z

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.

source=pdf_text observed=2026-08-07T14:52:36.259102Z digest=sha256:39f848373b5c0c6a82409a8bc6745eb12b88e509692341c4510d443ee98f6e07

Observation 95130738-2c30-4cd2-b8e4-15775b0ae999 · outbound

This paper cites Clustering on k-edge-colored graphs.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Clustering on k-edge-colored graphs

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:48.010864Z

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.

source=pdf_text observed=2026-08-07T14:52:36.356982Z digest=sha256:c1bf4f0be07fd9c36731449d76d1992f595898d2ce9a91aa19934a557b4f13c4

Observation 40e6519f-cf68-4a80-8e8d-5c8a37ee6746 · outbound

This paper cites Correlation clustering.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation clustering

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:47.841322Z

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.

source=pdf_text observed=2026-08-07T14:52:36.480111Z digest=sha256:f3ecec8de827254e27c42eb8ab0e8192494ad9bb063e08a5ed0f03b8255c6115

Observation 217507a4-647d-4532-9d6b-1fef13689fe9 · outbound

This paper cites Inapproximability of hypergraph vertex cover and applications to scheduling problems.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:47.656164Z

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.

source=pdf_text observed=2026-08-07T14:52:36.560306Z digest=sha256:e2bda45f0a6c6cf37cf9029cfae3f49f0ee3f936c1d6a18142cef61c0807143f

Observation 802225ed-ec62-486d-ae87-dea7572b614b · outbound

This paper cites Cut, glue & cut: A fast, approximate solver for multicut partitioning.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:47.495823Z

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.

source=pdf_text observed=2026-08-07T14:52:36.631386Z digest=sha256:e8445fcd09dc523dcbb9ea5e4c9851a318aad2e6d56f9a2c7cfbca3ee50c23e8

Observation 972643f7-6181-4228-93e3-6822bfdb5490 · outbound

This paper cites Higher-order organization of complex networks.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Higher-order organization of complex networks

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T14:52:36.745059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:52:36.745059Z digest=sha256:1967fb40c79dda47d4f68c39c6dbc5c610581d2ecf0c65b662436d7bdc596e35

Observation 4b2c1a34-6beb-4fd2-a1d7-6755a55121af · outbound

This paper cites Linear time bounds for median computations.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Linear time bounds for median computations

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:47.327900Z

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.

source=pdf_text observed=2026-08-07T14:52:36.817425Z digest=sha256:225f291a6d47a1d4ca6ebcd5385b7c87bcd50f067f9d17f51244602d7447f974

Observation 71cc5022-d9f7-4f33-8920-5ea3186f0a87 · outbound

This paper cites Correlation Clustering.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation Clustering

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:47.172024Z

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.

source=pdf_text observed=2026-08-07T14:52:36.891609Z digest=sha256:d5fb96d1d4b20f8fa3f99a1504b34607a01797944f7d752e246dbf727188792a

Observation 2b6e7bed-7d00-428f-9028-3f28c6b73230 · outbound

This paper cites Chromatic correlation clustering.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Chromatic correlation clustering

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:46.911909Z

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.

source=pdf_text observed=2026-08-07T14:52:36.974021Z digest=sha256:ce47e91454f51228bab24252a8c95472a22bf6c7cc80440c29ca2ad825686dff

Observation ef862437-6dfa-4cac-a7bd-34617c76263a · outbound

This paper cites Overlapping correlation clustering.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Overlapping correlation clustering

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:46.700987Z

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.

source=pdf_text observed=2026-08-07T14:52:37.078795Z digest=sha256:5e3942a14ce9a99e4c6214026a4555b66e629b156c2e90b4aee7c1dafc3feb5f

Observation 65d3264a-0e15-4f86-9f89-72979a3b0935 · outbound

This paper cites A hybrid heuristic for the overlapping cluster editing problem.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:46.484606Z

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.

source=pdf_text observed=2026-08-07T14:52:37.157936Z digest=sha256:e868164067f280eff3409a85e5199ff7678ecfac3d4262b82693b68a25241a8d

Observation 256cc428-3e05-4f37-8892-a77208960f01 · outbound

This paper cites Hypergraph clustering: from blockmodels to modularity.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Hypergraph clustering: from blockmodels to modularity

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:46.271718Z

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.

source=pdf_text observed=2026-08-07T14:52:37.247047Z digest=sha256:e3e3d40ca836d684a3411ece08779c7a098386f15ad1cd46f43292f4c414086f

Observation b12b0439-9fd2-411e-92cd-0a74e5bdf415 · outbound

This paper cites Overlapping and robust edge-colored clustering in hypergraphs.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:46.225956Z

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.

source=pdf_text observed=2026-08-07T14:52:37.323940Z digest=sha256:a3a849f734ca4bd008d3b5a0e4430eb362095ccf907e8883980b81aa4e387884

Observation 6a0aea90-454a-48e0-a622-8b2ae3de0b9f · outbound

This paper cites Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges.

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

Resolution
verified exact
local_arxiv, observed 2026-08-07T14:52:40.787819Z

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.

source=pdf_text observed=2026-08-07T14:52:37.447783Z digest=sha256:becb729d93adb91fdc8965de0256b0789525f6cb9100b3a5c4e142793df29cd9

Observation 9d5406b5-47fe-48c7-95e7-abd7c4e0767d · outbound

This paper cites Cognitive relevance of the community structure of the human brain functional coactivation network.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:46.042669Z

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.

source=pdf_text observed=2026-08-07T14:52:37.541003Z digest=sha256:aaac6332087c71baabc3fb8a9ef38383c4f469cf7c285f64a4b70f2e20318031

Observation 74683680-bdf7-423f-92b5-a40385ce9c96 · outbound

This paper cites Robust Correlation Clustering.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Robust Correlation Clustering

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.949166Z

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.

source=pdf_text observed=2026-08-07T14:52:37.638160Z digest=sha256:407682d9a1d50af2b92fc9a25a3ce3e72703ba7ca0b0ef56c76e23c62010906f

Observation 53f0b3a1-c248-4ed6-879b-74e44f27d074 · outbound

This paper cites A new multilayered PCP and the hardness of hypergraph vertex cover.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.820940Z

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.

source=pdf_text observed=2026-08-07T14:52:37.727670Z digest=sha256:50d560ecd320c4a5f39b7d540ff9ee43585ec09f10d8e0d0b610b70e935890e6

Observation e7c411fe-324d-47b5-a1d3-a510b4fc73e2 · outbound

This paper cites A density-based algorithm for discover- ing clusters in large spatial databases with noise.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.722474Z

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.

source=pdf_text observed=2026-08-07T14:52:37.812967Z digest=sha256:69e5cf00b01cca8ed84c792bdeadb99fca63d5c22615a8a191fc79236917c4a5

Observation 96091b74-4c1b-4749-8b2b-f4aaf4b1f1f1 · outbound

This paper cites A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.610491Z

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.

source=pdf_text observed=2026-08-07T14:52:37.909504Z digest=sha256:f8a305fd22b8c1ce333b60f4e5f0954040bbe17ba94dff9bf3606269d62f4c07

Observation bc065ec2-9d4d-4197-9266-d42f21633a70 · outbound

This paper cites Lp-based pivoting algorithm for higher-order correlation clustering.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.479432Z

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.

source=pdf_text observed=2026-08-07T14:52:38.006232Z digest=sha256:5b9596425e698b55e0f1b1b0c0148c129f1ea1254d2070e4a541b1dae8964a0b

Observation 8370a8b1-8af7-4687-ab7a-a22bb09e07fe · outbound

This paper cites Approximation algorithms for partial covering problems.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Approximation algorithms for partial covering problems

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.347877Z

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.

source=pdf_text observed=2026-08-07T14:52:38.093963Z digest=sha256:60fa58545488fe3f222f012f308562214e47d6c6f04fc962249f7d9fbbcb71f7

Observation 0fabf800-dcbc-444c-b607-266424861260 · outbound

This paper cites Correlation clustering generalized.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Correlation clustering generalized

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.214429Z

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.

source=pdf_text observed=2026-08-07T14:52:38.207369Z digest=sha256:8d64e89f724c083138d79b7db5a72b90c53613959cd91e04b0049062542903ad

Observation e9d24cc6-d3fd-4296-9730-fc94ff8f2221 · outbound

This paper cites A general approximation technique for constrained forest problems.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:45.099076Z

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.

source=pdf_text observed=2026-08-07T14:52:38.308385Z digest=sha256:4dda0307fe8f51aec953b66c655b31a358fe670bd2c40ab00c7dc43618cd4106

Observation 3a05f88a-93fb-404d-97a1-58eb50be5aff · outbound

This paper cites Goemans and David P.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Goemans and David P

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:44.956775Z

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.

source=pdf_text observed=2026-08-07T14:52:38.376114Z digest=sha256:7bc6e688b257be71975ffe7eadf6d7a142409728c469dbff64d7413f3b26a59d

Observation 84c3fde1-31e9-4372-b7d6-e68aa65af1c8 · outbound

This paper cites A primal-dual bicriteria distributed algorithm for capacitated vertex cover.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:44.809006Z

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.

source=pdf_text observed=2026-08-07T14:52:38.483457Z digest=sha256:4733636bce89a9055254ce29abdd205c66e267b4821a59a647a8db504d72136e

Observation 7b7f77cf-5742-4aa3-a891-284b5c1dddaf · outbound

This paper cites Approximation algorithms for the capacitated correlation clustering problem with penalties.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:44.665632Z

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.

source=pdf_text observed=2026-08-07T14:52:38.583499Z digest=sha256:efc636b9a5a47e5ab64677041b6ec2adb6e3fd293fa818983de58bfa06f31776

Observation d076a85a-773d-494d-aff3-2a9fb5b631db · outbound

This paper cites Walmart Recruiting: Trip Type Classifica- tion.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Walmart Recruiting: Trip Type Classifica- tion

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:44.462600Z

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.

source=pdf_text observed=2026-08-07T14:52:38.682719Z digest=sha256:f754a02cdc6676517f55a079e25a05b54dc9c4b72561b20127046047fb3acc6c

Observation 5116cd27-7e6e-4f8c-9108-2b01b4da53b9 · outbound

This paper cites What’s Cooking? https://kaggle.com/competitions/whats-cooking, 2015.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:44.222711Z

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.

source=pdf_text observed=2026-08-07T14:52:38.767268Z digest=sha256:965405312bd49c911b131566b94a746f489327e5e0a5c4268108c7aa8fec015c

Observation 66449ef5-2644-4ad1-9dab-2ef6c5df9781 · outbound

This paper cites Practical guide to cluster analysis in R: Unsupervised machine learning , vol- ume 1.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:44.020245Z

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.

source=pdf_text observed=2026-08-07T14:52:38.872168Z digest=sha256:14bef61fd6735cd6d38bd87e10022fe09c816bef7fe66831fc9ba5b5fdfdfb6e

Observation c239b24b-2640-4549-85a5-9d90870340b6 · outbound

This paper cites Higher-order correlation clus- tering for image segmentation.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:43.819652Z

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.

source=pdf_text observed=2026-08-07T14:52:38.967015Z digest=sha256:b66b15fa4b076681aceb1282f44106d3a3cf119f215c99b0fb49cee80f3ad0b3

Observation a166a319-0466-403c-b2c3-feb95c0ed478 · outbound

This paper cites A color-blind 3-approximation for chromatic correlation clustering and improved heuristics.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:43.651679Z

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.

source=pdf_text observed=2026-08-07T14:52:39.035003Z digest=sha256:f3226f08c39f8c95272097dc51cb9ab530b8ade10ac5a29a81ec00c1ada849e6

Observation 2d86803a-ae75-4886-87cf-90385fa8d6fe · outbound

This paper cites Recsys challenge 2019: Session-based hotel recommendations.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:43.502684Z

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.

source=pdf_text observed=2026-08-07T14:52:39.164504Z digest=sha256:7ff9743b71f4c07f1c314c9068d1b8dc7704c7d9509004bd58bc85e8bbd42386

Observation c9cd3dfd-3607-4d84-81de-b96f2418384e · outbound

This paper cites Motif clustering and overlapping clustering for social network analysis.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:43.342330Z

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.

source=pdf_text observed=2026-08-07T14:52:39.262543Z digest=sha256:066def3a48dc71cc71826b3be30871a04c0cd74bf958b7845c06e5b444a96a8b

Observation a2854c40-2969-4141-a782-0feba0fb5bd4 · outbound

This paper cites Inhomogeneous hypergraph clustering with applications.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Inhomogeneous hypergraph clustering with applications

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:43.168932Z

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.

source=pdf_text observed=2026-08-07T14:52:39.360065Z digest=sha256:3cb0aa3ad4e2c112436bc757b6aa907e4de1d95943ca0ecc0fbfbaa0911ee12b

Observation 194c535f-b255-4953-93a7-d45661496fcf · outbound

This paper cites Mittelmann.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Mittelmann

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:43.022639Z

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.

source=pdf_text observed=2026-08-07T14:52:39.465195Z digest=sha256:8e3bb5ff84a7d83caee0cda4f80a94d15987eb9bd6bee85dd034f8aa957bdb86

Observation 896d699a-1235-4e06-8b83-41103e0d1fde · outbound

This paper cites Mittelmann.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Mittelmann

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:42.831969Z

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.

source=pdf_text observed=2026-08-07T14:52:39.576895Z digest=sha256:b12719d1ddde86befd1e2d9f794d4b905c3e13257891a1af42e27b569abb0665

Observation 8e6ef35f-52e4-40e7-b412-8e20d6053867 · outbound

This paper cites Correlation clustering methodologies and their funda- mental results.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:42.682445Z

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.

source=pdf_text observed=2026-08-07T14:52:39.682507Z digest=sha256:49058979f6bd6056edd9a75a337ee131234ab2eea593b6d1dee2683dca0c3d33

Observation f1650c30-f829-43e9-a5b9-11107079e029 · outbound

This paper cites Complex network measures of brain connectivity: uses and interpre- tations.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:42.516113Z

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.

source=pdf_text observed=2026-08-07T14:52:39.795560Z digest=sha256:13b5a10b2b54c9f3d1a9af4de5486e3a76a8b5cd555f06e221a05e2a867f150f

Observation b75c84b6-ee62-4c76-a594-203a55e94886 · outbound

This paper cites An overview of Microsoft Academic Service (MAS) and Applications.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:42.336210Z

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.

source=pdf_text observed=2026-08-07T14:52:39.882811Z digest=sha256:ea1de8abe17769db88d9ecf4681d5f39b905d9c41ff20335c721c88acc0ca316

Observation d5885586-5439-411b-9e69-77543af46cb6 · outbound

This paper cites Drug Abuse Warning Network (DA WN).

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Drug Abuse Warning Network (DA WN)

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:42.187190Z

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.

source=pdf_text observed=2026-08-07T14:52:39.964980Z digest=sha256:1204a019f8e6c31ea72d426903905b1d24d4e40e8506458ebb54ac1abff6bb99

Observation feac6710-a5ce-492d-ab51-51b10f53e77d · outbound

This paper cites Overlapping and Robust Edge-Colored Clustering in Hyper- graphs.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:42.000407Z

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.

source=pdf_text observed=2026-08-07T14:52:40.080333Z digest=sha256:efcc48900c5fd7871de4f689ccedf86361d5345a047bd757aeee523dbebddec0

Observation 8edc4ce5-310e-41a7-a9ee-e49a82633b62 · outbound

This paper cites Optimal LP rounding and linear-time approximation algorithms for clustering edge-colored hypergraphs.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:41.754232Z

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.

source=pdf_text observed=2026-08-07T14:52:40.190540Z digest=sha256:9ab2c6552714599f110aa894dabef71b8a345af46c2e463bdd93ad0ae2a3020f

Observation c7c5927a-c927-4c02-864b-2bc5d6769465 · outbound

This paper cites A correlation clustering framework for community detection.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:41.546372Z

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.

source=pdf_text observed=2026-08-07T14:52:40.280793Z digest=sha256:42ecaa74ecd237dd035ca1428bbd0b81c9603a970986e9eb392035c7ffe8589e

Observation d83cf334-5fa3-446b-8021-68dfbe1949f3 · outbound

This paper cites A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:41.385006Z

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.

source=pdf_text observed=2026-08-07T14:52:40.362036Z digest=sha256:bf9e27847074dde6ffed92bb67bbdca787d56dc40bd8cd7bd9dbf31c9a9c5b24

Observation b764bdb2-72b8-4db9-9c2d-914a0fc824ec · outbound

This paper cites Chromatic correlation clustering, revisited.

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach Chromatic correlation clustering, revisited

Reference 51

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:41.203608Z

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.

source=pdf_text observed=2026-08-07T14:52:40.444324Z digest=sha256:a6641f8f08a0641b0899a4f210fc7599ac9144c459bd58baf434d1ea929c54bf

Observation 5d7d1b9b-7ae3-46f0-9c82-e0896fcabd1f · outbound

This paper cites 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.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:52:40.956249Z

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.

source=pdf_text observed=2026-08-07T14:52:40.517087Z digest=sha256:980d5dd757a21a56fd8e4910ad37a09171fbf27a36fbe2fc2657dc8d7963a935

Pith citing papers

No inbound Pith citation observations are available.