{"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/tree-decomposition","name":"Tree Decomposition","slug":"tree-decomposition","description_markdown":"**Tree Decomposition** is a technique in graph theory and computer science for representing a graph as a tree, where each node in the tree represents a set of vertices in the original graph. The goal of tree decomposition is to divide the graph into smaller, more manageable pieces, and to use the tree to represent the relationships between these pieces.","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":34,"papers_with_code":3,"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":34,"of":34,"of_with_code":3,"tagged_in_all":34,"counts":{"archive_papers_tagged":34,"with_a_code_link":3,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":34,"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/tree-decomposed-graph-neural-network","slug":"tree-decomposed-graph-neural-network","title":"Tree Decomposed Graph Neural Network","date":"2021-08-25","arxiv_id":"2108.11022","repositories_listed":1,"syntology":null},{"url":"/paper/dpmc-weighted-model-counting-by-dynamic","slug":"dpmc-weighted-model-counting-by-dynamic","title":"DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees","date":"2020-08-20","arxiv_id":"2008.08748","repositories_listed":1,"syntology":null},{"url":"/paper/constraint-based-causal-structure-learning","slug":"constraint-based-causal-structure-learning","title":"Constraint-based Causal Structure Learning with Consistent Separating Sets","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"hcaf-dta-drug-target-binding-affinity","title":"HCAF-DTA: drug-target binding affinity prediction with cross-attention fused hypergraph neural networks","date":"2025-04-02","arxiv_id":"2504.02014","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-inference-with-effective-resistance","title":"Graph Inference with Effective Resistance Queries","date":"2025-02-25","arxiv_id":"2502.18350","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-technique-for-plant-disease","title":"A Hybrid Technique for Plant Disease Identification and Localisation in Real-time","date":"2024-12-27","arxiv_id":"2412.19682","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounds-on-the-treewidth-of-level-k-rooted","title":"Bounds on the Treewidth of Level-k Rooted Phylogenetic Networks","date":"2024-11-20","arxiv_id":"2411.13380","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-complex-reasoning-over-knowledge","title":"Improving Complex Reasoning over Knowledge Graph with Logic-Aware Curriculum Tuning","date":"2024-05-02","arxiv_id":"2405.01649","repositories_listed":0,"syntology":null},{"url":null,"slug":"lifting-uniform-learners-via-distributional","title":"Lifting uniform learners via distributional decomposition","date":"2023-03-27","arxiv_id":"2303.16208","repositories_listed":0,"syntology":null},{"url":null,"slug":"calibrated-nonparametric-scan-statistics-for","title":"Calibrated Nonparametric Scan Statistics for Anomalous Pattern Detection in Graphs","date":"2022-06-26","arxiv_id":"2206.12786","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-fixed-parameter-algorithms-for","title":"Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs","date":"2021-12-25","arxiv_id":"2112.13175","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-tree-decomposition-parsers-for-amr-to","title":"Latent Tree Decomposition Parsers for AMR-to-Text Generation","date":"2021-08-27","arxiv_id":"2108.12304","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-the-newton-step-faster-than-hessian","title":"Computing the Newton-step faster than Hessian accumulation","date":"2021-08-02","arxiv_id":"2108.01219","repositories_listed":0,"syntology":null},{"url":null,"slug":"td-gen-graph-generation-with-tree","title":"TD-GEN: Graph Generation With Tree Decomposition","date":"2021-06-20","arxiv_id":"2106.10656","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-for-differentiable-discovery-of","title":"A Framework For Differentiable Discovery Of Graph Algorithms","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-elimination-ordering-for-tree","title":"Learning Elimination Ordering for Tree Decomposition Problem","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-for-texture-based-script","title":"A New Approach for Texture based Script Identification At Block Level using Quad Tree Decomposition","date":"2020-09-16","arxiv_id":"2009.07435","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixtape-breaking-the-softmax-bottleneck","title":"Mixtape: Breaking the Softmax Bottleneck Efficiently","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-policy-for-solving-tree","title":"Graph Convolutional Policy for Solving Tree Decomposition via Reinforcement Learning Heuristics","date":"2019-10-18","arxiv_id":"1910.08371","repositories_listed":0,"syntology":null},{"url":null,"slug":"ordered-tree-decomposition-for-hrg-rule","title":"Ordered Tree Decomposition for HRG Rule Extraction","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190206443","title":"Sparse residual tree and forest","date":"2019-02-18","arxiv_id":"1902.06443","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-answer-set-computation-via","title":"Optimizing Answer Set Computation via Heuristic-Based Decomposition","date":"2018-12-23","arxiv_id":"1812.09718","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-segmentation-based-on-multiscale-fast","title":"Image Segmentation Based on Multiscale Fast Spectral Clustering","date":"2018-12-12","arxiv_id":"1812.04816","repositories_listed":0,"syntology":null},{"url":null,"slug":"cache-transition-systems-for-graph-parsing","title":"Cache Transition Systems for Graph Parsing","date":"2018-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-learning-of-clique-tree-structure","title":"Bayesian Learning of Clique Tree Structure","date":"2017-08-23","arxiv_id":"1708.07025","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-in-sparse-graphs-with-pairwise","title":"Inference in Sparse Graphs with Pairwise Measurements and Side Information","date":"2017-03-08","arxiv_id":"1703.02728","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-analysis-using-a-dual-tree-m-band","title":"Image Analysis Using a Dual-Tree $M$-Band Wavelet Transform","date":"2017-02-27","arxiv_id":"1702.08534","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hierarchical-spectral-method-for-extreme","title":"A Hierarchical Spectral Method for Extreme Classification","date":"2015-11-10","arxiv_id":"1511.03260","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-tree-structured-data-on-manifold","title":"Clustering Tree-structured Data on Manifold","date":"2015-07-20","arxiv_id":"1507.05532","repositories_listed":0,"syntology":null},{"url":null,"slug":"itreepack-protein-complex-side-chain-packing","title":"iTreePack: Protein Complex Side-Chain Packing by Dual Decomposition","date":"2015-04-21","arxiv_id":"1504.05467","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiscale-dictionary-learning-for-estimating","title":"Multiscale Dictionary Learning for Estimating Conditional Distributions","date":"2013-12-04","arxiv_id":"1312.1099","repositories_listed":0,"syntology":null},{"url":null,"slug":"bethe-admm-for-tree-decomposition-based","title":"Bethe-ADMM for Tree Decomposition based Parallel MAP Inference","date":"2013-09-26","arxiv_id":"1309.6829","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimum-error-tree-decomposition","title":"Minimum Error Tree Decomposition","date":"2013-03-27","arxiv_id":"1304.1103","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-propagation-and-improved-bounds-on","title":"Density Propagation and Improved Bounds on the Partition Function","date":"2012-12-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":"8d8fa20637fcc6357ff204e6491221567b47a99c46c23f3fda7c5a6a095e64c3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}