{"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/merge-args","entry":"merge_args","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":3,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":3,"ran_fixture":0,"ran":3,"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":"2411.00163","arxiv_id_is_arxiv":true,"paper":"/paper/psl-rethinking-and-improving-softmax-loss","title":"PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiny-snow/ir-benchmark","path":"src/itemrec/args.py","file_url":"https://github.com/tiny-snow/ir-benchmark/blob/HEAD/src/itemrec/args.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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, tiny-snow/ir-benchmark, is not in the permissive set Syntology serves inline","code_sha256":"5438b7d5d6de91e6","code_sha256_prefix":"5438b7d5d6de91e6","mcp_get_code":{"code_sha256":"5438b7d5d6de91e6"}},{"arxiv_id":"2410.22728","arxiv_id_is_arxiv":true,"paper":"/paper/offline-behavior-distillation","title":"Offline Behavior Distillation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leaveslei/obd","path":"configs/command_parser.py","file_url":"https://github.com/leaveslei/obd/blob/HEAD/configs/command_parser.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, leaveslei/obd when it was checked","code_sha256":"d35eb4a0d5666e7f","code_sha256_prefix":"d35eb4a0d5666e7f","mcp_get_code":{"code_sha256":"d35eb4a0d5666e7f"}},{"arxiv_id":"2410.22728","arxiv_id_is_arxiv":true,"paper":"/paper/offline-behavior-distillation","title":"Offline Behavior Distillation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeavesLei/OBD","path":"configs/command_parser.py","file_url":"https://github.com/LeavesLei/OBD/blob/HEAD/configs/command_parser.py","status":"ran","verification_level":1,"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, LeavesLei/OBD when it was checked","code_sha256":"dc43b3f4e178b8c1","code_sha256_prefix":"dc43b3f4e178b8c1","mcp_get_code":{"code_sha256":"dc43b3f4e178b8c1"}},{"arxiv_id":"2304.04038","arxiv_id_is_arxiv":true,"paper":"/paper/poem-reconstructing-hand-in-a-point-embedded","title":"POEM: Reconstructing Hand in a Point Embedded Multi-view Stereo","date":"2023-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lixiny/POEM","path":"lib/opt.py","file_url":"https://github.com/lixiny/POEM/blob/HEAD/lib/opt.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":"8f67aed8ef91c50e","code_sha256_prefix":"8f67aed8ef91c50e","mcp_get_code":{"code_sha256":"8f67aed8ef91c50e"}},{"arxiv_id":"2208.14111","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-with-learnable-activation","title":"Transformers with Learnable Activation Functions","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/2022-raft","path":"run_mlm.py","file_url":"https://github.com/ukplab/2022-raft/blob/HEAD/run_mlm.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":"2210ab5529ea4060","code_sha256_prefix":"2210ab5529ea4060","mcp_get_code":{"code_sha256":"2210ab5529ea4060"}},{"arxiv_id":"2001.03799","arxiv_id_is_arxiv":true,"paper":"/paper/dudornet-learning-a-dual-domain-recurrent","title":"DuDoRNet: Learning a Dual-Domain Recurrent Network for Fast MRI Reconstruction with Deep T1 Prior","date":"2020-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbbbbbzhou/DuDoRNet","path":"utils/argparser.py","file_url":"https://github.com/bbbbbbzhou/DuDoRNet/blob/HEAD/utils/argparser.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":"4419a8c68ffca07c","code_sha256_prefix":"4419a8c68ffca07c","mcp_get_code":{"code_sha256":"4419a8c68ffca07c"}}],"record_sha256":"40aeef441b0008cca052dec9d1fe5355888de7ad8765a81cf9b4a2dae91b5fa0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}