{"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/is-feasible","entry":"is_feasible","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":6,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":1},"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":"2605.10396","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99ca5e7e0c1966c5","code_sha256_prefix":"99ca5e7e0c1966c5","mcp_get_code":{"code_sha256":"99ca5e7e0c1966c5"}},{"arxiv_id":"2406.12349","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","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, agent-lab/diffusion-integer-programming when it was checked","code_sha256":"e59eb704eed149d5","code_sha256_prefix":"e59eb704eed149d5","mcp_get_code":{"code_sha256":"e59eb704eed149d5"}},{"arxiv_id":"2106.16198","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, spandan-madan/in_distribution_adversarial_examples when it was checked","code_sha256":"cf7bd5cabdafd65c","code_sha256_prefix":"cf7bd5cabdafd65c","mcp_get_code":{"code_sha256":"cf7bd5cabdafd65c"}},{"arxiv_id":"2105.12204","arxiv_id_is_arxiv":true,"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":"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":"56e6aa0272a8e3a1","code_sha256_prefix":"56e6aa0272a8e3a1","mcp_get_code":{"code_sha256":"56e6aa0272a8e3a1"}},{"arxiv_id":"1812.00804","arxiv_id_is_arxiv":true,"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":"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":"d414607a77420000","code_sha256_prefix":"d414607a77420000","mcp_get_code":{"code_sha256":"d414607a77420000"}},{"arxiv_id":"1705.08039","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, drewwilimitis/hyperbolic-learning when it was checked","code_sha256":"784529646199407c","code_sha256_prefix":"784529646199407c","mcp_get_code":{"code_sha256":"784529646199407c"}}],"record_sha256":"888e709d3a82e89661d2fe1d64c0b7ace0a9a815b27ab9e72f7c76826780a6a5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}