{"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/convert-to-numpy","entry":"convert_to_numpy","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":4,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":2},"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":"2604.13592","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-13592","title":"Foresight Optimization for Strategic Reasoning in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"wangjs9/ForesightOptim","path":"environment/env_utils.py","file_url":"https://github.com/wangjs9/ForesightOptim/blob/HEAD/environment/env_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, wangjs9/ForesightOptim when it was checked","code_sha256":"0066c6e100759218","code_sha256_prefix":"0066c6e100759218","mcp_get_code":{"code_sha256":"0066c6e100759218"}},{"arxiv_id":"2602.03232","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03232","title":"BayeSQP: Bayesian Optimization through Sequential Quadratic Programming","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"brunzema/bayesqp","path":"src/bayesqp/utils.py","file_url":"https://github.com/brunzema/bayesqp/blob/HEAD/src/bayesqp/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9853f4dbb5c2de4a","code_sha256_prefix":"9853f4dbb5c2de4a","mcp_get_code":{"code_sha256":"9853f4dbb5c2de4a"}},{"arxiv_id":"2503.02130","arxiv_id_is_arxiv":true,"paper":"/paper/forgetting-transformer-softmax-attention-with","title":"Forgetting Transformer: Softmax Attention with a Forget Gate","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/forgetting-transformer","path":"src/forgetting_transformer/logger.py","file_url":"https://github.com/zhixuan-lin/forgetting-transformer/blob/HEAD/src/forgetting_transformer/logger.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47a1ac03e43d6cff","code_sha256_prefix":"47a1ac03e43d6cff","mcp_get_code":{"code_sha256":"47a1ac03e43d6cff"}},{"arxiv_id":"2405.15885","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-bridge-implicit-models","title":"Diffusion Bridge Implicit Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/DiffusionBridge","path":"evaluation/compute_metrices_imagenet.py","file_url":"https://github.com/thu-ml/DiffusionBridge/blob/HEAD/evaluation/compute_metrices_imagenet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thu-ml/DiffusionBridge when it was checked","code_sha256":"b4abe347f8da8134","code_sha256_prefix":"b4abe347f8da8134","mcp_get_code":{"code_sha256":"b4abe347f8da8134"}},{"arxiv_id":"2310.07478","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-graph-learning-for-generative","title":"Multimodal Graph Learning for Generative Tasks","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minjiyoon/mmgl","path":"wikiweb2m/preprocess_data.py","file_url":"https://github.com/minjiyoon/mmgl/blob/HEAD/wikiweb2m/preprocess_data.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, minjiyoon/mmgl when it was checked","code_sha256":"6bdb998d910dda91","code_sha256_prefix":"6bdb998d910dda91","mcp_get_code":{"code_sha256":"6bdb998d910dda91"}},{"arxiv_id":"2309.16948","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-bridge-models","title":"Denoising Diffusion Bridge Models","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/diffusionbridge","path":"evaluation/compute_metrices_imagenet.py","file_url":"https://github.com/thu-ml/diffusionbridge/blob/HEAD/evaluation/compute_metrices_imagenet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thu-ml/diffusionbridge when it was checked","code_sha256":"b4abe347f8da8134","code_sha256_prefix":"b4abe347f8da8134","mcp_get_code":{"code_sha256":"b4abe347f8da8134"}},{"arxiv_id":"2103.11886","arxiv_id_is_arxiv":true,"paper":"/paper/deepvit-towards-deeper-vision-transformer","title":"DeepViT: Towards Deeper Vision Transformer","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhoudaquan/dvit_repo","path":"attn_visualize.py","file_url":"https://github.com/zhoudaquan/dvit_repo/blob/HEAD/attn_visualize.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e73b0ac35599a89","code_sha256_prefix":"8e73b0ac35599a89","mcp_get_code":{"code_sha256":"8e73b0ac35599a89"}},{"arxiv_id":"openreview_KBt9iIfQAi","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_KBt9iIfQAi","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yanmluk/causal-xrl","path":"cxrl/lib/utils/utils.py","file_url":"https://github.com/yanmluk/causal-xrl/blob/HEAD/cxrl/lib/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1f5db11f93d4bac","code_sha256_prefix":"a1f5db11f93d4bac","mcp_get_code":{"code_sha256":"a1f5db11f93d4bac"}}],"record_sha256":"3b65fffc924665b18feecc7e961ee083e0614f0b3d24be6f7a3481b704cb0e50","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}