{"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/circle-points","entry":"circle_points","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":0,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2503.01488","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ivanniu/inversiongnn when it was checked","code_sha256":"c2aff6e3113308eb","code_sha256_prefix":"c2aff6e3113308eb","mcp_get_code":{"code_sha256":"c2aff6e3113308eb"}},{"arxiv_id":"2412.01773","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lisha-chen/ferero when it was checked","code_sha256":"c2aff6e3113308eb","code_sha256_prefix":"c2aff6e3113308eb","mcp_get_code":{"code_sha256":"c2aff6e3113308eb"}},{"arxiv_id":"2402.05955","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tuantran23012000/cpfl_hyper_transformer when it was checked","code_sha256":"f76ba0f4cbb3d733","code_sha256_prefix":"f76ba0f4cbb3d733","mcp_get_code":{"code_sha256":"f76ba0f4cbb3d733"}},{"arxiv_id":"2212.01130","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from tuantran23012000/cpfl_hyper_transformer, and GitHub detected no licence in that repository when it was checked","code_sha256":"f76ba0f4cbb3d733","code_sha256_prefix":"f76ba0f4cbb3d733","mcp_get_code":{"code_sha256":"f76ba0f4cbb3d733"}},{"arxiv_id":"2103.13392","arxiv_id_is_arxiv":true,"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":"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":"6ffd0a4948b2df0d","code_sha256_prefix":"6ffd0a4948b2df0d","mcp_get_code":{"code_sha256":"6ffd0a4948b2df0d"}}],"record_sha256":"ccc3eab3a32127398901aca8a1448a881a7f5abcae177760ab31d6fbd1264205","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}