{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/bdot","entry":"bdot","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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":4,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":2},"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":"2409.04495","paper":"/paper/learning-to-solve-combinatorial-optimization-1","title":"Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thinklab-sjtu/nar-co-solver","path":"constraint_layers/lml.py","file_url":"https://github.com/thinklab-sjtu/nar-co-solver/blob/HEAD/constraint_layers/lml.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3c9ef10a01e87fcb","mcp_get_code":{"code_sha256":"3c9ef10a01e87fcb"}},{"arxiv_id":"2106.14077","paper":"/paper/the-role-of-contextual-information-in-best","title":"The Role of Contextual Information in Best Arm Identification","date":"2021-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MasaKat0/CBAI","path":"semipara_track_stop.py","file_url":"https://github.com/MasaKat0/CBAI/blob/HEAD/semipara_track_stop.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"406af97f42b1876d","mcp_get_code":{"code_sha256":"406af97f42b1876d"}},{"arxiv_id":"2002.10410","paper":"/paper/lagrangian-decomposition-for-neural-network","title":"Lagrangian Decomposition for Neural Network Verification","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oval-group/decomposition-plnn-bounds","path":"plnn_bounds/proxlp_solver/utils.py","file_url":"https://github.com/oval-group/decomposition-plnn-bounds/blob/HEAD/plnn_bounds/proxlp_solver/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"afab9dc2ebdd02aa","mcp_get_code":{"code_sha256":"afab9dc2ebdd02aa"}},{"arxiv_id":"1906.08707","paper":"/paper/the-limited-multi-label-projection-layer","title":"The Limited Multi-Label Projection Layer","date":"2019-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/lml","path":"lml.py","file_url":"https://github.com/locuslab/lml/blob/HEAD/lml.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c9ef10a01e87fcb","mcp_get_code":{"code_sha256":"3c9ef10a01e87fcb"}},{"arxiv_id":"1306.0895","paper":"/paper/sinkhorn-distances-lightspeed-computation-of-1","title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","date":"2013-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/projected_sinkhorn","path":"projected_sinkhorn/projected_sinkhorn.py","file_url":"https://github.com/locuslab/projected_sinkhorn/blob/HEAD/projected_sinkhorn/projected_sinkhorn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5622291b1b88a13d","mcp_get_code":{"code_sha256":"5622291b1b88a13d"}}]}