{"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/optimizer-2","entry":"optimizer","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":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":5,"n_samples_constructed":1,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":2},"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":"2608.09036","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-09036","title":"Decision-Focused Learning in Network Interdiction Games","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lucahart/DFL-for-Shortest-Path-Network-Interdiction","path":"src/toy_example/main_funcs.py","file_url":"https://github.com/lucahart/DFL-for-Shortest-Path-Network-Interdiction/blob/HEAD/src/toy_example/main_funcs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f6fe5b849200fad","code_sha256_prefix":"5f6fe5b849200fad","mcp_get_code":{"code_sha256":"5f6fe5b849200fad"}},{"arxiv_id":"2211.02250","arxiv_id_is_arxiv":true,"paper":"/paper/real-time-target-sound-extraction","title":"Real-Time Target Sound Extraction","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vb000/waveformer","path":"src/training/dcc_tf.py","file_url":"https://github.com/vb000/waveformer/blob/HEAD/src/training/dcc_tf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"34831b1d082da07d","code_sha256_prefix":"34831b1d082da07d","mcp_get_code":{"code_sha256":"34831b1d082da07d"}},{"arxiv_id":"2210.11054","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-bias-aware-margins-into","title":"Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filtering","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anzhang314/BC-Loss","path":"util/learner.py","file_url":"https://github.com/anzhang314/BC-Loss/blob/HEAD/util/learner.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":"79f53062452bf811","code_sha256_prefix":"79f53062452bf811","mcp_get_code":{"code_sha256":"79f53062452bf811"}},{"arxiv_id":"1905.10674","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-fairness-constraints-for-graph","title":"Compositional Fairness Constraints for Graph Embeddings","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeybose/Flexible-Fairness-Constraints","path":"main_reddit.py","file_url":"https://github.com/joeybose/Flexible-Fairness-Constraints/blob/HEAD/main_reddit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joeybose/Flexible-Fairness-Constraints when it was checked","code_sha256":"9b3e13a2a59c4c62","code_sha256_prefix":"9b3e13a2a59c4c62","mcp_get_code":{"code_sha256":"9b3e13a2a59c4c62"}},{"arxiv_id":"1806.02382","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoder-with-arbitrary","title":"Variational Autoencoder with Arbitrary Conditioning","date":"2018-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tigvarts/ucm","path":"celeba_model/model.py","file_url":"https://github.com/tigvarts/ucm/blob/HEAD/celeba_model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb98b06acff24a8c","code_sha256_prefix":"bb98b06acff24a8c","mcp_get_code":{"code_sha256":"bb98b06acff24a8c"}},{"arxiv_id":"1412.6980","arxiv_id_is_arxiv":true,"paper":"/paper/adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"navdeepkumar12/Tic","path":"nn.py","file_url":"https://github.com/navdeepkumar12/Tic/blob/HEAD/nn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, navdeepkumar12/Tic when it was checked","code_sha256":"77da68eb2be45988","code_sha256_prefix":"77da68eb2be45988","mcp_get_code":{"code_sha256":"77da68eb2be45988"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pat-coady/tiny_imagenet","path":"src/train_pre_svm.py","file_url":"https://github.com/pat-coady/tiny_imagenet/blob/HEAD/src/train_pre_svm.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":"1407b52aee1994a9","code_sha256_prefix":"1407b52aee1994a9","mcp_get_code":{"code_sha256":"1407b52aee1994a9"}}],"record_sha256":"1193ed53c8caa258ffb9c5b6d2996e130d7ef926e209c88e7945f5070615ddbc","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}