{"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/circle-points","entry":"circle_points","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":4,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2503.01488","paper":"/paper/inversiongnn-a-dual-path-network-for-multi","title":"InversionGNN: A Dual Path Network for Multi-Property Molecular Optimization","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivanniu/inversiongnn","path":"InversionGNN/molecular/denovo.py","file_url":"https://github.com/ivanniu/inversiongnn/blob/HEAD/InversionGNN/molecular/denovo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c2aff6e3113308eb","mcp_get_code":{"code_sha256":"c2aff6e3113308eb"}},{"arxiv_id":"2412.01773","paper":"/paper/ferero-a-flexible-framework-for-preference","title":"FERERO: A Flexible Framework for Preference-Guided Multi-Objective Learning","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lisha-chen/ferero","path":"multiMNIST/ferero_train.py","file_url":"https://github.com/lisha-chen/ferero/blob/HEAD/multiMNIST/ferero_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c2aff6e3113308eb","mcp_get_code":{"code_sha256":"c2aff6e3113308eb"}},{"arxiv_id":"2402.05955","paper":"/paper/a-hyper-transformer-model-for-controllable","title":"A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuantran23012000/cpfl_hyper_transformer","path":"CPFL_MOP/Connected_PF/predict.py","file_url":"https://github.com/tuantran23012000/cpfl_hyper_transformer/blob/HEAD/CPFL_MOP/Connected_PF/predict.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f76ba0f4cbb3d733","mcp_get_code":{"code_sha256":"f76ba0f4cbb3d733"}},{"arxiv_id":"2212.01130","paper":"/paper/improving-pareto-front-learning-via-multi","title":"Improving Pareto Front Learning via Multi-Sample Hypernetworks","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longhoangphi225/MultiSample-Hypernetworks","path":"Jura/utils.py","file_url":"https://github.com/longhoangphi225/MultiSample-Hypernetworks/blob/HEAD/Jura/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f76ba0f4cbb3d733","mcp_get_code":{"code_sha256":"f76ba0f4cbb3d733"}},{"arxiv_id":"2103.13392","paper":"/paper/efficient-multi-objective-optimization-for","title":"Scalable Pareto Front Approximation for Deep Multi-Objective Learning","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruchtem/cosmos","path":"multi_objective/utils.py","file_url":"https://github.com/ruchtem/cosmos/blob/HEAD/multi_objective/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ffd0a4948b2df0d","mcp_get_code":{"code_sha256":"6ffd0a4948b2df0d"}}]}