{"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-duration","entry":"format_duration","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":7,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":11,"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":6,"ran_fixture":0,"ran":4,"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":"2608.14705","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-14705","title":"On Cross-Validation for Hyperparameter Optimization of Deep Learning Image Classifiers","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ljbuturovic/cvic","path":"cvic/common_cvic.py","file_url":"https://github.com/ljbuturovic/cvic/blob/HEAD/cvic/common_cvic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"241e27c132282bb0","code_sha256_prefix":"241e27c132282bb0","mcp_get_code":{"code_sha256":"241e27c132282bb0"}},{"arxiv_id":"2608.07439","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-07439","title":"An Exploratory Evaluation of LLM-Assisted Rewriting of Moderate-Complexity Financial Sentences for DisCoCat-Based Sentiment Analysis","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"bllin001/qnlp-discocat-llms-finance-rewriting","path":"code/summarize_discocat_paper_runs.py","file_url":"https://github.com/bllin001/qnlp-discocat-llms-finance-rewriting/blob/HEAD/code/summarize_discocat_paper_runs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bllin001/qnlp-discocat-llms-finance-rewriting when it was checked","code_sha256":"1c8d4b29390d47af","code_sha256_prefix":"1c8d4b29390d47af","mcp_get_code":{"code_sha256":"1c8d4b29390d47af"}},{"arxiv_id":"2607.11338","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-11338","title":"AutoVSR: Automatic Visual-to-Symbolic Reasoning for Symbolic Expression Generation from Circuit Schematic","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"LongfeiLi1/AutoVSR","path":"src/utils/metrics.py","file_url":"https://github.com/LongfeiLi1/AutoVSR/blob/HEAD/src/utils/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5cba50003f3b5a37","code_sha256_prefix":"5cba50003f3b5a37","mcp_get_code":{"code_sha256":"5cba50003f3b5a37"}},{"arxiv_id":"2604.04469","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04469","title":"Same Geometry, Opposite Noise: Transformer Magnitude Representations Lack Scalar Variability","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"synthiumjp/weber","path":"m3_pilot/m3_batch_run.py","file_url":"https://github.com/synthiumjp/weber/blob/HEAD/m3_pilot/m3_batch_run.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, synthiumjp/weber when it was checked","code_sha256":"47e2bf1a6a4e395a","code_sha256_prefix":"47e2bf1a6a4e395a","mcp_get_code":{"code_sha256":"47e2bf1a6a4e395a"}},{"arxiv_id":"2509.23413","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-23413","title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CIAM-Group/URS","path":"utils/utils.py","file_url":"https://github.com/CIAM-Group/URS/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, CIAM-Group/URS, is not in the permissive set Syntology serves inline","code_sha256":"0b8f10aaac740c27","code_sha256_prefix":"0b8f10aaac740c27","mcp_get_code":{"code_sha256":"0b8f10aaac740c27"}},{"arxiv_id":"2506.09659","arxiv_id_is_arxiv":true,"paper":"/paper/intent-factored-generation-unleashing-the","title":"Intent Factored Generation: Unleashing the Diversity in Your Language Model","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flairox/ifg","path":"hendrycks_math/experiment_pipelines/hparam_sweeper.py","file_url":"https://github.com/flairox/ifg/blob/HEAD/hendrycks_math/experiment_pipelines/hparam_sweeper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"606bde9343246a50","code_sha256_prefix":"606bde9343246a50","mcp_get_code":{"code_sha256":"606bde9343246a50"}},{"arxiv_id":"2505.22389","arxiv_id_is_arxiv":true,"paper":"/paper/train-with-perturbation-infer-after-merging-a","title":"Train with Perturbation, Infer after Merging: A Two-Stage Framework for Continual Learning","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhmiao/P-M-for-Continual-Learning","path":"utils/misc.py","file_url":"https://github.com/qhmiao/P-M-for-Continual-Learning/blob/HEAD/utils/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d06fe57a613a4c54","code_sha256_prefix":"d06fe57a613a4c54","mcp_get_code":{"code_sha256":"d06fe57a613a4c54"}},{"arxiv_id":"2406.05658","arxiv_id_is_arxiv":true,"paper":"/paper/visual-prompt-tuning-in-null-space-for","title":"Visual Prompt Tuning in Null Space for Continual Learning","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zugexiaodui/VPTinNSforCL","path":"utils/misc.py","file_url":"https://github.com/zugexiaodui/VPTinNSforCL/blob/HEAD/utils/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d06fe57a613a4c54","code_sha256_prefix":"d06fe57a613a4c54","mcp_get_code":{"code_sha256":"d06fe57a613a4c54"}},{"arxiv_id":"2310.01225","arxiv_id_is_arxiv":true,"paper":"/paper/a-path-norm-toolkit-for-modern-networks","title":"A path-norm toolkit for modern networks: consequences, promises and challenges","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agonon/pathnorm_toolkit","path":"repro/iclr24/utils/train_imagenet.py","file_url":"https://github.com/agonon/pathnorm_toolkit/blob/HEAD/repro/iclr24/utils/train_imagenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"108ebe73d0b32ec2","code_sha256_prefix":"108ebe73d0b32ec2","mcp_get_code":{"code_sha256":"108ebe73d0b32ec2"}},{"arxiv_id":"2309.14356","arxiv_id_is_arxiv":true,"paper":"/paper/coco-counterfactuals-automatically","title":"COCO-Counterfactuals: Automatically Constructed Counterfactual Examples for Image-Text Pairs","date":"2023-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/sentence-transformers","path":"sentence_transformers/base/model_card.py","file_url":"https://github.com/UKPLab/sentence-transformers/blob/HEAD/sentence_transformers/base/model_card.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e12c9d90a7538793","code_sha256_prefix":"e12c9d90a7538793","mcp_get_code":{"code_sha256":"e12c9d90a7538793"}},{"arxiv_id":"2007.03051","arxiv_id_is_arxiv":true,"paper":"/paper/carbontracker-tracking-and-predicting-the","title":"Carbontracker: Tracking and Predicting the Carbon Footprint of Training Deep Learning Models","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lfwa/carbontracker","path":"carbontracker/report.py","file_url":"https://github.com/lfwa/carbontracker/blob/HEAD/carbontracker/report.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":"db565056124af7a3","code_sha256_prefix":"db565056124af7a3","mcp_get_code":{"code_sha256":"db565056124af7a3"}}],"record_sha256":"247b9b856627d64bb8809cbc689034d4a9223b702ca272ccdee9ff535b81ec00","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}