{"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/lr-lambda","entry":"lr_lambda","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":0,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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.00933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00933","title":"CGM-JEPA: Learning Consistent Continuous Glucose Monitor Representations via Predictive Self-Supervised Pretraining","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"cruiseresearchgroup/CGM-JEPA","path":"pretrain/pretrain_cgm_jepa.py","file_url":"https://github.com/cruiseresearchgroup/CGM-JEPA/blob/HEAD/pretrain/pretrain_cgm_jepa.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":"08534d4fba9d55a6","code_sha256_prefix":"08534d4fba9d55a6","mcp_get_code":{"code_sha256":"08534d4fba9d55a6"}},{"arxiv_id":"2605.00933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00933","title":"CGM-JEPA: Learning Consistent Continuous Glucose Monitor Representations via Predictive Self-Supervised Pretraining","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"cruiseresearchgroup/CGM-JEPA","path":"pretrain/pretrain_x_cgm_jepa.py","file_url":"https://github.com/cruiseresearchgroup/CGM-JEPA/blob/HEAD/pretrain/pretrain_x_cgm_jepa.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":"fb54d1048c4d4685","code_sha256_prefix":"fb54d1048c4d4685","mcp_get_code":{"code_sha256":"fb54d1048c4d4685"}},{"arxiv_id":"2508.18742","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-18742","title":"Constraint Matters: Multi-Modal Representation for Reducing Mixed-Integer Linear programming","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"Liwow/Constraint_Matters","path":"model_train.py","file_url":"https://github.com/Liwow/Constraint_Matters/blob/HEAD/model_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a835e50ad8eb43b","code_sha256_prefix":"8a835e50ad8eb43b","mcp_get_code":{"code_sha256":"8a835e50ad8eb43b"}},{"arxiv_id":"2506.08306","arxiv_id_is_arxiv":true,"paper":"/paper/2506-08306","title":"AstroCompress: A benchmark dataset for multi-purpose compression of astronomical data","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuatruog/astrocompress","path":"train_idf.py","file_url":"https://github.com/tuatruog/astrocompress/blob/HEAD/train_idf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2ff2d1fd1ec7724","code_sha256_prefix":"a2ff2d1fd1ec7724","mcp_get_code":{"code_sha256":"a2ff2d1fd1ec7724"}},{"arxiv_id":"2501.17827","arxiv_id_is_arxiv":true,"paper":"/paper/langevin-soft-actor-critic-efficient","title":"Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning","date":"2025-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmishfaq/lsac","path":"lsac.py","file_url":"https://github.com/hmishfaq/lsac/blob/HEAD/lsac.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e570f37628252c79","code_sha256_prefix":"e570f37628252c79","mcp_get_code":{"code_sha256":"e570f37628252c79"}},{"arxiv_id":"2309.09812","arxiv_id_is_arxiv":true,"paper":"/paper/r2gengpt-radiology-report-generation-with","title":"R2GenGPT: Radiology Report Generation with Frozen LLMs","date":"2023-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-zhanyu/r2gengpt","path":"lightning_tools/optim.py","file_url":"https://github.com/wang-zhanyu/r2gengpt/blob/HEAD/lightning_tools/optim.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":"d5b1a71db63d18e1","code_sha256_prefix":"d5b1a71db63d18e1","mcp_get_code":{"code_sha256":"d5b1a71db63d18e1"}},{"arxiv_id":"2307.02028","arxiv_id_is_arxiv":true,"paper":"/paper/ehrshot-an-ehr-benchmark-for-few-shot-1","title":"EHRSHOT: An EHR Benchmark for Few-Shot Evaluation of Foundation Models","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"som-shahlab/ehrshot-benchmark","path":"ehrshot/7_eval_finetune.py","file_url":"https://github.com/som-shahlab/ehrshot-benchmark/blob/HEAD/ehrshot/7_eval_finetune.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":"3111cc4393ec453b","code_sha256_prefix":"3111cc4393ec453b","mcp_get_code":{"code_sha256":"3111cc4393ec453b"}},{"arxiv_id":"2202.09507","arxiv_id_is_arxiv":true,"paper":"/paper/pmp-net-point-cloud-completion-by-transformer","title":"PMP-Net++: Point Cloud Completion by Transformer-Enhanced Multi-step Point Moving Paths","date":"2022-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diviswen/PMP-Net","path":"core/train_c3d.py","file_url":"https://github.com/diviswen/PMP-Net/blob/HEAD/core/train_c3d.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":"675a87970f64485b","code_sha256_prefix":"675a87970f64485b","mcp_get_code":{"code_sha256":"675a87970f64485b"}},{"arxiv_id":"aaai_32596","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32596","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TengfeiLiu966/HC-LLM","path":"lightning_tools/optim.py","file_url":"https://github.com/TengfeiLiu966/HC-LLM/blob/HEAD/lightning_tools/optim.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":"d5b1a71db63d18e1","code_sha256_prefix":"d5b1a71db63d18e1","mcp_get_code":{"code_sha256":"d5b1a71db63d18e1"}}],"record_sha256":"25019b1d772e8e38abae1f2b73fe12f7003537b57aa2634e16df62aa546ecaf7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}