{"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":"/code/build-optim","entry":"build_optim","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":7,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"key_notes":{"n_samples_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_samples_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2607.16987","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-16987","title":"Twisted Schrödinger Bridge Matching","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"maxencenoble/twisted-sb-matching","path":"bridge/spline/gaussian_path.py","file_url":"https://github.com/maxencenoble/twisted-sb-matching/blob/HEAD/bridge/spline/gaussian_path.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bd109c55b67dad8e","code_sha256_prefix":"bd109c55b67dad8e","mcp_get_code":{"code_sha256":"bd109c55b67dad8e"}},{"arxiv_id":"2505.12355","arxiv_id_is_arxiv":true,"paper":"/paper/gates-cost-aware-dynamic-workflow-scheduling","title":"GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YaShen998/GATES","path":"builder.py","file_url":"https://github.com/YaShen998/GATES/blob/HEAD/builder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d12fbe243063331","code_sha256_prefix":"2d12fbe243063331","mcp_get_code":{"code_sha256":"2d12fbe243063331"}},{"arxiv_id":"2310.02233","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-schrodinger-bridge-matching","title":"Generalized Schrödinger Bridge Matching","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/generalized-schrodinger-bridge-matching","path":"gsbm/gaussian_path.py","file_url":"https://github.com/facebookresearch/generalized-schrodinger-bridge-matching/blob/HEAD/gsbm/gaussian_path.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/generalized-schrodinger-bridge-matching (NOASSERTION)","code_sha256":"3ca8e54de09b8c99","code_sha256_prefix":"3ca8e54de09b8c99","mcp_get_code":{"code_sha256":"3ca8e54de09b8c99"}},{"arxiv_id":"2211.09892","arxiv_id_is_arxiv":true,"paper":"/paper/summarizing-community-based-question-answer","title":"Summarizing Community-based Question-Answer Pairs","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpyang/BertSum","path":"src/models/optimizers.py","file_url":"https://github.com/nlpyang/BertSum/blob/HEAD/src/models/optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89e1b4954fded05b","code_sha256_prefix":"89e1b4954fded05b","mcp_get_code":{"code_sha256":"89e1b4954fded05b"}},{"arxiv_id":"2004.09424","arxiv_id_is_arxiv":true,"paper":"/paper/a-review-based-transformer-model-for","title":"Learning a Fine-Grained Review-based Transformer Model for Personalized Product Search","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kepingbi/ProdSearch","path":"models/optimizers.py","file_url":"https://github.com/kepingbi/ProdSearch/blob/HEAD/models/optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cda11e7f6d1f548","code_sha256_prefix":"0cda11e7f6d1f548","mcp_get_code":{"code_sha256":"0cda11e7f6d1f548"}},{"arxiv_id":"1908.08345","arxiv_id_is_arxiv":true,"paper":"/paper/text-summarization-with-pretrained-encoders","title":"Text Summarization with Pretrained Encoders","date":"2019-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aikawasho/BertSum","path":"src/models/optimizers.py","file_url":"https://github.com/aikawasho/BertSum/blob/HEAD/src/models/optimizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89e1b4954fded05b","code_sha256_prefix":"89e1b4954fded05b","mcp_get_code":{"code_sha256":"89e1b4954fded05b"}},{"arxiv_id":"1905.13164","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-transformers-for-multi-document","title":"Hierarchical Transformers for Multi-Document Summarization","date":"2019-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpyang/hiersumm","path":"src/abstractive/optimizer.py","file_url":"https://github.com/nlpyang/hiersumm/blob/HEAD/src/abstractive/optimizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32488d7d7df6063b","code_sha256_prefix":"32488d7d7df6063b","mcp_get_code":{"code_sha256":"32488d7d7df6063b"}}],"record_sha256":"1e6a1d20c12f6a012fcf63234cd33c0543671850ec72537534983e20cac245e2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}