{"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/community-detection/papers/10","list_of":"/task/community-detection","task":"Community Detection","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":10,"pages_in_order":10,"rows_per_page":100,"rows":[901,919],"of":919,"counts":{"archive_papers_tagged":919,"with_a_code_link":263,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":919,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":14,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":14,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/community-detection","prev":"/task/community-detection/papers/9","next":null,"papers":[{"url":null,"slug":"graph-based-approaches-to-clustering-network","title":"Graph-Based Approaches to Clustering Network-Constrained Trajectory Data","date":"2013-10-19","arxiv_id":"1310.5249","repositories_listed":0,"syntology":null},{"url":null,"slug":"partition-merge-distributed-inference-and","title":"Partition-Merge: Distributed Inference and Modularity Optimization","date":"2013-09-24","arxiv_id":"1309.6129","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-approaches-for-improving-community","title":"Ensemble approaches for improving community detection methods","date":"2013-09-01","arxiv_id":"1309.0242","repositories_listed":0,"syntology":null},{"url":null,"slug":"axioms-for-graph-clustering-quality-functions","title":"Axioms for graph clustering quality functions","date":"2013-08-15","arxiv_id":"1308.3383","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-in-sparse-random-networks","title":"Community Detection in Sparse Random Networks","date":"2013-08-13","arxiv_id":"1308.2955","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-and-community-detection-in","title":"Clustering and Community Detection in Directed Networks: A Survey","date":"2013-08-05","arxiv_id":"1308.0971","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimisation-dans-la-detection-de-communautes","title":"Optimisation dans la détection de communautés recouvrantes et équilibre de Nash","date":"2013-07-10","arxiv_id":"1307.2715","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-of-complex-networks-and-community","title":"Clustering of Complex Networks and Community Detection Using Group Search Optimization","date":"2013-07-04","arxiv_id":"1307.1372","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-redemption-clustering-sparse","title":"Spectral redemption: clustering sparse networks","date":"2013-06-24","arxiv_id":"1306.5550","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-and-functional-discovery-in","title":"Structural and Functional Discovery in Dynamic Networks with Non-negative Matrix Factorization","date":"2013-05-30","arxiv_id":"1305.7169","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-detection-theory-and-performance","title":"Network Detection Theory and Performance","date":"2013-03-22","arxiv_id":"1303.5613","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-quorum-sensing-inspired-algorithm-for","title":"A Quorum Sensing Inspired Algorithm for Dynamic Clustering","date":"2013-03-16","arxiv_id":"1303.3934","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tensor-approach-to-learning-mixed","title":"A Tensor Approach to Learning Mixed Membership Community Models","date":"2013-02-12","arxiv_id":"1302.2684","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-triangular-versus-edge-representations","title":"On Triangular versus Edge Representations --- Towards Scalable Modeling of Networks","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-spectral-algorithms-for-community","title":"Scalable Spectral Algorithms for Community Detection in Directed Networks","date":"2012-11-29","arxiv_id":"1211.6807","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-segmentation-of-fluorescence","title":"Automatic Segmentation of Fluorescence Lifetime Microscopy Images of Cells Using Multi-Resolution Community Detection","date":"2012-08-23","arxiv_id":"1208.4662","repositories_listed":0,"syntology":null},{"url":null,"slug":"pseudo-likelihood-methods-for-community","title":"Pseudo-likelihood methods for community detection in large sparse networks","date":"2012-07-10","arxiv_id":"1207.2340","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-the-omega-index-for-evaluating","title":"Using the Omega Index for Evaluating Abstractive Community Detection","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leaders-followers-and-community-detectio","title":"Leaders, Followers, and Community Detection","date":"2010-11-02","arxiv_id":"1011.0774","repositories_listed":0,"syntology":null}],"record_sha256":"7c375970289f98c5c195f1d50f0d0580ec1914974adfc9d53092661e8db6c31b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}