{"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/graph-partitioning/papers/3","list_of":"/task/graph-partitioning","task":"graph partitioning","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":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,208],"of":208,"counts":{"archive_papers_tagged":208,"with_a_code_link":69,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":208,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/graph-partitioning","prev":"/task/graph-partitioning/papers/2","next":null,"papers":[{"url":null,"slug":"spectral-clustering-with-imbalanced-data","title":"Spectral Clustering with Imbalanced Data","date":"2013-09-09","arxiv_id":"1309.2303","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimal-dirichlet-energy-partitions-for","title":"Minimal Dirichlet energy partitions for graphs","date":"2013-08-22","arxiv_id":"1308.4915","repositories_listed":0,"syntology":null},{"url":null,"slug":"flow-based-algorithms-for-local-graph","title":"Flow-Based Algorithms for Local Graph Clustering","date":"2013-07-10","arxiv_id":"1307.2855","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":"higher-order-correlation-clustering-for-image","title":"Higher-Order Correlation Clustering for Image Segmentation","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"maximin-affinity-learning-of-image","title":"Maximin affinity learning of image segmentation","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-co-clustering-with-dual","title":"Regularized Co-Clustering with Dual Supervision","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-hashing","title":"Spectral Hashing","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"701b8353cd58640ff941d3a9b968b407a65f2e47aaef020ec75c420f81b8773a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}