{"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/format-params","entry":"format_params","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":6,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":7,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":0,"unverified":1},"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":"2609.03047","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-03047","title":"SHELF: A Synthetic Harness for Multi-Task Bibliographic Benchmarking","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"mjbommar/shelf-benchmark","path":"src/shelf/cli_cmds/models.py","file_url":"https://github.com/mjbommar/shelf-benchmark/blob/HEAD/src/shelf/cli_cmds/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mjbommar/shelf-benchmark (NOASSERTION)","code_sha256":"bdeb9f655d9a60e9","code_sha256_prefix":"bdeb9f655d9a60e9","mcp_get_code":{"code_sha256":"bdeb9f655d9a60e9"}},{"arxiv_id":"2605.20955","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20955","title":"DrawMotion : Generating 3D Human Motions by Freehand Drawing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"InvertedForest/DrawMotion","path":"my_tools.py","file_url":"https://github.com/InvertedForest/DrawMotion/blob/HEAD/my_tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, InvertedForest/DrawMotion (NOASSERTION)","code_sha256":"4a9493762fefb549","code_sha256_prefix":"4a9493762fefb549","mcp_get_code":{"code_sha256":"4a9493762fefb549"}},{"arxiv_id":"2604.10183","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-10183","title":"RF-LEGO: Modularized Signal Processing-Deep Learning Co-Design for RF Sensing via Deep Unrolling","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"aiot-lab/RF-LEGO","path":"src/rflego/modules/ft.py","file_url":"https://github.com/aiot-lab/RF-LEGO/blob/HEAD/src/rflego/modules/ft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, aiot-lab/RF-LEGO, is not in the permissive set Syntology serves inline","code_sha256":"542bc1ae55a26569","code_sha256_prefix":"542bc1ae55a26569","mcp_get_code":{"code_sha256":"542bc1ae55a26569"}},{"arxiv_id":"2604.02051","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-02051","title":"OUROBOROS: Dynamic Weight Generation for Recursive Transformers via Input-Conditioned LoRA Modulation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"RightNow-AI/ouroboros","path":"ouroboros/utils.py","file_url":"https://github.com/RightNow-AI/ouroboros/blob/HEAD/ouroboros/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, RightNow-AI/ouroboros (NOASSERTION)","code_sha256":"58f53f7a705e0afc","code_sha256_prefix":"58f53f7a705e0afc","mcp_get_code":{"code_sha256":"58f53f7a705e0afc"}},{"arxiv_id":"2206.11124","arxiv_id_is_arxiv":true,"paper":"/paper/a-view-of-mini-batch-sgd-via-generating","title":"A view of mini-batch SGD via generating functions: conditions of convergence, phase transitions, benefit from negative momenta","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"godofnothing/powerlawoptimization","path":"train_4_regimes.py","file_url":"https://github.com/godofnothing/powerlawoptimization/blob/HEAD/train_4_regimes.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e17f30e31ba5db2","code_sha256_prefix":"9e17f30e31ba5db2","mcp_get_code":{"code_sha256":"9e17f30e31ba5db2"}},{"arxiv_id":"2005.03675","arxiv_id_is_arxiv":true,"paper":"/paper/machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/gcnn-survey-paper","path":"utils/train_utils.py","file_url":"https://github.com/google/gcnn-survey-paper/blob/HEAD/utils/train_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":"0b06ee2c27b2fcc8","code_sha256_prefix":"0b06ee2c27b2fcc8","mcp_get_code":{"code_sha256":"0b06ee2c27b2fcc8"}},{"arxiv_id":"Wang_SynSP_Synergy_of_Smoothness_and_Precision_in_Pose_Sequences_Refinement_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_SynSP_Synergy_of_Smoothness_and_Precision_in_Pose_Sequences_Refinement_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"InvertedForest/SynSP","path":"my_tools.py","file_url":"https://github.com/InvertedForest/SynSP/blob/HEAD/my_tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from InvertedForest/DrawMotion, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"4a9493762fefb549","code_sha256_prefix":"4a9493762fefb549","mcp_get_code":{"code_sha256":"4a9493762fefb549"}}],"record_sha256":"587fe79b8678422847c1b96390517f1cb89fc7889326af8fd5acbb697e17b833","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}