Methods › Graphs › Graph Embeddings › GIC

Graph InfoClust

GIC

14 papers tagged archive 2025-07-28

Introduced by Costas Mavromatis et al. in Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The archive carries no description for this method.

PaperSource

In Syntology about another paper, arXiv:2406.14927: the paper matched by title held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:2406.14927, not a method entry. About another paper: this answer is about arXiv:2406.14927, while the archive credits arXiv:2009.06946, so it does not say whether this method has code.

Origin paper of this answer, arXiv:2406.14927 (its page on Syntology).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 14 · with a code link: 4 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (3 of 14 tagged: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 14 of 14, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 27 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Graph Representation Learning2
Representation Learning2
Attribute1
Automatic Speech Recognition1
Automatic Speech Recognition (ASR)1
Blocking1
Clustering1
Deep Learning1
Form1
Graph Neural Network1
Hallucination1
Image Captioning1
Language Modeling1
Language Modelling1
Link Prediction1
Model Selection1
Node Classification1
Node Clustering1
Object Hallucination1
Position1

Usage over time archive 2025-07-28

Papers per year tagged with GIC: 2020 to 2024, peak 4 4 0 2020: 1 paper 2020 2021: 2 papers 2021 2022: 4 papers 2022 2023: 3 papers 2023 2024: 4 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (14 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Embeddings

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections