{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/clustering/papers/16","list_of":"/task/clustering","task":"Clustering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":16,"pages_in_order":108,"rows_per_page":100,"rows":[1501,1600],"of":10718,"counts":{"archive_papers_tagged":10718,"with_a_code_link":2823,"where_syntology_ran_a_sample":419,"not_listed_spam_title":0,"listed":10718,"listed_where_code_ran":419,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":335,"every_run_a_failure_of_syntologys_instrument":84,"listed_with_a_run_with_no_instrument_failure":335,"listed_every_run_a_failure_of_syntologys_instrument":84,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/clustering","prev":"/task/clustering/papers/15","next":"/task/clustering/papers/17","papers":[{"url":"/paper/kernel-clustering-with-sigmoid-based","slug":"kernel-clustering-with-sigmoid-based","title":"Kernel Clustering with Sigmoid-based Regularization for Efficient Segmentation of Sequential Data","date":"2021-06-22","arxiv_id":"2106.11541","repositories_listed":1,"syntology":null},{"url":"/paper/on-matrix-factorizations-in-subspace","slug":"on-matrix-factorizations-in-subspace","title":"On Matrix Factorizations in Subspace Clustering","date":"2021-06-22","arxiv_id":"2106.12016","repositories_listed":1,"syntology":null},{"url":"/paper/rank-one-matrix-estimation-with-groupwise","slug":"rank-one-matrix-estimation-with-groupwise","title":"Fundamental limits for rank-one matrix estimation with groupwise heteroskedasticity","date":"2021-06-22","arxiv_id":"2106.11950","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-multi-modal-clustering","slug":"contrastive-multi-modal-clustering","title":"Multi-level Feature Learning for Contrastive Multi-view Clustering","date":"2021-06-21","arxiv_id":"2106.11193","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-image-segmentation-based-on","slug":"large-scale-image-segmentation-based-on","title":"Large-scale image segmentation based on distributed clustering algorithms","date":"2021-06-21","arxiv_id":"2106.10795","repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-contrastive-learning-for-novel","slug":"neighborhood-contrastive-learning-for-novel","title":"Neighborhood Contrastive Learning for Novel Class Discovery","date":"2021-06-20","arxiv_id":"2106.10731","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/neighborhood-contrastive-learning-for-novel#ran","syntology_url":"https://syntology.ai/paper/2106.10731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10731"}},"official":{"repos":["zhunzhong07/NCL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/clusformer-a-transformer-based-clustering","slug":"clusformer-a-transformer-based-clustering","title":"Clusformer: A Transformer Based Clustering Approach to Unsupervised Large-Scale Face and Visual Landmark Recognition","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/nearest-neighbor-matching-for-deep-clustering","slug":"nearest-neighbor-matching-for-deep-clustering","title":"Nearest Neighbor Matching for Deep Clustering","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-face-clustering-on-a-large-1","slug":"structure-aware-face-clustering-on-a-large-1","title":"Structure-Aware Face Clustering on a Large-Scale Graph With 107 Nodes","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lsec-large-scale-spectral-ensemble-clustering","slug":"lsec-large-scale-spectral-ensemble-clustering","title":"LSEC: Large-scale spectral ensemble clustering","date":"2021-06-18","arxiv_id":"2106.09852","repositories_listed":1,"syntology":null},{"url":"/paper/smoothed-multi-view-subspace-clustering","slug":"smoothed-multi-view-subspace-clustering","title":"Smoothed Multi-View Subspace Clustering","date":"2021-06-18","arxiv_id":"2106.09875","repositories_listed":1,"syntology":null},{"url":"/paper/towards-clustering-friendly-representations","slug":"towards-clustering-friendly-representations","title":"Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering","date":"2021-06-18","arxiv_id":"2106.09874","repositories_listed":1,"syntology":null},{"url":"/paper/a-distance-based-separability-measure-for","slug":"a-distance-based-separability-measure-for","title":"A Distance-based Separability Measure for Internal Cluster Validation","date":"2021-06-17","arxiv_id":"2106.09794","repositories_listed":1,"syntology":null},{"url":"/paper/prototypical-graph-contrastive-learning","slug":"prototypical-graph-contrastive-learning","title":"Prototypical Graph Contrastive Learning","date":"2021-06-17","arxiv_id":"2106.09645","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/prototypical-graph-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2106.09645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09645"}},"official":{"repos":["ha-lins/pgcl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/an-unifying-point-of-view-on-expressive-power","slug":"an-unifying-point-of-view-on-expressive-power","title":"On the approximation capability of GNNs in node classification/regression tasks","date":"2021-06-16","arxiv_id":"2106.08992","repositories_listed":1,"syntology":null},{"url":"/paper/transductive-few-shot-learning-clustering-is","slug":"transductive-few-shot-learning-clustering-is","title":"Transductive Few-Shot Learning: Clustering is All You Need?","date":"2021-06-16","arxiv_id":"2106.09516","repositories_listed":1,"syntology":null},{"url":"/paper/author-clustering-and-topic-estimation-for","slug":"author-clustering-and-topic-estimation-for","title":"Author Clustering and Topic Estimation for Short Texts","date":"2021-06-15","arxiv_id":"2106.09533","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-guided-asymmetric-contrastive","slug":"cluster-guided-asymmetric-contrastive","title":"Cluster-guided Asymmetric Contrastive Learning for Unsupervised Person Re-Identification","date":"2021-06-15","arxiv_id":"2106.07846","repositories_listed":1,"syntology":null},{"url":"/paper/latent-correlation-based-multiview-learning","slug":"latent-correlation-based-multiview-learning","title":"Understanding Latent Correlation-Based Multiview Learning and Self-Supervision: An Identifiability Perspective","date":"2021-06-14","arxiv_id":"2106.07115","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/latent-correlation-based-multiview-learning#ran","syntology_url":"https://syntology.ai/paper/2106.07115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07115"}},"official":null}},{"url":"/paper/augnet-end-to-end-unsupervised-visual","slug":"augnet-end-to-end-unsupervised-visual","title":"AugNet: End-to-End Unsupervised Visual Representation Learning with Image Augmentation","date":"2021-06-11","arxiv_id":"2106.06250","repositories_listed":1,"syntology":null},{"url":"/paper/deep-conditional-gaussian-mixture-model-for","slug":"deep-conditional-gaussian-mixture-model-for","title":"Deep Conditional Gaussian Mixture Model for Constrained Clustering","date":"2021-06-11","arxiv_id":"2106.06385","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-precise-feature-for-cluster","slug":"learning-the-precise-feature-for-cluster","title":"Learning the Precise Feature for Cluster Assignment","date":"2021-06-11","arxiv_id":"2106.06159","repositories_listed":1,"syntology":null},{"url":"/paper/refining-pseudo-labels-with-clustering","slug":"refining-pseudo-labels-with-clustering","title":"Refining Pseudo Labels with Clustering Consensus over Generations for Unsupervised Object Re-identification","date":"2021-06-11","arxiv_id":"2106.06133","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-variational-approach-to-clustering","slug":"a-deep-variational-approach-to-clustering","title":"A Deep Variational Approach to Clustering Survival Data","date":"2021-06-10","arxiv_id":"2106.05763","repositories_listed":1,"syntology":null},{"url":"/paper/automated-self-supervised-learning-for-graphs","slug":"automated-self-supervised-learning-for-graphs","title":"Automated Self-Supervised Learning for Graphs","date":"2021-06-10","arxiv_id":"2106.05470","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-contrastive-learning-for","slug":"cross-domain-contrastive-learning-for","title":"Cross-domain Contrastive Learning for Unsupervised Domain Adaptation","date":"2021-06-10","arxiv_id":"2106.05528","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-notion-of-individually-fair-clustering","slug":"a-new-notion-of-individually-fair-clustering","title":"A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center","date":"2021-06-09","arxiv_id":"2106.05423","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-new-notion-of-individually-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/2106.05423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05423"}},"official":{"repos":["chakrabarti/equitable_clustering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-clustering-based-fair-outlier-detection","slug":"deep-clustering-based-fair-outlier-detection","title":"Deep Clustering based Fair Outlier Detection","date":"2021-06-09","arxiv_id":"2106.05127","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-clustering-based-fair-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2106.05127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05127"}},"official":{"repos":["brandeis-machine-learning/FairOutlierDetection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/digrac-digraph-clustering-with-flow-imbalance#ran","syntology_url":"https://syntology.ai/paper/2106.05194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05194"}},"official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/i-don-t-need-mathbf-u-identifiable-non-linear","slug":"i-don-t-need-mathbf-u-identifiable-non-linear","title":"I Don't Need u: Identifiable Non-Linear ICA Without Side Information","date":"2021-06-09","arxiv_id":"2106.05238","repositories_listed":1,"syntology":null},{"url":"/paper/local-algorithms-for-finding-densely","slug":"local-algorithms-for-finding-densely","title":"Local Algorithms for Finding Densely Connected Clusters","date":"2021-06-09","arxiv_id":"2106.05245","repositories_listed":1,"syntology":{"n":15,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/local-algorithms-for-finding-densely#ran","syntology_url":"https://syntology.ai/paper/2106.05245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05245"}},"official":{"repos":["pmacg/local-densely-connected-clusters"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-facet-clustering-variational","slug":"multi-facet-clustering-variational","title":"Multi-Facet Clustering Variational Autoencoders","date":"2021-06-09","arxiv_id":"2106.05241","repositories_listed":1,"syntology":{"n":25,"n_ran":14,"n_constructed":1,"n_ran_checked":8,"n_instrument":6,"n_unverified":11,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":4,"phrase":"14 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 6 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/multi-facet-clustering-variational#ran","syntology_url":"https://syntology.ai/paper/2106.05241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05241"}},"official":{"repos":["FabianFalck/mfcvae"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/tensor-based-multi-view-block-diagonal","slug":"tensor-based-multi-view-block-diagonal","title":"Tensor-Based Multi-View Block-Diagonal Structure Diffusion for Clustering Incomplete Multi-View Data","date":"2021-06-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/weighted-sparse-subspace-representation-a","slug":"weighted-sparse-subspace-representation-a","title":"Weighted Sparse Subspace Representation: A Unified Framework for Subspace Clustering, Constrained Clustering, and Active Learning","date":"2021-06-08","arxiv_id":"2106.04330","repositories_listed":1,"syntology":null},{"url":"/paper/a-semi-personalized-system-for-user-cold","slug":"a-semi-personalized-system-for-user-cold","title":"A Semi-Personalized System for User Cold Start Recommendation on Music Streaming Apps","date":"2021-06-07","arxiv_id":"2106.03819","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-clustered-federated-learning-in","slug":"unsupervised-clustered-federated-learning-in","title":"Unsupervised Clustered Federated Learning in Complex Multi-source Acoustic Environments","date":"2021-06-07","arxiv_id":"2106.03671","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-for-cuboid-shape","slug":"unsupervised-learning-for-cuboid-shape","title":"Unsupervised Learning for Cuboid Shape Abstraction via Joint Segmentation from Point Clouds","date":"2021-06-07","arxiv_id":"2106.03437","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-learning-for-cuboid-shape#ran","syntology_url":"https://syntology.ai/paper/2106.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03437"}},"official":null}},{"url":"/paper/domain-consensus-clustering-for-universal","slug":"domain-consensus-clustering-for-universal","title":"Domain Consensus Clustering for Universal Domain Adaptation","date":"2021-06-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-clustering-with-similarity-queries","slug":"fuzzy-clustering-with-similarity-queries","title":"Fuzzy Clustering with Similarity Queries","date":"2021-06-04","arxiv_id":"2106.02212","repositories_listed":1,"syntology":null},{"url":"/paper/spatially-relaxed-inference-on-high","slug":"spatially-relaxed-inference-on-high","title":"Spatially relaxed inference on high-dimensional linear models","date":"2021-06-04","arxiv_id":"2106.02590","repositories_listed":1,"syntology":null},{"url":"/paper/gmair-unsupervised-object-detection-based-on","slug":"gmair-unsupervised-object-detection-based-on","title":"GMAIR: Unsupervised Object Detection Based on Spatial Attention and Gaussian Mixture","date":"2021-06-03","arxiv_id":"2106.01722","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-embedding-for-dynamic-networks-with","slug":"spectral-embedding-for-dynamic-networks-with","title":"Spectral embedding for dynamic networks with stability guarantees","date":"2021-06-02","arxiv_id":"2106.01282","repositories_listed":1,"syntology":null},{"url":"/paper/open-hierarchical-relation-extraction","slug":"open-hierarchical-relation-extraction","title":"Open Hierarchical Relation Extraction","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/supervised-neural-clustering-via-latent","slug":"supervised-neural-clustering-via-latent","title":"Supervised Neural Clustering via Latent Structured Output Learning: Application to Question Intents","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/clustering-friendly-representation-learning-1","slug":"clustering-friendly-representation-learning-1","title":"Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelation","date":"2021-05-31","arxiv_id":"2106.00131","repositories_listed":1,"syntology":null},{"url":"/paper/oct-gan-neural-ode-based-conditional-tabular","slug":"oct-gan-neural-ode-based-conditional-tabular","title":"OCT-GAN: Neural ODE-based Conditional Tabular GANs","date":"2021-05-31","arxiv_id":"2105.14969","repositories_listed":1,"syntology":null},{"url":"/paper/a-stochastic-alternating-balance-k-means","slug":"a-stochastic-alternating-balance-k-means","title":"A Stochastic Alternating Balance $k$-Means Algorithm for Fair Clustering","date":"2021-05-29","arxiv_id":"2105.14172","repositories_listed":1,"syntology":null},{"url":"/paper/deep-fair-discriminative-clustering","slug":"deep-fair-discriminative-clustering","title":"Deep Fair Discriminative Clustering","date":"2021-05-28","arxiv_id":"2105.14146","repositories_listed":1,"syntology":null},{"url":"/paper/attention-oriented-brain-storm-optimization","slug":"attention-oriented-brain-storm-optimization","title":"Attention-oriented Brain Storm Optimization for Multimodal Optimization Problems","date":"2021-05-27","arxiv_id":"2105.13095","repositories_listed":1,"syntology":null},{"url":"/paper/time-varying-particle-data-feature-extraction","slug":"time-varying-particle-data-feature-extraction","title":"Local Latent Representation based on Geometric Convolution for Particle Data Feature Exploration","date":"2021-05-27","arxiv_id":"2105.13240","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-activity-segmentation-by-joint","slug":"unsupervised-activity-segmentation-by-joint","title":"Unsupervised Action Segmentation by Joint Representation Learning and Online Clustering","date":"2021-05-27","arxiv_id":"2105.13353","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-activity-segmentation-by-joint#ran","syntology_url":"https://syntology.ai/paper/2105.13353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13353"}},"official":{"repos":["trquhuytin/TOT-CVPR22"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/texrel-a-green-family-of-datasets-for","slug":"texrel-a-green-family-of-datasets-for","title":"TexRel: a Green Family of Datasets for Emergent Communications on Relations","date":"2021-05-26","arxiv_id":"2105.12804","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-hierarchical-agglomerative-clustering","slug":"scaling-hierarchical-agglomerative-clustering","title":"Scaling Hierarchical Agglomerative Clustering to Billion-sized Datasets","date":"2021-05-25","arxiv_id":"2105.11653","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-visual-representation-learning-3","slug":"unsupervised-visual-representation-learning-3","title":"Unsupervised Visual Representation Learning by Online Constrained K-Means","date":"2021-05-24","arxiv_id":"2105.11527","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-visual-representation-learning-3#ran","syntology_url":"https://syntology.ai/paper/2105.11527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11527"}},"official":{"repos":["idstcv/coke"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hpnet-deep-primitive-segmentation-using","slug":"hpnet-deep-primitive-segmentation-using","title":"HPNet: Deep Primitive Segmentation Using Hybrid Representations","date":"2021-05-22","arxiv_id":"2105.10620","repositories_listed":1,"syntology":null},{"url":"/paper/consensus-graph-learning-for-multi-view","slug":"consensus-graph-learning-for-multi-view","title":"Consensus Graph Learning for Multi-view Clustering","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/advances-in-integration-of-end-to-end-neural","slug":"advances-in-integration-of-end-to-end-neural","title":"Advances in integration of end-to-end neural and clustering-based diarization for real conversational speech","date":"2021-05-19","arxiv_id":"2105.09040","repositories_listed":1,"syntology":null},{"url":"/paper/free-energy-node-embedding-via-generalized","slug":"free-energy-node-embedding-via-generalized","title":"Free Energy Node Embedding via Generalized Skip-gram with Negative Sampling","date":"2021-05-19","arxiv_id":"2105.09182","repositories_listed":1,"syntology":null},{"url":"/paper/learning-representations-for-incomplete-time","slug":"learning-representations-for-incomplete-time","title":"Learning Representations for Incomplete Time Series Clustering","date":"2021-05-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-in-sequence-to","slug":"representation-learning-in-sequence-to","title":"Training Heterogeneous Features in Sequence to Sequence Tasks: Latent Enhanced Multi-filter Seq2Seq Model","date":"2021-05-18","arxiv_id":"2105.08840","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-framework-for-residential","slug":"a-clustering-framework-for-residential","title":"A Clustering Framework for Residential Electric Demand Profiles","date":"2021-05-17","arxiv_id":"2105.08537","repositories_listed":1,"syntology":null},{"url":"/paper/algorithm-agnostic-explainability-for","slug":"algorithm-agnostic-explainability-for","title":"Algorithm-Agnostic Explainability for Unsupervised Clustering","date":"2021-05-17","arxiv_id":"2105.08053","repositories_listed":1,"syntology":null},{"url":"/paper/traffic-scenario-clustering-by-iterative","slug":"traffic-scenario-clustering-by-iterative","title":"Traffic Scenario Clustering by Iterative Optimisation of Self-Supervised Networks Using a Random Forest Activation Pattern Similarity","date":"2021-05-17","arxiv_id":"2105.07639","repositories_listed":1,"syntology":null},{"url":"/paper/mean-shift-for-self-supervised-learning","slug":"mean-shift-for-self-supervised-learning","title":"Mean Shift for Self-Supervised Learning","date":"2021-05-15","arxiv_id":"2105.07269","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mean-shift-for-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2105.07269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.07269"}},"official":{"repos":["UMBCvision/MSF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/city-scale-multi-camera-vehicle-tracking","slug":"city-scale-multi-camera-vehicle-tracking","title":"City-Scale Multi-Camera Vehicle Tracking Guided by Crossroad Zones","date":"2021-05-14","arxiv_id":"2105.06623","repositories_listed":1,"syntology":null},{"url":"/paper/clustered-sampling-low-variance-and-improved","slug":"clustered-sampling-low-variance-and-improved","title":"Clustered Sampling: Low-Variance and Improved Representativity for Clients Selection in Federated Learning","date":"2021-05-12","arxiv_id":"2105.05883","repositories_listed":1,"syntology":null},{"url":"/paper/frequent-pattern-mining-in-continuous-time","slug":"frequent-pattern-mining-in-continuous-time","title":"Frequent Pattern Mining in Continuous-time Temporal Networks","date":"2021-05-12","arxiv_id":"2105.06399","repositories_listed":1,"syntology":null},{"url":"/paper/towards-discovery-and-attribution-of-open","slug":"towards-discovery-and-attribution-of-open","title":"Towards Discovery and Attribution of Open-world GAN Generated Images","date":"2021-05-10","arxiv_id":"2105.04580","repositories_listed":1,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-discovery-and-attribution-of-open#ran","syntology_url":"https://syntology.ai/paper/2105.04580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04580"}},"official":{"repos":["Sharath-girish/openworld-gan"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/docscan-unsupervised-text-classification-via","slug":"docscan-unsupervised-text-classification-via","title":"DocSCAN: Unsupervised Text Classification via Learning from Neighbors","date":"2021-05-09","arxiv_id":"2105.04024","repositories_listed":1,"syntology":null},{"url":"/paper/provable-guarantees-against-data-poisoning","slug":"provable-guarantees-against-data-poisoning","title":"Incompatibility Clustering as a Defense Against Backdoor Poisoning Attacks","date":"2021-05-08","arxiv_id":"2105.03692","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/provable-guarantees-against-data-poisoning#ran","syntology_url":"https://syntology.ai/paper/2105.03692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03692"}},"official":{"repos":["charlesjin/compatibility_clustering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mice-mixture-of-contrastive-experts-for-1","slug":"mice-mixture-of-contrastive-experts-for-1","title":"MiCE: Mixture of Contrastive Experts for Unsupervised Image Clustering","date":"2021-05-05","arxiv_id":"2105.01899","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mice-mixture-of-contrastive-experts-for-1#ran","syntology_url":"https://syntology.ai/paper/2105.01899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01899"}},"official":{"repos":["TsungWeiTsai/MiCE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-learning-for-clustering-via","slug":"representation-learning-for-clustering-via","title":"Representation Learning for Clustering via Building Consensus","date":"2021-05-04","arxiv_id":"2105.01289","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-for-clustering-via#ran","syntology_url":"https://syntology.ai/paper/2105.01289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01289"}},"official":{"repos":["JayanthRR/ConCURL_NCE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-graph-based-topic-modeling-from","slug":"unsupervised-graph-based-topic-modeling-from","title":"GraphTMT: Unsupervised Graph-based Topic Modeling from Video Transcripts","date":"2021-05-04","arxiv_id":"2105.01466","repositories_listed":1,"syntology":null},{"url":"/paper/russian-news-clustering-and-headline","slug":"russian-news-clustering-and-headline","title":"Russian News Clustering and Headline Selection Shared Task","date":"2021-05-03","arxiv_id":"2105.00981","repositories_listed":1,"syntology":null},{"url":"/paper/divide-and-conquer-based-large-scale-spectral-1","slug":"divide-and-conquer-based-large-scale-spectral-1","title":"Divide-and-conquer based Large-Scale Spectral Clustering","date":"2021-04-30","arxiv_id":"2104.15042","repositories_listed":1,"syntology":null},{"url":"/paper/flattening-multiparameter-hierarchical","slug":"flattening-multiparameter-hierarchical","title":"Flattening Multiparameter Hierarchical Clustering Functors","date":"2021-04-30","arxiv_id":"2104.14734","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-trading-with-predictable","slug":"deep-reinforcement-trading-with-predictable","title":"Deep Reinforcement Trading with Predictable Returns","date":"2021-04-29","arxiv_id":"2104.14683","repositories_listed":1,"syntology":null},{"url":"/paper/reckonition-a-nlp-based-system-for-industrial","slug":"reckonition-a-nlp-based-system-for-industrial","title":"RECKONition: a NLP-based system for Industrial Accidents at Work Prevention","date":"2021-04-29","arxiv_id":"2104.14150","repositories_listed":1,"syntology":null},{"url":"/paper/smlsom-the-shrinking-maximum-likelihood-self","slug":"smlsom-the-shrinking-maximum-likelihood-self","title":"SMLSOM: The shrinking maximum likelihood self-organizing map","date":"2021-04-28","arxiv_id":"2104.13971","repositories_listed":1,"syntology":null},{"url":"/paper/structured-sparse-non-negative-matrix","slug":"structured-sparse-non-negative-matrix","title":"Structured Sparse Non-negative Matrix Factorization with L20-Norm for scRNA-seq Data Analysis","date":"2021-04-27","arxiv_id":"2104.13171","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-deep-manifold-attributed-graph","slug":"unsupervised-deep-manifold-attributed-graph","title":"Unsupervised Deep Manifold Attributed Graph Embedding","date":"2021-04-27","arxiv_id":"2104.13048","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-clustering-networks-for-self","slug":"multimodal-clustering-networks-for-self","title":"Multimodal Clustering Networks for Self-supervised Learning from Unlabeled Videos","date":"2021-04-26","arxiv_id":"2104.12671","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multimodal-clustering-networks-for-self#ran","syntology_url":"https://syntology.ai/paper/2104.12671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12671"}},"official":{"repos":["brian7685/Multimodal-Clustering-Network"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/powered-dirichlet-process-for-controlling-the","slug":"powered-dirichlet-process-for-controlling-the","title":"Powered Dirichlet Process for Controlling the Importance of \"Rich-Get-Richer\" Prior Assumptions in Bayesian Clustering","date":"2021-04-26","arxiv_id":"2104.12485","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/powered-dirichlet-process-for-controlling-the#ran","syntology_url":"https://syntology.ai/paper/2104.12485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12485"}},"official":{"repos":["GaelPouxMedard/PDP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-on-global-local-embedding-spaces-in","slug":"attention-on-global-local-embedding-spaces-in","title":"Attention on Global-Local Representation Spaces in Recommender Systems","date":"2021-04-25","arxiv_id":"2104.12050","repositories_listed":1,"syntology":null},{"url":"/paper/open-intent-discovery-through-unsupervised","slug":"open-intent-discovery-through-unsupervised","title":"Open Intent Discovery through Unsupervised Semantic Clustering and Dependency Parsing","date":"2021-04-25","arxiv_id":"2104.12114","repositories_listed":1,"syntology":null},{"url":"/paper/converting-admm-to-a-proximal-gradient-for","slug":"converting-admm-to-a-proximal-gradient-for","title":"Converting ADMM to a Proximal Gradient for Efficient Sparse Estimation","date":"2021-04-22","arxiv_id":"2104.10911","repositories_listed":1,"syntology":null},{"url":"/paper/a-topological-selection-of-folding-pathways","slug":"a-topological-selection-of-folding-pathways","title":"A topological selection of folding pathways from native states of knotted proteins","date":"2021-04-21","arxiv_id":"2104.10530","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-introductory-computer-science","slug":"clustering-introductory-computer-science","title":"Clustering Introductory Computer Science Exercises Using Topic Modeling Methods","date":"2021-04-21","arxiv_id":"2104.10748","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-document-representations-for-large","slug":"revisiting-document-representations-for-large","title":"Revisiting Document Representations for Large-Scale Zero-Shot Learning","date":"2021-04-21","arxiv_id":"2104.10355","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/revisiting-document-representations-for-large#ran","syntology_url":"https://syntology.ai/paper/2104.10355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.10355"}},"official":{"repos":["heendung/vs-zsl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/permutation-invariant-variational-autoencoder","slug":"permutation-invariant-variational-autoencoder","title":"Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learning","date":"2021-04-20","arxiv_id":"2104.09856","repositories_listed":1,"syntology":null},{"url":"/paper/don-t-quote-me-on-that-finding-mixtures-of","slug":"don-t-quote-me-on-that-finding-mixtures-of","title":"\"Don't quote me on that\": Finding Mixtures of Sources in News Articles","date":"2021-04-19","arxiv_id":"2104.09656","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-representation-learning-with","slug":"self-supervised-representation-learning-with","title":"Self-supervised Representation Learning With Path Integral Clustering For Speaker Diarization","date":"2021-04-19","arxiv_id":"2104.09456","repositories_listed":1,"syntology":null},{"url":"/paper/hyperspectral-band-selection-via-spatial","slug":"hyperspectral-band-selection-via-spatial","title":"Hyperspectral Band Selection via Spatial-Spectral Weighted Region-wise Multiple Graph Fusion-Based Spectral Clustering","date":"2021-04-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-inefficiency-of-self-supervised","slug":"solving-inefficiency-of-self-supervised","title":"Solving Inefficiency of Self-supervised Representation Learning","date":"2021-04-18","arxiv_id":"2104.08760","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/solving-inefficiency-of-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2104.08760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08760"}},"official":{"repos":["wanggrun/triplet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/dwug-a-large-resource-of-diachronic-word","slug":"dwug-a-large-resource-of-diachronic-word","title":"DWUG: A large Resource of Diachronic Word Usage Graphs in Four Languages","date":"2021-04-17","arxiv_id":"2104.08540","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-discriminant-clustering-with-fuzzy","slug":"fuzzy-discriminant-clustering-with-fuzzy","title":"Fuzzy Discriminant Clustering with Fuzzy Pairwise Constraints","date":"2021-04-17","arxiv_id":"2104.08546","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fuzzy-clustering-for-spect-ct","slug":"learning-fuzzy-clustering-for-spect-ct","title":"Learning Fuzzy Clustering for SPECT/CT Segmentation via Convolutional Neural Networks","date":"2021-04-17","arxiv_id":"2104.08623","repositories_listed":1,"syntology":null},{"url":"/paper/does-language-help-generalization-in-vision","slug":"does-language-help-generalization-in-vision","title":"Does language help generalization in vision models?","date":"2021-04-16","arxiv_id":"2104.08313","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/does-language-help-generalization-in-vision#ran","syntology_url":"https://syntology.ai/paper/2104.08313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08313"}},"official":{"repos":["bdvllrs/generalization-vision"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/higher-order-attribute-enhancing","slug":"higher-order-attribute-enhancing","title":"Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07892","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/higher-order-attribute-enhancing#ran","syntology_url":"https://syntology.ai/paper/2104.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07892"}},"official":{"repos":["RingBDStack/HAE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tracing-topic-transitions-with-temporal-graph","slug":"tracing-topic-transitions-with-temporal-graph","title":"Tracing Topic Transitions with Temporal Graph Clusters","date":"2021-04-16","arxiv_id":"2104.07836","repositories_listed":1,"syntology":null}],"record_sha256":"7a27a0cdfb1d516ea34e9d1fc25040a307d36b4ca99c54e17806d491abca8b33","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}