{"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/ran/1","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":5,"rows_per_page":100,"rows":[1,100],"of":419,"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/papers/ran/1","prev":null,"next":"/task/clustering/papers/ran/2","papers":[{"url":"/paper/self-supervised-learning-of-echocardiographic","slug":"self-supervised-learning-of-echocardiographic","title":"Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation","date":"2025-06-13","arxiv_id":"2506.11777","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":3,"n_ran_checked":3,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-supervised-learning-of-echocardiographic#ran","syntology_url":"https://syntology.ai/paper/2506.11777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.11777"}},"official":{"repos":["mdivyanshu97/discovr"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/modified-k-means-algorithm-with-local","slug":"modified-k-means-algorithm-with-local","title":"Modified K-means Algorithm with Local Optimality Guarantees","date":"2025-06-08","arxiv_id":"2506.06990","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/modified-k-means-algorithm-with-local#ran","syntology_url":"https://syntology.ai/paper/2506.06990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.06990"}},"official":{"repos":["lmingyi/lo-k-means"],"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/differentially-private-federated-k-means","slug":"differentially-private-federated-k-means","title":"Differentially Private Federated $k$-Means Clustering with Server-Side Data","date":"2025-06-04","arxiv_id":"2506.05408","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"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, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/differentially-private-federated-k-means#ran","syntology_url":"https://syntology.ai/paper/2506.05408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.05408"}},"official":{"repos":["jonnyascott/fed-dp-kmeans"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-cluster-neuronal-function","slug":"learning-to-cluster-neuronal-function","title":"Learning to cluster neuronal function","date":"2025-06-03","arxiv_id":"2506.03293","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/learning-to-cluster-neuronal-function#ran","syntology_url":"https://syntology.ai/paper/2506.03293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03293"}},"official":{"repos":["nisone2000/sensorium"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/2505-10704","slug":"2505-10704","title":"ZEUS: Zero-shot Embeddings for Unsupervised Separation of Tabular Data","date":"2025-05-15","arxiv_id":"2505.10704","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"5 ran (of which 2 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) · 3 unverified","sample_list":"/paper/2505-10704#ran","syntology_url":"https://syntology.ai/paper/2505.10704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10704"}},"official":{"repos":["gmum/zeus"],"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":["found_in_text","official"]}}},{"url":"/paper/on-the-price-of-differential-privacy-for","slug":"on-the-price-of-differential-privacy-for","title":"On the Price of Differential Privacy for Hierarchical Clustering","date":"2025-04-22","arxiv_id":"2504.15580","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-price-of-differential-privacy-for#ran","syntology_url":"https://syntology.ai/paper/2504.15580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.15580"}},"official":{"repos":["margarita-aicyd/dp-hc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pact-pruning-and-clustering-based-token","slug":"pact-pruning-and-clustering-based-token","title":"PACT: Pruning and Clustering-Based Token Reduction for Faster Visual Language Models","date":"2025-04-11","arxiv_id":"2504.08966","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/pact-pruning-and-clustering-based-token#ran","syntology_url":"https://syntology.ai/paper/2504.08966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.08966"}},"official":{"repos":["orailix/pact"],"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/exploring-a-principled-framework-for-deep-1","slug":"exploring-a-principled-framework-for-deep-1","title":"Exploring a Principled Framework for Deep Subspace Clustering","date":"2025-03-21","arxiv_id":"2503.17288","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-a-principled-framework-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2503.17288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.17288"}},"official":{"repos":["mengxianghan123/PRO-DSC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/a-flag-decomposition-for-hierarchical","slug":"a-flag-decomposition-for-hierarchical","title":"A Flag Decomposition for Hierarchical Datasets","date":"2025-02-11","arxiv_id":"2502.07782","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/a-flag-decomposition-for-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2502.07782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.07782"}},"official":{"repos":["nmank/FD"],"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/learning-clustering-based-prototypes-for","slug":"learning-clustering-based-prototypes-for","title":"Learning Clustering-based Prototypes for Compositional Zero-shot Learning","date":"2025-02-10","arxiv_id":"2502.06501","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-clustering-based-prototypes-for#ran","syntology_url":"https://syntology.ai/paper/2502.06501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.06501"}},"official":{"repos":["quhongyu/cluspro"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-modularity-networks-with-diversity","slug":"deep-modularity-networks-with-diversity","title":"Deep Modularity Networks with Diversity--Preserving Regularization","date":"2025-01-23","arxiv_id":"2501.13451","repositories_listed":0,"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/deep-modularity-networks-with-diversity#ran","syntology_url":"https://syntology.ai/paper/2501.13451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13451"}},"official":null}},{"url":"/paper/improving-the-efficiency-of-self-supervised","slug":"improving-the-efficiency-of-self-supervised","title":"Improving the Efficiency of Self-Supervised Adversarial Training through Latent Clustering-Based Selection","date":"2025-01-15","arxiv_id":"2501.10466","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-efficiency-of-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2501.10466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.10466"}},"official":{"repos":["somrita99/SSATwithLCS"],"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":["found_in_text","official"]}}},{"url":"/paper/log-time-k-means-clustering-for-1d-data-novel","slug":"log-time-k-means-clustering-for-1d-data-novel","title":"Log-Time K-Means Clustering for 1D Data: Novel Approaches with Proof and Implementation","date":"2024-12-19","arxiv_id":"2412.15295","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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) · 1 unverified","sample_list":"/paper/log-time-k-means-clustering-for-1d-data-novel#ran","syntology_url":"https://syntology.ai/paper/2412.15295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15295"}},"official":{"repos":["SyphonArch/flash1dkmeans"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/personalized-clustering-via-targeted","slug":"personalized-clustering-via-targeted","title":"Personalized Clustering via Targeted Representation Learning","date":"2024-12-18","arxiv_id":"2412.13690","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/personalized-clustering-via-targeted#ran","syntology_url":"https://syntology.ai/paper/2412.13690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.13690"}},"official":{"repos":["hhdxwen/pcl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/duet-dual-clustering-enhanced-multivariate","slug":"duet-dual-clustering-enhanced-multivariate","title":"DUET: Dual Clustering Enhanced Multivariate Time Series Forecasting","date":"2024-12-14","arxiv_id":"2412.10859","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 0 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","sample_list":"/paper/duet-dual-clustering-enhanced-multivariate#ran","syntology_url":"https://syntology.ai/paper/2412.10859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10859"}},"official":{"repos":["decisionintelligence/duet"],"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/one-node-one-model-featuring-the-missing-half","slug":"one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","arxiv_id":"2412.09902","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-node-one-model-featuring-the-missing-half#ran","syntology_url":"https://syntology.ai/paper/2412.09902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09902"}},"official":{"repos":["xiexuanting/fpgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bootstraping-clustering-of-gaussians-for-view","slug":"bootstraping-clustering-of-gaussians-for-view","title":"Bootstraping Clustering of Gaussians for View-consistent 3D Scene Understanding","date":"2024-11-29","arxiv_id":"2411.19551","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":12,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bootstraping-clustering-of-gaussians-for-view#ran","syntology_url":"https://syntology.ai/paper/2411.19551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.19551"}},"official":{"repos":["wb014/FreeGS"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/customized-multiple-clustering-via-multi","slug":"customized-multiple-clustering-via-multi","title":"Customized Multiple Clustering via Multi-Modal Subspace Proxy Learning","date":"2024-11-06","arxiv_id":"2411.03978","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/customized-multiple-clustering-via-multi#ran","syntology_url":"https://syntology.ai/paper/2411.03978","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03978"}},"official":{"repos":["alexander-yao/multi-sub"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/breaking-the-reclustering-barrier-in-centroid","slug":"breaking-the-reclustering-barrier-in-centroid","title":"Breaking the Reclustering Barrier in Centroid-based Deep Clustering","date":"2024-11-04","arxiv_id":"2411.02275","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/breaking-the-reclustering-barrier-in-centroid#ran","syntology_url":"https://syntology.ai/paper/2411.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02275"}},"official":{"repos":["probabilistic-and-interactive-ml/breaking-the-reclustering-barrier"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lorann-low-rank-matrix-factorization-for","slug":"lorann-low-rank-matrix-factorization-for","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","date":"2024-10-24","arxiv_id":"2410.18926","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/lorann-low-rank-matrix-factorization-for#ran","syntology_url":"https://syntology.ai/paper/2410.18926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18926"}},"official":{"repos":["ejaasaari/lorann","ejaasaari/lorann-experiments"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/retraining-free-merging-of-sparse-mixture-of","slug":"retraining-free-merging-of-sparse-mixture-of","title":"Retraining-Free Merging of Sparse MoE via Hierarchical Clustering","date":"2024-10-11","arxiv_id":"2410.08589","repositories_listed":1,"syntology":{"n":22,"n_ran":15,"n_constructed":0,"n_ran_checked":8,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/retraining-free-merging-of-sparse-mixture-of#ran","syntology_url":"https://syntology.ai/paper/2410.08589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08589"}},"official":{"repos":["wazenmai/hc-smoe"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/syllablelm-learning-coarse-semantic-units-for","slug":"syllablelm-learning-coarse-semantic-units-for","title":"SyllableLM: Learning Coarse Semantic Units for Speech Language Models","date":"2024-10-05","arxiv_id":"2410.04029","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/syllablelm-learning-coarse-semantic-units-for#ran","syntology_url":"https://syntology.ai/paper/2410.04029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04029"}},"official":{"repos":["alanbaade/SyllableLM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/text-clustering-as-classification-with-llms","slug":"text-clustering-as-classification-with-llms","title":"Text Clustering as Classification with LLMs","date":"2024-09-30","arxiv_id":"2410.00927","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/text-clustering-as-classification-with-llms#ran","syntology_url":"https://syntology.ai/paper/2410.00927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.00927"}},"official":{"repos":["ecnu-text-computing/text-clustering-via-llm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-semantic-clustering-in-deep","slug":"exploring-semantic-clustering-in-deep","title":"Exploring Semantic Clustering in Deep Reinforcement Learning for Video Games","date":"2024-09-25","arxiv_id":"2409.17411","repositories_listed":0,"syntology":{"n":17,"n_ran":9,"n_constructed":6,"n_ran_checked":7,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/exploring-semantic-clustering-in-deep#ran","syntology_url":"https://syntology.ai/paper/2409.17411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17411"}},"official":null}},{"url":"/paper/diffusion-models-learn-low-dimensional","slug":"diffusion-models-learn-low-dimensional","title":"Diffusion Models Learn Low-Dimensional Distributions via Subspace Clustering","date":"2024-09-04","arxiv_id":"2409.02426","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/diffusion-models-learn-low-dimensional#ran","syntology_url":"https://syntology.ai/paper/2409.02426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02426"}},"official":{"repos":["huijieZH/Diffusion-Model-Generalizability"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-dreams-are-made-emulating-satellite","slug":"how-dreams-are-made-emulating-satellite","title":"How DREAMS are made: Emulating Satellite Galaxy and Subhalo Populations with Diffusion Models and Point Clouds","date":"2024-09-04","arxiv_id":"2409.02980","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/how-dreams-are-made-emulating-satellite#ran","syntology_url":"https://syntology.ai/paper/2409.02980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02980"}},"official":{"repos":["trivnguyen/nehod_torch"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tango-clustering-with-typicality-aware","slug":"tango-clustering-with-typicality-aware","title":"TANGO: Clustering with Typicality-Aware Nonlocal Mode-Seeking and Graph-Cut Optimization","date":"2024-08-19","arxiv_id":"2408.10084","repositories_listed":0,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/tango-clustering-with-typicality-aware#ran","syntology_url":"https://syntology.ai/paper/2408.10084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10084"}},"official":null}},{"url":"/paper/reliable-node-similarity-matrix-guided","slug":"reliable-node-similarity-matrix-guided","title":"Reliable Node Similarity Matrix Guided Contrastive Graph Clustering","date":"2024-08-07","arxiv_id":"2408.03765","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 0 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","sample_list":"/paper/reliable-node-similarity-matrix-guided#ran","syntology_url":"https://syntology.ai/paper/2408.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03765"}},"official":{"repos":["Cloudy1225/NS4GC"],"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/language-driven-slice-discovery-and-error","slug":"language-driven-slice-discovery-and-error","title":"LADDER: Language Driven Slice Discovery and Error Rectification","date":"2024-07-31","arxiv_id":"2408.07832","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/language-driven-slice-discovery-and-error#ran","syntology_url":"https://syntology.ai/paper/2408.07832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07832"}},"official":null}},{"url":"/paper/balanced-multi-relational-graph-clustering","slug":"balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","arxiv_id":"2407.16863","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":10,"n_instrument":5,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":15,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/balanced-multi-relational-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2407.16863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16863"}},"official":{"repos":["zxlearningdeep/bmgc"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-level-adaptive-self-labeling-for-novel","slug":"dual-level-adaptive-self-labeling-for-novel","title":"Dual-level Adaptive Self-Labeling for Novel Class Discovery in Point Cloud Segmentation","date":"2024-07-17","arxiv_id":"2407.12489","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":3,"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/dual-level-adaptive-self-labeling-for-novel#ran","syntology_url":"https://syntology.ai/paper/2407.12489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12489"}},"official":{"repos":["RikkiXu/NCD_PC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/part2object-hierarchical-unsupervised-3d","slug":"part2object-hierarchical-unsupervised-3d","title":"Part2Object: Hierarchical Unsupervised 3D Instance Segmentation","date":"2024-07-14","arxiv_id":"2407.10084","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/part2object-hierarchical-unsupervised-3d#ran","syntology_url":"https://syntology.ai/paper/2407.10084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10084"}},"official":{"repos":["chengshiest/part2object"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-generations-using-hierarchical","slug":"structured-generations-using-hierarchical","title":"Structured Generations: Using Hierarchical Clusters to guide Diffusion Models","date":"2024-07-08","arxiv_id":"2407.06124","repositories_listed":1,"syntology":{"n":20,"n_ran":14,"n_constructed":10,"n_ran_checked":11,"n_instrument":3,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":20,"phrase":"14 ran (of which 10 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/structured-generations-using-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2407.06124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06124"}},"official":{"repos":["JoGo175/diffuse-treevae"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":10,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-probability-aggregation-clustering","slug":"deep-probability-aggregation-clustering","title":"Deep Online Probability Aggregation Clustering","date":"2024-07-07","arxiv_id":"2407.05246","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-probability-aggregation-clustering#ran","syntology_url":"https://syntology.ai/paper/2407.05246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05246"}},"official":{"repos":["aomandechenai/deep-probability-aggregation-clustering"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-global-interactive-patterns-across","slug":"unveiling-global-interactive-patterns-across","title":"Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks","date":"2024-07-02","arxiv_id":"2407.01979","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-global-interactive-patterns-across#ran","syntology_url":"https://syntology.ai/paper/2407.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01979"}},"official":{"repos":["Wangyuwen0627/GIP-Framework"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/to-word-senses-and-beyond-inducing-concepts","slug":"to-word-senses-and-beyond-inducing-concepts","title":"To Word Senses and Beyond: Inducing Concepts with Contextualized Language Models","date":"2024-06-28","arxiv_id":"2406.20054","repositories_listed":0,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/to-word-senses-and-beyond-inducing-concepts#ran","syntology_url":"https://syntology.ai/paper/2406.20054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.20054"}},"official":null}},{"url":"/paper/segment-anything-without-supervision","slug":"segment-anything-without-supervision","title":"Segment Anything without Supervision","date":"2024-06-28","arxiv_id":"2406.20081","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/segment-anything-without-supervision#ran","syntology_url":"https://syntology.ai/paper/2406.20081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.20081"}},"official":{"repos":["frank-xwang/unsam"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/correspondence-free-non-rigid-point-set-1","slug":"correspondence-free-non-rigid-point-set-1","title":"Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis","date":"2024-06-27","arxiv_id":"2406.18817","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/correspondence-free-non-rigid-point-set-1#ran","syntology_url":"https://syntology.ai/paper/2406.18817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18817"}},"official":{"repos":["zikai1/cvpr24_pointsetreg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sctree-discovering-cellular-hierarchies-in","slug":"sctree-discovering-cellular-hierarchies-in","title":"scTree: Discovering Cellular Hierarchies in the Presence of Batch Effects in scRNA-seq Data","date":"2024-06-27","arxiv_id":"2406.19300","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sctree-discovering-cellular-hierarchies-in#ran","syntology_url":"https://syntology.ai/paper/2406.19300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19300"}},"official":{"repos":["mvandenhi/sctree-public"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-correlation-clustering-in-sublinear","slug":"dynamic-correlation-clustering-in-sublinear","title":"Dynamic Correlation Clustering in Sublinear Update Time","date":"2024-06-13","arxiv_id":"2406.09137","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":3,"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/dynamic-correlation-clustering-in-sublinear#ran","syntology_url":"https://syntology.ai/paper/2406.09137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09137"}},"official":{"repos":["andreasr27/DCC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/elfs-enhancing-label-free-coreset-selection","slug":"elfs-enhancing-label-free-coreset-selection","title":"ELFS: Enhancing Label-Free Coreset Selection via Clustering-based Pseudo-Labeling","date":"2024-06-06","arxiv_id":"2406.04273","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":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) · 0 unverified","sample_list":"/paper/elfs-enhancing-label-free-coreset-selection#ran","syntology_url":"https://syntology.ai/paper/2406.04273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04273"}},"official":{"repos":["eltsai/elfs"],"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/dynamic-spectral-clustering-with-provable","slug":"dynamic-spectral-clustering-with-provable","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","date":"2024-06-05","arxiv_id":"2406.03152","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dynamic-spectral-clustering-with-provable#ran","syntology_url":"https://syntology.ai/paper/2406.03152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03152"}},"official":{"repos":["SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/css-contrastive-semantic-similarity-for","slug":"css-contrastive-semantic-similarity-for","title":"CSS: Contrastive Semantic Similarity for Uncertainty Quantification of LLMs","date":"2024-06-05","arxiv_id":"2406.03158","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/css-contrastive-semantic-similarity-for#ran","syntology_url":"https://syntology.ai/paper/2406.03158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03158"}},"official":{"repos":["aoshuang92/css_uq_llms"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-study-into-clustering-of-unseen","slug":"an-empirical-study-into-clustering-of-unseen","title":"An Empirical Study into Clustering of Unseen Datasets with Self-Supervised Encoders","date":"2024-06-04","arxiv_id":"2406.02465","repositories_listed":3,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/an-empirical-study-into-clustering-of-unseen#ran","syntology_url":"https://syntology.ai/paper/2406.02465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02465"}},"official":{"repos":["scottclowe/zs-ssl-clustering"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mc-gta-metric-constrained-model-based","slug":"mc-gta-metric-constrained-model-based","title":"MC-GTA: Metric-Constrained Model-Based Clustering using Goodness-of-fit Tests with Autocorrelations","date":"2024-05-28","arxiv_id":"2405.18395","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/mc-gta-metric-constrained-model-based#ran","syntology_url":"https://syntology.ai/paper/2405.18395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18395"}},"official":{"repos":["Octopolugal/MC-GTA"],"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/automatic-data-curation-for-self-supervised","slug":"automatic-data-curation-for-self-supervised","title":"Automatic Data Curation for Self-Supervised Learning: A Clustering-Based Approach","date":"2024-05-24","arxiv_id":"2405.15613","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":19,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/automatic-data-curation-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2405.15613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15613"}},"official":{"repos":["facebookresearch/ssl-data-curation"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-multimodal-clustering-for","slug":"unsupervised-multimodal-clustering-for","title":"Unsupervised Multimodal Clustering for Semantics Discovery in Multimodal Utterances","date":"2024-05-21","arxiv_id":"2405.12775","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":11,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/unsupervised-multimodal-clustering-for#ran","syntology_url":"https://syntology.ai/paper/2405.12775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12775"}},"official":{"repos":["thuiar/umc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-learning-of-daily-movement","slug":"representation-learning-of-daily-movement","title":"Representation Learning of Daily Movement Data Using Text Encoders","date":"2024-05-07","arxiv_id":"2405.04494","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/representation-learning-of-daily-movement#ran","syntology_url":"https://syntology.ai/paper/2405.04494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04494"}},"official":{"repos":["alexcapstick/text-encoders-for-daily-movement-data"],"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/deep-clustering-with-self-supervision-using","slug":"deep-clustering-with-self-supervision-using","title":"Deep Clustering with Self-Supervision using Pairwise Similarities","date":"2024-05-06","arxiv_id":"2405.03590","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-clustering-with-self-supervision-using#ran","syntology_url":"https://syntology.ai/paper/2405.03590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03590"}},"official":{"repos":["Armanfard-Lab/DCSS"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-one-stage-unsupervised-domain-adaptive","slug":"fast-one-stage-unsupervised-domain-adaptive","title":"Fast One-Stage Unsupervised Domain Adaptive Person Search","date":"2024-05-05","arxiv_id":"2405.02832","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fast-one-stage-unsupervised-domain-adaptive#ran","syntology_url":"https://syntology.ai/paper/2405.02832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02832"}},"official":{"repos":["whbdmu/fous"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fastlloyd-federated-accurate-secure-and","slug":"fastlloyd-federated-accurate-secure-and","title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","date":"2024-05-03","arxiv_id":"2405.02437","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fastlloyd-federated-accurate-secure-and#ran","syntology_url":"https://syntology.ai/paper/2405.02437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.02437"}},"official":{"repos":["d-diaa/fastlloyd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-modal-proxy-learning-towards","slug":"multi-modal-proxy-learning-towards","title":"Multi-Modal Proxy Learning Towards Personalized Visual Multiple Clustering","date":"2024-04-24","arxiv_id":"2404.15655","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/multi-modal-proxy-learning-towards#ran","syntology_url":"https://syntology.ai/paper/2404.15655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15655"}},"official":{"repos":["alexander-yao/multi-map"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-learning-to-rank-formulation-of-clustering","slug":"a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","date":"2024-04-17","arxiv_id":"2404.11731","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-learning-to-rank-formulation-of-clustering#ran","syntology_url":"https://syntology.ai/paper/2404.11731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11731"}},"official":{"repos":["tomvek/mips-learnt-ivf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-based-graph-collaborative-filtering","slug":"cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","arxiv_id":"2404.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-based-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2404.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10321"}},"official":{"repos":["zhao254014/clustergcf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-known-clusters-probe-new-prototypes","slug":"beyond-known-clusters-probe-new-prototypes","title":"Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery","date":"2024-04-13","arxiv_id":"2404.08995","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/beyond-known-clusters-probe-new-prototypes#ran","syntology_url":"https://syntology.ai/paper/2404.08995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08995"}},"official":{"repos":["xjtuyw/pnp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/okay-let-s-do-this-modeling-event-coreference","slug":"okay-let-s-do-this-modeling-event-coreference","title":"Okay, Let's Do This! Modeling Event Coreference with Generated Rationales and Knowledge Distillation","date":"2024-04-04","arxiv_id":"2404.03196","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"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) · 5 unverified","sample_list":"/paper/okay-let-s-do-this-modeling-event-coreference#ran","syntology_url":"https://syntology.ai/paper/2404.03196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03196"}},"official":{"repos":["csu-signal/llama_cdcr"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/from-similarity-to-superiority-channel","slug":"from-similarity-to-superiority-channel","title":"From Similarity to Superiority: Channel Clustering for Time Series Forecasting","date":"2024-03-31","arxiv_id":"2404.01340","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/from-similarity-to-superiority-channel#ran","syntology_url":"https://syntology.ai/paper/2404.01340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01340"}},"official":{"repos":["graph-and-geometric-learning/timeseriesccm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-clustering-based-visual-representation","slug":"neural-clustering-based-visual-representation","title":"Neural Clustering based Visual Representation Learning","date":"2024-03-26","arxiv_id":"2403.17409","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-clustering-based-visual-representation#ran","syntology_url":"https://syntology.ai/paper/2403.17409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17409"}},"official":{"repos":["guikunchen/fec"],"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/cuvler-enhanced-unsupervised-object","slug":"cuvler-enhanced-unsupervised-object","title":"CuVLER: Enhanced Unsupervised Object Discoveries through Exhaustive Self-Supervised Transformers","date":"2024-03-12","arxiv_id":"2403.07700","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cuvler-enhanced-unsupervised-object#ran","syntology_url":"https://syntology.ai/paper/2403.07700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07700"}},"official":{"repos":["shahaf-arica/cuvler"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/solution-simplex-clustering-for-heterogeneous","slug":"solution-simplex-clustering-for-heterogeneous","title":"Federated Learning over Connected Modes","date":"2024-03-05","arxiv_id":"2403.03333","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 0 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","sample_list":"/paper/solution-simplex-clustering-for-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/2403.03333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03333"}},"official":{"repos":["dennis-grinwald/floco"],"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/towards-calibrated-deep-clustering-network","slug":"towards-calibrated-deep-clustering-network","title":"Towards Calibrated Deep Clustering Network","date":"2024-03-04","arxiv_id":"2403.02998","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":2,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-calibrated-deep-clustering-network#ran","syntology_url":"https://syntology.ai/paper/2403.02998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02998"}},"official":{"repos":["ChengJianH/CDC"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-and-ranking-diversity-preserved","slug":"clustering-and-ranking-diversity-preserved","title":"Clustering and Ranking: Diversity-preserved Instruction Selection through Expert-aligned Quality Estimation","date":"2024-02-28","arxiv_id":"2402.18191","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/clustering-and-ranking-diversity-preserved#ran","syntology_url":"https://syntology.ai/paper/2402.18191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.18191"}},"official":{"repos":["ironbeliever/car"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/an-interpretable-evaluation-of-entropy-based","slug":"an-interpretable-evaluation-of-entropy-based","title":"An Interpretable Evaluation of Entropy-based Novelty of Generative Models","date":"2024-02-27","arxiv_id":"2402.17287","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/an-interpretable-evaluation-of-entropy-based#ran","syntology_url":"https://syntology.ai/paper/2402.17287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17287"}},"official":{"repos":["buyeah1109/KEN"],"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/scalable-density-based-clustering-with-random","slug":"scalable-density-based-clustering-with-random","title":"Scalable Density-based Clustering with Random Projections","date":"2024-02-24","arxiv_id":"2402.15679","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":3,"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/scalable-density-based-clustering-with-random#ran","syntology_url":"https://syntology.ai/paper/2402.15679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15679"}},"official":{"repos":["NinhPham/sDbscan"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/balanced-data-sampling-for-language-model","slug":"balanced-data-sampling-for-language-model","title":"Balanced Data Sampling for Language Model Training with Clustering","date":"2024-02-22","arxiv_id":"2402.14526","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/balanced-data-sampling-for-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.14526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14526"}},"official":{"repos":["choosewhatulike/cluster-clip"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/clustertabnet-supervised-clustering-method","slug":"clustertabnet-supervised-clustering-method","title":"ClusterTabNet: Supervised clustering method for table detection and table structure recognition","date":"2024-02-12","arxiv_id":"2402.07502","repositories_listed":1,"syntology":{"n":16,"n_ran":16,"n_constructed":0,"n_ran_checked":13,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":4,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clustertabnet-supervised-clustering-method#ran","syntology_url":"https://syntology.ai/paper/2402.07502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07502"}},"official":{"repos":["sap-samples/clustertabnet"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/just-cluster-it-an-approach-for-exploration","slug":"just-cluster-it-an-approach-for-exploration","title":"Just Cluster It: An Approach for Exploration in High-Dimensions using Clustering and Pre-Trained Representations","date":"2024-02-05","arxiv_id":"2402.03138","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/just-cluster-it-an-approach-for-exploration#ran","syntology_url":"https://syntology.ai/paper/2402.03138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03138"}},"official":{"repos":["stefanwm13/just-cluster-it-public"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-embedding-clustering-driven-by-sample","slug":"deep-embedding-clustering-driven-by-sample","title":"Deep Embedding Clustering Driven by Sample Stability","date":"2024-01-29","arxiv_id":"2401.15989","repositories_listed":0,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-embedding-clustering-driven-by-sample#ran","syntology_url":"https://syntology.ai/paper/2401.15989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15989"}},"official":null}},{"url":"/paper/p-2-ot-progressive-partial-optimal-transport","slug":"p-2-ot-progressive-partial-optimal-transport","title":"P$^2$OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering","date":"2024-01-17","arxiv_id":"2401.09266","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/p-2-ot-progressive-partial-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2401.09266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09266"}},"official":{"repos":["rhfeiyang/ppot"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/optimization-of-inter-group-criteria-for-1","slug":"optimization-of-inter-group-criteria-for-1","title":"Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints","date":"2024-01-13","arxiv_id":"2401.07091","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/optimization-of-inter-group-criteria-for-1#ran","syntology_url":"https://syntology.ai/paper/2401.07091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.07091"}},"official":{"repos":["lmurtinho/sizeconstrainedspacing"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/every-node-is-different-dynamically-fusing","slug":"every-node-is-different-dynamically-fusing","title":"Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering","date":"2024-01-12","arxiv_id":"2401.06595","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/every-node-is-different-dynamically-fusing#ran","syntology_url":"https://syntology.ai/paper/2401.06595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06595"}},"official":{"repos":["q086/dyfss"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ccfc-bridging-federated-clustering-and","slug":"ccfc-bridging-federated-clustering-and","title":"CCFC: Bridging Federated Clustering and Contrastive Learning","date":"2024-01-12","arxiv_id":"2401.06634","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ccfc-bridging-federated-clustering-and#ran","syntology_url":"https://syntology.ai/paper/2401.06634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06634"}},"official":null}},{"url":"/paper/learning-persistent-community-structures-in","slug":"learning-persistent-community-structures-in","title":"Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis","date":"2024-01-06","arxiv_id":"2401.03194","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-persistent-community-structures-in#ran","syntology_url":"https://syntology.ai/paper/2401.03194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.03194"}},"official":{"repos":["kundtx/MFC_TopoReg"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/upper-bounding-barlow-twins-a-novel-filter","slug":"upper-bounding-barlow-twins-a-novel-filter","title":"Upper Bounding Barlow Twins: A Novel Filter for Multi-Relational Clustering","date":"2023-12-21","arxiv_id":"2312.14066","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/upper-bounding-barlow-twins-a-novel-filter#ran","syntology_url":"https://syntology.ai/paper/2312.14066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14066"}},"official":{"repos":["XweiQ/BTGF"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/incomplete-contrastive-multi-view-clustering","slug":"incomplete-contrastive-multi-view-clustering","title":"Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding","date":"2023-12-14","arxiv_id":"2312.08697","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/incomplete-contrastive-multi-view-clustering#ran","syntology_url":"https://syntology.ai/paper/2312.08697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.08697"}},"official":{"repos":["liunian-jay/icmvc"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/contextually-affinitive-neighborhood-refinery-1","slug":"contextually-affinitive-neighborhood-refinery-1","title":"Contextually Affinitive Neighborhood Refinery for Deep Clustering","date":"2023-12-12","arxiv_id":"2312.07806","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contextually-affinitive-neighborhood-refinery-1#ran","syntology_url":"https://syntology.ai/paper/2312.07806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.07806"}},"official":{"repos":["cly234/deepclustering-connr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-gradient-guided-nested-sampling-for","slug":"improving-gradient-guided-nested-sampling-for","title":"Improving Gradient-guided Nested Sampling for Posterior Inference","date":"2023-12-06","arxiv_id":"2312.03911","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":3,"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/improving-gradient-guided-nested-sampling-for#ran","syntology_url":"https://syntology.ai/paper/2312.03911","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03911"}},"official":{"repos":["pablo-lemos/ggns"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/betrayed-by-attention-a-simple-yet-effective","slug":"betrayed-by-attention-a-simple-yet-effective","title":"Betrayed by Attention: A Simple yet Effective Approach for Self-supervised Video Object Segmentation","date":"2023-11-29","arxiv_id":"2311.17893","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/betrayed-by-attention-a-simple-yet-effective#ran","syntology_url":"https://syntology.ai/paper/2311.17893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17893"}},"official":{"repos":["shvdiwnkozbw/ssl-uvos"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/constraintmatch-for-semi-constrained","slug":"constraintmatch-for-semi-constrained","title":"ConstraintMatch for Semi-constrained Clustering","date":"2023-11-26","arxiv_id":"2311.15395","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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) · 1 unverified","sample_list":"/paper/constraintmatch-for-semi-constrained#ran","syntology_url":"https://syntology.ai/paper/2311.15395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15395"}},"official":{"repos":["slds-lmu/constraintmatch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stable-cluster-discrimination-for-deep-1","slug":"stable-cluster-discrimination-for-deep-1","title":"Stable Cluster Discrimination for Deep Clustering","date":"2023-11-24","arxiv_id":"2311.14310","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/stable-cluster-discrimination-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2311.14310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14310"}},"official":{"repos":["idstcv/secu"],"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/object-centric-learning-with-slot-mixture","slug":"object-centric-learning-with-slot-mixture","title":"Object-Centric Learning with Slot Mixture Module","date":"2023-11-08","arxiv_id":"2311.04640","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/object-centric-learning-with-slot-mixture#ran","syntology_url":"https://syntology.ai/paper/2311.04640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04640"}},"official":{"repos":["airi-institute/smm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-graph-theoretic-framework-for-understanding-1","slug":"a-graph-theoretic-framework-for-understanding-1","title":"A Graph-Theoretic Framework for Understanding Open-World Semi-Supervised Learning","date":"2023-11-06","arxiv_id":"2311.03524","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-graph-theoretic-framework-for-understanding-1#ran","syntology_url":"https://syntology.ai/paper/2311.03524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03524"}},"official":{"repos":["deeplearning-wisc/sorl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-graph-clustering-via-meta-weighting","slug":"robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","arxiv_id":"2311.00322","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-graph-clustering-via-meta-weighting#ran","syntology_url":"https://syntology.ai/paper/2311.00322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00322"}},"official":{"repos":["hyeonsoojo/metagc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/image-clustering-conditioned-on-text-criteria","slug":"image-clustering-conditioned-on-text-criteria","title":"Image Clustering Conditioned on Text Criteria","date":"2023-10-27","arxiv_id":"2310.18297","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/image-clustering-conditioned-on-text-criteria#ran","syntology_url":"https://syntology.ai/paper/2310.18297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18297"}},"official":{"repos":["sehyunkwon/ictc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/crash-clustering-removing-and-sharing-enhance","slug":"crash-clustering-removing-and-sharing-enhance","title":"CRaSh: Clustering, Removing, and Sharing Enhance Fine-tuning without Full Large Language Model","date":"2023-10-24","arxiv_id":"2310.15477","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/crash-clustering-removing-and-sharing-enhance#ran","syntology_url":"https://syntology.ai/paper/2310.15477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15477"}},"official":{"repos":["tsinghuac3i/crash"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/image-clustering-with-external-guidance","slug":"image-clustering-with-external-guidance","title":"Image Clustering with External Guidance","date":"2023-10-18","arxiv_id":"2310.11989","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/image-clustering-with-external-guidance#ran","syntology_url":"https://syntology.ai/paper/2310.11989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11989"}},"official":{"repos":["xlearning-scu/2024-icml-tac"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-4-approximation-algorithm-for-min-max","slug":"a-4-approximation-algorithm-for-min-max","title":"A 4-approximation algorithm for min max correlation clustering","date":"2023-10-13","arxiv_id":"2310.09196","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/a-4-approximation-algorithm-for-min-max#ran","syntology_url":"https://syntology.ai/paper/2310.09196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09196"}},"official":{"repos":["jannikirmai/min-max-correlation-clustering"],"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/find-your-optimal-assignments-on-the-fly-a","slug":"find-your-optimal-assignments-on-the-fly-a","title":"Find Your Optimal Assignments On-the-fly: A Holistic Framework for Clustered Federated Learning","date":"2023-10-09","arxiv_id":"2310.05397","repositories_listed":0,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/find-your-optimal-assignments-on-the-fly-a#ran","syntology_url":"https://syntology.ai/paper/2310.05397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05397"}},"official":null}},{"url":"/paper/multi-swap-k-means","slug":"multi-swap-k-means","title":"Multi-Swap $k$-Means++","date":"2023-09-28","arxiv_id":"2309.16384","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/multi-swap-k-means#ran","syntology_url":"https://syntology.ai/paper/2309.16384","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16384"}},"official":{"repos":["lorenzo2beretta/multi-swap-k-means-pp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/redundancy-free-self-supervised-relational","slug":"redundancy-free-self-supervised-relational","title":"Redundancy-Free Self-Supervised Relational Learning for Graph Clustering","date":"2023-09-09","arxiv_id":"2309.04694","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":2,"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/redundancy-free-self-supervised-relational#ran","syntology_url":"https://syntology.ai/paper/2309.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.04694"}},"official":{"repos":["yisiyu95/r2fgc"],"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/scaled-up-discovery-of-latent-concepts-in","slug":"scaled-up-discovery-of-latent-concepts-in","title":"Scaling up Discovery of Latent Concepts in Deep NLP Models","date":"2023-08-20","arxiv_id":"2308.10263","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaled-up-discovery-of-latent-concepts-in#ran","syntology_url":"https://syntology.ai/paper/2308.10263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10263"}},"official":{"repos":["qcri/latent_concept_analysis"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convert-contrastive-graph-clustering-with","slug":"convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dealmvc-dual-contrastive-calibration-for","slug":"dealmvc-dual-contrastive-calibration-for","title":"DealMVC: Dual Contrastive Calibration for Multi-view Clustering","date":"2023-08-17","arxiv_id":"2308.09000","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/dealmvc-dual-contrastive-calibration-for#ran","syntology_url":"https://syntology.ai/paper/2308.09000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09000"}},"official":{"repos":["xihongyang1999/dealmvc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/homophily-enhanced-structure-learning-for","slug":"homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","arxiv_id":"2308.05309","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/homophily-enhanced-structure-learning-for#ran","syntology_url":"https://syntology.ai/paper/2308.05309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05309"}},"official":{"repos":["galogm/hole"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/clustering-based-point-cloud-representation","slug":"clustering-based-point-cloud-representation","title":"Clustering based Point Cloud Representation Learning for 3D Analysis","date":"2023-07-27","arxiv_id":"2307.14605","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clustering-based-point-cloud-representation#ran","syntology_url":"https://syntology.ai/paper/2307.14605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.14605"}},"official":{"repos":["fengzicai/cluster3dseg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-aware-semi-supervised-learning","slug":"cluster-aware-semi-supervised-learning","title":"Cluster-aware Semi-supervised Learning: Relational Knowledge Distillation Provably Learns Clustering","date":"2023-07-20","arxiv_id":"2307.11030","repositories_listed":1,"syntology":{"n":18,"n_ran":15,"n_constructed":3,"n_ran_checked":14,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":5,"phrase":"15 ran (of which 3 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cluster-aware-semi-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2307.11030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.11030"}},"official":null}},{"url":"/paper/large-language-models-enable-few-shot","slug":"large-language-models-enable-few-shot","title":"Large Language Models Enable Few-Shot Clustering","date":"2023-07-02","arxiv_id":"2307.00524","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-enable-few-shot#ran","syntology_url":"https://syntology.ai/paper/2307.00524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00524"}},"official":{"repos":["viswavi/few-shot-clustering"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-double-self-expressive-subspace","slug":"deep-double-self-expressive-subspace","title":"Deep Double Self-Expressive Subspace Clustering","date":"2023-06-20","arxiv_id":"2306.11592","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-double-self-expressive-subspace#ran","syntology_url":"https://syntology.ai/paper/2306.11592","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11592"}},"official":{"repos":["zhaoling0229/dsesc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-learning-made-simple-with-1","slug":"semi-supervised-learning-made-simple-with-1","title":"Semi-supervised learning made simple with self-supervised clustering","date":"2023-06-13","arxiv_id":"2306.07483","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/semi-supervised-learning-made-simple-with-1#ran","syntology_url":"https://syntology.ai/paper/2306.07483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07483"}},"official":{"repos":["pietroastolfi/suave-daino"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/compositor-bottom-up-clustering-and-1","slug":"compositor-bottom-up-clustering-and-1","title":"Compositor: Bottom-up Clustering and Compositing for Robust Part and Object Segmentation","date":"2023-06-12","arxiv_id":"2306.07404","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compositor-bottom-up-clustering-and-1#ran","syntology_url":"https://syntology.ai/paper/2306.07404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07404"}},"official":{"repos":["tacju/compositor"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"0d8c5f3bec59754a6e4274dd392a9995d559e833a5d37bb72658543d9457da84","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}