{"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/truncated-normal-2","entry":"truncated_normal_","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":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":8,"n_places_pointer_only":2,"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":1,"ran_fixture":2,"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":"2603.28743","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28743","title":"Rethinking Language Model Scaling under Transferable Hypersphere Optimization","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"microsoft/ArchScale","path":"lit_gpt/model.py","file_url":"https://github.com/microsoft/ArchScale/blob/HEAD/lit_gpt/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e4e234055203901","code_sha256_prefix":"1e4e234055203901","mcp_get_code":{"code_sha256":"1e4e234055203901"}},{"arxiv_id":"2405.10369","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-1","title":"Reinforcement learning","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sarodyatawatta/hintrl","path":"model_based/train_dyn.py","file_url":"https://github.com/sarodyatawatta/hintrl/blob/HEAD/model_based/train_dyn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1077f3c7e0a41889","code_sha256_prefix":"1077f3c7e0a41889","mcp_get_code":{"code_sha256":"1077f3c7e0a41889"}},{"arxiv_id":"2405.08322","arxiv_id_is_arxiv":true,"paper":"/paper/straightpcf-straight-point-cloud-filtering","title":"StraightPCF: Straight Point Cloud Filtering","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddsediri/StraightPCF","path":"models/utils.py","file_url":"https://github.com/ddsediri/StraightPCF/blob/HEAD/models/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":"b68eb6bc82f68d94","code_sha256_prefix":"b68eb6bc82f68d94","mcp_get_code":{"code_sha256":"b68eb6bc82f68d94"}},{"arxiv_id":"2403.13417","arxiv_id_is_arxiv":true,"paper":"/paper/diversified-and-personalized-multi-rater","title":"Diversified and Personalized Multi-rater Medical Image Segmentation","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ycwu1997/D-Persona","path":"D-Persona/code/lib/DPersona.py","file_url":"https://github.com/ycwu1997/D-Persona/blob/HEAD/D-Persona/code/lib/DPersona.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":"6f12908079fae859","code_sha256_prefix":"6f12908079fae859","mcp_get_code":{"code_sha256":"6f12908079fae859"}},{"arxiv_id":"2209.15597","arxiv_id_is_arxiv":true,"paper":"/paper/meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tranhungnghiep/MEIM","path":"src/models.py","file_url":"https://github.com/tranhungnghiep/MEIM/blob/HEAD/src/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, tranhungnghiep/MEIM when it was checked","code_sha256":"3ca0782c847afb07","code_sha256_prefix":"3ca0782c847afb07","mcp_get_code":{"code_sha256":"3ca0782c847afb07"}},{"arxiv_id":"2208.10559","arxiv_id_is_arxiv":true,"paper":"/paper/transductive-decoupled-variational-inference","title":"Transductive Decoupled Variational Inference for Few-Shot Classification","date":"2022-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anujinho/trident","path":"src/zoo/archs.py","file_url":"https://github.com/anujinho/trident/blob/HEAD/src/zoo/archs.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":"11a97a6c9d7fbf5d","code_sha256_prefix":"11a97a6c9d7fbf5d","mcp_get_code":{"code_sha256":"11a97a6c9d7fbf5d"}},{"arxiv_id":"2004.13912","arxiv_id_is_arxiv":true,"paper":"/paper/neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kherud/neural-additive-models-pt","path":"nam/model.py","file_url":"https://github.com/kherud/neural-additive-models-pt/blob/HEAD/nam/model.py","status":"unverified","verification_level":0,"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, kherud/neural-additive-models-pt when it was checked","code_sha256":"9ea962308449a4bb","code_sha256_prefix":"9ea962308449a4bb","mcp_get_code":{"code_sha256":"9ea962308449a4bb"}},{"arxiv_id":"1911.02855","arxiv_id_is_arxiv":true,"paper":"/paper/dice-loss-for-data-imbalanced-nlp-tasks","title":"Dice Loss for Data-imbalanced NLP Tasks","date":"2019-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShannonAI/dice_loss_for_NLP","path":"models/classifier.py","file_url":"https://github.com/ShannonAI/dice_loss_for_NLP/blob/HEAD/models/classifier.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":"db9f3807cf1d3857","code_sha256_prefix":"db9f3807cf1d3857","mcp_get_code":{"code_sha256":"db9f3807cf1d3857"}}],"record_sha256":"b6c3ac38cc7dcb8317d6de5bb60a7d9e1ff0e658c434abbcff836743071f2b20","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}