{"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/initialize-exp","entry":"initialize_exp","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":9,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":5},"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":"2602.07800","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07800","title":"Approximating Matrix Functions with Deep Neural Networks and Transformers","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"rahul3/LAWT","path":"src/utils.py","file_url":"https://github.com/rahul3/LAWT/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rahul3/LAWT (NOASSERTION)","code_sha256":"c4d4b0ccb9f71797","code_sha256_prefix":"c4d4b0ccb9f71797","mcp_get_code":{"code_sha256":"c4d4b0ccb9f71797"}},{"arxiv_id":"2411.01158","arxiv_id_is_arxiv":true,"paper":"/paper/pin-tuning-parameter-efficient-in-context","title":"Pin-Tuning: Parameter-Efficient In-Context Tuning for Few-Shot Molecular Property Prediction","date":"2024-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/Pin-Tuning","path":"explight.py","file_url":"https://github.com/CRIPAC-DIG/Pin-Tuning/blob/HEAD/explight.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, CRIPAC-DIG/Pin-Tuning when it was checked","code_sha256":"bd1d11411c769e6d","code_sha256_prefix":"bd1d11411c769e6d","mcp_get_code":{"code_sha256":"bd1d11411c769e6d"}},{"arxiv_id":"2404.11341","arxiv_id_is_arxiv":true,"paper":"/paper/the-causal-chambers-real-physical-systems-as","title":"The Causal Chambers: Real Physical Systems as a Testbed for AI Methodology","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juangamella/causal-chamber-paper","path":"case_studies/src/symbolicregression/utils.py","file_url":"https://github.com/juangamella/causal-chamber-paper/blob/HEAD/case_studies/src/symbolicregression/utils.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":"4b15c33783dc239e","code_sha256_prefix":"4b15c33783dc239e","mcp_get_code":{"code_sha256":"4b15c33783dc239e"}},{"arxiv_id":"2404.09632","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-vision-and-language-spaces-with","title":"Bridging Vision and Language Spaces with Assignment Prediction","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"park-jungin/vlap","path":"src/utils.py","file_url":"https://github.com/park-jungin/vlap/blob/HEAD/src/utils.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, park-jungin/vlap when it was checked","code_sha256":"ea7e4bf913916e30","code_sha256_prefix":"ea7e4bf913916e30","mcp_get_code":{"code_sha256":"ea7e4bf913916e30"}},{"arxiv_id":"2307.16210","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-uncertainly-missing-and-ambiguous","title":"Rethinking Uncertainly Missing and Ambiguous Visual Modality in Multi-Modal Entity Alignment","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/umaea","path":"UMAEA/torchlight/logger.py","file_url":"https://github.com/zjukg/umaea/blob/HEAD/UMAEA/torchlight/logger.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":"2d355acf020f9d60","code_sha256_prefix":"2d355acf020f9d60","mcp_get_code":{"code_sha256":"2d355acf020f9d60"}},{"arxiv_id":"2306.16780","arxiv_id_is_arxiv":true,"paper":"/paper/graph-sampling-based-meta-learning-for","title":"Graph Sampling-based Meta-Learning for Molecular Property Prediction","date":"2023-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HICAI-ZJU/GS-Meta","path":"explight.py","file_url":"https://github.com/HICAI-ZJU/GS-Meta/blob/HEAD/explight.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":"bf30db74c9c63326","code_sha256_prefix":"bf30db74c9c63326","mcp_get_code":{"code_sha256":"bf30db74c9c63326"}},{"arxiv_id":"2212.14454","arxiv_id_is_arxiv":true,"paper":"/paper/meaformer-multi-modal-entity-alignment","title":"MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid","date":"2022-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/MEAformer","path":"torchlight/logger.py","file_url":"https://github.com/zjukg/MEAformer/blob/HEAD/torchlight/logger.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":"2d355acf020f9d60","code_sha256_prefix":"2d355acf020f9d60","mcp_get_code":{"code_sha256":"2d355acf020f9d60"}},{"arxiv_id":"2110.03501","arxiv_id_is_arxiv":true,"paper":"/paper/pretrained-language-models-are-symbolic","title":"Pretrained Language Models are Symbolic Mathematics Solvers too!","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softsys4ai/differentiable-proving","path":"src/utils.py","file_url":"https://github.com/softsys4ai/differentiable-proving/blob/HEAD/src/utils.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":"c7bf75ed8696c79a","code_sha256_prefix":"c7bf75ed8696c79a","mcp_get_code":{"code_sha256":"c7bf75ed8696c79a"}},{"arxiv_id":"1711.00043","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-machine-translation-using","title":"Unsupervised Machine Translation Using Monolingual Corpora Only","date":"2017-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/MultilingualFactorAnalysis","path":"src/utils.py","file_url":"https://github.com/Babylonpartners/MultilingualFactorAnalysis/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21a3d4ec06ede4eb","code_sha256_prefix":"21a3d4ec06ede4eb","mcp_get_code":{"code_sha256":"21a3d4ec06ede4eb"}}],"record_sha256":"c3106272faffaa5f6a9fa4886ecf2d258ab356a7deabae7034c40f9859c837a1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}