{"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/transform-data","entry":"transform_data","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":4,"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":"2605.25750","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25750","title":"Invariant-Based Weight Sharing for Message Passing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fseiffarth/SimpleGNN","path":"src/simplegnn/datasets/graph_dataset.py","file_url":"https://github.com/fseiffarth/SimpleGNN/blob/HEAD/src/simplegnn/datasets/graph_dataset.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":"86daa8f105b06423","code_sha256_prefix":"86daa8f105b06423","mcp_get_code":{"code_sha256":"86daa8f105b06423"}},{"arxiv_id":"2501.11839","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-learning-for-analog-and-rf-circuit","title":"Supervised Learning for Analog and RF Circuit Design: Benchmarks and Comparative Insights","date":"2025-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avestimehrresearchgroup/aicircuit","path":"Utils/data_utils.py","file_url":"https://github.com/avestimehrresearchgroup/aicircuit/blob/HEAD/Utils/data_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":"2ec58a477ba80a8d","code_sha256_prefix":"2ec58a477ba80a8d","mcp_get_code":{"code_sha256":"2ec58a477ba80a8d"}},{"arxiv_id":"2410.22459","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-future-actions-of-reinforcement","title":"Predicting Future Actions of Reinforcement Learning Agents","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephen-chung-mh/predict_action","path":"thinker/detect/detect_train.py","file_url":"https://github.com/stephen-chung-mh/predict_action/blob/HEAD/thinker/detect/detect_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef34b3bf8afad266","code_sha256_prefix":"ef34b3bf8afad266","mcp_get_code":{"code_sha256":"ef34b3bf8afad266"}},{"arxiv_id":"2405.18727","arxiv_id_is_arxiv":true,"paper":"/paper/ctrla-adaptive-retrieval-augmented-generation","title":"CtrlA: Adaptive Retrieval-Augmented Generation via Inherent Control","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsliu-initial/ctrla","path":"code/model/utils.py","file_url":"https://github.com/hsliu-initial/ctrla/blob/HEAD/code/model/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":"17965da41b5a7cec","code_sha256_prefix":"17965da41b5a7cec","mcp_get_code":{"code_sha256":"17965da41b5a7cec"}},{"arxiv_id":"2212.04450","arxiv_id_is_arxiv":true,"paper":"/paper/gauche-a-library-for-gaussian-processes-in-1","title":"GAUCHE: A Library for Gaussian Processes in Chemistry","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leojklarner/gauche","path":"gauche/dataloader/data_utils.py","file_url":"https://github.com/leojklarner/gauche/blob/HEAD/gauche/dataloader/data_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":"7e96d38a7b1e0e8e","code_sha256_prefix":"7e96d38a7b1e0e8e","mcp_get_code":{"code_sha256":"7e96d38a7b1e0e8e"}},{"arxiv_id":"2211.02950","arxiv_id_is_arxiv":true,"paper":"/paper/the-legal-argument-reasoning-task-in-civil","title":"The Legal Argument Reasoning Task in Civil Procedure","date":"2022-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trusthlt/legal-argument-reasoning-task","path":"models/train_and_evaluate_sentence_bert_and_tf_idf.py","file_url":"https://github.com/trusthlt/legal-argument-reasoning-task/blob/HEAD/models/train_and_evaluate_sentence_bert_and_tf_idf.py","status":"ran","verification_level":1,"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":"6f6476deeb8aaf49","code_sha256_prefix":"6f6476deeb8aaf49","mcp_get_code":{"code_sha256":"6f6476deeb8aaf49"}},{"arxiv_id":"2202.04933","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-contrastive-learning-of-visual","title":"Energy-Based Contrastive Learning of Visual Representations","date":"2022-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1202kbs/ebclr","path":"libs/ebclr.py","file_url":"https://github.com/1202kbs/ebclr/blob/HEAD/libs/ebclr.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, 1202kbs/ebclr when it was checked","code_sha256":"a93280fc29bbdbef","code_sha256_prefix":"a93280fc29bbdbef","mcp_get_code":{"code_sha256":"a93280fc29bbdbef"}},{"arxiv_id":"2010.07777","arxiv_id_is_arxiv":true,"paper":"/paper/a-game-theoretic-analysis-of-networked-system","title":"A game-theoretic analysis of networked system control for common-pool resource management using multi-agent reinforcement learning","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"instadeepai/EGTA-NMARL","path":"egta/experiments/plot_schelling_diagram.py","file_url":"https://github.com/instadeepai/EGTA-NMARL/blob/HEAD/egta/experiments/plot_schelling_diagram.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":"e8cde3414bc94ecb","code_sha256_prefix":"e8cde3414bc94ecb","mcp_get_code":{"code_sha256":"e8cde3414bc94ecb"}},{"arxiv_id":"2025.findings-acl.652","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.652","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HSLiu-Initial/CtrlA","path":"code/model/utils.py","file_url":"https://github.com/HSLiu-Initial/CtrlA/blob/HEAD/code/model/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":"17965da41b5a7cec","code_sha256_prefix":"17965da41b5a7cec","mcp_get_code":{"code_sha256":"17965da41b5a7cec"}}],"record_sha256":"10bb65fe2d10923c6cc9db3703609746ccf4f690e2c7444db2f9a74384fee7a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}