SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2409.04495 · 2024

Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks

arXiv · PDF · Open in the Atlas

Code that ran

6 of 7 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 5 failures of our instrument; 1 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2409.04495.json · badge: /api/ran/2409.04495.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
thinklab-sjtu/nar-co-solver canonical (classifier label)
classifier basis: census
6 ran · 1 no recorded run
FunctionStatusWhere it lives
bdot Ran
ran, honoured the contract we drafted
thinklab-sjtu/nar-co-solver/constraint_layers/lml.py
pointer only (licence: NONE) · get_code("3c9ef10a01e87fcb")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

build_graph_from_points Ran
ran; our contract draft was wrong, not the code
thinklab-sjtu/nar-co-solver/src/facility_location_methods.py
pointer only (licence: NONE) · get_code("6177fd41053f5edc")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

cfg_from_file Ran
ran; our contract draft was wrong, not the code
thinklab-sjtu/nar-co-solver/src/config.py
pointer only (licence: NONE) · get_code("1d1c36690ac9960f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_random_data Ran
ran; our contract draft was wrong, not the code
thinklab-sjtu/nar-co-solver/src/facility_location_data.py
pointer only (licence: NONE) · get_code("254c316c8d371f3a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_starbucks_data Ran
ran; our contract draft was wrong, not the code
thinklab-sjtu/nar-co-solver/src/facility_location_data.py
pointer only (licence: NONE) · get_code("c3b96072f5ba1d2f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

topk Ran
ran; our contract draft was wrong, not the code
thinklab-sjtu/nar-co-solver/constraint_layers/blackbox_diff.py
pointer only (licence: NONE) · get_code("e45b3bd133c80889")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_random_dataset Not yet run
unverified (harvested, no recorded run)
thinklab-sjtu/nar-co-solver/src/max_covering_data.py
pointer only (licence: NONE) · get_code("4a4705a51c1c262c")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, thinklab-sjtu/nar-co-solver when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 6 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
bdot 1 other paper
1 dated earlier
1906.08707 (2019-06)
The Limited Multi-Label Projection Layer

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Combinatorial optimization (CO) is the fundamental problem at the intersection of computer science, applied mathematics, etc. The inherent hardness in CO problems brings up challenge for solving CO exactly, making deep-neural-network-based solvers a research frontier. In this paper, we design a family of non-autoregressive neural networks to solve CO problems under positive linear constraints with the following merits. First, the positive linear constraint covers a wide range of CO problems, indicating that our approach breaks the generality bottleneck of existing non-autoregressive networks. Second, compared to existing autoregressive neural network solvers, our non-autoregressive networks have the advantages of higher efficiency and preserving permutation invariance. Third, our offline unsupervised learning has lower demand on high-quality labels, getting rid of the demand of optimal labels in supervised learning. Fourth, our online differentiable search method significantly improves the generalizability of our neural network solver to unseen problems. We validate the effectiveness of this framework in solving representative CO problems including facility location, max-set covering, and traveling salesman problem. Our non-autoregressive neural solvers are competitive to and can be even superior to state-of-the-art solvers such as SCIP and Gurobi, especially when both efficiency and efficacy are considered. Code is available at https://github.com/Thinklab-SJTU/NAR-CO-Solver

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2409.04495")
get_code_for_paper("2409.04495")
have("2409.04495")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2409.04495.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2409.04495.svg)](https://syntology.ai/paper/2409.04495)

Connect an agent — have() is free.