{"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/equilibrium-traffic-assignment","name":"Equilibrium traffic assignment","slug":"equilibrium-traffic-assignment","description_markdown":"training surrogate models to approximate user equilibrium network traffic assignment, which is a convex optimization problem.","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":6,"papers_with_code":1,"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":1,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/equilibrium-traffic-assignment-on-equilibrium","slug":"equilibrium-traffic-assignment-on-equilibrium","dataset":"Equilibrium-Traffic-Networks/Eastern Massachusetts","dataset_url":null,"rows_in_archive":1,"metrics":["MAPE (%)"],"first_row_in_archive_order":{"model":"GIN-GA","paper_title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","paper_url":"/paper/a-hybrid-deep-learning-metaheuristic","paper_date":"2023-03-10","arxiv_id":"2303.06024","code_links":[{"title":"bahmanmdd/HDLMF_GIN-GA","url":"https://github.com/bahmanmdd/HDLMF_GIN-GA"}],"syntology":null}}],"datasets":[{"url":"/dataset/equilibrium-traffic-networks","name":"Equilibrium-Traffic-Networks","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/model-optimization","name":"Model Optimization"}],"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":6,"of":6,"of_with_code":1,"tagged_in_all":6,"counts":{"archive_papers_tagged":6,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":6,"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/a-hybrid-deep-learning-metaheuristic","slug":"a-hybrid-deep-learning-metaheuristic","title":"A hybrid deep-learning-metaheuristic framework for bi-level network design problems","date":"2023-03-10","arxiv_id":"2303.06024","repositories_listed":1,"syntology":null},{"url":null,"slug":"a-data-driven-resilience-framework-of","title":"A Data-driven Resilience Framework of Directionality Configuration based on Topological Credentials in Road Networks","date":"2024-01-14","arxiv_id":"2401.07371","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-graph-neural-networks-for-data","title":"End-to-End Heterogeneous Graph Neural Networks for Traffic Assignment","date":"2023-10-19","arxiv_id":"2310.13193","repositories_listed":0,"syntology":null},{"url":null,"slug":"deployment-of-leader-follower-automated","title":"Deployment of Leader-Follower Automated Vehicle Systems for Smart Work Zone Applications with a Queuing-based Traffic Assignment Approach","date":"2023-07-23","arxiv_id":"2308.03764","repositories_listed":0,"syntology":null},{"url":null,"slug":"traffic-assignment-problem-for-footpath","title":"Traffic Assignment Problem for Footpath Networks with Bidirectional Links","date":"2020-12-06","arxiv_id":"2012.03389","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-modified-physarum-inspired-model-for-the","title":"A modified Physarum-inspired model for the user equilibrium traffic assignment problem","date":"2016-12-19","arxiv_id":"1612.06174","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":"efe484356fe74f81e03b45a3580a1cb90ee13cb5bab07a4c036b23153e48bdc2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}