{"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/hypergraph-partitioning","name":"hypergraph partitioning","slug":"hypergraph-partitioning","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":26,"papers_with_code":6,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":26,"of":26,"of_with_code":6,"tagged_in_all":26,"counts":{"archive_papers_tagged":26,"with_a_code_link":6,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":26,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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"},"items":[{"url":"/paper/hyperef-spectral-hypergraph-coarsening-by","slug":"hyperef-spectral-hypergraph-coarsening-by","title":"HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering","date":"2022-10-26","arxiv_id":"2210.14813","repositories_listed":1,"syntology":null},{"url":"/paper/hypersf-spectral-hypergraph-coarsening-via","slug":"hypersf-spectral-hypergraph-coarsening-via","title":"HyperSF: Spectral Hypergraph Coarsening via Flow-based Local Clustering","date":"2021-08-17","arxiv_id":"2108.07901","repositories_listed":1,"syntology":null},{"url":"/paper/co-clustering-vertices-and-hyperedges-via","slug":"co-clustering-vertices-and-hyperedges-via","title":"Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning","date":"2021-02-19","arxiv_id":"2102.10169","repositories_listed":1,"syntology":null},{"url":"/paper/inhomogeneous-hypergraph-clustering-with","slug":"inhomogeneous-hypergraph-clustering-with","title":"Inhomogeneous Hypergraph Clustering with Applications","date":"2017-09-05","arxiv_id":"1709.01249","repositories_listed":1,"syntology":null},{"url":"/paper/improving-coarsening-schemes-for-hypergraph","slug":"improving-coarsening-schemes-for-hypergraph","title":"Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure","date":"2017-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cluster-ensembles-a-knowledge-reuse-framework","slug":"cluster-ensembles-a-knowledge-reuse-framework","title":"Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions","date":"2002-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"shypar-a-spectral-coarsening-approach-to","title":"SHyPar: A Spectral Coarsening Approach to Hypergraph Partitioning","date":"2024-10-09","arxiv_id":"2410.10875","repositories_listed":0,"syntology":null},{"url":null,"slug":"vlsi-hypergraph-partitioning-with-deep","title":"VLSI Hypergraph Partitioning with Deep Learning","date":"2024-09-02","arxiv_id":"2409.01387","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-specpart-a-supervised-spectral-framework","title":"K-SpecPart: Supervised embedding algorithms and cut overlay for improved hypergraph partitioning","date":"2023-05-07","arxiv_id":"2305.06167","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-graph-convolutional-network-training","title":"Scalable Graph Convolutional Network Training on Distributed-Memory Systems","date":"2022-12-09","arxiv_id":"2212.05009","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-recent-advances-in-hyper-graph","title":"More Recent Advances in (Hyper)Graph Partitioning","date":"2022-05-26","arxiv_id":"2205.13202","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilevel-memetic-hypergraph-partitioning","title":"Multilevel Memetic Hypergraph Partitioning with Greedy Recombination","date":"2022-04-07","arxiv_id":"2204.03730","repositories_listed":0,"syntology":null},{"url":null,"slug":"balanced-coarsening-for-multilevel-hypergraph","title":"Balanced Coarsening for Multilevel Hypergraph Partitioning via Wasserstein Discrepancy","date":"2021-06-14","arxiv_id":"2106.07501","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-partitioning-using-tensor","title":"Hypergraph Partitioning using Tensor Eigenvalue Decomposition","date":"2020-11-16","arxiv_id":"2011.07683","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilevel-acyclic-hypergraph-partitioning","title":"Multilevel Acyclic Hypergraph Partitioning","date":"2020-02-06","arxiv_id":"2002.02962","repositories_listed":0,"syntology":null},{"url":null,"slug":"partition-hypergraphs-with-embeddings","title":"Hypergraph Partitioning With Embeddings","date":"2019-09-09","arxiv_id":"1909.04016","repositories_listed":0,"syntology":null},{"url":null,"slug":"quadratic-decomposable-submodular-function-1","title":"Quadratic Decomposable Submodular Function Minimization: Theory and Practice (Computation and Analysis of PageRank over Hypergraphs)","date":"2019-02-26","arxiv_id":"1902.10132","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandana-using-non-volatile-memory-for-storing","title":"Bandana: Using Non-volatile Memory for Storing Deep Learning Models","date":"2018-11-14","arxiv_id":"1811.05922","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-n-level-hypergraph-partitioning","title":"Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening","date":"2018-03-25","arxiv_id":"1803.09258","repositories_listed":0,"syntology":null},{"url":null,"slug":"engineering-a-direct-k-way-hypergraph","title":"Engineering a direct k-way Hypergraph Partitioning Algorithm","date":"2017-01-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-hypergraph-partitioning-provable","title":"Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques","date":"2016-02-21","arxiv_id":"1602.06516","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-min-max-hypergraph-partitioning","title":"Streaming Min-max Hypergraph Partitioning","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistency-of-spectral-hypergraph","title":"Consistency of Spectral Hypergraph Partitioning under Planted Partition Model","date":"2015-05-07","arxiv_id":"1505.01582","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-hypergraph-construction-for","title":"Context-Aware Hypergraph Construction for Robust Spectral Clustering","date":"2014-01-04","arxiv_id":"1401.0764","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hypergraph-partitioned-vertex-programming","title":"A Hypergraph-Partitioned Vertex Programming Approach for Large-scale Consensus Optimization","date":"2013-08-30","arxiv_id":"1308.6823","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-constraint-based-hypergraph-partitioning","title":"A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_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.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"98a52d97616c9c2576ae53775939bb6841f1ef86bfc64e692bff62855665173e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}