{"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","name":"graph partitioning","slug":"graph-partitioning","description_markdown":"Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":208,"papers_with_code":69,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":2,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-partitioning-on-custom-1","slug":"graph-partitioning-on-custom-1","dataset":"custom","dataset_url":null,"rows_in_archive":1,"metrics":["All"],"first_row_in_archive_order":{"model":"GAP","paper_title":"GAP: Generalizable Approximate Graph Partitioning Framework","paper_url":"/paper/gap-generalizable-approximate-graph","paper_date":"2019-03-02","arxiv_id":"1903.00614","code_links":[{"title":"saurabhdash/GCN_Partitioning","url":"https://github.com/saurabhdash/GCN_Partitioning"}],"syntology":null}}],"datasets":[{"url":"/dataset/a-collection-of-lfr-benchmark-graphs","name":"A collection of LFR benchmark graphs","full_name":"","num_papers_in_archive":1},{"url":"/dataset/ham","name":"HAM","full_name":"Human-annotated Mappings","num_papers_in_archive":1}],"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":3,"rows_per_page":100,"shown":100,"of":208,"of_with_code":69,"tagged_in_all":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"},"items":[{"url":"/paper/pgt-i-scaling-spatiotemporal-gnns-with-memory","slug":"pgt-i-scaling-spatiotemporal-gnns-with-memory","title":"PGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training","date":"2025-07-15","arxiv_id":"2507.11683","repositories_listed":2,"syntology":null},{"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":3,"n_instrument":3,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 3 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":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-spectral-improvement-for-unsupervised","slug":"deep-spectral-improvement-for-unsupervised","title":"Deep Spectral Improvement for Unsupervised Image Instance Segmentation","date":"2024-02-04","arxiv_id":"2402.02474","repositories_listed":2,"syntology":null},{"url":"/paper/federated-classification-in-hyperbolic-spaces","slug":"federated-classification-in-hyperbolic-spaces","title":"Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls","date":"2023-08-14","arxiv_id":"2308.06895","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-network-based-coarse-grained","slug":"graph-neural-network-based-coarse-grained","title":"Graph Neural Network Based Coarse-Grained Mapping Prediction","date":"2020-06-24","arxiv_id":"2007.04921","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/graph-neural-network-based-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2007.04921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04921"}},"official":{"repos":["rochesterxugroup/DSGPM","rochesterxugroup/HAM_dataset"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-partitioning-based-diffusion","slug":"graph-partitioning-based-diffusion","title":"Graph-Partitioning-Based Diffusion Convolutional Recurrent Neural Network for Large-Scale Traffic Forecasting","date":"2019-09-24","arxiv_id":"1909.11197","repositories_listed":2,"syntology":null},{"url":"/paper/ego-splitting-framework-from-non-overlapping","slug":"ego-splitting-framework-from-non-overlapping","title":"Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters","date":"2017-08-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/demystifying-distributed-training-of-graph","slug":"demystifying-distributed-training-of-graph","title":"Demystifying Distributed Training of Graph Neural Networks for Link Prediction","date":"2025-06-25","arxiv_id":"2506.20818","repositories_listed":1,"syntology":null},{"url":"/paper/distmlip-a-distributed-inference-platform-for","slug":"distmlip-a-distributed-inference-platform-for","title":"DistMLIP: A Distributed Inference Platform for Machine Learning Interatomic Potentials","date":"2025-05-28","arxiv_id":"2506.02023","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":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) · 0 unverified","sample_list":"/paper/distmlip-a-distributed-inference-platform-for#ran","syntology_url":"https://syntology.ai/paper/2506.02023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.02023"}},"official":{"repos":["AegisIK/DistMLIP"],"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/hierarchical-superpixel-segmentation-via","slug":"hierarchical-superpixel-segmentation-via","title":"Hierarchical Superpixel Segmentation via Structural Information Theory","date":"2025-01-13","arxiv_id":"2501.07069","repositories_listed":1,"syntology":null},{"url":"/paper/fairgp-a-scalable-and-fair-graph-transformer","slug":"fairgp-a-scalable-and-fair-graph-transformer","title":"FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning","date":"2024-12-14","arxiv_id":"2412.10669","repositories_listed":1,"syntology":null},{"url":"/paper/towards-the-efficacy-of-federated-prediction","slug":"towards-the-efficacy-of-federated-prediction","title":"Towards the efficacy of federated prediction for epidemics on networks","date":"2024-12-03","arxiv_id":"2412.02161","repositories_listed":1,"syntology":null},{"url":"/paper/upsampling-dinov2-features-for-unsupervised","slug":"upsampling-dinov2-features-for-unsupervised","title":"Upsampling DINOv2 features for unsupervised vision tasks and weakly supervised materials segmentation","date":"2024-10-20","arxiv_id":"2410.19836","repositories_listed":1,"syntology":null},{"url":"/paper/towards-faster-graph-partitioning-via-pre","slug":"towards-faster-graph-partitioning-via-pre","title":"Towards Faster Graph Partitioning via Pre-training and Inductive Inference","date":"2024-09-01","arxiv_id":"2409.00670","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-surgical-instrument-segmentation","slug":"revisiting-surgical-instrument-segmentation","title":"Revisiting Surgical Instrument Segmentation Without Human Intervention: A Graph Partitioning View","date":"2024-08-27","arxiv_id":"2408.14789","repositories_listed":1,"syntology":null},{"url":"/paper/causal-discovery-over-high-dimensional","slug":"causal-discovery-over-high-dimensional","title":"Causal Discovery over High-Dimensional Structured Hypothesis Spaces with Causal Graph Partitioning","date":"2024-06-10","arxiv_id":"2406.06348","repositories_listed":1,"syntology":null},{"url":"/paper/a-random-key-grasp-for-combinatorial","slug":"a-random-key-grasp-for-combinatorial","title":"A random-key GRASP for combinatorial optimization","date":"2024-05-29","arxiv_id":"2405.18681","repositories_listed":1,"syntology":null},{"url":"/paper/a-structure-aware-framework-for-learning","slug":"a-structure-aware-framework-for-learning","title":"A Structure-Aware Framework for Learning Device Placements on Computation Graphs","date":"2024-05-23","arxiv_id":"2405.14185","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-key-point-analysis-with-pairwise","slug":"exploring-key-point-analysis-with-pairwise","title":"Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning","date":"2024-04-17","arxiv_id":"2404.11384","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":1,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":13,"phrase":"8 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; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/exploring-key-point-analysis-with-pairwise#ran","syntology_url":"https://syntology.ai/paper/2404.11384","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11384"}},"official":{"repos":["alibaba-nlp/key-point-analysis"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/unleashing-graph-partitioning-for-large-scale","slug":"unleashing-graph-partitioning-for-large-scale","title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search","date":"2024-03-04","arxiv_id":"2403.01797","repositories_listed":1,"syntology":null},{"url":"/paper/towards-cohesion-fairness-harmony-contrastive","slug":"towards-cohesion-fairness-harmony-contrastive","title":"Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering","date":"2024-02-16","arxiv_id":"2402.10756","repositories_listed":1,"syntology":null},{"url":"/paper/bclean-a-bayesian-data-cleaning-system","slug":"bclean-a-bayesian-data-cleaning-system","title":"BClean: A Bayesian Data Cleaning System","date":"2023-11-11","arxiv_id":"2311.06517","repositories_listed":1,"syntology":null},{"url":"/paper/neurocut-a-neural-approach-for-robust-graph","slug":"neurocut-a-neural-approach-for-robust-graph","title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning","date":"2023-10-18","arxiv_id":"2310.11787","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-few-shot-learning-for-1","slug":"self-supervised-few-shot-learning-for-1","title":"Self-supervised Few-shot Learning for Semantic Segmentation: An Annotation-free Approach","date":"2023-07-26","arxiv_id":"2307.14446","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-normalized-cut-graph-partitioning","slug":"spectral-normalized-cut-graph-partitioning","title":"Spectral Normalized-Cut Graph Partitioning with Fairness Constraints","date":"2023-07-22","arxiv_id":"2307.12065","repositories_listed":1,"syntology":null},{"url":"/paper/graph-ladling-shockingly-simple-parallel-gnn","slug":"graph-ladling-shockingly-simple-parallel-gnn","title":"Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication","date":"2023-06-18","arxiv_id":"2306.10466","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-ladling-shockingly-simple-parallel-gnn#ran","syntology_url":"https://syntology.ai/paper/2306.10466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10466"}},"official":{"repos":["vita-group/graph_ladling"],"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/creating-multi-level-skill-hierarchies-in","slug":"creating-multi-level-skill-hierarchies-in","title":"Creating Multi-Level Skill Hierarchies in Reinforcement Learning","date":"2023-06-16","arxiv_id":"2306.09980","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-graph-unlearning","slug":"inductive-graph-unlearning","title":"Inductive Graph Unlearning","date":"2023-04-06","arxiv_id":"2304.03093","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-graph-embedding-with-information","slug":"distributed-graph-embedding-with-information","title":"Distributed Graph Embedding with Information-Oriented Random Walks","date":"2023-03-28","arxiv_id":"2303.15702","repositories_listed":1,"syntology":null},{"url":"/paper/a-parameter-free-graph-reduction-for-spectral","slug":"a-parameter-free-graph-reduction-for-spectral","title":"A parameter-free graph reduction for spectral clustering and SpectralNet","date":"2023-02-25","arxiv_id":"2302.13165","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-tree-similarity-metric-for","slug":"random-projection-tree-similarity-metric-for","title":"Random projection tree similarity metric for SpectralNet","date":"2023-02-25","arxiv_id":"2302.13168","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-density-based","slug":"approximate-spectral-clustering-density-based","title":"Approximate spectral clustering density-based similarity for noisy datasets","date":"2023-02-22","arxiv_id":"2302.11298","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-with","slug":"approximate-spectral-clustering-with","title":"Approximate spectral clustering with eigenvector selection and self-tuned $k$","date":"2023-02-22","arxiv_id":"2302.11297","repositories_listed":1,"syntology":null},{"url":"/paper/graph-construction-using-principal-axis-trees","slug":"graph-construction-using-principal-axis-trees","title":"Graph Construction using Principal Axis Trees for Simple Graph Convolution","date":"2023-02-22","arxiv_id":"2302.12000","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-forest-initialization-for","slug":"random-projection-forest-initialization-for","title":"Random Projection Forest Initialization for Graph Convolutional Networks","date":"2023-02-22","arxiv_id":"2302.12001","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-k-nearest-neighbor-graph-for-a","slug":"refining-a-k-nearest-neighbor-graph-for-a","title":"Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering","date":"2023-02-22","arxiv_id":"2302.11296","repositories_listed":1,"syntology":null},{"url":"/paper/task-specific-scene-structure-representations","slug":"task-specific-scene-structure-representations","title":"Task-specific Scene Structure Representations","date":"2023-01-02","arxiv_id":"2301.00555","repositories_listed":1,"syntology":null},{"url":"/paper/robust-fair-clustering-a-novel-fairness","slug":"robust-fair-clustering-a-novel-fairness","title":"Robust Fair Clustering: A Novel Fairness Attack and Defense Framework","date":"2022-10-04","arxiv_id":"2210.01953","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-scalable-recommendation-via","slug":"efficient-and-scalable-recommendation-via","title":"Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendation","date":"2022-07-13","arxiv_id":"2207.05959","repositories_listed":1,"syntology":null},{"url":"/paper/neural-improvement-heuristics-for-preference","slug":"neural-improvement-heuristics-for-preference","title":"Neural Improvement Heuristics for Graph Combinatorial Optimization Problems","date":"2022-06-01","arxiv_id":"2206.00383","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-combinatorial-graph","slug":"learning-to-solve-combinatorial-graph","title":"Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration","date":"2022-05-27","arxiv_id":"2205.14105","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-to-solve-combinatorial-graph#ran","syntology_url":"https://syntology.ai/paper/2205.14105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14105"}},"official":{"repos":["tomdbar/ecord"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-spectral-methods-a-surprisingly-strong","slug":"deep-spectral-methods-a-surprisingly-strong","title":"Deep Spectral Methods: A Surprisingly Strong Baseline for Unsupervised Semantic Segmentation and Localization","date":"2022-05-16","arxiv_id":"2205.07839","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 4 unverified","sample_list":"/paper/deep-spectral-methods-a-surprisingly-strong#ran","syntology_url":"https://syntology.ai/paper/2205.07839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07839"}},"official":{"repos":["lukemelas/deep-spectral-segmentation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/local-motif-clustering-via-hyper-graph","slug":"local-motif-clustering-via-hyper-graph","title":"Local Motif Clustering via (Hyper)Graph Partitioning","date":"2022-05-11","arxiv_id":"2205.06176","repositories_listed":1,"syntology":null},{"url":"/paper/fast-multi-view-clustering-via-ensembles","slug":"fast-multi-view-clustering-via-ensembles","title":"Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and Simplicity","date":"2022-03-22","arxiv_id":"2203.11572","repositories_listed":1,"syntology":null},{"url":"/paper/rama-a-rapid-multicut-algorithm-on-gpu","slug":"rama-a-rapid-multicut-algorithm-on-gpu","title":"RAMA: A Rapid Multicut Algorithm on GPU","date":"2021-09-04","arxiv_id":"2109.01838","repositories_listed":1,"syntology":null},{"url":"/paper/graph-partitioning-and-sparse-matrix-ordering","slug":"graph-partitioning-and-sparse-matrix-ordering","title":"Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks","date":"2021-04-08","arxiv_id":"2104.03546","repositories_listed":1,"syntology":null},{"url":"/paper/learning-spatial-context-with-graph-neural","slug":"learning-spatial-context-with-graph-neural","title":"Learning Spatial Context with Graph Neural Network for Multi-Person Pose Grouping","date":"2021-04-06","arxiv_id":"2104.02385","repositories_listed":1,"syntology":null},{"url":"/paper/reformulating-dover-lap-label-mapping-as-a","slug":"reformulating-dover-lap-label-mapping-as-a","title":"Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem","date":"2021-04-05","arxiv_id":"2104.01954","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-graph-matching-incorporating-graph","slug":"learnable-graph-matching-incorporating-graph","title":"Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking","date":"2021-03-30","arxiv_id":"2103.16178","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":1,"n_ran_checked":3,"n_instrument":7,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":12,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learnable-graph-matching-incorporating-graph#ran","syntology_url":"https://syntology.ai/paper/2103.16178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16178"}},"official":{"repos":["jiaweihe1996/GMTracker"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/refining-a-nearest-neighbor-graph-for-a","slug":"refining-a-nearest-neighbor-graph-for-a","title":"Refining a -nearest neighbor graph for a computationally efficient spectral clustering","date":"2021-02-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-and-comparing-external","slug":"characterizing-and-comparing-external","title":"Characterizing and comparing external measures for the assessment of cluster analysis and community detection","date":"2021-02-01","arxiv_id":"2102.00708","repositories_listed":1,"syntology":null},{"url":"/paper/distdgl-distributed-graph-neural-network","slug":"distdgl-distributed-graph-neural-network","title":"DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs","date":"2020-10-11","arxiv_id":"2010.05337","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-versatile-3d-segmentation-of","slug":"accurate-and-versatile-3d-segmentation-of","title":"Accurate and versatile 3D segmentation of plant tissues at cellular resolution","date":"2020-07-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalized-spectral-clustering-via-gromov","slug":"generalized-spectral-clustering-via-gromov","title":"Generalized Spectral Clustering via Gromov-Wasserstein Learning","date":"2020-06-07","arxiv_id":"2006.04163","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-modification-of-graphs-for-improved","slug":"spectral-modification-of-graphs-for-improved","title":"Spectral Modification of Graphs for Improved Spectral Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalizable-resource-allocation-in-stream","slug":"generalizable-resource-allocation-in-stream","title":"Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning","date":"2019-11-19","arxiv_id":"1911.08517","repositories_listed":1,"syntology":null},{"url":"/paper/a-spectral-approach-to-unsupervised-object","slug":"a-spectral-approach-to-unsupervised-object","title":"A 3D Convolutional Approach to Spectral Object Segmentation in Space and Time","date":"2019-07-05","arxiv_id":"1907.02731","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-spectral-approach-to-unsupervised-object#ran","syntology_url":"https://syntology.ai/paper/1907.02731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02731"}},"official":{"repos":["bit-ml/sfseg"],"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/leveraging-domain-knowledge-to-improve-em","slug":"leveraging-domain-knowledge-to-improve-em","title":"Leveraging Domain Knowledge to Improve Microscopy Image Segmentation with Lifted Multicuts","date":"2019-05-25","arxiv_id":"1905.10535","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-gromov-wasserstein-learning-for","slug":"scalable-gromov-wasserstein-learning-for","title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","date":"2019-05-18","arxiv_id":"1905.07645","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-gromov-wasserstein-learning-for#ran","syntology_url":"https://syntology.ai/paper/1905.07645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07645"}},"official":{"repos":["HongtengXu/s-gwl"],"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/pytorch-biggraph-a-large-scale-graph","slug":"pytorch-biggraph-a-large-scale-graph","title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","date":"2019-03-28","arxiv_id":"1903.12287","repositories_listed":1,"syntology":null},{"url":"/paper/gap-generalizable-approximate-graph","slug":"gap-generalizable-approximate-graph","title":"GAP: Generalizable Approximate Graph Partitioning Framework","date":"2019-03-02","arxiv_id":"1903.00614","repositories_listed":1,"syntology":null},{"url":"/paper/learning-sublinear-time-indexing-for-nearest","slug":"learning-sublinear-time-indexing-for-nearest","title":"Learning Space Partitions for Nearest Neighbor Search","date":"2019-01-24","arxiv_id":"1901.08544","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-sublinear-time-indexing-for-nearest#ran","syntology_url":"https://syntology.ai/paper/1901.08544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08544"}},"official":null}},{"url":"/paper/intel-ngraph-an-intermediate-representation","slug":"intel-ngraph-an-intermediate-representation","title":"Intel nGraph: An Intermediate Representation, Compiler, and Executor for Deep Learning","date":"2018-01-24","arxiv_id":"1801.08058","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/the-product-cut","slug":"the-product-cut","title":"The Product Cut","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/parallel-graph-partitioning-for-complex","slug":"parallel-graph-partitioning-for-complex","title":"Parallel Graph Partitioning for Complex Networks","date":"2014-04-18","arxiv_id":"1404.4797","repositories_listed":1,"syntology":null},{"url":"/paper/think-locally-act-globally-perfectly-balanced","slug":"think-locally-act-globally-perfectly-balanced","title":"Think Locally, Act Globally: Perfectly Balanced Graph Partitioning","date":"2012-10-01","arxiv_id":"1210.0477","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-evolutionary-graph-partitioning","slug":"distributed-evolutionary-graph-partitioning","title":"Distributed Evolutionary Graph Partitioning","date":"2011-10-03","arxiv_id":"1110.0477","repositories_listed":1,"syntology":null},{"url":"/paper/a-min-max-cult-algorithm-for-graph","slug":"a-min-max-cult-algorithm-for-graph","title":"A Min-max Cult Algorithm for Graph Partitioning and Data Clustering","date":"2002-08-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"divide-by-question-conquer-by-agent-split-rag","title":"Divide by Question, Conquer by Agent: SPLIT-RAG with Question-Driven Graph Partitioning","date":"2025-05-20","arxiv_id":"2505.13994","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-partitioning-based-continuous","title":"A Graph-Partitioning Based Continuous Optimization Approach to Semi-supervised Clustering Problems","date":"2025-03-06","arxiv_id":"2503.04447","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-level-contrastive-unlearning-on-graph","title":"Node-level Contrastive Unlearning on Graph Neural Networks","date":"2025-03-04","arxiv_id":"2503.02959","repositories_listed":0,"syntology":null},{"url":null,"slug":"wavegas-waveform-relaxation-for-scaling-graph","title":"WaveGAS: Waveform Relaxation for Scaling Graph Neural Networks","date":"2025-02-27","arxiv_id":"2502.19986","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-bounded-nonlinear-optimal-transport-for","title":"Dual-Bounded Nonlinear Optimal Transport for Size Constrained Min Cut Clustering","date":"2025-01-30","arxiv_id":"2501.18143","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute-enhanced-similarity-ranking-for","title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction","date":"2024-11-29","arxiv_id":"2412.00261","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-on-graph-databases","title":"Graph Neural Networks on Graph Databases","date":"2024-11-18","arxiv_id":"2411.11375","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-random-key-optimizer-for-combinatorial","title":"A Random-Key Optimizer for Combinatorial Optimization","date":"2024-11-06","arxiv_id":"2411.04293","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":"quantum-annealing-based-power-grid","title":"Quantum Annealing based Power Grid Partitioning for Parallel Simulation","date":"2024-08-07","arxiv_id":"2408.04097","repositories_listed":0,"syntology":null},{"url":null,"slug":"lsm-gnn-large-scale-storage-based-multi-gpu","title":"LSM-GNN: Large-scale Storage-based Multi-GPU GNN Training by Optimizing Data Transfer Scheme","date":"2024-07-21","arxiv_id":"2407.15264","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-training-of-large-graph-neural","title":"Distributed Training of Large Graph Neural Networks with Variable Communication Rates","date":"2024-06-25","arxiv_id":"2406.17611","repositories_listed":0,"syntology":null},{"url":null,"slug":"fastgas-fast-graph-based-annotation-selection","title":"FastGAS: Fast Graph-based Annotation Selection for In-Context Learning","date":"2024-06-06","arxiv_id":"2406.03730","repositories_listed":0,"syntology":null},{"url":null,"slug":"catgnn-cost-efficient-and-scalable","title":"CATGNN: Cost-Efficient and Scalable Distributed Training for Graph Neural Networks","date":"2024-04-02","arxiv_id":"2404.02300","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clustering-method-with-graph-maximum","title":"A Clustering Method with Graph Maximum Decoding Information","date":"2024-03-18","arxiv_id":"2403.13846","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-investigation-into-using-unsupervised","title":"Unsupervised Optimisation of GNNs for Node Clustering","date":"2024-02-12","arxiv_id":"2402.07845","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-effective-branch-and-bound-algorithm-with","title":"An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem","date":"2024-02-06","arxiv_id":"2402.03736","repositories_listed":0,"syntology":null},{"url":null,"slug":"circuit-partitioning-for-multi-core-quantum","title":"Circuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning","date":"2024-01-31","arxiv_id":"2401.17976","repositories_listed":0,"syntology":null},{"url":null,"slug":"glisp-a-scalable-gnn-learning-system-by","title":"GLISP: A Scalable GNN Learning System by Exploiting Inherent Structural Properties of Graphs","date":"2024-01-06","arxiv_id":"2401.03114","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-bipartite-concept-factorization","title":"Fine-Grained Bipartite Concept Factorization for Clustering","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-traning-of-graph-neural-networks","title":"Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant","date":"2023-12-22","arxiv_id":"2312.14847","repositories_listed":0,"syntology":null},{"url":null,"slug":"uplifting-the-expressive-power-of-graph","title":"Uplifting the Expressive Power of Graph Neural Networks through Graph Partitioning","date":"2023-12-14","arxiv_id":"2312.08671","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-differentiable-loss-function-for","title":"A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning","date":"2023-12-11","arxiv_id":"2312.06877","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-pilot-contamination-and-enabling","title":"Mitigating Pilot Contamination and Enabling IoT Scalability in Massive MIMO Systems","date":"2023-10-05","arxiv_id":"2310.03278","repositories_listed":0,"syntology":null},{"url":null,"slug":"dgc-training-dynamic-graphs-with-spatio","title":"DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks","date":"2023-09-07","arxiv_id":"2309.03523","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-experimental-comparison-of-partitioning","title":"An Experimental Comparison of Partitioning Strategies for Distributed Graph Neural Network Training","date":"2023-08-29","arxiv_id":"2308.15602","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-generic-graph-neural-networks","title":"Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design","date":"2023-08-16","arxiv_id":"2308.08174","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-set-reduction-to-efficiently-solve-the","title":"Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm","date":"2023-07-19","arxiv_id":"2307.10410","repositories_listed":0,"syntology":null},{"url":null,"slug":"policyclustergcn-identifying-efficient","title":"PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks","date":"2023-06-25","arxiv_id":"2306.14357","repositories_listed":0,"syntology":null},{"url":null,"slug":"batchgnn-efficient-cpu-based-distributed-gnn","title":"BatchGNN: Efficient CPU-Based Distributed GNN Training on Very Large Graphs","date":"2023-06-23","arxiv_id":"2306.13814","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-partitioning-method-of-large-scale","title":"Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints","date":"2023-06-22","arxiv_id":"2306.12857","repositories_listed":0,"syntology":null}],"syntology_records":11,"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":11,"papers_where_code_ran_first_page":"/task/graph-partitioning/papers/ran/1","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":[{"order":"archive","page":2,"of":3,"url":"/task/graph-partitioning/papers/2","json":"/task/graph-partitioning/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/graph-partitioning/papers/3","json":"/task/graph-partitioning/papers/3.json","rows":8},{"order":"ran","page":1,"of":1,"url":"/task/graph-partitioning/papers/ran/1","json":"/task/graph-partitioning/papers/ran/1.json","rows":11}],"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":"d85a2b3e93262738b9b600b12f097639cade1ad71ee6fbc46b1c201e87021cca","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}