{"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/is-feasible","entry":"is_feasible","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":6,"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":6,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":3},"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":"2605.10396","paper":"/paper/arxiv-2605-10396","title":"Causal Explanations from the Geometric Properties of ReLU Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HJWoods/ReLUExplanations","path":"ExplanationEngine.py","file_url":"https://github.com/HJWoods/ReLUExplanations/blob/HEAD/ExplanationEngine.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99ca5e7e0c1966c5","mcp_get_code":{"code_sha256":"99ca5e7e0c1966c5"}},{"arxiv_id":"2406.12349","paper":"/paper/effective-generation-of-feasible-solutions","title":"Effective Generation of Feasible Solutions for Integer Programming via Guided Diffusion","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agent-lab/diffusion-integer-programming","path":"_diffusion_scip.py","file_url":"https://github.com/agent-lab/diffusion-integer-programming/blob/HEAD/_diffusion_scip.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e59eb704eed149d5","mcp_get_code":{"code_sha256":"e59eb704eed149d5"}},{"arxiv_id":"2106.16198","paper":"/paper/small-in-distribution-changes-in-3d","title":"In-distribution adversarial attacks on object recognition models using gradient-free search","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spandan-madan/in_distribution_adversarial_examples","path":"cma/evolution_strategy.py","file_url":"https://github.com/spandan-madan/in_distribution_adversarial_examples/blob/HEAD/cma/evolution_strategy.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cf7bd5cabdafd65c","mcp_get_code":{"code_sha256":"cf7bd5cabdafd65c"}},{"arxiv_id":"2105.12204","paper":"/paper/safe-value-functions","title":"Safe Value Functions","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheim/vibly","path":"models/slip.py","file_url":"https://github.com/sheim/vibly/blob/HEAD/models/slip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"56e6aa0272a8e3a1","mcp_get_code":{"code_sha256":"56e6aa0272a8e3a1"}},{"arxiv_id":"1812.00804","paper":"/paper/deep-inverse-optimization","title":"Deep Inverse Optimization","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tankconcordia/deep_inv_opt","path":"deep_inv_opt/util.py","file_url":"https://github.com/tankconcordia/deep_inv_opt/blob/HEAD/deep_inv_opt/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d414607a77420000","mcp_get_code":{"code_sha256":"d414607a77420000"}},{"arxiv_id":"1705.08039","paper":"/paper/poincare-embeddings-for-learning-hierarchical","title":"Poincaré Embeddings for Learning Hierarchical Representations","date":"2017-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drewwilimitis/hyperbolic-learning","path":"hyperbolic_svm/hsvm.py","file_url":"https://github.com/drewwilimitis/hyperbolic-learning/blob/HEAD/hyperbolic_svm/hsvm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"784529646199407c","mcp_get_code":{"code_sha256":"784529646199407c"}}]}